./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label53.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_52c322b8-9d3a-4344-8d74-f3b8d57f26e3/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52c322b8-9d3a-4344-8d74-f3b8d57f26e3/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_52c322b8-9d3a-4344-8d74-f3b8d57f26e3/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52c322b8-9d3a-4344-8d74-f3b8d57f26e3/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label53.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52c322b8-9d3a-4344-8d74-f3b8d57f26e3/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_52c322b8-9d3a-4344-8d74-f3b8d57f26e3/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 7127a319cf1cd9799cd1fae45aa7d7ff5ae81a2fc57d6618c5b4c58ba3671893 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-05 22:33:31,315 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-05 22:33:31,369 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52c322b8-9d3a-4344-8d74-f3b8d57f26e3/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-05 22:33:31,374 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-05 22:33:31,374 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-05 22:33:31,393 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-05 22:33:31,394 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-05 22:33:31,394 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-05 22:33:31,394 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-05 22:33:31,394 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-05 22:33:31,395 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-05 22:33:31,395 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-05 22:33:31,395 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-05 22:33:31,395 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-05 22:33:31,395 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-05 22:33:31,395 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-05 22:33:31,395 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-05 22:33:31,395 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-05 22:33:31,395 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-05 22:33:31,396 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-05 22:33:31,396 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-05 22:33:31,396 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-05 22:33:31,396 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-05 22:33:31,396 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-05 22:33:31,396 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-05 22:33:31,396 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-05 22:33:31,396 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-05 22:33:31,396 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-05 22:33:31,397 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-05 22:33:31,397 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-05 22:33:31,397 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-05 22:33:31,397 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-05 22:33:31,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-05 22:33:31,397 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_52c322b8-9d3a-4344-8d74-f3b8d57f26e3/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 -> 7127a319cf1cd9799cd1fae45aa7d7ff5ae81a2fc57d6618c5b4c58ba3671893 [2024-12-05 22:33:31,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-05 22:33:31,631 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-05 22:33:31,634 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-05 22:33:31,635 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-05 22:33:31,635 INFO L274 PluginConnector]: CDTParser initialized [2024-12-05 22:33:31,636 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52c322b8-9d3a-4344-8d74-f3b8d57f26e3/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/eca-rers2012/Problem01_label53.c [2024-12-05 22:33:34,298 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52c322b8-9d3a-4344-8d74-f3b8d57f26e3/bin/ukojak-verify-CZk0znPC7b/data/adf198ad4/383ec0e040c742cdae3305b5eef808b6/FLAG654699e29 [2024-12-05 22:33:34,541 INFO L384 CDTParser]: Found 1 translation units. [2024-12-05 22:33:34,541 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52c322b8-9d3a-4344-8d74-f3b8d57f26e3/sv-benchmarks/c/eca-rers2012/Problem01_label53.c [2024-12-05 22:33:34,553 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52c322b8-9d3a-4344-8d74-f3b8d57f26e3/bin/ukojak-verify-CZk0znPC7b/data/adf198ad4/383ec0e040c742cdae3305b5eef808b6/FLAG654699e29 [2024-12-05 22:33:34,566 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52c322b8-9d3a-4344-8d74-f3b8d57f26e3/bin/ukojak-verify-CZk0znPC7b/data/adf198ad4/383ec0e040c742cdae3305b5eef808b6 [2024-12-05 22:33:34,568 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-05 22:33:34,569 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-05 22:33:34,570 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-05 22:33:34,570 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-05 22:33:34,573 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-05 22:33:34,574 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 10:33:34" (1/1) ... [2024-12-05 22:33:34,575 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@653ff401 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:33:34, skipping insertion in model container [2024-12-05 22:33:34,575 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 10:33:34" (1/1) ... [2024-12-05 22:33:34,601 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-05 22:33:34,822 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_52c322b8-9d3a-4344-8d74-f3b8d57f26e3/sv-benchmarks/c/eca-rers2012/Problem01_label53.c[19724,19737] [2024-12-05 22:33:34,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-05 22:33:34,848 INFO L200 MainTranslator]: Completed pre-run [2024-12-05 22:33:34,931 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_52c322b8-9d3a-4344-8d74-f3b8d57f26e3/sv-benchmarks/c/eca-rers2012/Problem01_label53.c[19724,19737] [2024-12-05 22:33:34,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-05 22:33:34,951 INFO L204 MainTranslator]: Completed translation [2024-12-05 22:33:34,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:33:34 WrapperNode [2024-12-05 22:33:34,951 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-05 22:33:34,952 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-05 22:33:34,952 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-05 22:33:34,952 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-05 22:33:34,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:33:34" (1/1) ... [2024-12-05 22:33:34,970 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:33:34" (1/1) ... [2024-12-05 22:33:35,007 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-12-05 22:33:35,007 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-05 22:33:35,008 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-05 22:33:35,008 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-05 22:33:35,008 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-05 22:33:35,015 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:33:34" (1/1) ... [2024-12-05 22:33:35,015 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:33:34" (1/1) ... [2024-12-05 22:33:35,019 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:33:34" (1/1) ... [2024-12-05 22:33:35,019 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:33:34" (1/1) ... [2024-12-05 22:33:35,037 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:33:34" (1/1) ... [2024-12-05 22:33:35,039 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:33:34" (1/1) ... [2024-12-05 22:33:35,045 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:33:34" (1/1) ... [2024-12-05 22:33:35,048 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:33:34" (1/1) ... [2024-12-05 22:33:35,051 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:33:34" (1/1) ... [2024-12-05 22:33:35,056 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-05 22:33:35,057 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-05 22:33:35,057 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-05 22:33:35,057 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-05 22:33:35,058 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:33:34" (1/1) ... [2024-12-05 22:33:35,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-05 22:33:35,072 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52c322b8-9d3a-4344-8d74-f3b8d57f26e3/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-05 22:33:35,082 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52c322b8-9d3a-4344-8d74-f3b8d57f26e3/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-05 22:33:35,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52c322b8-9d3a-4344-8d74-f3b8d57f26e3/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-05 22:33:35,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-05 22:33:35,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-05 22:33:35,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-05 22:33:35,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-05 22:33:35,153 INFO L234 CfgBuilder]: Building ICFG [2024-12-05 22:33:35,155 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-05 22:33:35,963 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-12-05 22:33:35,963 INFO L283 CfgBuilder]: Performing block encoding [2024-12-05 22:33:36,193 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-05 22:33:36,194 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-05 22:33:36,194 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 10:33:36 BoogieIcfgContainer [2024-12-05 22:33:36,194 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-05 22:33:36,195 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-05 22:33:36,195 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-05 22:33:36,204 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-05 22:33:36,204 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 10:33:36" (1/1) ... [2024-12-05 22:33:36,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 22:33:36,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:36,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-12-05 22:33:36,258 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-12-05 22:33:36,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-12-05 22:33:36,261 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:36,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:36,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:36,679 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 22:33:37,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:37,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 145 states and 219 transitions. [2024-12-05 22:33:37,203 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 219 transitions. [2024-12-05 22:33:37,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-12-05 22:33:37,204 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:37,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:37,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:37,443 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-05 22:33:37,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:37,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 146 states and 220 transitions. [2024-12-05 22:33:37,667 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2024-12-05 22:33:37,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-12-05 22:33:37,668 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:37,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:37,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:37,776 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:33:37,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:37,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 151 states and 227 transitions. [2024-12-05 22:33:37,867 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 227 transitions. [2024-12-05 22:33:37,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-12-05 22:33:37,869 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:37,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:37,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:38,277 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:33:39,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:39,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 226 states and 305 transitions. [2024-12-05 22:33:39,068 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 305 transitions. [2024-12-05 22:33:39,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-12-05 22:33:39,069 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:39,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:39,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:39,211 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:33:39,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:39,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 227 states and 307 transitions. [2024-12-05 22:33:39,319 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 307 transitions. [2024-12-05 22:33:39,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-12-05 22:33:39,320 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:39,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:39,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:39,437 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:33:39,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:39,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 230 states and 310 transitions. [2024-12-05 22:33:39,490 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 310 transitions. [2024-12-05 22:33:39,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-12-05 22:33:39,491 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:39,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:39,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:39,582 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-05 22:33:39,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:39,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 238 states and 323 transitions. [2024-12-05 22:33:39,917 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 323 transitions. [2024-12-05 22:33:39,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-12-05 22:33:39,919 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:39,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:39,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:39,987 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-05 22:33:40,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:40,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 243 states and 328 transitions. [2024-12-05 22:33:40,126 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 328 transitions. [2024-12-05 22:33:40,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-12-05 22:33:40,127 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:40,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:40,236 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:33:40,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:40,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 249 states and 335 transitions. [2024-12-05 22:33:40,385 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 335 transitions. [2024-12-05 22:33:40,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-12-05 22:33:40,386 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:40,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:40,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:40,570 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:33:40,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:40,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 257 states and 346 transitions. [2024-12-05 22:33:40,912 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 346 transitions. [2024-12-05 22:33:40,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-12-05 22:33:40,913 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:40,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:40,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:41,067 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:33:41,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:41,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 259 states and 348 transitions. [2024-12-05 22:33:41,221 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 348 transitions. [2024-12-05 22:33:41,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-12-05 22:33:41,222 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:41,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:41,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:41,310 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-05 22:33:41,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:41,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 268 states and 360 transitions. [2024-12-05 22:33:41,594 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 360 transitions. [2024-12-05 22:33:41,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-12-05 22:33:41,595 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:41,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:41,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:41,719 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-05 22:33:41,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:41,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 272 states and 365 transitions. [2024-12-05 22:33:41,904 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 365 transitions. [2024-12-05 22:33:41,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-12-05 22:33:41,905 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:41,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:41,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:42,005 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-05 22:33:42,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:42,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 275 states and 371 transitions. [2024-12-05 22:33:42,366 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 371 transitions. [2024-12-05 22:33:42,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-12-05 22:33:42,367 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:42,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:42,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:42,486 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-05 22:33:42,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:42,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 287 states and 387 transitions. [2024-12-05 22:33:42,958 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 387 transitions. [2024-12-05 22:33:42,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-12-05 22:33:42,959 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:42,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:42,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:43,024 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-05 22:33:43,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:43,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 288 states and 387 transitions. [2024-12-05 22:33:43,057 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 387 transitions. [2024-12-05 22:33:43,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-12-05 22:33:43,057 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:43,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:43,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:43,180 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:33:43,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:43,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 305 states and 406 transitions. [2024-12-05 22:33:43,401 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 406 transitions. [2024-12-05 22:33:43,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-12-05 22:33:43,402 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:43,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:43,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:43,587 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-05 22:33:44,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:44,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 320 states and 423 transitions. [2024-12-05 22:33:44,025 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 423 transitions. [2024-12-05 22:33:44,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-12-05 22:33:44,026 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:44,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:44,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:44,097 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-05 22:33:44,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:44,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 335 states and 439 transitions. [2024-12-05 22:33:44,295 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 439 transitions. [2024-12-05 22:33:44,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-12-05 22:33:44,295 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:44,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:44,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:44,366 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-05 22:33:44,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:44,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 349 states and 453 transitions. [2024-12-05 22:33:44,587 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 453 transitions. [2024-12-05 22:33:44,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-12-05 22:33:44,588 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:44,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:44,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:44,670 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-05 22:33:44,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:44,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 352 states and 457 transitions. [2024-12-05 22:33:44,737 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 457 transitions. [2024-12-05 22:33:44,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-12-05 22:33:44,738 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:44,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:44,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:44,849 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-05 22:33:45,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:45,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 360 states and 468 transitions. [2024-12-05 22:33:45,309 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 468 transitions. [2024-12-05 22:33:45,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-12-05 22:33:45,310 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:45,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:45,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:45,410 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-05 22:33:45,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:45,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 374 states and 482 transitions. [2024-12-05 22:33:45,600 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 482 transitions. [2024-12-05 22:33:45,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-12-05 22:33:45,601 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:45,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:45,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:45,741 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-05 22:33:46,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:46,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 382 states and 492 transitions. [2024-12-05 22:33:46,213 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 492 transitions. [2024-12-05 22:33:46,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-12-05 22:33:46,214 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:46,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:46,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:46,300 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-05 22:33:46,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:46,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 385 states and 496 transitions. [2024-12-05 22:33:46,425 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 496 transitions. [2024-12-05 22:33:46,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-12-05 22:33:46,426 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:46,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:46,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:46,656 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 61 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:33:46,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:46,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 387 states and 500 transitions. [2024-12-05 22:33:46,951 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 500 transitions. [2024-12-05 22:33:46,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-12-05 22:33:46,952 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:46,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:46,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:47,079 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 22:33:47,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:47,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 406 states and 521 transitions. [2024-12-05 22:33:47,252 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 521 transitions. [2024-12-05 22:33:47,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-12-05 22:33:47,253 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:47,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:47,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:47,352 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-05 22:33:47,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:47,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 408 states and 523 transitions. [2024-12-05 22:33:47,481 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 523 transitions. [2024-12-05 22:33:47,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-12-05 22:33:47,482 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:47,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:47,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:47,522 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-05 22:33:47,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:47,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 422 states and 537 transitions. [2024-12-05 22:33:47,608 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 537 transitions. [2024-12-05 22:33:47,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-12-05 22:33:47,609 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:47,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:47,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:47,650 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:33:47,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:47,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 430 states and 548 transitions. [2024-12-05 22:33:47,710 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 548 transitions. [2024-12-05 22:33:47,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-12-05 22:33:47,710 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:47,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:47,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:47,843 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-05 22:33:48,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:48,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 470 states and 590 transitions. [2024-12-05 22:33:48,541 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 590 transitions. [2024-12-05 22:33:48,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-12-05 22:33:48,542 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:48,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:48,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:48,625 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-05 22:33:48,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:48,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 475 states and 595 transitions. [2024-12-05 22:33:48,847 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 595 transitions. [2024-12-05 22:33:48,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-12-05 22:33:48,848 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:48,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:48,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:48,889 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-05 22:33:49,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:49,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 480 states and 601 transitions. [2024-12-05 22:33:49,015 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 601 transitions. [2024-12-05 22:33:49,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-12-05 22:33:49,016 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:49,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:49,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:49,154 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 60 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-05 22:33:49,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:49,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 483 states and 605 transitions. [2024-12-05 22:33:49,426 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 605 transitions. [2024-12-05 22:33:49,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-12-05 22:33:49,427 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:49,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:49,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:49,540 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 62 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-05 22:33:49,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:49,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 485 states and 608 transitions. [2024-12-05 22:33:49,744 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 608 transitions. [2024-12-05 22:33:49,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-12-05 22:33:49,745 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:49,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:49,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:49,901 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-12-05 22:33:50,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:50,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 488 states and 611 transitions. [2024-12-05 22:33:50,001 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 611 transitions. [2024-12-05 22:33:50,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-12-05 22:33:50,002 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:50,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:50,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:50,173 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:33:50,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:50,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 538 states and 666 transitions. [2024-12-05 22:33:50,854 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 666 transitions. [2024-12-05 22:33:50,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-12-05 22:33:50,854 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:50,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:50,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:50,956 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:33:51,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:51,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 540 states and 667 transitions. [2024-12-05 22:33:51,124 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 667 transitions. [2024-12-05 22:33:51,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-12-05 22:33:51,124 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:51,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:51,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:51,232 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-12-05 22:33:51,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:51,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 543 states and 670 transitions. [2024-12-05 22:33:51,288 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 670 transitions. [2024-12-05 22:33:51,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-12-05 22:33:51,288 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:51,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:51,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:51,362 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:33:51,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:51,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 563 states and 691 transitions. [2024-12-05 22:33:51,575 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 691 transitions. [2024-12-05 22:33:51,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-12-05 22:33:51,576 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:51,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:51,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:51,835 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:33:53,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:53,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 703 states and 846 transitions. [2024-12-05 22:33:53,228 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 846 transitions. [2024-12-05 22:33:53,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-12-05 22:33:53,228 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:53,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:53,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:53,519 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:33:54,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:54,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 772 states and 931 transitions. [2024-12-05 22:33:54,715 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 931 transitions. [2024-12-05 22:33:54,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-12-05 22:33:54,715 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:54,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:54,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:55,002 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:33:56,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:56,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 826 states and 992 transitions. [2024-12-05 22:33:56,700 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 992 transitions. [2024-12-05 22:33:56,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-12-05 22:33:56,701 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:56,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:56,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:56,885 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:33:57,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:57,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 843 states and 1011 transitions. [2024-12-05 22:33:57,581 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1011 transitions. [2024-12-05 22:33:57,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-12-05 22:33:57,582 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:57,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:57,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:57,707 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:33:57,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:57,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 845 states and 1012 transitions. [2024-12-05 22:33:57,943 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1012 transitions. [2024-12-05 22:33:57,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-12-05 22:33:57,944 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:57,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:57,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:58,149 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 82 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:33:58,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:58,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 858 states and 1027 transitions. [2024-12-05 22:33:58,497 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1027 transitions. [2024-12-05 22:33:58,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-12-05 22:33:58,498 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:58,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:58,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:58,553 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-12-05 22:33:58,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:58,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 872 states and 1044 transitions. [2024-12-05 22:33:58,946 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1044 transitions. [2024-12-05 22:33:58,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-12-05 22:33:58,947 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:58,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:58,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:59,064 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-12-05 22:33:59,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:59,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 893 states and 1063 transitions. [2024-12-05 22:33:59,344 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1063 transitions. [2024-12-05 22:33:59,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-12-05 22:33:59,345 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:59,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:59,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:59,449 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-05 22:34:00,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:00,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 923 states and 1096 transitions. [2024-12-05 22:34:00,458 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1096 transitions. [2024-12-05 22:34:00,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-12-05 22:34:00,458 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:00,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:00,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:00,562 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-05 22:34:00,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:00,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 937 states and 1108 transitions. [2024-12-05 22:34:00,779 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1108 transitions. [2024-12-05 22:34:00,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-12-05 22:34:00,780 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:00,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:00,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:01,052 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:34:01,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:01,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 967 states and 1142 transitions. [2024-12-05 22:34:01,851 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1142 transitions. [2024-12-05 22:34:01,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-12-05 22:34:01,851 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:01,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:01,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:01,999 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-05 22:34:02,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:02,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1013 states and 1195 transitions. [2024-12-05 22:34:02,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1195 transitions. [2024-12-05 22:34:02,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-12-05 22:34:02,440 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:02,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:02,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:02,518 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-05 22:34:02,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:02,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1014 states and 1195 transitions. [2024-12-05 22:34:02,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1195 transitions. [2024-12-05 22:34:02,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-12-05 22:34:02,544 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:02,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:02,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:02,884 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:34:04,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:04,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1085 states and 1282 transitions. [2024-12-05 22:34:04,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1282 transitions. [2024-12-05 22:34:04,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-12-05 22:34:04,496 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:04,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:04,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:04,570 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-12-05 22:34:04,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:04,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1086 states and 1282 transitions. [2024-12-05 22:34:04,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1282 transitions. [2024-12-05 22:34:04,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-12-05 22:34:04,767 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:04,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:04,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:05,291 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 130 proven. 49 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-05 22:34:07,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:07,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1179 states and 1397 transitions. [2024-12-05 22:34:07,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1397 transitions. [2024-12-05 22:34:07,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-12-05 22:34:07,233 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:07,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:07,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:07,450 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 130 proven. 49 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-05 22:34:07,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:07,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1181 states and 1400 transitions. [2024-12-05 22:34:07,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 1400 transitions. [2024-12-05 22:34:07,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-12-05 22:34:07,690 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:07,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:07,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:07,812 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 112 proven. 6 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-12-05 22:34:08,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:08,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1206 states and 1427 transitions. [2024-12-05 22:34:08,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 1427 transitions. [2024-12-05 22:34:08,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-12-05 22:34:08,369 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:08,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:08,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:08,499 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-05 22:34:09,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:09,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1233 states and 1457 transitions. [2024-12-05 22:34:09,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1457 transitions. [2024-12-05 22:34:09,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-12-05 22:34:09,377 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:09,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:09,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:09,438 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-12-05 22:34:09,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:09,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1487 states to 1260 states and 1487 transitions. [2024-12-05 22:34:09,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1487 transitions. [2024-12-05 22:34:09,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-12-05 22:34:09,996 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:09,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:10,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:10,199 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 142 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-05 22:34:10,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:10,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1289 states and 1518 transitions. [2024-12-05 22:34:10,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1518 transitions. [2024-12-05 22:34:10,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-05 22:34:10,916 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:10,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:10,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:11,130 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:34:11,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:11,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1305 states and 1535 transitions. [2024-12-05 22:34:11,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 1535 transitions. [2024-12-05 22:34:11,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-05 22:34:11,791 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:11,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:11,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:12,004 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:34:12,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:12,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1539 states to 1310 states and 1539 transitions. [2024-12-05 22:34:12,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1539 transitions. [2024-12-05 22:34:12,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-12-05 22:34:12,313 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:12,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:12,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:12,893 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 3 proven. 167 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-05 22:34:14,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:14,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1342 states and 1572 transitions. [2024-12-05 22:34:14,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1572 transitions. [2024-12-05 22:34:14,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-12-05 22:34:14,395 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:14,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:14,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:14,700 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 119 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:34:15,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:15,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1356 states and 1590 transitions. [2024-12-05 22:34:15,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 1590 transitions. [2024-12-05 22:34:15,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-12-05 22:34:15,424 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:15,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:15,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:15,522 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-12-05 22:34:15,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:15,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1357 states and 1591 transitions. [2024-12-05 22:34:15,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 1591 transitions. [2024-12-05 22:34:15,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-05 22:34:15,723 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:15,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:15,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:15,896 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-12-05 22:34:17,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:17,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1398 states and 1634 transitions. [2024-12-05 22:34:17,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 1634 transitions. [2024-12-05 22:34:17,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-05 22:34:17,559 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:17,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:17,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:18,057 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 69 proven. 124 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-05 22:34:21,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:21,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1818 states to 1558 states and 1818 transitions. [2024-12-05 22:34:21,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 1818 transitions. [2024-12-05 22:34:21,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-12-05 22:34:21,225 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:21,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:21,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:21,490 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 239 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:34:22,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:22,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1863 states to 1588 states and 1863 transitions. [2024-12-05 22:34:22,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 1863 transitions. [2024-12-05 22:34:22,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-12-05 22:34:22,514 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:22,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:22,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:22,706 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 239 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:34:22,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:22,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1863 states to 1589 states and 1863 transitions. [2024-12-05 22:34:22,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 1863 transitions. [2024-12-05 22:34:22,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-12-05 22:34:22,991 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:22,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:23,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:23,296 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-05 22:34:24,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:24,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1654 states and 1946 transitions. [2024-12-05 22:34:24,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 1946 transitions. [2024-12-05 22:34:24,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-12-05 22:34:24,505 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:24,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:24,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:24,721 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-05 22:34:25,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:25,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1675 states and 1969 transitions. [2024-12-05 22:34:25,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1675 states and 1969 transitions. [2024-12-05 22:34:25,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-05 22:34:25,545 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:25,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:25,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:25,848 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 136 proven. 65 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-12-05 22:34:26,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:26,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1984 states to 1688 states and 1984 transitions. [2024-12-05 22:34:26,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1688 states and 1984 transitions. [2024-12-05 22:34:26,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-05 22:34:26,253 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:26,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:26,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:26,693 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-12-05 22:34:27,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:27,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2051 states to 1740 states and 2051 transitions. [2024-12-05 22:34:27,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1740 states and 2051 transitions. [2024-12-05 22:34:27,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-05 22:34:27,942 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:27,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:27,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:28,170 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 139 proven. 55 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-05 22:34:30,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:30,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 1814 states and 2132 transitions. [2024-12-05 22:34:30,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1814 states and 2132 transitions. [2024-12-05 22:34:30,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-05 22:34:30,428 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:30,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:30,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:30,700 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 140 proven. 71 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-12-05 22:34:30,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:30,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 1820 states and 2139 transitions. [2024-12-05 22:34:30,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 2139 transitions. [2024-12-05 22:34:30,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-12-05 22:34:30,870 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:30,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:30,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:31,017 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 227 proven. 9 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-12-05 22:34:31,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:31,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 1829 states and 2152 transitions. [2024-12-05 22:34:31,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2152 transitions. [2024-12-05 22:34:31,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-12-05 22:34:31,446 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:31,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:31,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:31,537 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-12-05 22:34:32,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:32,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2194 states to 1864 states and 2194 transitions. [2024-12-05 22:34:32,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 2194 transitions. [2024-12-05 22:34:32,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-12-05 22:34:32,802 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:32,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:32,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:32,876 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-12-05 22:34:33,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:33,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2205 states to 1874 states and 2205 transitions. [2024-12-05 22:34:33,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 2205 transitions. [2024-12-05 22:34:33,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-12-05 22:34:33,587 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:33,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:33,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:33,964 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:34:34,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:34,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2219 states to 1887 states and 2219 transitions. [2024-12-05 22:34:34,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1887 states and 2219 transitions. [2024-12-05 22:34:34,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-12-05 22:34:34,665 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:34,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:34,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:34,735 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-12-05 22:34:36,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:36,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2255 states to 1921 states and 2255 transitions. [2024-12-05 22:34:36,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1921 states and 2255 transitions. [2024-12-05 22:34:36,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-12-05 22:34:36,165 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:36,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:36,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:36,512 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 86 proven. 141 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-12-05 22:34:38,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:38,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2352 states to 2012 states and 2352 transitions. [2024-12-05 22:34:38,255 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 2352 transitions. [2024-12-05 22:34:38,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-12-05 22:34:38,256 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:38,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:38,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:38,407 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 145 proven. 72 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-12-05 22:34:38,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:38,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2369 states to 2029 states and 2369 transitions. [2024-12-05 22:34:38,848 INFO L276 IsEmpty]: Start isEmpty. Operand 2029 states and 2369 transitions. [2024-12-05 22:34:38,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-12-05 22:34:38,850 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:38,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:38,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:38,936 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-05 22:34:39,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:39,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2384 states to 2042 states and 2384 transitions. [2024-12-05 22:34:39,343 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 2384 transitions. [2024-12-05 22:34:39,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-12-05 22:34:39,345 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:39,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:39,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:39,418 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-05 22:34:39,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:39,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2401 states to 2059 states and 2401 transitions. [2024-12-05 22:34:39,822 INFO L276 IsEmpty]: Start isEmpty. Operand 2059 states and 2401 transitions. [2024-12-05 22:34:39,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-12-05 22:34:39,823 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:39,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:39,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:39,897 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-12-05 22:34:40,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:40,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2423 states to 2081 states and 2423 transitions. [2024-12-05 22:34:40,529 INFO L276 IsEmpty]: Start isEmpty. Operand 2081 states and 2423 transitions. [2024-12-05 22:34:40,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-12-05 22:34:40,530 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:40,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:40,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:40,779 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 156 proven. 87 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-05 22:34:41,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:41,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2460 states to 2110 states and 2460 transitions. [2024-12-05 22:34:41,927 INFO L276 IsEmpty]: Start isEmpty. Operand 2110 states and 2460 transitions. [2024-12-05 22:34:41,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-12-05 22:34:41,928 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:41,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:41,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:43,099 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 174 proven. 28 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-05 22:34:45,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:45,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2495 states to 2139 states and 2495 transitions. [2024-12-05 22:34:45,792 INFO L276 IsEmpty]: Start isEmpty. Operand 2139 states and 2495 transitions. [2024-12-05 22:34:45,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-12-05 22:34:45,793 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:45,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:45,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:46,041 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 243 proven. 9 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-12-05 22:34:47,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:47,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2505 states to 2141 states and 2505 transitions. [2024-12-05 22:34:47,260 INFO L276 IsEmpty]: Start isEmpty. Operand 2141 states and 2505 transitions. [2024-12-05 22:34:47,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-12-05 22:34:47,261 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:47,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:47,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:47,388 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 243 proven. 9 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-12-05 22:34:48,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:48,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2169 states and 2534 transitions. [2024-12-05 22:34:48,351 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 2534 transitions. [2024-12-05 22:34:48,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-12-05 22:34:48,353 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:48,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:48,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:48,434 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-12-05 22:34:49,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:49,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2564 states to 2184 states and 2564 transitions. [2024-12-05 22:34:49,831 INFO L276 IsEmpty]: Start isEmpty. Operand 2184 states and 2564 transitions. [2024-12-05 22:34:49,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-12-05 22:34:49,832 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:49,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:49,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:49,910 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-12-05 22:34:50,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:50,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2579 states to 2199 states and 2579 transitions. [2024-12-05 22:34:50,494 INFO L276 IsEmpty]: Start isEmpty. Operand 2199 states and 2579 transitions. [2024-12-05 22:34:50,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-12-05 22:34:50,495 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:50,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:50,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:50,573 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-12-05 22:34:51,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:51,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2586 states to 2201 states and 2586 transitions. [2024-12-05 22:34:51,591 INFO L276 IsEmpty]: Start isEmpty. Operand 2201 states and 2586 transitions. [2024-12-05 22:34:51,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-12-05 22:34:51,592 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:51,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:51,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:51,670 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-12-05 22:34:52,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:52,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2613 states to 2229 states and 2613 transitions. [2024-12-05 22:34:52,625 INFO L276 IsEmpty]: Start isEmpty. Operand 2229 states and 2613 transitions. [2024-12-05 22:34:52,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-12-05 22:34:52,626 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:52,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:52,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:53,073 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 188 proven. 145 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-05 22:34:55,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:55,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2686 states to 2291 states and 2686 transitions. [2024-12-05 22:34:55,221 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 2686 transitions. [2024-12-05 22:34:55,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-12-05 22:34:55,222 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:55,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:55,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:55,347 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 219 proven. 100 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-12-05 22:34:56,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:56,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2713 states to 2317 states and 2713 transitions. [2024-12-05 22:34:56,527 INFO L276 IsEmpty]: Start isEmpty. Operand 2317 states and 2713 transitions. [2024-12-05 22:34:56,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-12-05 22:34:56,528 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:56,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:56,786 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 162 proven. 93 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-12-05 22:34:57,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:57,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2720 states to 2324 states and 2720 transitions. [2024-12-05 22:34:57,149 INFO L276 IsEmpty]: Start isEmpty. Operand 2324 states and 2720 transitions. [2024-12-05 22:34:57,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-12-05 22:34:57,150 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:57,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:57,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:57,229 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-12-05 22:34:57,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:57,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2728 states to 2333 states and 2728 transitions. [2024-12-05 22:34:57,453 INFO L276 IsEmpty]: Start isEmpty. Operand 2333 states and 2728 transitions. [2024-12-05 22:34:57,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-12-05 22:34:57,455 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:57,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:57,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:57,904 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 106 proven. 160 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-12-05 22:34:59,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:59,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2848 states to 2441 states and 2848 transitions. [2024-12-05 22:34:59,809 INFO L276 IsEmpty]: Start isEmpty. Operand 2441 states and 2848 transitions. [2024-12-05 22:34:59,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-12-05 22:34:59,810 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:59,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:59,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:35:00,369 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 201 proven. 127 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-05 22:35:02,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:35:02,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2895 states to 2478 states and 2895 transitions. [2024-12-05 22:35:02,443 INFO L276 IsEmpty]: Start isEmpty. Operand 2478 states and 2895 transitions. [2024-12-05 22:35:02,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-12-05 22:35:02,444 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:35:02,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:35:02,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:35:02,707 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 201 proven. 127 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-05 22:35:03,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:35:03,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2921 states to 2502 states and 2921 transitions. [2024-12-05 22:35:03,764 INFO L276 IsEmpty]: Start isEmpty. Operand 2502 states and 2921 transitions. [2024-12-05 22:35:03,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-12-05 22:35:03,767 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:35:03,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:35:03,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:35:04,057 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 201 proven. 127 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-05 22:35:04,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:35:04,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2942 states to 2518 states and 2942 transitions. [2024-12-05 22:35:04,744 INFO L276 IsEmpty]: Start isEmpty. Operand 2518 states and 2942 transitions. [2024-12-05 22:35:04,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-12-05 22:35:04,745 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:35:04,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:35:04,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:35:04,984 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 201 proven. 127 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-05 22:35:05,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:35:05,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2954 states to 2527 states and 2954 transitions. [2024-12-05 22:35:05,466 INFO L276 IsEmpty]: Start isEmpty. Operand 2527 states and 2954 transitions. [2024-12-05 22:35:05,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-12-05 22:35:05,467 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:35:05,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:35:05,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:35:05,752 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 201 proven. 127 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-05 22:35:06,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:35:06,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2966 states to 2536 states and 2966 transitions. [2024-12-05 22:35:06,229 INFO L276 IsEmpty]: Start isEmpty. Operand 2536 states and 2966 transitions. [2024-12-05 22:35:06,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-12-05 22:35:06,230 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:35:06,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:35:06,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:35:06,493 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 166 proven. 97 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-12-05 22:35:07,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:35:07,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2970 states to 2537 states and 2970 transitions. [2024-12-05 22:35:07,034 INFO L276 IsEmpty]: Start isEmpty. Operand 2537 states and 2970 transitions. [2024-12-05 22:35:07,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-12-05 22:35:07,035 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:35:07,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:35:07,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:35:07,350 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 166 proven. 97 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-12-05 22:35:07,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:35:07,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2970 states to 2538 states and 2970 transitions. [2024-12-05 22:35:07,935 INFO L276 IsEmpty]: Start isEmpty. Operand 2538 states and 2970 transitions. [2024-12-05 22:35:07,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-12-05 22:35:07,937 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:35:07,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:35:07,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:35:08,059 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-12-05 22:35:09,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:35:09,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2991 states to 2554 states and 2991 transitions. [2024-12-05 22:35:09,325 INFO L276 IsEmpty]: Start isEmpty. Operand 2554 states and 2991 transitions. [2024-12-05 22:35:09,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-12-05 22:35:09,326 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:35:09,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:35:09,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:35:09,445 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-12-05 22:35:09,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:35:09,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2991 states to 2555 states and 2991 transitions. [2024-12-05 22:35:09,984 INFO L276 IsEmpty]: Start isEmpty. Operand 2555 states and 2991 transitions. [2024-12-05 22:35:09,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-05 22:35:09,987 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:35:09,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:35:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:35:10,425 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 169 proven. 100 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-12-05 22:35:11,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:35:11,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3050 states to 2606 states and 3050 transitions. [2024-12-05 22:35:11,793 INFO L276 IsEmpty]: Start isEmpty. Operand 2606 states and 3050 transitions. [2024-12-05 22:35:11,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-05 22:35:11,794 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:35:11,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:35:11,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:35:11,916 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 261 proven. 9 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-12-05 22:35:13,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:35:13,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3088 states to 2642 states and 3088 transitions. [2024-12-05 22:35:13,699 INFO L276 IsEmpty]: Start isEmpty. Operand 2642 states and 3088 transitions. [2024-12-05 22:35:13,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-05 22:35:13,701 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:35:13,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:35:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:35:13,830 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-05 22:35:17,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:35:17,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3161 states to 2695 states and 3161 transitions. [2024-12-05 22:35:17,432 INFO L276 IsEmpty]: Start isEmpty. Operand 2695 states and 3161 transitions. [2024-12-05 22:35:17,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-05 22:35:17,433 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:35:17,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:35:17,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:35:17,512 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-05 22:35:18,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:35:18,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3188 states to 2721 states and 3188 transitions. [2024-12-05 22:35:18,447 INFO L276 IsEmpty]: Start isEmpty. Operand 2721 states and 3188 transitions. [2024-12-05 22:35:18,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-05 22:35:18,449 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:35:18,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:35:18,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:35:18,526 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-05 22:35:19,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:35:19,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3206 states to 2737 states and 3206 transitions. [2024-12-05 22:35:19,118 INFO L276 IsEmpty]: Start isEmpty. Operand 2737 states and 3206 transitions. [2024-12-05 22:35:19,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-05 22:35:19,119 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:35:19,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:35:19,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:35:19,197 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-05 22:35:19,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:35:19,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3215 states to 2747 states and 3215 transitions. [2024-12-05 22:35:19,976 INFO L276 IsEmpty]: Start isEmpty. Operand 2747 states and 3215 transitions. [2024-12-05 22:35:19,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-05 22:35:19,977 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:35:19,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:35:20,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:35:20,055 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-05 22:35:20,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:35:20,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3232 states to 2764 states and 3232 transitions. [2024-12-05 22:35:20,620 INFO L276 IsEmpty]: Start isEmpty. Operand 2764 states and 3232 transitions. [2024-12-05 22:35:20,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-12-05 22:35:20,621 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:35:20,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:35:20,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:35:20,700 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-12-05 22:35:23,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:35:23,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3266 states to 2792 states and 3266 transitions. [2024-12-05 22:35:23,373 INFO L276 IsEmpty]: Start isEmpty. Operand 2792 states and 3266 transitions. [2024-12-05 22:35:23,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-12-05 22:35:23,435 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:35:23,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:35:23,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:35:23,516 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-12-05 22:35:24,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:35:24,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3279 states to 2806 states and 3279 transitions. [2024-12-05 22:35:24,015 INFO L276 IsEmpty]: Start isEmpty. Operand 2806 states and 3279 transitions. [2024-12-05 22:35:24,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-12-05 22:35:24,017 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:35:24,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:35:24,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:35:24,381 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-05 22:35:27,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:35:27,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3360 states to 2875 states and 3360 transitions. [2024-12-05 22:35:27,764 INFO L276 IsEmpty]: Start isEmpty. Operand 2875 states and 3360 transitions. [2024-12-05 22:35:27,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-12-05 22:35:27,766 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:35:27,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:35:27,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:35:28,082 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-05 22:35:29,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:35:29,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3394 states to 2905 states and 3394 transitions. [2024-12-05 22:35:29,581 INFO L276 IsEmpty]: Start isEmpty. Operand 2905 states and 3394 transitions. [2024-12-05 22:35:29,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-12-05 22:35:29,583 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:35:29,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:35:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:35:29,855 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 179 proven. 104 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-05 22:35:32,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:35:32,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3435 states to 2937 states and 3435 transitions. [2024-12-05 22:35:32,624 INFO L276 IsEmpty]: Start isEmpty. Operand 2937 states and 3435 transitions. [2024-12-05 22:35:32,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-12-05 22:35:32,626 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:35:32,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:35:32,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:35:33,065 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-05 22:35:35,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:35:35,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3501 states to 2995 states and 3501 transitions. [2024-12-05 22:35:35,005 INFO L276 IsEmpty]: Start isEmpty. Operand 2995 states and 3501 transitions. [2024-12-05 22:35:35,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-12-05 22:35:35,007 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:35:35,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:35:35,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:35:35,352 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 175 proven. 106 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-12-05 22:35:35,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:35:35,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3508 states to 3001 states and 3508 transitions. [2024-12-05 22:35:35,556 INFO L276 IsEmpty]: Start isEmpty. Operand 3001 states and 3508 transitions. [2024-12-05 22:35:35,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-05 22:35:35,558 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:35:35,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:35:35,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:35:35,638 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-12-05 22:35:36,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:35:36,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3526 states to 3017 states and 3526 transitions. [2024-12-05 22:35:36,273 INFO L276 IsEmpty]: Start isEmpty. Operand 3017 states and 3526 transitions. [2024-12-05 22:35:36,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-05 22:35:36,275 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:35:36,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:35:36,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:35:36,355 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-12-05 22:35:36,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:35:36,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3542 states to 3033 states and 3542 transitions. [2024-12-05 22:35:36,880 INFO L276 IsEmpty]: Start isEmpty. Operand 3033 states and 3542 transitions. [2024-12-05 22:35:36,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-05 22:35:36,882 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:35:36,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:35:36,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:35:36,962 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-12-05 22:35:38,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:35:38,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3053 states and 3564 transitions. [2024-12-05 22:35:38,050 INFO L276 IsEmpty]: Start isEmpty. Operand 3053 states and 3564 transitions. [2024-12-05 22:35:38,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-05 22:35:38,052 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:35:38,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:35:38,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:35:38,823 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:35:41,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:35:41,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3604 states to 3092 states and 3604 transitions. [2024-12-05 22:35:41,674 INFO L276 IsEmpty]: Start isEmpty. Operand 3092 states and 3604 transitions. [2024-12-05 22:35:41,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-12-05 22:35:41,676 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:35:41,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:35:41,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:35:41,758 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2024-12-05 22:35:42,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:35:42,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3620 states to 3108 states and 3620 transitions. [2024-12-05 22:35:42,503 INFO L276 IsEmpty]: Start isEmpty. Operand 3108 states and 3620 transitions. [2024-12-05 22:35:42,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-12-05 22:35:42,506 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:35:42,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:35:42,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:35:42,975 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 186 proven. 111 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-05 22:35:44,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:35:44,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3635 states to 3122 states and 3635 transitions. [2024-12-05 22:35:44,376 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 3635 transitions. [2024-12-05 22:35:44,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-12-05 22:35:44,378 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:35:44,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:35:44,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:35:44,582 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 179 proven. 107 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-12-05 22:35:45,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:35:45,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3647 states to 3134 states and 3647 transitions. [2024-12-05 22:35:45,198 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 3647 transitions. [2024-12-05 22:35:45,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-12-05 22:35:45,200 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:35:45,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:35:45,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:35:45,284 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-12-05 22:35:46,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:35:46,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3663 states to 3148 states and 3663 transitions. [2024-12-05 22:35:46,318 INFO L276 IsEmpty]: Start isEmpty. Operand 3148 states and 3663 transitions. [2024-12-05 22:35:46,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-12-05 22:35:46,320 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:35:46,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:35:46,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:35:46,604 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 185 proven. 152 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-12-05 22:35:48,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:35:48,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3701 states to 3185 states and 3701 transitions. [2024-12-05 22:35:48,654 INFO L276 IsEmpty]: Start isEmpty. Operand 3185 states and 3701 transitions. [2024-12-05 22:35:48,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-05 22:35:48,656 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:35:48,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:35:48,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:35:48,739 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2024-12-05 22:35:50,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:35:50,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3720 states to 3205 states and 3720 transitions. [2024-12-05 22:35:50,009 INFO L276 IsEmpty]: Start isEmpty. Operand 3205 states and 3720 transitions. [2024-12-05 22:35:50,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-05 22:35:50,011 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:35:50,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:35:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:35:50,371 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 189 proven. 114 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-05 22:35:50,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:35:50,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3724 states to 3208 states and 3724 transitions. [2024-12-05 22:35:50,598 INFO L276 IsEmpty]: Start isEmpty. Operand 3208 states and 3724 transitions. [2024-12-05 22:35:50,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-05 22:35:50,600 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:35:50,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:35:50,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:35:51,033 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 125 proven. 170 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-12-05 22:35:55,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:35:55,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3870 states to 3338 states and 3870 transitions. [2024-12-05 22:35:55,224 INFO L276 IsEmpty]: Start isEmpty. Operand 3338 states and 3870 transitions. [2024-12-05 22:35:55,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-12-05 22:35:55,226 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:35:55,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:35:55,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:35:55,640 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-12-05 22:35:58,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:35:58,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3944 states to 3404 states and 3944 transitions. [2024-12-05 22:35:58,249 INFO L276 IsEmpty]: Start isEmpty. Operand 3404 states and 3944 transitions. [2024-12-05 22:35:58,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-12-05 22:35:58,251 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:35:58,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:35:58,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:35:58,941 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 237 proven. 185 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-12-05 22:36:02,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:36:02,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4075 states to 3522 states and 4075 transitions. [2024-12-05 22:36:02,953 INFO L276 IsEmpty]: Start isEmpty. Operand 3522 states and 4075 transitions. [2024-12-05 22:36:02,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-12-05 22:36:02,955 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:36:02,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:36:02,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:36:03,627 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-05 22:36:08,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:36:08,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4139 states to 3572 states and 4139 transitions. [2024-12-05 22:36:08,028 INFO L276 IsEmpty]: Start isEmpty. Operand 3572 states and 4139 transitions. [2024-12-05 22:36:08,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-12-05 22:36:08,029 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:36:08,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:36:08,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:36:08,426 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-05 22:36:09,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:36:09,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4149 states to 3581 states and 4149 transitions. [2024-12-05 22:36:09,066 INFO L276 IsEmpty]: Start isEmpty. Operand 3581 states and 4149 transitions. [2024-12-05 22:36:09,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-12-05 22:36:09,068 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:36:09,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:36:09,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:36:09,372 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-05 22:36:10,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:36:10,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4159 states to 3590 states and 4159 transitions. [2024-12-05 22:36:10,057 INFO L276 IsEmpty]: Start isEmpty. Operand 3590 states and 4159 transitions. [2024-12-05 22:36:10,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-12-05 22:36:10,058 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:36:10,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:36:10,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:36:10,888 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 200 proven. 180 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-05 22:36:15,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:36:15,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 3700 states and 4276 transitions. [2024-12-05 22:36:15,001 INFO L276 IsEmpty]: Start isEmpty. Operand 3700 states and 4276 transitions. [2024-12-05 22:36:15,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-12-05 22:36:15,003 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:36:15,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:36:15,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:36:15,455 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 417 proven. 9 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-12-05 22:36:17,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:36:17,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4298 states to 3718 states and 4298 transitions. [2024-12-05 22:36:17,612 INFO L276 IsEmpty]: Start isEmpty. Operand 3718 states and 4298 transitions. [2024-12-05 22:36:17,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-12-05 22:36:17,614 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:36:17,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:36:17,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:36:18,106 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 293 proven. 142 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-12-05 22:36:23,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:36:23,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4366 states to 3765 states and 4366 transitions. [2024-12-05 22:36:23,172 INFO L276 IsEmpty]: Start isEmpty. Operand 3765 states and 4366 transitions. [2024-12-05 22:36:23,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2024-12-05 22:36:23,174 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:36:23,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:36:23,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:36:23,409 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 368 proven. 105 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-12-05 22:36:24,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:36:24,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4375 states to 3770 states and 4375 transitions. [2024-12-05 22:36:24,599 INFO L276 IsEmpty]: Start isEmpty. Operand 3770 states and 4375 transitions. [2024-12-05 22:36:24,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2024-12-05 22:36:24,601 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:36:24,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:36:24,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:36:25,060 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 385 proven. 9 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-12-05 22:36:28,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:36:28,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4399 states to 3788 states and 4399 transitions. [2024-12-05 22:36:28,574 INFO L276 IsEmpty]: Start isEmpty. Operand 3788 states and 4399 transitions. [2024-12-05 22:36:28,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-12-05 22:36:28,576 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:36:28,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:36:28,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:36:28,879 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-12-05 22:36:30,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:36:30,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4410 states to 3797 states and 4410 transitions. [2024-12-05 22:36:30,745 INFO L276 IsEmpty]: Start isEmpty. Operand 3797 states and 4410 transitions. [2024-12-05 22:36:30,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-12-05 22:36:30,747 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:36:30,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:36:30,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:36:30,885 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-12-05 22:36:32,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:36:32,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4417 states to 3803 states and 4417 transitions. [2024-12-05 22:36:32,928 INFO L276 IsEmpty]: Start isEmpty. Operand 3803 states and 4417 transitions. [2024-12-05 22:36:32,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-12-05 22:36:32,930 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:36:32,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:36:32,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:36:33,835 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 279 proven. 206 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-12-05 22:36:41,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:36:41,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4482 states to 3859 states and 4482 transitions. [2024-12-05 22:36:41,470 INFO L276 IsEmpty]: Start isEmpty. Operand 3859 states and 4482 transitions. [2024-12-05 22:36:41,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-12-05 22:36:41,471 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 148 iterations. [2024-12-05 22:36:41,479 INFO L726 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-12-05 22:37:19,534 INFO L77 FloydHoareUtils]: At program point L102(lines 102 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5)))) [2024-12-05 22:37:19,534 INFO L77 FloydHoareUtils]: At program point L598(line 598) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-05 22:37:19,535 INFO L77 FloydHoareUtils]: At program point L334(lines 334 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-05 22:37:19,535 INFO L77 FloydHoareUtils]: At program point L302(lines 302 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-05 22:37:19,535 INFO L77 FloydHoareUtils]: At program point L170(lines 170 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5)))) [2024-12-05 22:37:19,535 INFO L77 FloydHoareUtils]: At program point L204(lines 204 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5)))) [2024-12-05 22:37:19,536 INFO L77 FloydHoareUtils]: At program point L72(lines 72 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-05 22:37:19,536 INFO L77 FloydHoareUtils]: At program point L271(lines 271 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-05 22:37:19,536 INFO L77 FloydHoareUtils]: At program point L139(lines 139 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5)))) [2024-12-05 22:37:19,536 INFO L77 FloydHoareUtils]: At program point L371(lines 371 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-05 22:37:19,536 INFO L77 FloydHoareUtils]: At program point L107(lines 107 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5)))) [2024-12-05 22:37:19,537 INFO L77 FloydHoareUtils]: At program point L41(lines 41 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-05 22:37:19,537 INFO L77 FloydHoareUtils]: At program point L339(lines 339 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-05 22:37:19,537 INFO L77 FloydHoareUtils]: At program point L207(lines 207 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-05 22:37:19,537 INFO L77 FloydHoareUtils]: At program point L75(lines 75 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-05 22:37:19,537 INFO L77 FloydHoareUtils]: At program point L373(lines 373 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-05 22:37:19,537 INFO L77 FloydHoareUtils]: At program point L241(lines 241 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-05 22:37:19,538 INFO L77 FloydHoareUtils]: At program point L175(lines 175 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5)))) [2024-12-05 22:37:19,538 INFO L77 FloydHoareUtils]: At program point L275(lines 275 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-05 22:37:19,538 INFO L77 FloydHoareUtils]: At program point L375(lines 375 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-05 22:37:19,538 INFO L77 FloydHoareUtils]: At program point L309(lines 309 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-05 22:37:19,538 INFO L77 FloydHoareUtils]: At program point L45(lines 45 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-05 22:37:19,539 INFO L77 FloydHoareUtils]: At program point L343(lines 343 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-05 22:37:19,539 INFO L77 FloydHoareUtils]: At program point L112(lines 112 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5)))) [2024-12-05 22:37:19,539 INFO L77 FloydHoareUtils]: At program point L278(lines 278 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-05 22:37:19,539 INFO L77 FloydHoareUtils]: At program point L146(lines 146 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5)))) [2024-12-05 22:37:19,539 INFO L77 FloydHoareUtils]: At program point L213(lines 213 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-05 22:37:19,539 INFO L77 FloydHoareUtils]: At program point L82(lines 82 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5)))) [2024-12-05 22:37:19,540 INFO L77 FloydHoareUtils]: At program point L347(lines 347 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-05 22:37:19,540 INFO L77 FloydHoareUtils]: At program point L248(lines 248 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-05 22:37:19,540 INFO L77 FloydHoareUtils]: At program point L183(lines 183 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5)))) [2024-12-05 22:37:19,540 INFO L77 FloydHoareUtils]: At program point L150(lines 150 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5)))) [2024-12-05 22:37:19,540 INFO L77 FloydHoareUtils]: At program point L382(lines 382 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-05 22:37:19,540 INFO L77 FloydHoareUtils]: At program point L316(lines 316 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-05 22:37:19,540 INFO L77 FloydHoareUtils]: At program point L283(lines 283 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-05 22:37:19,541 INFO L77 FloydHoareUtils]: At program point L118(lines 118 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5)))) [2024-12-05 22:37:19,541 INFO L77 FloydHoareUtils]: At program point L218(lines 218 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-05 22:37:19,541 INFO L77 FloydHoareUtils]: At program point L53(lines 53 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-05 22:37:19,541 INFO L77 FloydHoareUtils]: At program point L154(lines 154 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5)))) [2024-12-05 22:37:19,541 INFO L77 FloydHoareUtils]: At program point L188(lines 188 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5)))) [2024-12-05 22:37:19,541 INFO L77 FloydHoareUtils]: At program point L387(lines 387 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-05 22:37:19,542 INFO L77 FloydHoareUtils]: At program point L288(lines 288 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-05 22:37:19,542 INFO L77 FloydHoareUtils]: At program point L255(lines 255 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-05 22:37:19,542 INFO L77 FloydHoareUtils]: At program point L90(lines 90 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5)))) [2024-12-05 22:37:19,542 INFO L77 FloydHoareUtils]: At program point L355(lines 355 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-05 22:37:19,542 INFO L77 FloydHoareUtils]: At program point L322(lines 322 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-05 22:37:19,542 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-12-05 22:37:19,542 INFO L77 FloydHoareUtils]: At program point L124(lines 124 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5)))) [2024-12-05 22:37:19,542 INFO L77 FloydHoareUtils]: At program point L587(lines 587 604) the Hoare annotation is: true [2024-12-05 22:37:19,542 INFO L77 FloydHoareUtils]: At program point L224(lines 224 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-05 22:37:19,543 INFO L77 FloydHoareUtils]: At program point L158(lines 158 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5)))) [2024-12-05 22:37:19,543 INFO L77 FloydHoareUtils]: At program point L59(lines 59 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-05 22:37:19,543 INFO L77 FloydHoareUtils]: At program point L94(lines 94 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5)))) [2024-12-05 22:37:19,543 INFO L77 FloydHoareUtils]: At program point L524-1(lines 40 585) the Hoare annotation is: (not (= 14 ~a8~0)) [2024-12-05 22:37:19,543 INFO L77 FloydHoareUtils]: At program point L392(lines 392 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-05 22:37:19,543 INFO L77 FloydHoareUtils]: At program point L326(lines 326 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-05 22:37:19,543 INFO L77 FloydHoareUtils]: At program point L260(lines 260 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-05 22:37:19,543 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-12-05 22:37:19,543 INFO L77 FloydHoareUtils]: At program point L228(lines 228 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-05 22:37:19,543 INFO L77 FloydHoareUtils]: At program point L162(lines 162 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5)))) [2024-12-05 22:37:19,544 INFO L77 FloydHoareUtils]: At program point L129(lines 129 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5)))) [2024-12-05 22:37:19,544 INFO L77 FloydHoareUtils]: At program point L328(lines 328 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-05 22:37:19,544 INFO L77 FloydHoareUtils]: At program point L196(lines 196 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5)))) [2024-12-05 22:37:19,544 INFO L77 FloydHoareUtils]: At program point L64(lines 64 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-05 22:37:19,544 INFO L77 FloydHoareUtils]: At program point L593-2(lines 593 603) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-05 22:37:19,544 INFO L77 FloydHoareUtils]: At program point L527-1(lines 40 585) the Hoare annotation is: (not (let ((.cse1 (= 5 ~a16~0)) (.cse4 (= ~a17~0 1)) (.cse0 (= ~a12~0 8)) (.cse2 (not (= ~a7~0 1))) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a20~0 1))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~a20~0 ~a7~0))) (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (= 14 ~a8~0) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse5 (= ~a17~0 ~a7~0)))))) [2024-12-05 22:37:19,544 INFO L77 FloydHoareUtils]: At program point L296(lines 296 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-05 22:37:19,544 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 40 585) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-05 22:37:19,544 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 528) no Hoare annotation was computed. [2024-12-05 22:37:19,544 INFO L75 FloydHoareUtils]: For program point L528(line 528) no Hoare annotation was computed. [2024-12-05 22:37:19,544 INFO L77 FloydHoareUtils]: At program point L363(lines 363 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-05 22:37:19,544 INFO L77 FloydHoareUtils]: At program point L199(lines 199 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5)))) [2024-12-05 22:37:19,545 INFO L77 FloydHoareUtils]: At program point L365(lines 365 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-05 22:37:19,545 INFO L77 FloydHoareUtils]: At program point L266(lines 266 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-05 22:37:19,545 INFO L77 FloydHoareUtils]: At program point L233(lines 233 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-05 22:37:19,545 INFO L77 FloydHoareUtils]: At program point L134(lines 134 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5)))) [2024-12-05 22:37:19,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 05.12 10:37:19 ImpRootNode [2024-12-05 22:37:19,555 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-05 22:37:19,555 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-05 22:37:19,555 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-05 22:37:19,555 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-05 22:37:19,556 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 10:33:36" (3/4) ... [2024-12-05 22:37:19,557 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-12-05 22:37:19,569 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 119 nodes and edges [2024-12-05 22:37:19,570 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-12-05 22:37:19,571 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-12-05 22:37:19,572 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-12-05 22:37:19,663 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52c322b8-9d3a-4344-8d74-f3b8d57f26e3/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-05 22:37:19,663 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52c322b8-9d3a-4344-8d74-f3b8d57f26e3/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-05 22:37:19,664 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-05 22:37:19,665 INFO L158 Benchmark]: Toolchain (without parser) took 225095.20ms. Allocated memory was 142.6MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 114.5MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 506.4MB. Max. memory is 16.1GB. [2024-12-05 22:37:19,665 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 142.6MB. Free memory is still 83.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-05 22:37:19,665 INFO L158 Benchmark]: CACSL2BoogieTranslator took 381.66ms. Allocated memory is still 142.6MB. Free memory was 114.5MB in the beginning and 86.7MB in the end (delta: 27.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-05 22:37:19,666 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.17ms. Allocated memory is still 142.6MB. Free memory was 86.4MB in the beginning and 81.1MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-05 22:37:19,666 INFO L158 Benchmark]: Boogie Preprocessor took 48.41ms. Allocated memory is still 142.6MB. Free memory was 81.1MB in the beginning and 77.0MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-05 22:37:19,666 INFO L158 Benchmark]: RCFGBuilder took 1137.19ms. Allocated memory is still 142.6MB. Free memory was 77.0MB in the beginning and 63.4MB in the end (delta: 13.6MB). Peak memory consumption was 34.8MB. Max. memory is 16.1GB. [2024-12-05 22:37:19,667 INFO L158 Benchmark]: CodeCheck took 223360.05ms. Allocated memory was 142.6MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 63.4MB in the beginning and 1.6GB in the end (delta: -1.6GB). Peak memory consumption was 447.5MB. Max. memory is 16.1GB. [2024-12-05 22:37:19,667 INFO L158 Benchmark]: Witness Printer took 108.53ms. Allocated memory is still 2.1GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-05 22:37:19,668 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 185.3s, OverallIterations: 148, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 527898 SdHoareTripleChecker+Valid, 1066.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 525545 mSDsluCounter, 70656 SdHoareTripleChecker+Invalid, 911.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60269 mSDsCounter, 91946 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1107260 IncrementalHoareTripleChecker+Invalid, 1199206 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 91946 mSolverCounterUnsat, 10387 mSDtfsCounter, 1107260 mSolverCounterSat, 7.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 188879 GetRequests, 180208 SyntacticMatches, 7291 SemanticMatches, 1380 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1239316 ImplicationChecksByTransitivity, 133.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.8s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 29.0s InterpolantComputationTime, 28180 NumberOfCodeBlocks, 28180 NumberOfCodeBlocksAsserted, 147 NumberOfCheckSat, 28033 ConstructedInterpolants, 0 QuantifiedInterpolants, 148765 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 147 InterpolantComputations, 73 PerfectInterpolantSequences, 27505/33072 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: 528]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 40]: Location Invariant Derived location invariant: !((((!(((((a12 == 8) && (a7 != 1)) && (a21 == 1)) && (a20 == 1)) && (a16 == 4)) && (14 == a8)) && !(((((a12 == 8) && (5 == a16)) && (a17 != 1)) && (a21 == 1)) && (a7 == 1))) && !(((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a21 == 1)) && (a16 == 4))) && !(((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1))) - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: !((((!(((((a12 == 8) && (a7 != 1)) && (a21 == 1)) && (a20 == 1)) && (a16 == 4)) && (14 == a8)) && !(((((a12 == 8) && (5 == a16)) && (a17 != 1)) && (a21 == 1)) && (a7 == 1))) && !(((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a21 == 1)) && (a16 == 4))) && !(((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1))) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 142.6MB. Free memory is still 83.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 381.66ms. Allocated memory is still 142.6MB. Free memory was 114.5MB in the beginning and 86.7MB in the end (delta: 27.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.17ms. Allocated memory is still 142.6MB. Free memory was 86.4MB in the beginning and 81.1MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.41ms. Allocated memory is still 142.6MB. Free memory was 81.1MB in the beginning and 77.0MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1137.19ms. Allocated memory is still 142.6MB. Free memory was 77.0MB in the beginning and 63.4MB in the end (delta: 13.6MB). Peak memory consumption was 34.8MB. Max. memory is 16.1GB. * CodeCheck took 223360.05ms. Allocated memory was 142.6MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 63.4MB in the beginning and 1.6GB in the end (delta: -1.6GB). Peak memory consumption was 447.5MB. Max. memory is 16.1GB. * Witness Printer took 108.53ms. Allocated memory is still 2.1GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-12-05 22:37:19,683 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52c322b8-9d3a-4344-8d74-f3b8d57f26e3/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