./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e40f6d15-0fd9-40df-b04c-87580ba2f523/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e40f6d15-0fd9-40df-b04c-87580ba2f523/bin/ukojak-verify-CZk0znPC7b/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e40f6d15-0fd9-40df-b04c-87580ba2f523/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e40f6d15-0fd9-40df-b04c-87580ba2f523/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label10.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e40f6d15-0fd9-40df-b04c-87580ba2f523/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e40f6d15-0fd9-40df-b04c-87580ba2f523/bin/ukojak-verify-CZk0znPC7b --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b406ff3fd0da0465581d2165eb1f16564f4bf2c96c00f3bdd76ed4230f7217fd --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-05 21:51:57,345 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-05 21:51:57,399 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e40f6d15-0fd9-40df-b04c-87580ba2f523/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-05 21:51:57,403 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-05 21:51:57,403 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-05 21:51:57,422 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-05 21:51:57,423 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-05 21:51:57,423 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-05 21:51:57,423 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-05 21:51:57,424 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-05 21:51:57,424 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-05 21:51:57,424 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-05 21:51:57,424 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-05 21:51:57,424 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-05 21:51:57,424 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-05 21:51:57,424 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-05 21:51:57,424 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-05 21:51:57,424 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-05 21:51:57,424 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-05 21:51:57,424 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-05 21:51:57,425 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-05 21:51:57,425 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-05 21:51:57,425 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-05 21:51:57,425 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-05 21:51:57,425 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-05 21:51:57,425 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-05 21:51:57,425 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-05 21:51:57,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-05 21:51:57,425 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-05 21:51:57,425 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-05 21:51:57,425 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-05 21:51:57,425 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-05 21:51:57,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-05 21:51:57,426 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_e40f6d15-0fd9-40df-b04c-87580ba2f523/bin/ukojak-verify-CZk0znPC7b Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b406ff3fd0da0465581d2165eb1f16564f4bf2c96c00f3bdd76ed4230f7217fd [2024-12-05 21:51:57,665 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-05 21:51:57,673 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-05 21:51:57,675 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-05 21:51:57,676 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-05 21:51:57,676 INFO L274 PluginConnector]: CDTParser initialized [2024-12-05 21:51:57,677 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e40f6d15-0fd9-40df-b04c-87580ba2f523/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/eca-rers2012/Problem02_label10.c [2024-12-05 21:52:00,276 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e40f6d15-0fd9-40df-b04c-87580ba2f523/bin/ukojak-verify-CZk0znPC7b/data/3bfc4de49/535b72ce1e7f46a0b469021bfde359a4/FLAG6ea2bcc3e [2024-12-05 21:52:00,527 INFO L384 CDTParser]: Found 1 translation units. [2024-12-05 21:52:00,528 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e40f6d15-0fd9-40df-b04c-87580ba2f523/sv-benchmarks/c/eca-rers2012/Problem02_label10.c [2024-12-05 21:52:00,539 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e40f6d15-0fd9-40df-b04c-87580ba2f523/bin/ukojak-verify-CZk0znPC7b/data/3bfc4de49/535b72ce1e7f46a0b469021bfde359a4/FLAG6ea2bcc3e [2024-12-05 21:52:00,864 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e40f6d15-0fd9-40df-b04c-87580ba2f523/bin/ukojak-verify-CZk0znPC7b/data/3bfc4de49/535b72ce1e7f46a0b469021bfde359a4 [2024-12-05 21:52:00,865 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-05 21:52:00,866 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-05 21:52:00,867 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-05 21:52:00,867 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-05 21:52:00,872 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-05 21:52:00,872 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:52:00" (1/1) ... [2024-12-05 21:52:00,873 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b063862 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:52:00, skipping insertion in model container [2024-12-05 21:52:00,873 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:52:00" (1/1) ... [2024-12-05 21:52:00,904 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-05 21:52:01,142 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_e40f6d15-0fd9-40df-b04c-87580ba2f523/sv-benchmarks/c/eca-rers2012/Problem02_label10.c[20766,20779] [2024-12-05 21:52:01,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-05 21:52:01,164 INFO L200 MainTranslator]: Completed pre-run [2024-12-05 21:52:01,237 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_e40f6d15-0fd9-40df-b04c-87580ba2f523/sv-benchmarks/c/eca-rers2012/Problem02_label10.c[20766,20779] [2024-12-05 21:52:01,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-05 21:52:01,253 INFO L204 MainTranslator]: Completed translation [2024-12-05 21:52:01,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:52:01 WrapperNode [2024-12-05 21:52:01,253 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-05 21:52:01,254 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-05 21:52:01,254 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-05 21:52:01,254 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-05 21:52:01,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:52:01" (1/1) ... [2024-12-05 21:52:01,270 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:52:01" (1/1) ... [2024-12-05 21:52:01,307 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668 [2024-12-05 21:52:01,308 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-05 21:52:01,308 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-05 21:52:01,308 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-05 21:52:01,308 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-05 21:52:01,316 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:52:01" (1/1) ... [2024-12-05 21:52:01,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:52:01" (1/1) ... [2024-12-05 21:52:01,319 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:52:01" (1/1) ... [2024-12-05 21:52:01,320 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:52:01" (1/1) ... [2024-12-05 21:52:01,335 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:52:01" (1/1) ... [2024-12-05 21:52:01,338 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:52:01" (1/1) ... [2024-12-05 21:52:01,345 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:52:01" (1/1) ... [2024-12-05 21:52:01,350 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:52:01" (1/1) ... [2024-12-05 21:52:01,353 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:52:01" (1/1) ... [2024-12-05 21:52:01,359 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-05 21:52:01,359 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-05 21:52:01,359 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-05 21:52:01,359 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-05 21:52:01,360 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:52:01" (1/1) ... [2024-12-05 21:52:01,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-05 21:52:01,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e40f6d15-0fd9-40df-b04c-87580ba2f523/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-05 21:52:01,385 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e40f6d15-0fd9-40df-b04c-87580ba2f523/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-05 21:52:01,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e40f6d15-0fd9-40df-b04c-87580ba2f523/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-05 21:52:01,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-05 21:52:01,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-05 21:52:01,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-05 21:52:01,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-05 21:52:01,464 INFO L234 CfgBuilder]: Building ICFG [2024-12-05 21:52:01,466 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-05 21:52:02,287 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-12-05 21:52:02,287 INFO L283 CfgBuilder]: Performing block encoding [2024-12-05 21:52:02,564 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-05 21:52:02,564 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-05 21:52:02,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:52:02 BoogieIcfgContainer [2024-12-05 21:52:02,564 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-05 21:52:02,565 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-05 21:52:02,565 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-05 21:52:02,575 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-05 21:52:02,575 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:52:02" (1/1) ... [2024-12-05 21:52:02,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 21:52:02,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:02,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 85 states and 162 transitions. [2024-12-05 21:52:02,638 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 162 transitions. [2024-12-05 21:52:02,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-12-05 21:52:02,641 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:02,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:02,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:03,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:52:03,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:03,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 163 states and 240 transitions. [2024-12-05 21:52:03,560 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 240 transitions. [2024-12-05 21:52:03,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-12-05 21:52:03,562 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:03,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:03,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:03,890 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:52:03,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:03,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 166 states and 245 transitions. [2024-12-05 21:52:03,960 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 245 transitions. [2024-12-05 21:52:03,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-12-05 21:52:03,962 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:03,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:03,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:04,067 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-05 21:52:04,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:04,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 167 states and 248 transitions. [2024-12-05 21:52:04,224 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 248 transitions. [2024-12-05 21:52:04,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-12-05 21:52:04,226 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:04,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:04,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:04,355 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:52:04,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:04,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 184 states and 274 transitions. [2024-12-05 21:52:04,566 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 274 transitions. [2024-12-05 21:52:04,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-12-05 21:52:04,567 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:04,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:04,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:04,671 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:52:04,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:04,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 202 states and 296 transitions. [2024-12-05 21:52:04,971 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 296 transitions. [2024-12-05 21:52:04,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-12-05 21:52:04,973 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:04,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:05,054 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:52:05,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:05,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 220 states and 324 transitions. [2024-12-05 21:52:05,584 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 324 transitions. [2024-12-05 21:52:05,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-12-05 21:52:05,585 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:05,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:05,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:05,645 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:52:05,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:05,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 223 states and 327 transitions. [2024-12-05 21:52:05,749 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 327 transitions. [2024-12-05 21:52:05,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-12-05 21:52:05,750 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:05,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:05,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:05,817 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-05 21:52:06,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:06,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 227 states and 334 transitions. [2024-12-05 21:52:06,085 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 334 transitions. [2024-12-05 21:52:06,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-12-05 21:52:06,086 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:06,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:06,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:06,173 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-05 21:52:06,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:06,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 244 states and 351 transitions. [2024-12-05 21:52:06,486 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 351 transitions. [2024-12-05 21:52:06,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-12-05 21:52:06,487 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:06,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:06,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:06,588 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:52:06,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:06,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 264 states and 375 transitions. [2024-12-05 21:52:06,990 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 375 transitions. [2024-12-05 21:52:06,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-12-05 21:52:06,991 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:06,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:07,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:07,140 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-12-05 21:52:07,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:07,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 268 states and 382 transitions. [2024-12-05 21:52:07,478 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 382 transitions. [2024-12-05 21:52:07,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-12-05 21:52:07,479 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:07,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:07,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:07,854 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:52:09,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:09,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 372 states and 496 transitions. [2024-12-05 21:52:09,031 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 496 transitions. [2024-12-05 21:52:09,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-12-05 21:52:09,032 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:09,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:09,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:09,194 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:52:09,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:09,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 391 states and 523 transitions. [2024-12-05 21:52:09,779 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 523 transitions. [2024-12-05 21:52:09,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-12-05 21:52:09,780 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:09,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:09,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:09,903 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:52:10,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:10,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 405 states and 537 transitions. [2024-12-05 21:52:10,107 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 537 transitions. [2024-12-05 21:52:10,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-12-05 21:52:10,108 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:10,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:10,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:10,198 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:52:10,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:10,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 429 states and 565 transitions. [2024-12-05 21:52:10,875 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 565 transitions. [2024-12-05 21:52:10,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-12-05 21:52:10,876 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:10,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:10,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:10,993 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:52:11,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:11,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 443 states and 578 transitions. [2024-12-05 21:52:11,234 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 578 transitions. [2024-12-05 21:52:11,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-12-05 21:52:11,235 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:11,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:11,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:11,345 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:52:11,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:11,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 468 states and 613 transitions. [2024-12-05 21:52:11,980 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 613 transitions. [2024-12-05 21:52:11,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-12-05 21:52:11,980 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:11,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:11,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:12,063 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:52:12,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:12,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 482 states and 633 transitions. [2024-12-05 21:52:12,303 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 633 transitions. [2024-12-05 21:52:12,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-12-05 21:52:12,304 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:12,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:12,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:12,337 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:52:12,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:12,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 488 states and 641 transitions. [2024-12-05 21:52:12,585 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 641 transitions. [2024-12-05 21:52:12,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-12-05 21:52:12,586 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:12,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:12,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:12,621 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:52:12,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:12,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 489 states and 641 transitions. [2024-12-05 21:52:12,719 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 641 transitions. [2024-12-05 21:52:12,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-12-05 21:52:12,721 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:12,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:12,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:12,843 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 33 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:52:13,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:13,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 518 states and 683 transitions. [2024-12-05 21:52:13,768 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 683 transitions. [2024-12-05 21:52:13,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-12-05 21:52:13,769 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:13,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:13,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:13,862 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 33 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:52:14,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:14,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 532 states and 697 transitions. [2024-12-05 21:52:14,115 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 697 transitions. [2024-12-05 21:52:14,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-12-05 21:52:14,116 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:14,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:14,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:14,206 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 33 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:52:14,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:14,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 538 states and 704 transitions. [2024-12-05 21:52:14,497 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 704 transitions. [2024-12-05 21:52:14,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-12-05 21:52:14,498 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:14,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:14,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:14,540 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:52:15,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:15,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 552 states and 721 transitions. [2024-12-05 21:52:15,096 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 721 transitions. [2024-12-05 21:52:15,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-12-05 21:52:15,097 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:15,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:15,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:15,129 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:52:15,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:15,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 558 states and 727 transitions. [2024-12-05 21:52:15,245 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 727 transitions. [2024-12-05 21:52:15,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-12-05 21:52:15,246 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:15,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:15,282 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:52:15,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:15,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 563 states and 732 transitions. [2024-12-05 21:52:15,509 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 732 transitions. [2024-12-05 21:52:15,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-12-05 21:52:15,511 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:15,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:15,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:15,559 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:52:15,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:15,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 569 states and 738 transitions. [2024-12-05 21:52:15,919 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 738 transitions. [2024-12-05 21:52:15,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-12-05 21:52:15,920 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:15,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:15,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:15,982 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:52:16,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:16,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 577 states and 747 transitions. [2024-12-05 21:52:16,244 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 747 transitions. [2024-12-05 21:52:16,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-12-05 21:52:16,245 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:16,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:16,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:16,298 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:52:16,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:16,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 582 states and 751 transitions. [2024-12-05 21:52:16,474 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 751 transitions. [2024-12-05 21:52:16,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-12-05 21:52:16,475 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:16,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:16,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:16,518 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-12-05 21:52:17,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:17,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 611 states and 787 transitions. [2024-12-05 21:52:17,089 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 787 transitions. [2024-12-05 21:52:17,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-12-05 21:52:17,090 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:17,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:17,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:17,165 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-12-05 21:52:17,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:17,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 614 states and 792 transitions. [2024-12-05 21:52:17,395 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 792 transitions. [2024-12-05 21:52:17,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-12-05 21:52:17,396 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:17,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:17,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:17,463 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-12-05 21:52:17,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:17,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 628 states and 806 transitions. [2024-12-05 21:52:17,719 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 806 transitions. [2024-12-05 21:52:17,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-12-05 21:52:17,720 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:17,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:17,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:17,766 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:52:17,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:17,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 650 states and 831 transitions. [2024-12-05 21:52:17,896 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 831 transitions. [2024-12-05 21:52:17,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-12-05 21:52:17,897 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:17,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:17,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:17,976 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-05 21:52:18,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:18,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 663 states and 848 transitions. [2024-12-05 21:52:18,350 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 848 transitions. [2024-12-05 21:52:18,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-12-05 21:52:18,350 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:18,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:18,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:18,426 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-05 21:52:18,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:18,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 673 states and 858 transitions. [2024-12-05 21:52:18,650 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 858 transitions. [2024-12-05 21:52:18,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-12-05 21:52:18,651 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:18,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:18,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:18,695 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-05 21:52:18,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:18,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 678 states and 862 transitions. [2024-12-05 21:52:18,839 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 862 transitions. [2024-12-05 21:52:18,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-12-05 21:52:18,839 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:18,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:18,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:18,876 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:52:19,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:19,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 684 states and 868 transitions. [2024-12-05 21:52:19,291 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 868 transitions. [2024-12-05 21:52:19,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-12-05 21:52:19,292 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:19,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:19,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:19,339 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-05 21:52:19,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:19,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 715 states and 903 transitions. [2024-12-05 21:52:19,848 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 903 transitions. [2024-12-05 21:52:19,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-12-05 21:52:19,849 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:19,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:19,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:19,925 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-05 21:52:20,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:20,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 734 states and 920 transitions. [2024-12-05 21:52:20,353 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 920 transitions. [2024-12-05 21:52:20,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-12-05 21:52:20,353 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:20,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:20,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:20,399 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:52:20,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:20,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 743 states and 929 transitions. [2024-12-05 21:52:20,494 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 929 transitions. [2024-12-05 21:52:20,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-12-05 21:52:20,494 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:20,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:20,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:20,593 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:52:21,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:21,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 775 states and 970 transitions. [2024-12-05 21:52:21,987 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 970 transitions. [2024-12-05 21:52:21,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-12-05 21:52:21,987 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:21,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:22,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:22,046 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:52:22,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:22,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 789 states and 984 transitions. [2024-12-05 21:52:22,123 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 984 transitions. [2024-12-05 21:52:22,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-12-05 21:52:22,124 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:22,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:22,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:22,170 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:52:22,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:22,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 800 states and 995 transitions. [2024-12-05 21:52:22,836 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 995 transitions. [2024-12-05 21:52:22,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-12-05 21:52:22,837 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:22,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:22,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:22,897 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-12-05 21:52:23,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:23,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 807 states and 1004 transitions. [2024-12-05 21:52:23,035 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1004 transitions. [2024-12-05 21:52:23,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-12-05 21:52:23,036 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:23,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:23,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:23,092 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-05 21:52:23,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:23,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 811 states and 1010 transitions. [2024-12-05 21:52:23,165 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1010 transitions. [2024-12-05 21:52:23,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-12-05 21:52:23,166 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:23,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:23,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:23,221 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-05 21:52:23,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:23,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 812 states and 1011 transitions. [2024-12-05 21:52:23,268 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1011 transitions. [2024-12-05 21:52:23,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-12-05 21:52:23,268 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:23,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:23,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:23,328 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:52:23,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:23,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 843 states and 1043 transitions. [2024-12-05 21:52:23,472 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1043 transitions. [2024-12-05 21:52:23,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-12-05 21:52:23,473 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:23,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:23,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:23,570 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-12-05 21:52:23,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:23,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 850 states and 1053 transitions. [2024-12-05 21:52:23,792 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1053 transitions. [2024-12-05 21:52:23,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-12-05 21:52:23,792 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:23,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:23,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:23,869 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-12-05 21:52:24,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:24,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 855 states and 1057 transitions. [2024-12-05 21:52:24,109 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1057 transitions. [2024-12-05 21:52:24,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-12-05 21:52:24,109 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:24,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:24,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:24,211 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-12-05 21:52:24,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:24,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 862 states and 1065 transitions. [2024-12-05 21:52:24,486 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1065 transitions. [2024-12-05 21:52:24,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-12-05 21:52:24,487 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:24,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:24,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:24,749 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:52:26,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:26,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 929 states and 1142 transitions. [2024-12-05 21:52:26,396 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1142 transitions. [2024-12-05 21:52:26,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-12-05 21:52:26,397 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:26,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:26,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:26,526 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-05 21:52:27,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:27,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 954 states and 1173 transitions. [2024-12-05 21:52:27,786 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1173 transitions. [2024-12-05 21:52:27,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-12-05 21:52:27,787 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:27,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:27,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:27,834 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-05 21:52:28,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:28,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 977 states and 1198 transitions. [2024-12-05 21:52:28,744 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1198 transitions. [2024-12-05 21:52:28,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-12-05 21:52:28,745 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:28,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:28,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:28,809 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-05 21:52:29,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:29,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 982 states and 1202 transitions. [2024-12-05 21:52:29,112 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1202 transitions. [2024-12-05 21:52:29,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-12-05 21:52:29,113 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:29,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:29,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:29,158 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-05 21:52:29,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:29,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 987 states and 1206 transitions. [2024-12-05 21:52:29,457 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1206 transitions. [2024-12-05 21:52:29,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-12-05 21:52:29,458 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:29,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:29,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:29,508 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-05 21:52:29,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:29,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 988 states and 1207 transitions. [2024-12-05 21:52:29,560 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1207 transitions. [2024-12-05 21:52:29,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-12-05 21:52:29,561 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:29,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:29,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:29,969 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 71 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:52:32,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:32,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1055 states and 1284 transitions. [2024-12-05 21:52:32,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1284 transitions. [2024-12-05 21:52:32,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-12-05 21:52:32,876 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:32,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:32,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:33,032 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 71 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:52:33,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:33,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 1077 states and 1305 transitions. [2024-12-05 21:52:33,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1305 transitions. [2024-12-05 21:52:33,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-12-05 21:52:33,969 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:33,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:33,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:34,106 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 71 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:52:34,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:34,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 1082 states and 1309 transitions. [2024-12-05 21:52:34,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1309 transitions. [2024-12-05 21:52:34,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-12-05 21:52:34,451 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:34,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:34,717 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 72 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:52:35,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:35,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1087 states and 1315 transitions. [2024-12-05 21:52:35,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1315 transitions. [2024-12-05 21:52:35,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-12-05 21:52:35,576 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:35,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:35,646 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:52:35,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:35,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1093 states and 1322 transitions. [2024-12-05 21:52:35,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1093 states and 1322 transitions. [2024-12-05 21:52:35,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-12-05 21:52:35,948 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:35,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:35,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:36,192 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 75 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:52:38,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:38,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1155 states and 1394 transitions. [2024-12-05 21:52:38,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1394 transitions. [2024-12-05 21:52:38,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-12-05 21:52:38,744 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:38,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:38,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:38,884 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 75 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:52:39,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:39,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1160 states and 1398 transitions. [2024-12-05 21:52:39,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1398 transitions. [2024-12-05 21:52:39,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-12-05 21:52:39,242 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:39,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:39,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:39,308 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:52:40,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:40,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1415 states to 1175 states and 1415 transitions. [2024-12-05 21:52:40,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1415 transitions. [2024-12-05 21:52:40,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-12-05 21:52:40,138 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:40,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:40,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:40,179 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:52:40,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:40,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1178 states and 1419 transitions. [2024-12-05 21:52:40,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1419 transitions. [2024-12-05 21:52:40,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-12-05 21:52:40,449 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:40,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:40,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:40,491 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:52:40,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:40,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1183 states and 1423 transitions. [2024-12-05 21:52:40,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1423 transitions. [2024-12-05 21:52:40,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-12-05 21:52:40,808 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:40,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:40,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:40,963 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:52:43,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:43,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1219 states and 1462 transitions. [2024-12-05 21:52:43,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 1462 transitions. [2024-12-05 21:52:43,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-12-05 21:52:43,754 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:43,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:43,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:43,806 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:52:45,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:45,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1230 states and 1477 transitions. [2024-12-05 21:52:45,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1477 transitions. [2024-12-05 21:52:45,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-12-05 21:52:45,048 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:45,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:45,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:45,125 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-12-05 21:52:45,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:45,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1231 states and 1477 transitions. [2024-12-05 21:52:45,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1477 transitions. [2024-12-05 21:52:45,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-12-05 21:52:45,169 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:45,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:45,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:45,221 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-05 21:52:45,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:45,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1244 states and 1490 transitions. [2024-12-05 21:52:45,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 1490 transitions. [2024-12-05 21:52:45,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-12-05 21:52:45,590 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:45,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:45,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:45,643 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-05 21:52:45,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:45,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1254 states and 1499 transitions. [2024-12-05 21:52:45,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1499 transitions. [2024-12-05 21:52:45,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-12-05 21:52:45,893 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:45,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:45,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:45,942 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-12-05 21:52:46,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:46,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 1333 states and 1594 transitions. [2024-12-05 21:52:46,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1594 transitions. [2024-12-05 21:52:46,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-12-05 21:52:46,574 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:46,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:46,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:46,658 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-12-05 21:52:47,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:47,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1334 states and 1596 transitions. [2024-12-05 21:52:47,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 1596 transitions. [2024-12-05 21:52:47,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-12-05 21:52:47,085 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:47,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:47,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:47,308 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:52:47,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:47,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1344 states and 1608 transitions. [2024-12-05 21:52:47,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 1608 transitions. [2024-12-05 21:52:47,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-12-05 21:52:47,700 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:47,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:47,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:47,773 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-12-05 21:52:48,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:48,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1345 states and 1609 transitions. [2024-12-05 21:52:48,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 1609 transitions. [2024-12-05 21:52:48,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-12-05 21:52:48,124 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:48,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:48,211 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:52:48,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:48,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1348 states and 1612 transitions. [2024-12-05 21:52:48,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1612 transitions. [2024-12-05 21:52:48,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-12-05 21:52:48,256 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:48,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:48,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:48,340 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-12-05 21:52:48,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:48,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1367 states and 1634 transitions. [2024-12-05 21:52:48,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 1634 transitions. [2024-12-05 21:52:48,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-12-05 21:52:48,770 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:48,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:48,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:48,852 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-12-05 21:52:49,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:49,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1368 states and 1635 transitions. [2024-12-05 21:52:49,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 1635 transitions. [2024-12-05 21:52:49,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-12-05 21:52:49,174 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:49,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:49,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:49,235 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-12-05 21:52:49,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:49,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1638 states to 1371 states and 1638 transitions. [2024-12-05 21:52:49,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 1638 transitions. [2024-12-05 21:52:49,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-12-05 21:52:49,550 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:49,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:49,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:49,648 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-05 21:52:49,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:49,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1373 states and 1640 transitions. [2024-12-05 21:52:49,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 1640 transitions. [2024-12-05 21:52:49,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-12-05 21:52:49,696 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:49,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:49,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:49,774 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:52:51,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:51,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1688 states to 1414 states and 1688 transitions. [2024-12-05 21:52:51,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 1688 transitions. [2024-12-05 21:52:51,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-12-05 21:52:51,985 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:51,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:52,032 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:52:52,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:52,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1692 states to 1418 states and 1692 transitions. [2024-12-05 21:52:52,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 1692 transitions. [2024-12-05 21:52:52,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-12-05 21:52:52,449 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:52,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:52,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:52,503 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:52:53,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:53,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1729 states to 1449 states and 1729 transitions. [2024-12-05 21:52:53,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 1729 transitions. [2024-12-05 21:52:53,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-12-05 21:52:53,802 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:53,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:53,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:53,849 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:52:54,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:54,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1454 states and 1733 transitions. [2024-12-05 21:52:54,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 1733 transitions. [2024-12-05 21:52:54,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-12-05 21:52:54,241 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:54,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:54,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:54,289 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:52:54,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:54,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1455 states and 1738 transitions. [2024-12-05 21:52:54,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1455 states and 1738 transitions. [2024-12-05 21:52:54,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-12-05 21:52:54,755 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:54,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:54,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:54,838 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:52:55,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:55,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1459 states and 1741 transitions. [2024-12-05 21:52:55,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 1741 transitions. [2024-12-05 21:52:55,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-12-05 21:52:55,344 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:55,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:55,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:55,407 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-12-05 21:52:56,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:56,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1763 states to 1470 states and 1763 transitions. [2024-12-05 21:52:56,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1470 states and 1763 transitions. [2024-12-05 21:52:56,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-12-05 21:52:56,865 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:56,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:56,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:56,966 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-12-05 21:52:57,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:57,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1477 states and 1773 transitions. [2024-12-05 21:52:57,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1477 states and 1773 transitions. [2024-12-05 21:52:57,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-12-05 21:52:57,095 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:57,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:57,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:57,154 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-12-05 21:52:58,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:58,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1787 states to 1490 states and 1787 transitions. [2024-12-05 21:52:58,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 1787 transitions. [2024-12-05 21:52:58,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-12-05 21:52:58,032 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:58,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:58,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:58,092 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-12-05 21:52:58,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:58,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1495 states and 1791 transitions. [2024-12-05 21:52:58,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 1791 transitions. [2024-12-05 21:52:58,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-12-05 21:52:58,349 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:58,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:58,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:58,412 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-12-05 21:52:58,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:58,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1505 states and 1801 transitions. [2024-12-05 21:52:58,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 1801 transitions. [2024-12-05 21:52:58,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-12-05 21:52:58,983 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:58,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:58,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:59,043 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-12-05 21:52:59,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:59,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1805 states to 1510 states and 1805 transitions. [2024-12-05 21:52:59,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 1805 transitions. [2024-12-05 21:52:59,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-12-05 21:52:59,272 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:59,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:59,385 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-12-05 21:52:59,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:52:59,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1820 states to 1522 states and 1820 transitions. [2024-12-05 21:52:59,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1522 states and 1820 transitions. [2024-12-05 21:52:59,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-12-05 21:52:59,759 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:52:59,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:52:59,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:52:59,870 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-12-05 21:53:01,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:53:01,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1542 states and 1842 transitions. [2024-12-05 21:53:01,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 1842 transitions. [2024-12-05 21:53:01,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-12-05 21:53:01,014 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:53:01,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:53:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:53:01,127 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-12-05 21:53:01,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:53:01,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1543 states and 1842 transitions. [2024-12-05 21:53:01,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 1842 transitions. [2024-12-05 21:53:01,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-12-05 21:53:01,219 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:53:01,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:53:01,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:53:01,329 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-12-05 21:53:01,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:53:01,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1859 states to 1560 states and 1859 transitions. [2024-12-05 21:53:01,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 1859 transitions. [2024-12-05 21:53:01,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-12-05 21:53:01,961 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:53:01,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:53:01,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:53:02,262 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-05 21:53:02,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:53:02,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1871 states to 1570 states and 1871 transitions. [2024-12-05 21:53:02,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 1871 transitions. [2024-12-05 21:53:02,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-12-05 21:53:02,747 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:53:02,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:53:02,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:53:02,880 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-12-05 21:53:03,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:53:03,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1892 states to 1587 states and 1892 transitions. [2024-12-05 21:53:03,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 1892 transitions. [2024-12-05 21:53:03,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-12-05 21:53:03,876 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:53:03,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:53:03,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:53:04,058 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-05 21:53:04,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:53:04,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1908 states to 1600 states and 1908 transitions. [2024-12-05 21:53:04,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 1908 transitions. [2024-12-05 21:53:04,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-12-05 21:53:04,720 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:53:04,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:53:04,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:53:04,775 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-12-05 21:53:04,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:53:04,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1920 states to 1612 states and 1920 transitions. [2024-12-05 21:53:04,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 1920 transitions. [2024-12-05 21:53:04,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-12-05 21:53:04,903 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:53:04,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:53:04,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:53:04,960 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-12-05 21:53:05,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:53:05,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1617 states and 1924 transitions. [2024-12-05 21:53:05,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 1924 transitions. [2024-12-05 21:53:05,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-12-05 21:53:05,646 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:53:05,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:53:05,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:53:05,704 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-12-05 21:53:06,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:53:06,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1937 states to 1630 states and 1937 transitions. [2024-12-05 21:53:06,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 1937 transitions. [2024-12-05 21:53:06,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-12-05 21:53:06,104 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:53:06,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:53:06,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:53:06,167 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-12-05 21:53:06,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:53:06,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1940 states to 1634 states and 1940 transitions. [2024-12-05 21:53:06,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 1940 transitions. [2024-12-05 21:53:06,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-12-05 21:53:06,542 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:53:06,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:53:06,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:53:06,604 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-05 21:53:06,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:53:06,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1636 states and 1942 transitions. [2024-12-05 21:53:06,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 1942 transitions. [2024-12-05 21:53:06,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-12-05 21:53:06,656 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:53:06,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:53:06,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:53:06,725 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-12-05 21:53:07,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:53:07,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1958 states to 1645 states and 1958 transitions. [2024-12-05 21:53:07,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 1958 transitions. [2024-12-05 21:53:07,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-12-05 21:53:07,471 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:53:07,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:53:07,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:53:07,534 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-12-05 21:53:08,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:53:08,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1979 states to 1665 states and 1979 transitions. [2024-12-05 21:53:08,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 1979 transitions. [2024-12-05 21:53:08,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-12-05 21:53:08,716 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:53:08,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:53:08,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:53:08,778 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-12-05 21:53:09,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:53:09,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1992 states to 1679 states and 1992 transitions. [2024-12-05 21:53:09,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1679 states and 1992 transitions. [2024-12-05 21:53:09,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-12-05 21:53:09,228 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:53:09,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:53:09,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:53:09,797 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-05 21:53:13,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:53:13,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2160 states to 1815 states and 2160 transitions. [2024-12-05 21:53:13,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 2160 transitions. [2024-12-05 21:53:13,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-12-05 21:53:13,907 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:53:13,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:53:13,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:53:14,229 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-05 21:53:15,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:53:15,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 1838 states and 2182 transitions. [2024-12-05 21:53:15,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2182 transitions. [2024-12-05 21:53:15,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-12-05 21:53:15,162 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:53:15,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:53:15,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:53:15,363 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-05 21:53:18,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:53:18,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2236 states to 1880 states and 2236 transitions. [2024-12-05 21:53:18,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1880 states and 2236 transitions. [2024-12-05 21:53:18,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-12-05 21:53:18,823 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:53:18,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:53:18,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:53:19,004 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-05 21:53:22,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:53:22,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2298 states to 1936 states and 2298 transitions. [2024-12-05 21:53:22,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1936 states and 2298 transitions. [2024-12-05 21:53:22,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-12-05 21:53:22,510 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:53:22,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:53:22,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:53:22,732 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-05 21:53:23,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:53:23,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2302 states to 1941 states and 2302 transitions. [2024-12-05 21:53:23,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 2302 transitions. [2024-12-05 21:53:23,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-12-05 21:53:23,416 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:53:23,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:53:23,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:53:23,507 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-12-05 21:53:24,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:53:24,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2333 states to 1968 states and 2333 transitions. [2024-12-05 21:53:24,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1968 states and 2333 transitions. [2024-12-05 21:53:24,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-12-05 21:53:24,041 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:53:24,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:53:24,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:53:24,140 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-05 21:53:25,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:53:25,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2345 states to 1980 states and 2345 transitions. [2024-12-05 21:53:25,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1980 states and 2345 transitions. [2024-12-05 21:53:25,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-12-05 21:53:25,124 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:53:25,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:53:25,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:53:25,257 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:53:26,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:53:26,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2354 states to 1986 states and 2354 transitions. [2024-12-05 21:53:26,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1986 states and 2354 transitions. [2024-12-05 21:53:26,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-12-05 21:53:26,378 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:53:26,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:53:26,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:53:26,480 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 142 proven. 8 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-12-05 21:53:27,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:53:27,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2381 states to 2004 states and 2381 transitions. [2024-12-05 21:53:27,776 INFO L276 IsEmpty]: Start isEmpty. Operand 2004 states and 2381 transitions. [2024-12-05 21:53:27,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-05 21:53:27,776 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:53:27,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:53:27,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:53:27,854 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-12-05 21:53:28,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:53:28,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2387 states to 2010 states and 2387 transitions. [2024-12-05 21:53:28,380 INFO L276 IsEmpty]: Start isEmpty. Operand 2010 states and 2387 transitions. [2024-12-05 21:53:28,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-05 21:53:28,381 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:53:28,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:53:28,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:53:28,454 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-12-05 21:53:29,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:53:29,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2401 states to 2022 states and 2401 transitions. [2024-12-05 21:53:29,734 INFO L276 IsEmpty]: Start isEmpty. Operand 2022 states and 2401 transitions. [2024-12-05 21:53:29,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-05 21:53:29,735 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:53:29,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:53:29,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:53:29,808 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-12-05 21:53:30,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:53:30,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2407 states to 2028 states and 2407 transitions. [2024-12-05 21:53:30,766 INFO L276 IsEmpty]: Start isEmpty. Operand 2028 states and 2407 transitions. [2024-12-05 21:53:30,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-12-05 21:53:30,767 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:53:30,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:53:30,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:53:31,635 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 93 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:53:35,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:53:35,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2581 states to 2189 states and 2581 transitions. [2024-12-05 21:53:35,654 INFO L276 IsEmpty]: Start isEmpty. Operand 2189 states and 2581 transitions. [2024-12-05 21:53:35,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-12-05 21:53:35,655 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:53:35,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:53:35,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:53:35,942 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2024-12-05 21:53:40,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:53:40,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2740 states to 2339 states and 2740 transitions. [2024-12-05 21:53:40,244 INFO L276 IsEmpty]: Start isEmpty. Operand 2339 states and 2740 transitions. [2024-12-05 21:53:40,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-12-05 21:53:40,245 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:53:40,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:53:40,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:53:40,323 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-05 21:53:41,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:53:41,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2745 states to 2345 states and 2745 transitions. [2024-12-05 21:53:41,308 INFO L276 IsEmpty]: Start isEmpty. Operand 2345 states and 2745 transitions. [2024-12-05 21:53:41,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-12-05 21:53:41,309 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:53:41,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:53:41,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:53:41,393 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-12-05 21:53:42,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:53:42,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2755 states to 2355 states and 2755 transitions. [2024-12-05 21:53:42,128 INFO L276 IsEmpty]: Start isEmpty. Operand 2355 states and 2755 transitions. [2024-12-05 21:53:42,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-12-05 21:53:42,129 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:53:42,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:53:42,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:53:42,215 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-12-05 21:53:42,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:53:42,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2759 states to 2360 states and 2759 transitions. [2024-12-05 21:53:42,552 INFO L276 IsEmpty]: Start isEmpty. Operand 2360 states and 2759 transitions. [2024-12-05 21:53:42,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-12-05 21:53:42,554 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:53:42,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:53:42,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:53:42,727 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 253 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-12-05 21:53:44,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:53:44,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2786 states to 2386 states and 2786 transitions. [2024-12-05 21:53:44,050 INFO L276 IsEmpty]: Start isEmpty. Operand 2386 states and 2786 transitions. [2024-12-05 21:53:44,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-12-05 21:53:44,051 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:53:44,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:53:44,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:53:44,125 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2024-12-05 21:53:44,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:53:44,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2786 states to 2387 states and 2786 transitions. [2024-12-05 21:53:44,202 INFO L276 IsEmpty]: Start isEmpty. Operand 2387 states and 2786 transitions. [2024-12-05 21:53:44,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-12-05 21:53:44,204 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:53:44,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:53:44,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:53:44,873 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-12-05 21:53:47,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:53:47,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2821 states to 2419 states and 2821 transitions. [2024-12-05 21:53:47,272 INFO L276 IsEmpty]: Start isEmpty. Operand 2419 states and 2821 transitions. [2024-12-05 21:53:47,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-12-05 21:53:47,276 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:53:47,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:53:47,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:53:47,425 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-12-05 21:53:47,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:53:47,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2825 states to 2424 states and 2825 transitions. [2024-12-05 21:53:47,676 INFO L276 IsEmpty]: Start isEmpty. Operand 2424 states and 2825 transitions. [2024-12-05 21:53:47,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-12-05 21:53:47,679 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:53:47,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:53:47,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:53:47,802 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-12-05 21:53:48,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:53:48,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2831 states to 2430 states and 2831 transitions. [2024-12-05 21:53:48,604 INFO L276 IsEmpty]: Start isEmpty. Operand 2430 states and 2831 transitions. [2024-12-05 21:53:48,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-12-05 21:53:48,606 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:53:48,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:53:48,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:53:48,694 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-12-05 21:53:50,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:53:50,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2843 states to 2442 states and 2843 transitions. [2024-12-05 21:53:50,509 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 2843 transitions. [2024-12-05 21:53:50,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-12-05 21:53:50,510 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:53:50,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:53:50,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:53:50,660 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-12-05 21:53:51,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:53:51,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2850 states to 2448 states and 2850 transitions. [2024-12-05 21:53:51,695 INFO L276 IsEmpty]: Start isEmpty. Operand 2448 states and 2850 transitions. [2024-12-05 21:53:51,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-12-05 21:53:51,696 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:53:51,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:53:51,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:53:51,788 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-12-05 21:53:52,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:53:52,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2856 states to 2454 states and 2856 transitions. [2024-12-05 21:53:52,219 INFO L276 IsEmpty]: Start isEmpty. Operand 2454 states and 2856 transitions. [2024-12-05 21:53:52,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-12-05 21:53:52,220 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:53:52,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:53:52,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:53:52,317 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-12-05 21:53:52,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:53:52,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2858 states to 2455 states and 2858 transitions. [2024-12-05 21:53:52,950 INFO L276 IsEmpty]: Start isEmpty. Operand 2455 states and 2858 transitions. [2024-12-05 21:53:52,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-12-05 21:53:52,951 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:53:52,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:53:52,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:53:53,042 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-12-05 21:53:54,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:53:54,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2864 states to 2460 states and 2864 transitions. [2024-12-05 21:53:54,335 INFO L276 IsEmpty]: Start isEmpty. Operand 2460 states and 2864 transitions. [2024-12-05 21:53:54,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2024-12-05 21:53:54,336 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:53:54,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:53:54,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:53:54,580 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 316 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-12-05 21:53:55,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:53:55,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2944 states to 2539 states and 2944 transitions. [2024-12-05 21:53:55,542 INFO L276 IsEmpty]: Start isEmpty. Operand 2539 states and 2944 transitions. [2024-12-05 21:53:55,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2024-12-05 21:53:55,544 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:53:55,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:53:55,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:53:56,144 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 328 proven. 16 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-12-05 21:54:02,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:54:02,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3066 states to 2649 states and 3066 transitions. [2024-12-05 21:54:02,180 INFO L276 IsEmpty]: Start isEmpty. Operand 2649 states and 3066 transitions. [2024-12-05 21:54:02,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2024-12-05 21:54:02,181 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:54:02,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:54:02,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:54:02,484 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 328 proven. 16 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-12-05 21:54:05,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:54:05,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3096 states to 2680 states and 3096 transitions. [2024-12-05 21:54:05,039 INFO L276 IsEmpty]: Start isEmpty. Operand 2680 states and 3096 transitions. [2024-12-05 21:54:05,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2024-12-05 21:54:05,040 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:54:05,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:54:05,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:54:05,273 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 328 proven. 16 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-12-05 21:54:08,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:54:08,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 2714 states and 3129 transitions. [2024-12-05 21:54:08,034 INFO L276 IsEmpty]: Start isEmpty. Operand 2714 states and 3129 transitions. [2024-12-05 21:54:08,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2024-12-05 21:54:08,035 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:54:08,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:54:08,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:54:08,268 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 328 proven. 16 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-12-05 21:54:09,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:54:09,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 2719 states and 3133 transitions. [2024-12-05 21:54:09,065 INFO L276 IsEmpty]: Start isEmpty. Operand 2719 states and 3133 transitions. [2024-12-05 21:54:09,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2024-12-05 21:54:09,066 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:54:09,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:54:09,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:54:09,277 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 214 proven. 4 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2024-12-05 21:54:10,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:54:10,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3145 states to 2726 states and 3145 transitions. [2024-12-05 21:54:10,463 INFO L276 IsEmpty]: Start isEmpty. Operand 2726 states and 3145 transitions. [2024-12-05 21:54:10,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2024-12-05 21:54:10,466 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:54:10,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:54:10,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:54:10,636 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2024-12-05 21:54:12,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:54:12,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3157 states to 2733 states and 3157 transitions. [2024-12-05 21:54:12,678 INFO L276 IsEmpty]: Start isEmpty. Operand 2733 states and 3157 transitions. [2024-12-05 21:54:12,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2024-12-05 21:54:12,679 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:54:12,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:54:12,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:54:12,782 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2024-12-05 21:54:14,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:54:14,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3164 states to 2742 states and 3164 transitions. [2024-12-05 21:54:14,496 INFO L276 IsEmpty]: Start isEmpty. Operand 2742 states and 3164 transitions. [2024-12-05 21:54:14,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2024-12-05 21:54:14,498 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:54:14,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:54:14,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:54:14,600 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2024-12-05 21:54:15,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:54:15,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3169 states to 2747 states and 3169 transitions. [2024-12-05 21:54:15,553 INFO L276 IsEmpty]: Start isEmpty. Operand 2747 states and 3169 transitions. [2024-12-05 21:54:15,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2024-12-05 21:54:15,554 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:54:15,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:54:15,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:54:15,657 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2024-12-05 21:54:17,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:54:17,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3174 states to 2753 states and 3174 transitions. [2024-12-05 21:54:17,225 INFO L276 IsEmpty]: Start isEmpty. Operand 2753 states and 3174 transitions. [2024-12-05 21:54:17,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2024-12-05 21:54:17,226 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:54:17,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:54:17,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:54:17,328 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2024-12-05 21:54:17,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:54:17,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3179 states to 2759 states and 3179 transitions. [2024-12-05 21:54:17,774 INFO L276 IsEmpty]: Start isEmpty. Operand 2759 states and 3179 transitions. [2024-12-05 21:54:17,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2024-12-05 21:54:17,776 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:54:17,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:54:17,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:54:17,877 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2024-12-05 21:54:18,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:54:18,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3180 states to 2760 states and 3180 transitions. [2024-12-05 21:54:18,083 INFO L276 IsEmpty]: Start isEmpty. Operand 2760 states and 3180 transitions. [2024-12-05 21:54:18,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2024-12-05 21:54:18,084 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:54:18,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:54:18,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:54:18,188 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2024-12-05 21:54:18,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:54:18,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2193 states and 2504 transitions. [2024-12-05 21:54:18,712 INFO L276 IsEmpty]: Start isEmpty. Operand 2193 states and 2504 transitions. [2024-12-05 21:54:18,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-12-05 21:54:18,713 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 148 iterations. [2024-12-05 21:54:18,720 INFO L726 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-12-05 21:54:35,062 INFO L77 FloydHoareUtils]: At program point L301(lines 301 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-12-05 21:54:35,063 INFO L77 FloydHoareUtils]: At program point L235(lines 235 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-12-05 21:54:35,063 INFO L77 FloydHoareUtils]: At program point L169(lines 169 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,063 INFO L77 FloydHoareUtils]: At program point L303(lines 303 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-12-05 21:54:35,063 INFO L77 FloydHoareUtils]: At program point L105(lines 105 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,063 INFO L77 FloydHoareUtils]: At program point L40(lines 40 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,064 INFO L77 FloydHoareUtils]: At program point L371(lines 371 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,064 INFO L77 FloydHoareUtils]: At program point L307(lines 307 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-12-05 21:54:35,064 INFO L77 FloydHoareUtils]: At program point L175(lines 175 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,064 INFO L77 FloydHoareUtils]: At program point L109(lines 109 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,064 INFO L77 FloydHoareUtils]: At program point L242(lines 242 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-12-05 21:54:35,065 INFO L77 FloydHoareUtils]: At program point L45(lines 45 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,065 INFO L77 FloydHoareUtils]: At program point L244(lines 244 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-12-05 21:54:35,065 INFO L77 FloydHoareUtils]: At program point L179(lines 179 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,065 INFO L77 FloydHoareUtils]: At program point L378(lines 378 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,065 INFO L77 FloydHoareUtils]: At program point L48(lines 48 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,065 INFO L77 FloydHoareUtils]: At program point L247(lines 247 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-12-05 21:54:35,065 INFO L77 FloydHoareUtils]: At program point L116(lines 116 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,066 INFO L77 FloydHoareUtils]: At program point L52(lines 52 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,066 INFO L77 FloydHoareUtils]: At program point L185(lines 185 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,066 INFO L77 FloydHoareUtils]: At program point L583-1(lines 39 608) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not (= 7 ~a17~0)) .cse1) (and (= ~a25~0 1) .cse1)))) [2024-12-05 21:54:35,066 INFO L77 FloydHoareUtils]: At program point L385(lines 385 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,066 INFO L77 FloydHoareUtils]: At program point L319(lines 319 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-12-05 21:54:35,066 INFO L77 FloydHoareUtils]: At program point L189(lines 189 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,067 INFO L77 FloydHoareUtils]: At program point L123(lines 123 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,067 INFO L77 FloydHoareUtils]: At program point L57(lines 57 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,067 INFO L77 FloydHoareUtils]: At program point L586-1(lines 39 608) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not (= 7 ~a17~0)) .cse1) (and (= ~a25~0 1) .cse1)))) [2024-12-05 21:54:35,067 INFO L77 FloydHoareUtils]: At program point L388(lines 388 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,067 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-12-05 21:54:35,067 INFO L75 FloydHoareUtils]: For program point L587(line 587) no Hoare annotation was computed. [2024-12-05 21:54:35,067 INFO L77 FloydHoareUtils]: At program point L390(lines 390 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,067 INFO L77 FloydHoareUtils]: At program point L324(lines 324 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-12-05 21:54:35,068 INFO L77 FloydHoareUtils]: At program point L258(lines 258 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-12-05 21:54:35,068 INFO L77 FloydHoareUtils]: At program point L60(lines 60 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,068 INFO L77 FloydHoareUtils]: At program point L195(lines 195 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,068 INFO L77 FloydHoareUtils]: At program point L129(lines 129 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,068 INFO L77 FloydHoareUtils]: At program point L64(lines 64 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,068 INFO L77 FloydHoareUtils]: At program point L263(lines 263 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-12-05 21:54:35,068 INFO L77 FloydHoareUtils]: At program point L197(lines 197 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,068 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 587) no Hoare annotation was computed. [2024-12-05 21:54:35,068 INFO L77 FloydHoareUtils]: At program point L199(lines 199 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,068 INFO L77 FloydHoareUtils]: At program point L133(lines 133 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,069 INFO L77 FloydHoareUtils]: At program point L399(lines 399 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,069 INFO L77 FloydHoareUtils]: At program point L201(lines 201 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,069 INFO L77 FloydHoareUtils]: At program point L69(lines 69 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,069 INFO L77 FloydHoareUtils]: At program point L269(lines 269 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-12-05 21:54:35,069 INFO L77 FloydHoareUtils]: At program point L204(lines 204 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,069 INFO L77 FloydHoareUtils]: At program point L271(lines 271 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-12-05 21:54:35,069 INFO L77 FloydHoareUtils]: At program point L404(lines 404 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,069 INFO L77 FloydHoareUtils]: At program point L338(lines 338 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-12-05 21:54:35,069 INFO L77 FloydHoareUtils]: At program point L140(lines 140 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,069 INFO L77 FloydHoareUtils]: At program point L75(lines 75 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,069 INFO L77 FloydHoareUtils]: At program point L208(lines 208 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,069 INFO L77 FloydHoareUtils]: At program point L341(lines 341 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,069 INFO L77 FloydHoareUtils]: At program point L408(lines 408 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,070 INFO L77 FloydHoareUtils]: At program point L144(lines 144 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,070 INFO L77 FloydHoareUtils]: At program point L79(lines 79 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,070 INFO L77 FloydHoareUtils]: At program point L212(lines 212 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,070 INFO L77 FloydHoareUtils]: At program point L610(lines 610 627) the Hoare annotation is: true [2024-12-05 21:54:35,070 INFO L77 FloydHoareUtils]: At program point L412(lines 412 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,070 INFO L77 FloydHoareUtils]: At program point L347(lines 347 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,070 INFO L77 FloydHoareUtils]: At program point L149(lines 149 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,070 INFO L77 FloydHoareUtils]: At program point L414(lines 414 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,070 INFO L77 FloydHoareUtils]: At program point L84(lines 84 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,070 INFO L77 FloydHoareUtils]: At program point L417(lines 417 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,070 INFO L77 FloydHoareUtils]: At program point L153(lines 153 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,070 INFO L77 FloydHoareUtils]: At program point L616-2(lines 616 626) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,070 INFO L77 FloydHoareUtils]: At program point L286(lines 286 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-12-05 21:54:35,070 INFO L77 FloydHoareUtils]: At program point L419(lines 419 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,070 INFO L77 FloydHoareUtils]: At program point L222(lines 222 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,070 INFO L77 FloydHoareUtils]: At program point L290(lines 290 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-12-05 21:54:35,071 INFO L77 FloydHoareUtils]: At program point L158(lines 158 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,071 INFO L77 FloydHoareUtils]: At program point L92(lines 92 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,071 INFO L77 FloydHoareUtils]: At program point L621(line 621) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,071 INFO L77 FloydHoareUtils]: At program point L225(lines 225 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,071 INFO L77 FloydHoareUtils]: At program point L359(lines 359 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,071 INFO L77 FloydHoareUtils]: At program point L293(lines 293 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-12-05 21:54:35,071 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-12-05 21:54:35,071 INFO L77 FloydHoareUtils]: At program point L228(lines 228 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-12-05 21:54:35,071 INFO L77 FloydHoareUtils]: At program point L296(lines 296 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-12-05 21:54:35,072 INFO L77 FloydHoareUtils]: At program point L164(lines 164 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,072 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 39 608) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,072 INFO L77 FloydHoareUtils]: At program point L364(lines 364 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,072 INFO L77 FloydHoareUtils]: At program point L233(lines 233 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-12-05 21:54:35,072 INFO L77 FloydHoareUtils]: At program point L101(lines 101 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-05 21:54:35,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 05.12 09:54:35 ImpRootNode [2024-12-05 21:54:35,082 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-05 21:54:35,082 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-05 21:54:35,082 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-05 21:54:35,082 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-05 21:54:35,083 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:52:02" (3/4) ... [2024-12-05 21:54:35,085 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-12-05 21:54:35,098 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 129 nodes and edges [2024-12-05 21:54:35,099 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-12-05 21:54:35,100 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-12-05 21:54:35,100 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-12-05 21:54:35,189 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e40f6d15-0fd9-40df-b04c-87580ba2f523/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-05 21:54:35,189 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e40f6d15-0fd9-40df-b04c-87580ba2f523/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-05 21:54:35,189 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-05 21:54:35,190 INFO L158 Benchmark]: Toolchain (without parser) took 154323.09ms. Allocated memory was 117.4MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 91.0MB in the beginning and 1.0GB in the end (delta: -947.7MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2024-12-05 21:54:35,190 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 117.4MB. Free memory is still 73.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-05 21:54:35,190 INFO L158 Benchmark]: CACSL2BoogieTranslator took 386.42ms. Allocated memory is still 117.4MB. Free memory was 91.0MB in the beginning and 64.7MB in the end (delta: 26.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-05 21:54:35,190 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.53ms. Allocated memory is still 117.4MB. Free memory was 64.7MB in the beginning and 59.6MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-05 21:54:35,191 INFO L158 Benchmark]: Boogie Preprocessor took 50.51ms. Allocated memory is still 117.4MB. Free memory was 59.6MB in the beginning and 55.5MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-05 21:54:35,191 INFO L158 Benchmark]: RCFGBuilder took 1205.15ms. Allocated memory is still 117.4MB. Free memory was 55.5MB in the beginning and 31.5MB in the end (delta: 24.0MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. [2024-12-05 21:54:35,191 INFO L158 Benchmark]: CodeCheck took 152516.63ms. Allocated memory was 117.4MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 31.5MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 961.7MB. Max. memory is 16.1GB. [2024-12-05 21:54:35,192 INFO L158 Benchmark]: Witness Printer took 106.62ms. Allocated memory is still 2.1GB. Free memory was 1.1GB in the beginning and 1.0GB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-05 21:54:35,193 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 136.1s, OverallIterations: 148, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 430942 SdHoareTripleChecker+Valid, 814.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 418382 mSDsluCounter, 52200 SdHoareTripleChecker+Invalid, 690.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 44373 mSDsCounter, 94870 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 892675 IncrementalHoareTripleChecker+Invalid, 987545 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 94870 mSolverCounterUnsat, 7827 mSDtfsCounter, 892675 mSolverCounterSat, 6.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 175257 GetRequests, 165766 SyntacticMatches, 8333 SemanticMatches, 1158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 850000 ImplicationChecksByTransitivity, 101.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.6s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 15.1s InterpolantComputationTime, 25866 NumberOfCodeBlocks, 25866 NumberOfCodeBlocksAsserted, 147 NumberOfCheckSat, 25719 ConstructedInterpolants, 0 QuantifiedInterpolants, 81400 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 147 InterpolantComputations, 124 PerfectInterpolantSequences, 20098/21246 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - PositiveResult [Line: 587]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 39]: Location Invariant Derived location invariant: ((((((a17 <= 8) && (a19 == 1)) || ((7 != a17) && (a19 != 1))) || ((((a11 == 1) && (a28 == 10)) && (a21 == 1)) && (7 == a17))) || (((((7 == a28) && (a25 == a11)) && (a21 == 1)) && (a11 == a19)) && (a11 != 1))) || ((a25 == 1) && (a19 != 1))) - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: ((((((a17 <= 8) && (a19 == 1)) || ((7 != a17) && (a19 != 1))) || ((((a11 == 1) && (a28 == 10)) && (a21 == 1)) && (7 == a17))) || (((((7 == a28) && (a25 == a11)) && (a21 == 1)) && (a11 == a19)) && (a11 != 1))) || ((a25 == 1) && (a19 != 1))) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 117.4MB. Free memory is still 73.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 386.42ms. Allocated memory is still 117.4MB. Free memory was 91.0MB in the beginning and 64.7MB in the end (delta: 26.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.53ms. Allocated memory is still 117.4MB. Free memory was 64.7MB in the beginning and 59.6MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.51ms. Allocated memory is still 117.4MB. Free memory was 59.6MB in the beginning and 55.5MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1205.15ms. Allocated memory is still 117.4MB. Free memory was 55.5MB in the beginning and 31.5MB in the end (delta: 24.0MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. * CodeCheck took 152516.63ms. Allocated memory was 117.4MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 31.5MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 961.7MB. Max. memory is 16.1GB. * Witness Printer took 106.62ms. Allocated memory is still 2.1GB. Free memory was 1.1GB in the beginning and 1.0GB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-12-05 21:54:35,206 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e40f6d15-0fd9-40df-b04c-87580ba2f523/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE