./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label54.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_5ba0cfc9-d138-47e3-8989-f9ba27a188f2/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba0cfc9-d138-47e3-8989-f9ba27a188f2/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_5ba0cfc9-d138-47e3-8989-f9ba27a188f2/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba0cfc9-d138-47e3-8989-f9ba27a188f2/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label54.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba0cfc9-d138-47e3-8989-f9ba27a188f2/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_5ba0cfc9-d138-47e3-8989-f9ba27a188f2/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 86c957edaa3a19e9386396f93b83971b79b2c7d38305a79160055b9fd3c1d0de --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 05:11:31,310 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 05:11:31,366 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba0cfc9-d138-47e3-8989-f9ba27a188f2/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-06 05:11:31,371 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 05:11:31,371 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 05:11:31,390 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 05:11:31,390 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-06 05:11:31,390 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-06 05:11:31,391 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 05:11:31,391 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 05:11:31,391 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 05:11:31,391 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-06 05:11:31,391 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-06 05:11:31,391 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 05:11:31,391 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-06 05:11:31,392 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 05:11:31,392 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-06 05:11:31,392 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 05:11:31,392 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-06 05:11:31,392 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-06 05:11:31,392 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-06 05:11:31,392 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 05:11:31,392 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 05:11:31,392 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 05:11:31,392 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 05:11:31,393 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 05:11:31,393 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 05:11:31,393 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 05:11:31,393 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 05:11:31,393 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 05:11:31,393 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-06 05:11:31,393 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 05:11:31,393 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 05:11:31,393 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_5ba0cfc9-d138-47e3-8989-f9ba27a188f2/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 -> 86c957edaa3a19e9386396f93b83971b79b2c7d38305a79160055b9fd3c1d0de [2024-12-06 05:11:31,616 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 05:11:31,624 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 05:11:31,626 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 05:11:31,627 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 05:11:31,628 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 05:11:31,629 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba0cfc9-d138-47e3-8989-f9ba27a188f2/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/eca-rers2012/Problem02_label54.c [2024-12-06 05:11:34,255 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba0cfc9-d138-47e3-8989-f9ba27a188f2/bin/ukojak-verify-CZk0znPC7b/data/82e011c22/cb4212daf0a34a1d8774ec12d6129351/FLAG738ab534b [2024-12-06 05:11:34,506 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 05:11:34,507 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba0cfc9-d138-47e3-8989-f9ba27a188f2/sv-benchmarks/c/eca-rers2012/Problem02_label54.c [2024-12-06 05:11:34,518 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba0cfc9-d138-47e3-8989-f9ba27a188f2/bin/ukojak-verify-CZk0znPC7b/data/82e011c22/cb4212daf0a34a1d8774ec12d6129351/FLAG738ab534b [2024-12-06 05:11:34,841 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba0cfc9-d138-47e3-8989-f9ba27a188f2/bin/ukojak-verify-CZk0znPC7b/data/82e011c22/cb4212daf0a34a1d8774ec12d6129351 [2024-12-06 05:11:34,843 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 05:11:34,844 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 05:11:34,845 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 05:11:34,845 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 05:11:34,848 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 05:11:34,848 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:11:34" (1/1) ... [2024-12-06 05:11:34,849 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c6ea5f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:11:34, skipping insertion in model container [2024-12-06 05:11:34,849 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:11:34" (1/1) ... [2024-12-06 05:11:34,875 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 05:11:35,075 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_5ba0cfc9-d138-47e3-8989-f9ba27a188f2/sv-benchmarks/c/eca-rers2012/Problem02_label54.c[16901,16914] [2024-12-06 05:11:35,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 05:11:35,106 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 05:11:35,171 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_5ba0cfc9-d138-47e3-8989-f9ba27a188f2/sv-benchmarks/c/eca-rers2012/Problem02_label54.c[16901,16914] [2024-12-06 05:11:35,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 05:11:35,197 INFO L204 MainTranslator]: Completed translation [2024-12-06 05:11:35,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:11:35 WrapperNode [2024-12-06 05:11:35,198 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 05:11:35,199 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 05:11:35,199 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 05:11:35,199 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 05:11:35,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:11:35" (1/1) ... [2024-12-06 05:11:35,218 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:11:35" (1/1) ... [2024-12-06 05:11:35,246 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668 [2024-12-06 05:11:35,246 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 05:11:35,246 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 05:11:35,246 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 05:11:35,247 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 05:11:35,254 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:11:35" (1/1) ... [2024-12-06 05:11:35,254 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:11:35" (1/1) ... [2024-12-06 05:11:35,257 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:11:35" (1/1) ... [2024-12-06 05:11:35,257 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:11:35" (1/1) ... [2024-12-06 05:11:35,274 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:11:35" (1/1) ... [2024-12-06 05:11:35,276 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:11:35" (1/1) ... [2024-12-06 05:11:35,283 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:11:35" (1/1) ... [2024-12-06 05:11:35,288 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:11:35" (1/1) ... [2024-12-06 05:11:35,291 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:11:35" (1/1) ... [2024-12-06 05:11:35,296 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 05:11:35,297 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 05:11:35,297 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 05:11:35,297 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 05:11:35,298 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:11:35" (1/1) ... [2024-12-06 05:11:35,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 05:11:35,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba0cfc9-d138-47e3-8989-f9ba27a188f2/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 05:11:35,325 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba0cfc9-d138-47e3-8989-f9ba27a188f2/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 05:11:35,328 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba0cfc9-d138-47e3-8989-f9ba27a188f2/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 05:11:35,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-06 05:11:35,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-06 05:11:35,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 05:11:35,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 05:11:35,413 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 05:11:35,415 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 05:11:36,193 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-12-06 05:11:36,193 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 05:11:36,448 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 05:11:36,448 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-06 05:11:36,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:11:36 BoogieIcfgContainer [2024-12-06 05:11:36,449 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 05:11:36,450 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 05:11:36,450 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 05:11:36,459 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 05:11:36,459 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:11:36" (1/1) ... [2024-12-06 05:11:36,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 05:11:36,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:36,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 85 states and 162 transitions. [2024-12-06 05:11:36,510 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 162 transitions. [2024-12-06 05:11:36,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-12-06 05:11:36,513 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:36,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:36,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:36,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:11:37,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:37,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 163 states and 250 transitions. [2024-12-06 05:11:37,431 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 250 transitions. [2024-12-06 05:11:37,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-12-06 05:11:37,433 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:37,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:37,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:37,629 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:11:38,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:38,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 242 states and 332 transitions. [2024-12-06 05:11:38,309 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 332 transitions. [2024-12-06 05:11:38,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-12-06 05:11:38,311 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:38,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:38,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:38,410 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:11:38,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:38,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 251 states and 343 transitions. [2024-12-06 05:11:38,505 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 343 transitions. [2024-12-06 05:11:38,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-12-06 05:11:38,507 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:38,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:38,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:38,589 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:11:38,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:38,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 256 states and 348 transitions. [2024-12-06 05:11:38,635 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 348 transitions. [2024-12-06 05:11:38,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-12-06 05:11:38,637 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:38,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:38,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:38,721 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 05:11:38,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:38,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 270 states and 364 transitions. [2024-12-06 05:11:38,896 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 364 transitions. [2024-12-06 05:11:38,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-12-06 05:11:38,897 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:38,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:38,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:38,950 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:11:38,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:38,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 277 states and 371 transitions. [2024-12-06 05:11:38,992 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 371 transitions. [2024-12-06 05:11:38,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-12-06 05:11:38,992 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:38,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:39,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:39,049 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:11:39,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:39,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 283 states and 377 transitions. [2024-12-06 05:11:39,091 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 377 transitions. [2024-12-06 05:11:39,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-12-06 05:11:39,092 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:39,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:39,180 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:11:39,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:39,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 307 states and 404 transitions. [2024-12-06 05:11:39,420 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 404 transitions. [2024-12-06 05:11:39,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-12-06 05:11:39,422 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:39,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:39,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:39,482 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 05:11:40,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:40,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 388 states and 488 transitions. [2024-12-06 05:11:40,079 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 488 transitions. [2024-12-06 05:11:40,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-12-06 05:11:40,080 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:40,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:40,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:40,379 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 32 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:11:40,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:40,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 420 states and 527 transitions. [2024-12-06 05:11:40,881 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 527 transitions. [2024-12-06 05:11:40,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-12-06 05:11:40,882 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:40,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:41,011 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-12-06 05:11:41,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:41,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 430 states and 542 transitions. [2024-12-06 05:11:41,253 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 542 transitions. [2024-12-06 05:11:41,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-12-06 05:11:41,255 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:41,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:41,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:41,359 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-12-06 05:11:41,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:41,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 440 states and 554 transitions. [2024-12-06 05:11:41,622 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 554 transitions. [2024-12-06 05:11:41,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-12-06 05:11:41,623 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:41,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:41,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:41,756 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 05:11:42,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:42,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 464 states and 583 transitions. [2024-12-06 05:11:42,202 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 583 transitions. [2024-12-06 05:11:42,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-12-06 05:11:42,203 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:42,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:42,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:42,292 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:11:42,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:42,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 497 states and 617 transitions. [2024-12-06 05:11:42,522 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 617 transitions. [2024-12-06 05:11:42,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-12-06 05:11:42,524 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:42,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:42,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:42,590 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 05:11:42,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:42,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 531 states and 654 transitions. [2024-12-06 05:11:42,811 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 654 transitions. [2024-12-06 05:11:42,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-12-06 05:11:42,813 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:42,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:43,059 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 56 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:11:43,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:43,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 561 states and 688 transitions. [2024-12-06 05:11:43,541 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 688 transitions. [2024-12-06 05:11:43,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-12-06 05:11:43,543 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:43,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:43,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:43,655 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:11:44,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:44,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 590 states and 725 transitions. [2024-12-06 05:11:44,072 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 725 transitions. [2024-12-06 05:11:44,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-12-06 05:11:44,074 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:44,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:44,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:44,176 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-12-06 05:11:44,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:44,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 601 states and 742 transitions. [2024-12-06 05:11:44,631 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 742 transitions. [2024-12-06 05:11:44,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-12-06 05:11:44,633 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:44,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:44,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:44,686 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-12-06 05:11:44,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:44,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 611 states and 753 transitions. [2024-12-06 05:11:44,861 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 753 transitions. [2024-12-06 05:11:44,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-12-06 05:11:44,862 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:44,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:44,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:44,948 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-12-06 05:11:45,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:45,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 618 states and 765 transitions. [2024-12-06 05:11:45,575 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 765 transitions. [2024-12-06 05:11:45,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-12-06 05:11:45,576 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:45,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:45,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:45,642 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-12-06 05:11:45,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:45,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 626 states and 774 transitions. [2024-12-06 05:11:45,868 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 774 transitions. [2024-12-06 05:11:45,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-12-06 05:11:45,869 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:45,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:45,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:45,947 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-12-06 05:11:46,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:46,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 636 states and 785 transitions. [2024-12-06 05:11:46,148 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 785 transitions. [2024-12-06 05:11:46,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-12-06 05:11:46,149 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:46,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:46,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:46,226 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-12-06 05:11:46,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:46,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 644 states and 795 transitions. [2024-12-06 05:11:46,405 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 795 transitions. [2024-12-06 05:11:46,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-12-06 05:11:46,406 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:46,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:46,490 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-12-06 05:11:46,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:46,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 659 states and 810 transitions. [2024-12-06 05:11:46,709 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 810 transitions. [2024-12-06 05:11:46,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-12-06 05:11:46,709 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:46,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:46,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:46,804 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-12-06 05:11:47,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:47,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 661 states and 811 transitions. [2024-12-06 05:11:47,016 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 811 transitions. [2024-12-06 05:11:47,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-12-06 05:11:47,017 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:47,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:47,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:47,105 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 05:11:47,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:47,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 691 states and 843 transitions. [2024-12-06 05:11:47,466 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 843 transitions. [2024-12-06 05:11:47,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-12-06 05:11:47,466 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:47,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:47,519 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 05:11:47,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:47,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 701 states and 853 transitions. [2024-12-06 05:11:47,714 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 853 transitions. [2024-12-06 05:11:47,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-12-06 05:11:47,714 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:47,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:47,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:47,754 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:11:48,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:48,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 730 states and 884 transitions. [2024-12-06 05:11:48,085 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 884 transitions. [2024-12-06 05:11:48,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-12-06 05:11:48,086 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:48,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:48,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:48,322 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 84 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-12-06 05:11:48,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:48,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 739 states and 894 transitions. [2024-12-06 05:11:48,793 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 894 transitions. [2024-12-06 05:11:48,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-12-06 05:11:48,794 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:48,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:48,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:48,869 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-12-06 05:11:49,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:49,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 741 states and 901 transitions. [2024-12-06 05:11:49,007 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 901 transitions. [2024-12-06 05:11:49,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-12-06 05:11:49,008 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:49,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:49,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:49,078 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 05:11:49,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:49,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 774 states and 936 transitions. [2024-12-06 05:11:49,416 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 936 transitions. [2024-12-06 05:11:49,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-12-06 05:11:49,416 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:49,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:49,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:49,483 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-12-06 05:11:49,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:49,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 775 states and 936 transitions. [2024-12-06 05:11:49,577 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 936 transitions. [2024-12-06 05:11:49,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-12-06 05:11:49,578 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:49,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:49,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:49,641 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 05:11:49,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:49,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 825 states and 986 transitions. [2024-12-06 05:11:49,897 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 986 transitions. [2024-12-06 05:11:49,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-12-06 05:11:49,898 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:49,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:49,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:50,252 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 68 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:11:52,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:52,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 992 states and 1164 transitions. [2024-12-06 05:11:52,169 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1164 transitions. [2024-12-06 05:11:52,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-12-06 05:11:52,169 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:52,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:52,441 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 102 proven. 4 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 05:11:53,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:53,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1057 states and 1233 transitions. [2024-12-06 05:11:53,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1233 transitions. [2024-12-06 05:11:53,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-12-06 05:11:53,251 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:53,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:53,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:53,311 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 05:11:53,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:53,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 1058 states and 1236 transitions. [2024-12-06 05:11:53,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1236 transitions. [2024-12-06 05:11:53,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-12-06 05:11:53,564 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:53,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:53,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:53,626 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 05:11:53,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:53,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1086 states and 1264 transitions. [2024-12-06 05:11:53,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1264 transitions. [2024-12-06 05:11:53,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-12-06 05:11:53,967 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:53,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:53,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:54,020 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-12-06 05:11:54,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:54,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 1095 states and 1273 transitions. [2024-12-06 05:11:54,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1273 transitions. [2024-12-06 05:11:54,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-12-06 05:11:54,103 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:54,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:54,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:54,243 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-12-06 05:11:55,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:55,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1127 states and 1310 transitions. [2024-12-06 05:11:55,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1310 transitions. [2024-12-06 05:11:55,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-12-06 05:11:55,298 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:55,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:55,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:55,354 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 05:11:56,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:56,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1156 states and 1342 transitions. [2024-12-06 05:11:56,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1342 transitions. [2024-12-06 05:11:56,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-12-06 05:11:56,189 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:56,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:56,260 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-12-06 05:11:56,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:56,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1167 states and 1355 transitions. [2024-12-06 05:11:56,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1355 transitions. [2024-12-06 05:11:56,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-12-06 05:11:56,778 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:56,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:56,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:56,951 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-06 05:11:57,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:57,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1238 states and 1433 transitions. [2024-12-06 05:11:57,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 1433 transitions. [2024-12-06 05:11:57,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-06 05:11:57,805 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:57,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:57,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:57,899 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-12-06 05:11:58,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:58,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1258 states and 1455 transitions. [2024-12-06 05:11:58,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1455 transitions. [2024-12-06 05:11:58,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-06 05:11:58,383 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:58,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:58,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:58,469 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-12-06 05:11:58,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:58,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1264 states and 1461 transitions. [2024-12-06 05:11:58,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1264 states and 1461 transitions. [2024-12-06 05:11:58,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-06 05:11:58,751 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:58,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:58,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:58,834 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-12-06 05:11:58,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:58,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1265 states and 1461 transitions. [2024-12-06 05:11:58,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1461 transitions. [2024-12-06 05:11:58,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-12-06 05:11:58,892 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:58,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:58,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:58,943 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2024-12-06 05:11:59,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:59,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1272 states and 1475 transitions. [2024-12-06 05:11:59,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1475 transitions. [2024-12-06 05:11:59,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-12-06 05:11:59,239 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:59,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:59,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:59,288 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-12-06 05:11:59,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:59,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1304 states and 1509 transitions. [2024-12-06 05:11:59,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 1509 transitions. [2024-12-06 05:11:59,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-12-06 05:11:59,882 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:59,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:59,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:59,946 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-12-06 05:12:00,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:00,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1339 states and 1546 transitions. [2024-12-06 05:12:00,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 1546 transitions. [2024-12-06 05:12:00,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-12-06 05:12:00,471 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:00,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:00,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:00,547 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-12-06 05:12:01,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:01,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1409 states and 1628 transitions. [2024-12-06 05:12:01,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1409 states and 1628 transitions. [2024-12-06 05:12:01,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-12-06 05:12:01,560 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:01,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:01,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:01,752 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 133 proven. 8 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-12-06 05:12:02,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:02,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1676 states to 1455 states and 1676 transitions. [2024-12-06 05:12:02,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1455 states and 1676 transitions. [2024-12-06 05:12:02,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-12-06 05:12:02,624 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:02,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:02,684 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-12-06 05:12:03,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:03,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1725 states to 1499 states and 1725 transitions. [2024-12-06 05:12:03,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 1725 transitions. [2024-12-06 05:12:03,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-12-06 05:12:03,432 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:03,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:03,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:03,495 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-12-06 05:12:04,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:04,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1528 states and 1756 transitions. [2024-12-06 05:12:04,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 1756 transitions. [2024-12-06 05:12:04,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-12-06 05:12:04,390 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:04,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:04,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:04,441 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-12-06 05:12:05,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:05,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1590 states and 1821 transitions. [2024-12-06 05:12:05,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 1821 transitions. [2024-12-06 05:12:05,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-12-06 05:12:05,275 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:05,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:05,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:05,343 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-12-06 05:12:06,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:06,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1888 states to 1647 states and 1888 transitions. [2024-12-06 05:12:06,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 1888 transitions. [2024-12-06 05:12:06,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-12-06 05:12:06,224 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:06,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:06,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:06,306 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-06 05:12:06,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:06,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1918 states to 1676 states and 1918 transitions. [2024-12-06 05:12:06,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1676 states and 1918 transitions. [2024-12-06 05:12:06,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-12-06 05:12:06,721 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:06,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:06,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:06,925 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 149 proven. 22 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-12-06 05:12:07,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:07,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1961 states to 1719 states and 1961 transitions. [2024-12-06 05:12:07,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 1961 transitions. [2024-12-06 05:12:07,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-06 05:12:07,593 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:07,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:07,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:07,781 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 195 proven. 16 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-12-06 05:12:08,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:08,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1734 states and 1976 transitions. [2024-12-06 05:12:08,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 1976 transitions. [2024-12-06 05:12:08,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-06 05:12:08,086 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:08,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:08,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:08,186 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 195 proven. 16 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-12-06 05:12:08,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:08,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1987 states to 1744 states and 1987 transitions. [2024-12-06 05:12:08,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 1987 transitions. [2024-12-06 05:12:08,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-06 05:12:08,668 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:08,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:08,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:08,761 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 195 proven. 16 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-12-06 05:12:09,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:09,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1992 states to 1750 states and 1992 transitions. [2024-12-06 05:12:09,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 1992 transitions. [2024-12-06 05:12:09,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-06 05:12:09,050 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:09,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:09,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:09,241 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 195 proven. 16 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-12-06 05:12:09,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:09,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1756 states and 1997 transitions. [2024-12-06 05:12:09,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 1997 transitions. [2024-12-06 05:12:09,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-12-06 05:12:09,651 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:09,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:09,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:09,790 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-12-06 05:12:10,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:10,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2052 states to 1806 states and 2052 transitions. [2024-12-06 05:12:10,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1806 states and 2052 transitions. [2024-12-06 05:12:10,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-06 05:12:10,583 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:10,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:10,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:10,699 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-12-06 05:12:11,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:11,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2070 states to 1825 states and 2070 transitions. [2024-12-06 05:12:11,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1825 states and 2070 transitions. [2024-12-06 05:12:11,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-12-06 05:12:11,047 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:11,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:11,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:11,130 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 05:12:11,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:11,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2073 states to 1828 states and 2073 transitions. [2024-12-06 05:12:11,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1828 states and 2073 transitions. [2024-12-06 05:12:11,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-12-06 05:12:11,212 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:11,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:11,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:11,670 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 179 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-12-06 05:12:14,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:14,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2189 states to 1939 states and 2189 transitions. [2024-12-06 05:12:14,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 2189 transitions. [2024-12-06 05:12:14,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-12-06 05:12:14,229 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:14,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:14,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:14,328 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-12-06 05:12:16,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:16,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2328 states to 2072 states and 2328 transitions. [2024-12-06 05:12:16,464 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 2328 transitions. [2024-12-06 05:12:16,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-12-06 05:12:16,466 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:16,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:16,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:16,520 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-12-06 05:12:17,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:17,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2367 states to 2111 states and 2367 transitions. [2024-12-06 05:12:17,109 INFO L276 IsEmpty]: Start isEmpty. Operand 2111 states and 2367 transitions. [2024-12-06 05:12:17,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-12-06 05:12:17,111 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:17,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:17,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:17,216 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 05:12:17,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:17,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2371 states to 2115 states and 2371 transitions. [2024-12-06 05:12:17,321 INFO L276 IsEmpty]: Start isEmpty. Operand 2115 states and 2371 transitions. [2024-12-06 05:12:17,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-12-06 05:12:17,323 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:17,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:17,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:17,412 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 05:12:18,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:18,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2423 states to 2162 states and 2423 transitions. [2024-12-06 05:12:18,802 INFO L276 IsEmpty]: Start isEmpty. Operand 2162 states and 2423 transitions. [2024-12-06 05:12:18,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-12-06 05:12:18,804 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:18,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:18,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:18,906 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 05:12:19,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:19,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2423 states to 2163 states and 2423 transitions. [2024-12-06 05:12:19,212 INFO L276 IsEmpty]: Start isEmpty. Operand 2163 states and 2423 transitions. [2024-12-06 05:12:19,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-12-06 05:12:19,214 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:19,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:19,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:19,331 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 05:12:19,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:19,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2430 states to 2170 states and 2430 transitions. [2024-12-06 05:12:19,399 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 2430 transitions. [2024-12-06 05:12:19,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-12-06 05:12:19,400 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:19,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:19,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:19,486 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 05:12:20,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:20,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2466 states to 2205 states and 2466 transitions. [2024-12-06 05:12:20,202 INFO L276 IsEmpty]: Start isEmpty. Operand 2205 states and 2466 transitions. [2024-12-06 05:12:20,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-12-06 05:12:20,204 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:20,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:20,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:20,338 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2024-12-06 05:12:20,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:20,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2468 states to 2206 states and 2468 transitions. [2024-12-06 05:12:20,447 INFO L276 IsEmpty]: Start isEmpty. Operand 2206 states and 2468 transitions. [2024-12-06 05:12:20,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-12-06 05:12:20,449 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:20,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:20,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:20,560 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2024-12-06 05:12:20,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:20,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2470 states to 2209 states and 2470 transitions. [2024-12-06 05:12:20,867 INFO L276 IsEmpty]: Start isEmpty. Operand 2209 states and 2470 transitions. [2024-12-06 05:12:20,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-12-06 05:12:20,868 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:20,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:20,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:20,948 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-12-06 05:12:21,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:21,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2476 states to 2215 states and 2476 transitions. [2024-12-06 05:12:21,277 INFO L276 IsEmpty]: Start isEmpty. Operand 2215 states and 2476 transitions. [2024-12-06 05:12:21,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-12-06 05:12:21,278 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:21,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:21,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:21,386 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-12-06 05:12:22,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:22,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2515 states to 2254 states and 2515 transitions. [2024-12-06 05:12:22,169 INFO L276 IsEmpty]: Start isEmpty. Operand 2254 states and 2515 transitions. [2024-12-06 05:12:22,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-12-06 05:12:22,170 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:22,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:22,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:22,678 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 282 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-12-06 05:12:24,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:24,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2594 states to 2332 states and 2594 transitions. [2024-12-06 05:12:24,043 INFO L276 IsEmpty]: Start isEmpty. Operand 2332 states and 2594 transitions. [2024-12-06 05:12:24,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-12-06 05:12:24,045 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:24,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:24,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:24,136 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-12-06 05:12:24,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:24,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2594 states to 2333 states and 2594 transitions. [2024-12-06 05:12:24,374 INFO L276 IsEmpty]: Start isEmpty. Operand 2333 states and 2594 transitions. [2024-12-06 05:12:24,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2024-12-06 05:12:24,376 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:24,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:24,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:24,505 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-12-06 05:12:25,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:25,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2619 states to 2355 states and 2619 transitions. [2024-12-06 05:12:25,456 INFO L276 IsEmpty]: Start isEmpty. Operand 2355 states and 2619 transitions. [2024-12-06 05:12:25,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2024-12-06 05:12:25,458 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:25,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:25,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:25,585 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-12-06 05:12:26,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:26,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2365 states and 2630 transitions. [2024-12-06 05:12:26,243 INFO L276 IsEmpty]: Start isEmpty. Operand 2365 states and 2630 transitions. [2024-12-06 05:12:26,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2024-12-06 05:12:26,244 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:26,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:26,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:26,415 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-12-06 05:12:26,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:26,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2631 states to 2367 states and 2631 transitions. [2024-12-06 05:12:26,806 INFO L276 IsEmpty]: Start isEmpty. Operand 2367 states and 2631 transitions. [2024-12-06 05:12:26,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2024-12-06 05:12:26,809 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:26,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:26,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:26,932 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2024-12-06 05:12:27,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:27,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2643 states to 2377 states and 2643 transitions. [2024-12-06 05:12:27,296 INFO L276 IsEmpty]: Start isEmpty. Operand 2377 states and 2643 transitions. [2024-12-06 05:12:27,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2024-12-06 05:12:27,298 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:27,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:27,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:27,376 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2024-12-06 05:12:27,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:27,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2649 states to 2380 states and 2649 transitions. [2024-12-06 05:12:27,460 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 2649 transitions. [2024-12-06 05:12:27,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2024-12-06 05:12:27,461 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:27,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:27,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:27,543 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 328 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-12-06 05:12:28,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:28,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2692 states to 2419 states and 2692 transitions. [2024-12-06 05:12:28,162 INFO L276 IsEmpty]: Start isEmpty. Operand 2419 states and 2692 transitions. [2024-12-06 05:12:28,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2024-12-06 05:12:28,163 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:28,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:28,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:28,244 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 328 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-12-06 05:12:28,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:28,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2707 states to 2434 states and 2707 transitions. [2024-12-06 05:12:28,677 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 2707 transitions. [2024-12-06 05:12:28,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2024-12-06 05:12:28,679 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:28,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:28,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:28,763 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 328 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-12-06 05:12:29,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:29,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2729 states to 2457 states and 2729 transitions. [2024-12-06 05:12:29,454 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 2729 transitions. [2024-12-06 05:12:29,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2024-12-06 05:12:29,457 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:29,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:29,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:29,576 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 328 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-12-06 05:12:30,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:30,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2751 states to 2480 states and 2751 transitions. [2024-12-06 05:12:30,017 INFO L276 IsEmpty]: Start isEmpty. Operand 2480 states and 2751 transitions. [2024-12-06 05:12:30,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2024-12-06 05:12:30,019 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:30,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:30,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:30,110 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2024-12-06 05:12:30,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:30,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2751 states to 2481 states and 2751 transitions. [2024-12-06 05:12:30,177 INFO L276 IsEmpty]: Start isEmpty. Operand 2481 states and 2751 transitions. [2024-12-06 05:12:30,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-12-06 05:12:30,178 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:30,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:30,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:30,309 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 302 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-12-06 05:12:31,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:31,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2831 states to 2558 states and 2831 transitions. [2024-12-06 05:12:31,790 INFO L276 IsEmpty]: Start isEmpty. Operand 2558 states and 2831 transitions. [2024-12-06 05:12:31,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-12-06 05:12:31,792 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:31,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:31,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:31,905 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 302 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-12-06 05:12:33,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:33,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2900 states to 2618 states and 2900 transitions. [2024-12-06 05:12:33,092 INFO L276 IsEmpty]: Start isEmpty. Operand 2618 states and 2900 transitions. [2024-12-06 05:12:33,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-12-06 05:12:33,094 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:33,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:33,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:33,181 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 302 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-12-06 05:12:33,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:33,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2912 states to 2628 states and 2912 transitions. [2024-12-06 05:12:33,761 INFO L276 IsEmpty]: Start isEmpty. Operand 2628 states and 2912 transitions. [2024-12-06 05:12:33,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-12-06 05:12:33,762 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:33,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:33,849 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 302 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-12-06 05:12:34,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:34,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2932 states to 2649 states and 2932 transitions. [2024-12-06 05:12:34,325 INFO L276 IsEmpty]: Start isEmpty. Operand 2649 states and 2932 transitions. [2024-12-06 05:12:34,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-12-06 05:12:34,328 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:34,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:34,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:34,469 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 302 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-12-06 05:12:34,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:34,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2933 states to 2651 states and 2933 transitions. [2024-12-06 05:12:34,876 INFO L276 IsEmpty]: Start isEmpty. Operand 2651 states and 2933 transitions. [2024-12-06 05:12:34,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-12-06 05:12:34,877 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:34,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:34,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:34,965 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 302 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-12-06 05:12:35,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:35,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2934 states to 2653 states and 2934 transitions. [2024-12-06 05:12:35,328 INFO L276 IsEmpty]: Start isEmpty. Operand 2653 states and 2934 transitions. [2024-12-06 05:12:35,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-12-06 05:12:35,329 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:35,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:35,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:35,416 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 302 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-12-06 05:12:35,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:35,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2945 states to 2663 states and 2945 transitions. [2024-12-06 05:12:35,767 INFO L276 IsEmpty]: Start isEmpty. Operand 2663 states and 2945 transitions. [2024-12-06 05:12:35,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2024-12-06 05:12:35,769 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:35,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:35,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:35,956 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 329 proven. 120 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 05:12:36,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:36,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2966 states to 2685 states and 2966 transitions. [2024-12-06 05:12:36,221 INFO L276 IsEmpty]: Start isEmpty. Operand 2685 states and 2966 transitions. [2024-12-06 05:12:36,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2024-12-06 05:12:36,222 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:36,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:36,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:36,328 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 379 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-12-06 05:12:37,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:37,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3022 states to 2741 states and 3022 transitions. [2024-12-06 05:12:37,884 INFO L276 IsEmpty]: Start isEmpty. Operand 2741 states and 3022 transitions. [2024-12-06 05:12:37,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2024-12-06 05:12:37,885 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:37,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:37,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:37,977 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 353 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-12-06 05:12:38,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:38,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3044 states to 2764 states and 3044 transitions. [2024-12-06 05:12:38,121 INFO L276 IsEmpty]: Start isEmpty. Operand 2764 states and 3044 transitions. [2024-12-06 05:12:38,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2024-12-06 05:12:38,123 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:38,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:38,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:38,274 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 319 proven. 0 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2024-12-06 05:12:38,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:38,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3044 states to 2765 states and 3044 transitions. [2024-12-06 05:12:38,507 INFO L276 IsEmpty]: Start isEmpty. Operand 2765 states and 3044 transitions. [2024-12-06 05:12:38,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2024-12-06 05:12:38,509 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:38,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:38,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:38,696 INFO L134 CoverageAnalysis]: Checked inductivity of 589 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-12-06 05:12:40,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:40,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3107 states to 2826 states and 3107 transitions. [2024-12-06 05:12:40,929 INFO L276 IsEmpty]: Start isEmpty. Operand 2826 states and 3107 transitions. [2024-12-06 05:12:40,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2024-12-06 05:12:40,931 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:12:40,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:12:40,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:12:41,186 INFO L134 CoverageAnalysis]: Checked inductivity of 589 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-12-06 05:12:41,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:12:41,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2329 states to 2109 states and 2329 transitions. [2024-12-06 05:12:41,673 INFO L276 IsEmpty]: Start isEmpty. Operand 2109 states and 2329 transitions. [2024-12-06 05:12:41,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-12-06 05:12:41,675 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 101 iterations. [2024-12-06 05:12:41,687 INFO L726 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-12-06 05:12:56,673 INFO L77 FloydHoareUtils]: At program point L301(lines 301 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,673 INFO L77 FloydHoareUtils]: At program point L235(lines 235 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,674 INFO L77 FloydHoareUtils]: At program point L169(lines 169 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,674 INFO L77 FloydHoareUtils]: At program point L303(lines 303 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,674 INFO L77 FloydHoareUtils]: At program point L105(lines 105 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1))) (let ((.cse3 (<= ~a28~0 7)) (.cse2 (< 10 ~a28~0)) (.cse5 (= ~a28~0 11)) (.cse7 (= ~a21~0 1)) (.cse8 (= ~a28~0 9)) (.cse4 (not .cse1)) (.cse0 (= ~a25~0 1)) (.cse6 (not (= ~a11~0 1)))) (or (and (< ~a28~0 10) .cse0 .cse1) (and (<= ~a17~0 7) .cse2) (and (= ~a25~0 ~a11~0) .cse3) (and .cse4 .cse3) (and .cse2 (not (and .cse5 .cse6))) (and (not .cse7) .cse0 .cse6) (and (= ~a17~0 8) .cse7 .cse1 .cse8) (= ~a28~0 10) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 3)) .cse5) (and .cse0 .cse7 (= 7 ~a17~0) .cse8) (and .cse0 (< 8 ~a17~0) .cse1) (and .cse4 .cse6) (and (<= 9 ~a28~0) (not .cse0) .cse6)))) [2024-12-06 05:12:56,674 INFO L77 FloydHoareUtils]: At program point L40(lines 40 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,675 INFO L77 FloydHoareUtils]: At program point L371(lines 371 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,675 INFO L77 FloydHoareUtils]: At program point L307(lines 307 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,675 INFO L77 FloydHoareUtils]: At program point L175(lines 175 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,675 INFO L77 FloydHoareUtils]: At program point L109(lines 109 423) the Hoare annotation is: (let ((.cse1 (= ~a19~0 1))) (let ((.cse3 (<= ~a28~0 7)) (.cse2 (< 10 ~a28~0)) (.cse5 (= ~a28~0 11)) (.cse7 (= ~a21~0 1)) (.cse8 (= ~a28~0 9)) (.cse4 (not .cse1)) (.cse0 (= ~a25~0 1)) (.cse6 (not (= ~a11~0 1)))) (or (and (< ~a28~0 10) .cse0 .cse1) (and (<= ~a17~0 7) .cse2) (and (= ~a25~0 ~a11~0) .cse3) (and .cse4 .cse3) (and .cse2 (not (and .cse5 .cse6))) (and (not .cse7) .cse0 .cse6) (and (= ~a17~0 8) .cse7 .cse1 .cse8) (= ~a28~0 10) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 3)) .cse5) (and .cse0 .cse7 (= 7 ~a17~0) .cse8) (and .cse0 (< 8 ~a17~0) .cse1) (and .cse4 .cse6) (and (<= 9 ~a28~0) (not .cse0) .cse6)))) [2024-12-06 05:12:56,675 INFO L77 FloydHoareUtils]: At program point L242(lines 242 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,676 INFO L77 FloydHoareUtils]: At program point L45(lines 45 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,676 INFO L77 FloydHoareUtils]: At program point L244(lines 244 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,676 INFO L77 FloydHoareUtils]: At program point L179(lines 179 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,676 INFO L77 FloydHoareUtils]: At program point L378(lines 378 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,676 INFO L77 FloydHoareUtils]: At program point L48(lines 48 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,676 INFO L77 FloydHoareUtils]: At program point L247(lines 247 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,677 INFO L77 FloydHoareUtils]: At program point L116(lines 116 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,677 INFO L77 FloydHoareUtils]: At program point L52(lines 52 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,677 INFO L77 FloydHoareUtils]: At program point L185(lines 185 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,677 INFO L77 FloydHoareUtils]: At program point L385(lines 385 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,678 INFO L77 FloydHoareUtils]: At program point L319(lines 319 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,678 INFO L77 FloydHoareUtils]: At program point L189(lines 189 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,678 INFO L77 FloydHoareUtils]: At program point L123(lines 123 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,678 INFO L77 FloydHoareUtils]: At program point L57(lines 57 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,678 INFO L77 FloydHoareUtils]: At program point L388(lines 388 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,678 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-12-06 05:12:56,678 INFO L77 FloydHoareUtils]: At program point L390(lines 390 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,678 INFO L77 FloydHoareUtils]: At program point L324(lines 324 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,678 INFO L77 FloydHoareUtils]: At program point L258(lines 258 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,678 INFO L77 FloydHoareUtils]: At program point L60(lines 60 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,678 INFO L77 FloydHoareUtils]: At program point L195(lines 195 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,678 INFO L77 FloydHoareUtils]: At program point L129(lines 129 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,679 INFO L77 FloydHoareUtils]: At program point L64(lines 64 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,679 INFO L77 FloydHoareUtils]: At program point L263(lines 263 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,679 INFO L77 FloydHoareUtils]: At program point L197(lines 197 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,679 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 485) no Hoare annotation was computed. [2024-12-06 05:12:56,679 INFO L77 FloydHoareUtils]: At program point L199(lines 199 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,679 INFO L77 FloydHoareUtils]: At program point L133(lines 133 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,679 INFO L77 FloydHoareUtils]: At program point L399(lines 399 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,679 INFO L77 FloydHoareUtils]: At program point L201(lines 201 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,679 INFO L77 FloydHoareUtils]: At program point L69(lines 69 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,679 INFO L77 FloydHoareUtils]: At program point L269(lines 269 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,679 INFO L77 FloydHoareUtils]: At program point L204(lines 204 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,679 INFO L77 FloydHoareUtils]: At program point L271(lines 271 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,679 INFO L77 FloydHoareUtils]: At program point L404(lines 404 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,679 INFO L77 FloydHoareUtils]: At program point L338(lines 338 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,679 INFO L77 FloydHoareUtils]: At program point L140(lines 140 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,680 INFO L77 FloydHoareUtils]: At program point L75(lines 75 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,680 INFO L77 FloydHoareUtils]: At program point L208(lines 208 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,680 INFO L77 FloydHoareUtils]: At program point L341(lines 341 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,680 INFO L77 FloydHoareUtils]: At program point L408(lines 408 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,680 INFO L77 FloydHoareUtils]: At program point L144(lines 144 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,680 INFO L77 FloydHoareUtils]: At program point L79(lines 79 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,680 INFO L77 FloydHoareUtils]: At program point L212(lines 212 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,680 INFO L77 FloydHoareUtils]: At program point L610(lines 610 627) the Hoare annotation is: true [2024-12-06 05:12:56,680 INFO L77 FloydHoareUtils]: At program point L412(lines 412 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,680 INFO L77 FloydHoareUtils]: At program point L347(lines 347 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,680 INFO L77 FloydHoareUtils]: At program point L149(lines 149 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,680 INFO L77 FloydHoareUtils]: At program point L414(lines 414 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,680 INFO L77 FloydHoareUtils]: At program point L84(lines 84 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,680 INFO L77 FloydHoareUtils]: At program point L481-1(lines 39 608) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse1 (not .cse3)) (.cse2 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (<= 9 ~a28~0) .cse2) (and (= ~a25~0 1) .cse3) (and .cse1 .cse2)))) [2024-12-06 05:12:56,680 INFO L77 FloydHoareUtils]: At program point L417(lines 417 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,680 INFO L77 FloydHoareUtils]: At program point L153(lines 153 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,680 INFO L77 FloydHoareUtils]: At program point L616-2(lines 616 626) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,681 INFO L77 FloydHoareUtils]: At program point L484-1(lines 39 608) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse1 (not .cse3)) (.cse2 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (<= 9 ~a28~0) .cse2) (and (= ~a25~0 1) .cse3) (and .cse1 .cse2)))) [2024-12-06 05:12:56,681 INFO L77 FloydHoareUtils]: At program point L286(lines 286 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,681 INFO L75 FloydHoareUtils]: For program point L485(line 485) no Hoare annotation was computed. [2024-12-06 05:12:56,681 INFO L77 FloydHoareUtils]: At program point L419(lines 419 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,681 INFO L77 FloydHoareUtils]: At program point L222(lines 222 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,681 INFO L77 FloydHoareUtils]: At program point L290(lines 290 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,681 INFO L77 FloydHoareUtils]: At program point L158(lines 158 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,681 INFO L77 FloydHoareUtils]: At program point L92(lines 92 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,681 INFO L77 FloydHoareUtils]: At program point L621(line 621) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,682 INFO L77 FloydHoareUtils]: At program point L225(lines 225 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,682 INFO L77 FloydHoareUtils]: At program point L359(lines 359 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,682 INFO L77 FloydHoareUtils]: At program point L293(lines 293 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,682 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-12-06 05:12:56,682 INFO L77 FloydHoareUtils]: At program point L228(lines 228 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,682 INFO L77 FloydHoareUtils]: At program point L296(lines 296 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,682 INFO L77 FloydHoareUtils]: At program point L164(lines 164 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,682 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 39 608) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,682 INFO L77 FloydHoareUtils]: At program point L364(lines 364 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,682 INFO L77 FloydHoareUtils]: At program point L233(lines 233 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,683 INFO L77 FloydHoareUtils]: At program point L101(lines 101 423) the Hoare annotation is: (let ((.cse3 (= ~a19~0 1))) (let ((.cse0 (<= ~a28~0 7)) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a25~0 1)) (.cse1 (not .cse3)) (.cse5 (not (= ~a11~0 1)))) (or (<= 10 ~a28~0) (and (= ~a25~0 ~a11~0) .cse0) (and .cse1 .cse0) (and (= ~a17~0 8) .cse2 .cse3 .cse4) (and (<= 9 ~a28~0) .cse5) (and .cse6 .cse2 (= 7 ~a17~0) .cse4) (and .cse6 .cse3) (and .cse1 .cse5)))) [2024-12-06 05:12:56,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 06.12 05:12:56 ImpRootNode [2024-12-06 05:12:56,692 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-06 05:12:56,693 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-06 05:12:56,693 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-06 05:12:56,693 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-06 05:12:56,694 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:11:36" (3/4) ... [2024-12-06 05:12:56,696 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-12-06 05:12:56,708 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 129 nodes and edges [2024-12-06 05:12:56,709 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-12-06 05:12:56,710 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-12-06 05:12:56,711 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-12-06 05:12:56,807 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba0cfc9-d138-47e3-8989-f9ba27a188f2/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-06 05:12:56,807 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba0cfc9-d138-47e3-8989-f9ba27a188f2/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-06 05:12:56,807 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-06 05:12:56,808 INFO L158 Benchmark]: Toolchain (without parser) took 81963.45ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 115.3MB in the beginning and 988.0MB in the end (delta: -872.7MB). Peak memory consumption was 261.2MB. Max. memory is 16.1GB. [2024-12-06 05:12:56,808 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 142.6MB. Free memory is still 83.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 05:12:56,808 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.51ms. Allocated memory is still 142.6MB. Free memory was 115.3MB in the beginning and 88.2MB in the end (delta: 27.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-06 05:12:56,808 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.92ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 83.2MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 05:12:56,808 INFO L158 Benchmark]: Boogie Preprocessor took 49.57ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 79.2MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 05:12:56,809 INFO L158 Benchmark]: RCFGBuilder took 1152.25ms. Allocated memory is still 142.6MB. Free memory was 79.2MB in the beginning and 62.7MB in the end (delta: 16.5MB). Peak memory consumption was 43.9MB. Max. memory is 16.1GB. [2024-12-06 05:12:56,809 INFO L158 Benchmark]: CodeCheck took 80242.96ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 61.9MB in the beginning and 1.0GB in the end (delta: -938.6MB). Peak memory consumption was 192.8MB. Max. memory is 16.1GB. [2024-12-06 05:12:56,809 INFO L158 Benchmark]: Witness Printer took 114.05ms. Allocated memory is still 1.3GB. Free memory was 1.0GB in the beginning and 988.0MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-06 05:12:56,811 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 65.2s, OverallIterations: 101, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 296846 SdHoareTripleChecker+Valid, 580.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 295954 mSDsluCounter, 36243 SdHoareTripleChecker+Invalid, 490.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30893 mSDsCounter, 66565 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 635048 IncrementalHoareTripleChecker+Invalid, 701613 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 66565 mSolverCounterUnsat, 5350 mSDtfsCounter, 635048 mSolverCounterSat, 3.9s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 133198 GetRequests, 129704 SyntacticMatches, 2828 SemanticMatches, 666 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285493 ImplicationChecksByTransitivity, 38.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.5s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 20501 NumberOfCodeBlocks, 20501 NumberOfCodeBlocksAsserted, 100 NumberOfCheckSat, 20401 ConstructedInterpolants, 0 QuantifiedInterpolants, 49933 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 100 InterpolantComputations, 86 PerfectInterpolantSequences, 22160/22497 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: 485]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 39]: Location Invariant Derived location invariant: ((((((((10 <= a28) || ((a25 == a11) && (a28 <= 7))) || ((a19 != 1) && (a28 <= 7))) || ((((a17 == 8) && (a21 == 1)) && (a19 == 1)) && (a28 == 9))) || ((9 <= a28) && (a11 != 1))) || ((((a25 == 1) && (a21 == 1)) && (7 == a17)) && (a28 == 9))) || ((a25 == 1) && (a19 == 1))) || ((a19 != 1) && (a11 != 1))) - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: ((((((((10 <= a28) || ((a25 == a11) && (a28 <= 7))) || ((a19 != 1) && (a28 <= 7))) || ((((a17 == 8) && (a21 == 1)) && (a19 == 1)) && (a28 == 9))) || ((9 <= a28) && (a11 != 1))) || ((((a25 == 1) && (a21 == 1)) && (7 == a17)) && (a28 == 9))) || ((a25 == 1) && (a19 == 1))) || ((a19 != 1) && (a11 != 1))) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 142.6MB. Free memory is still 83.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 353.51ms. Allocated memory is still 142.6MB. Free memory was 115.3MB in the beginning and 88.2MB in the end (delta: 27.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.92ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 83.2MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.57ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 79.2MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1152.25ms. Allocated memory is still 142.6MB. Free memory was 79.2MB in the beginning and 62.7MB in the end (delta: 16.5MB). Peak memory consumption was 43.9MB. Max. memory is 16.1GB. * CodeCheck took 80242.96ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 61.9MB in the beginning and 1.0GB in the end (delta: -938.6MB). Peak memory consumption was 192.8MB. Max. memory is 16.1GB. * Witness Printer took 114.05ms. Allocated memory is still 1.3GB. Free memory was 1.0GB in the beginning and 988.0MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-12-06 05:12:56,826 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ba0cfc9-d138-47e3-8989-f9ba27a188f2/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