./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label00.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_fd24d67c-7874-47a5-8c10-a814362f61df/bin/ukojak-verify-ENZ3QT5qd3/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd24d67c-7874-47a5-8c10-a814362f61df/bin/ukojak-verify-ENZ3QT5qd3/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd24d67c-7874-47a5-8c10-a814362f61df/bin/ukojak-verify-ENZ3QT5qd3/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd24d67c-7874-47a5-8c10-a814362f61df/bin/ukojak-verify-ENZ3QT5qd3/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label00.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd24d67c-7874-47a5-8c10-a814362f61df/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd24d67c-7874-47a5-8c10-a814362f61df/bin/ukojak-verify-ENZ3QT5qd3 --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 ef0fc431edab04e2bc46b00be67c275761704e057ac7d10029420dfecba76e3a --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-25 03:01:52,730 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-25 03:01:52,789 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd24d67c-7874-47a5-8c10-a814362f61df/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-25 03:01:52,794 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-25 03:01:52,794 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-25 03:01:52,815 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-25 03:01:52,816 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-25 03:01:52,816 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-25 03:01:52,817 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-25 03:01:52,817 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-25 03:01:52,817 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-25 03:01:52,817 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-25 03:01:52,817 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-25 03:01:52,817 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-25 03:01:52,817 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-25 03:01:52,817 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-25 03:01:52,818 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-25 03:01:52,818 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-25 03:01:52,818 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-25 03:01:52,818 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-25 03:01:52,818 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-25 03:01:52,818 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-25 03:01:52,818 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-25 03:01:52,818 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-25 03:01:52,818 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-25 03:01:52,819 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-25 03:01:52,819 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-25 03:01:52,819 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 03:01:52,819 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-25 03:01:52,819 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-25 03:01:52,819 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-25 03:01:52,819 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-25 03:01:52,819 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-25 03:01:52,820 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_fd24d67c-7874-47a5-8c10-a814362f61df/bin/ukojak-verify-ENZ3QT5qd3 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 -> ef0fc431edab04e2bc46b00be67c275761704e057ac7d10029420dfecba76e3a [2024-11-25 03:01:53,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-25 03:01:53,144 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-25 03:01:53,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-25 03:01:53,150 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-25 03:01:53,150 INFO L274 PluginConnector]: CDTParser initialized [2024-11-25 03:01:53,152 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd24d67c-7874-47a5-8c10-a814362f61df/bin/ukojak-verify-ENZ3QT5qd3/../../sv-benchmarks/c/eca-rers2012/Problem01_label00.c [2024-11-25 03:01:56,317 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd24d67c-7874-47a5-8c10-a814362f61df/bin/ukojak-verify-ENZ3QT5qd3/data/a2f6bb94e/79253d7bb2a643e38f1ea2ddd3020fb8/FLAG09d6a4470 [2024-11-25 03:01:56,652 INFO L384 CDTParser]: Found 1 translation units. [2024-11-25 03:01:56,654 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd24d67c-7874-47a5-8c10-a814362f61df/sv-benchmarks/c/eca-rers2012/Problem01_label00.c [2024-11-25 03:01:56,678 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd24d67c-7874-47a5-8c10-a814362f61df/bin/ukojak-verify-ENZ3QT5qd3/data/a2f6bb94e/79253d7bb2a643e38f1ea2ddd3020fb8/FLAG09d6a4470 [2024-11-25 03:01:56,694 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd24d67c-7874-47a5-8c10-a814362f61df/bin/ukojak-verify-ENZ3QT5qd3/data/a2f6bb94e/79253d7bb2a643e38f1ea2ddd3020fb8 [2024-11-25 03:01:56,697 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-25 03:01:56,699 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-25 03:01:56,700 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-25 03:01:56,700 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-25 03:01:56,705 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-25 03:01:56,706 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:01:56" (1/1) ... [2024-11-25 03:01:56,707 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f887f92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:01:56, skipping insertion in model container [2024-11-25 03:01:56,707 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:01:56" (1/1) ... [2024-11-25 03:01:56,741 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-25 03:01:57,059 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_fd24d67c-7874-47a5-8c10-a814362f61df/sv-benchmarks/c/eca-rers2012/Problem01_label00.c[18976,18989] [2024-11-25 03:01:57,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 03:01:57,108 INFO L200 MainTranslator]: Completed pre-run [2024-11-25 03:01:57,209 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_fd24d67c-7874-47a5-8c10-a814362f61df/sv-benchmarks/c/eca-rers2012/Problem01_label00.c[18976,18989] [2024-11-25 03:01:57,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 03:01:57,246 INFO L204 MainTranslator]: Completed translation [2024-11-25 03:01:57,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:01:57 WrapperNode [2024-11-25 03:01:57,247 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-25 03:01:57,249 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-25 03:01:57,249 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-25 03:01:57,250 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-25 03:01:57,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:01:57" (1/1) ... [2024-11-25 03:01:57,280 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:01:57" (1/1) ... [2024-11-25 03:01:57,324 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-11-25 03:01:57,325 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-25 03:01:57,325 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-25 03:01:57,325 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-25 03:01:57,325 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-25 03:01:57,338 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:01:57" (1/1) ... [2024-11-25 03:01:57,338 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:01:57" (1/1) ... [2024-11-25 03:01:57,347 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:01:57" (1/1) ... [2024-11-25 03:01:57,347 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:01:57" (1/1) ... [2024-11-25 03:01:57,385 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:01:57" (1/1) ... [2024-11-25 03:01:57,391 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:01:57" (1/1) ... [2024-11-25 03:01:57,404 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:01:57" (1/1) ... [2024-11-25 03:01:57,414 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:01:57" (1/1) ... [2024-11-25 03:01:57,419 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:01:57" (1/1) ... [2024-11-25 03:01:57,425 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-25 03:01:57,427 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-25 03:01:57,428 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-25 03:01:57,428 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-25 03:01:57,430 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:01:57" (1/1) ... [2024-11-25 03:01:57,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 03:01:57,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd24d67c-7874-47a5-8c10-a814362f61df/bin/ukojak-verify-ENZ3QT5qd3/z3 [2024-11-25 03:01:57,468 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd24d67c-7874-47a5-8c10-a814362f61df/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-25 03:01:57,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd24d67c-7874-47a5-8c10-a814362f61df/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-25 03:01:57,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-25 03:01:57,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-25 03:01:57,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-25 03:01:57,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-25 03:01:57,600 INFO L234 CfgBuilder]: Building ICFG [2024-11-25 03:01:57,605 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-25 03:01:59,080 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-25 03:01:59,081 INFO L283 CfgBuilder]: Performing block encoding [2024-11-25 03:01:59,388 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-25 03:01:59,388 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-25 03:01:59,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:01:59 BoogieIcfgContainer [2024-11-25 03:01:59,389 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-25 03:01:59,390 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-25 03:01:59,391 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-25 03:01:59,402 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-25 03:01:59,402 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:01:59" (1/1) ... [2024-11-25 03:01:59,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-25 03:01:59,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:01:59,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-11-25 03:01:59,474 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-11-25 03:01:59,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-25 03:01:59,478 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:01:59,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:01:59,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:02:00,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:02:01,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:02:01,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 145 states and 220 transitions. [2024-11-25 03:02:01,436 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 220 transitions. [2024-11-25 03:02:01,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-25 03:02:01,440 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:02:01,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:02:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:02:01,630 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:02:02,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:02:02,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 214 states and 297 transitions. [2024-11-25 03:02:02,784 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 297 transitions. [2024-11-25 03:02:02,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-25 03:02:02,786 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:02:02,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:02:02,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:02:03,335 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:02:04,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:02:04,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 283 states and 367 transitions. [2024-11-25 03:02:04,294 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 367 transitions. [2024-11-25 03:02:04,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-25 03:02:04,296 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:02:04,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:02:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:02:04,656 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:02:05,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:02:05,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 297 states and 386 transitions. [2024-11-25 03:02:05,336 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 386 transitions. [2024-11-25 03:02:05,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-25 03:02:05,339 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:02:05,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:02:05,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:02:05,563 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-25 03:02:05,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:02:05,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 306 states and 397 transitions. [2024-11-25 03:02:05,870 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 397 transitions. [2024-11-25 03:02:05,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-25 03:02:05,871 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:02:05,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:02:05,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:02:06,142 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 30 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-25 03:02:06,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:02:06,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 308 states and 399 transitions. [2024-11-25 03:02:06,244 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 399 transitions. [2024-11-25 03:02:06,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-25 03:02:06,245 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:02:06,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:02:06,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:02:06,500 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 03:02:07,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:02:07,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 334 states and 431 transitions. [2024-11-25 03:02:07,689 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 431 transitions. [2024-11-25 03:02:07,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-25 03:02:07,690 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:02:07,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:02:07,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:02:07,913 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 03:02:08,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:02:08,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 351 states and 451 transitions. [2024-11-25 03:02:08,700 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 451 transitions. [2024-11-25 03:02:08,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-25 03:02:08,701 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:02:08,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:02:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:02:09,049 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-25 03:02:09,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:02:09,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 380 states and 483 transitions. [2024-11-25 03:02:09,820 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 483 transitions. [2024-11-25 03:02:09,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-25 03:02:09,822 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:02:09,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:02:09,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:02:10,154 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 60 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-25 03:02:11,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:02:11,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 428 states and 537 transitions. [2024-11-25 03:02:11,747 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 537 transitions. [2024-11-25 03:02:11,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-25 03:02:11,749 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:02:11,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:02:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:02:12,069 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-25 03:02:12,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:02:12,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 431 states and 541 transitions. [2024-11-25 03:02:12,363 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 541 transitions. [2024-11-25 03:02:12,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-25 03:02:12,365 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:02:12,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:02:12,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:02:12,683 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:02:14,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:02:14,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 494 states and 612 transitions. [2024-11-25 03:02:14,826 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 612 transitions. [2024-11-25 03:02:14,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-25 03:02:14,828 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:02:14,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:02:14,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:02:15,073 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:02:15,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:02:15,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 496 states and 613 transitions. [2024-11-25 03:02:15,274 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 613 transitions. [2024-11-25 03:02:15,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-25 03:02:15,276 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:02:15,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:02:15,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:02:15,363 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-25 03:02:15,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:02:15,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 513 states and 633 transitions. [2024-11-25 03:02:15,925 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 633 transitions. [2024-11-25 03:02:15,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-25 03:02:15,927 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:02:15,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:02:15,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:02:16,210 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 03:02:16,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:02:16,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 514 states and 633 transitions. [2024-11-25 03:02:16,345 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 633 transitions. [2024-11-25 03:02:16,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-25 03:02:16,347 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:02:16,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:02:16,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:02:16,794 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:02:18,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:02:18,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 583 states and 718 transitions. [2024-11-25 03:02:18,587 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 718 transitions. [2024-11-25 03:02:18,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-25 03:02:18,589 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:02:18,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:02:18,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:02:18,914 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:02:20,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:02:20,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 602 states and 739 transitions. [2024-11-25 03:02:20,093 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 739 transitions. [2024-11-25 03:02:20,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-25 03:02:20,096 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:02:20,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:02:20,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:02:20,429 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:02:20,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:02:20,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 604 states and 740 transitions. [2024-11-25 03:02:20,795 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 740 transitions. [2024-11-25 03:02:20,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-25 03:02:20,797 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:02:20,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:02:20,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:02:20,972 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-25 03:02:21,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:02:21,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 606 states and 743 transitions. [2024-11-25 03:02:21,213 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 743 transitions. [2024-11-25 03:02:21,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-25 03:02:21,216 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:02:21,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:02:21,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:02:21,473 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 84 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-25 03:02:22,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:02:22,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 631 states and 770 transitions. [2024-11-25 03:02:22,656 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 770 transitions. [2024-11-25 03:02:22,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-25 03:02:22,660 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:02:22,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:02:22,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:02:22,818 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-25 03:02:23,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:02:23,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 656 states and 795 transitions. [2024-11-25 03:02:23,156 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 795 transitions. [2024-11-25 03:02:23,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-25 03:02:23,158 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:02:23,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:02:23,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:02:23,355 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 03:02:23,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:02:23,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 658 states and 796 transitions. [2024-11-25 03:02:23,689 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 796 transitions. [2024-11-25 03:02:23,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-25 03:02:23,691 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:02:23,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:02:23,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:02:23,858 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 03:02:25,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:02:25,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 705 states and 856 transitions. [2024-11-25 03:02:25,215 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 856 transitions. [2024-11-25 03:02:25,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-25 03:02:25,217 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:02:25,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:02:25,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:02:25,464 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 03:02:26,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:02:26,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 720 states and 876 transitions. [2024-11-25 03:02:26,252 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 876 transitions. [2024-11-25 03:02:26,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-25 03:02:26,253 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:02:26,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:02:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:02:26,875 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:02:30,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:02:30,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 804 states and 972 transitions. [2024-11-25 03:02:30,166 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 972 transitions. [2024-11-25 03:02:30,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-25 03:02:30,169 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:02:30,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:02:30,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:02:30,751 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:02:32,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:02:32,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 854 states and 1035 transitions. [2024-11-25 03:02:32,296 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1035 transitions. [2024-11-25 03:02:32,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-25 03:02:32,298 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:02:32,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:02:32,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:02:32,699 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:02:32,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:02:32,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 856 states and 1038 transitions. [2024-11-25 03:02:32,859 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1038 transitions. [2024-11-25 03:02:32,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-25 03:02:32,861 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:02:32,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:02:32,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:02:33,542 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 156 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 03:02:35,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:02:35,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 918 states and 1111 transitions. [2024-11-25 03:02:35,165 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1111 transitions. [2024-11-25 03:02:35,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-25 03:02:35,166 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:02:35,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:02:35,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:02:35,549 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 156 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 03:02:35,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:02:35,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 920 states and 1112 transitions. [2024-11-25 03:02:35,926 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1112 transitions. [2024-11-25 03:02:35,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-25 03:02:35,927 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:02:35,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:02:35,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:02:36,505 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:02:39,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:02:39,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1013 states and 1225 transitions. [2024-11-25 03:02:39,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1225 transitions. [2024-11-25 03:02:39,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-25 03:02:39,124 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:02:39,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:02:39,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:02:39,471 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:02:40,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:02:40,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1017 states and 1230 transitions. [2024-11-25 03:02:40,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1230 transitions. [2024-11-25 03:02:40,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-25 03:02:40,163 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:02:40,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:02:40,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:02:40,481 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-25 03:02:42,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:02:42,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1052 states and 1271 transitions. [2024-11-25 03:02:42,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1271 transitions. [2024-11-25 03:02:42,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-25 03:02:42,243 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:02:42,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:02:42,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:02:42,612 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 120 proven. 51 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-25 03:02:43,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:02:43,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1067 states and 1290 transitions. [2024-11-25 03:02:43,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1290 transitions. [2024-11-25 03:02:43,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-25 03:02:43,154 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:02:43,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:02:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:02:43,344 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 67 proven. 122 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 03:02:45,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:02:45,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1159 states and 1386 transitions. [2024-11-25 03:02:45,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1386 transitions. [2024-11-25 03:02:45,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-25 03:02:45,697 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:02:45,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:02:45,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:02:46,042 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:02:47,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:02:47,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1202 states and 1436 transitions. [2024-11-25 03:02:47,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1436 transitions. [2024-11-25 03:02:47,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-25 03:02:47,598 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:02:47,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:02:47,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:02:47,879 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:02:49,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:02:49,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1473 states to 1234 states and 1473 transitions. [2024-11-25 03:02:49,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 1473 transitions. [2024-11-25 03:02:49,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-25 03:02:49,089 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:02:49,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:02:49,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:02:49,446 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-25 03:02:50,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:02:50,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1294 states and 1546 transitions. [2024-11-25 03:02:50,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 1546 transitions. [2024-11-25 03:02:50,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-25 03:02:50,743 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:02:50,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:02:50,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:02:50,869 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 03:02:52,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:02:52,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1332 states and 1589 transitions. [2024-11-25 03:02:52,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1332 states and 1589 transitions. [2024-11-25 03:02:52,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-25 03:02:52,148 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:02:52,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:02:52,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:02:52,325 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 136 proven. 65 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-25 03:02:53,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:02:53,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1367 states and 1626 transitions. [2024-11-25 03:02:53,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 1626 transitions. [2024-11-25 03:02:53,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-25 03:02:53,379 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:02:53,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:02:53,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:02:53,811 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-25 03:02:56,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:02:56,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1687 states to 1420 states and 1687 transitions. [2024-11-25 03:02:56,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1420 states and 1687 transitions. [2024-11-25 03:02:56,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-25 03:02:56,841 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:02:56,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:02:56,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:02:57,242 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-25 03:02:57,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:02:57,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1422 states and 1690 transitions. [2024-11-25 03:02:57,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 1690 transitions. [2024-11-25 03:02:57,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-25 03:02:57,661 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:02:57,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:02:57,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:02:58,139 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:02:58,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:02:58,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1424 states and 1694 transitions. [2024-11-25 03:02:58,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1424 states and 1694 transitions. [2024-11-25 03:02:58,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-25 03:02:58,575 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:02:58,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:02:58,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:02:58,879 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:03:00,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:03:00,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1720 states to 1447 states and 1720 transitions. [2024-11-25 03:03:00,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 1720 transitions. [2024-11-25 03:03:00,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-25 03:03:00,471 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:03:00,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:03:00,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:03:00,742 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:03:02,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:03:02,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1465 states and 1737 transitions. [2024-11-25 03:03:02,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1465 states and 1737 transitions. [2024-11-25 03:03:02,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-25 03:03:02,577 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:03:02,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:03:02,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:03:03,254 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-25 03:03:06,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:03:06,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1514 states and 1804 transitions. [2024-11-25 03:03:06,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 1804 transitions. [2024-11-25 03:03:06,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-25 03:03:06,528 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:03:06,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:03:06,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:03:06,846 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-25 03:03:08,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:03:08,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1827 states to 1539 states and 1827 transitions. [2024-11-25 03:03:08,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1539 states and 1827 transitions. [2024-11-25 03:03:08,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-25 03:03:08,656 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:03:08,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:03:08,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:03:08,929 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 140 proven. 71 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-25 03:03:09,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:03:09,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1830 states to 1542 states and 1830 transitions. [2024-11-25 03:03:09,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 1830 transitions. [2024-11-25 03:03:09,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-25 03:03:09,087 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:03:09,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:03:09,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:03:09,946 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 119 proven. 137 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 03:03:13,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:03:13,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1978 states to 1676 states and 1978 transitions. [2024-11-25 03:03:13,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1676 states and 1978 transitions. [2024-11-25 03:03:13,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-25 03:03:13,824 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:03:13,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:03:13,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:03:14,134 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 58 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-25 03:03:15,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:03:15,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2004 states to 1701 states and 2004 transitions. [2024-11-25 03:03:15,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 2004 transitions. [2024-11-25 03:03:15,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-25 03:03:15,028 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:03:15,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:03:15,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:03:15,413 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:03:16,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:03:16,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2019 states to 1714 states and 2019 transitions. [2024-11-25 03:03:16,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 2019 transitions. [2024-11-25 03:03:16,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-25 03:03:16,155 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:03:16,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:03:16,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:03:16,451 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:03:16,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:03:16,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2023 states to 1717 states and 2023 transitions. [2024-11-25 03:03:16,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 2023 transitions. [2024-11-25 03:03:16,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-25 03:03:16,962 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:03:16,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:03:17,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:03:17,475 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 86 proven. 141 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-25 03:03:20,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:03:20,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2124 states to 1805 states and 2124 transitions. [2024-11-25 03:03:20,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1805 states and 2124 transitions. [2024-11-25 03:03:20,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-25 03:03:20,066 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:03:20,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:03:20,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:03:20,613 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 129 proven. 142 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 03:03:22,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:03:22,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2200 states to 1879 states and 2200 transitions. [2024-11-25 03:03:22,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 2200 transitions. [2024-11-25 03:03:22,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-25 03:03:22,440 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:03:22,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:03:22,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:03:22,916 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 183 proven. 52 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-25 03:03:24,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:03:24,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2222 states to 1900 states and 2222 transitions. [2024-11-25 03:03:24,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1900 states and 2222 transitions. [2024-11-25 03:03:24,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-25 03:03:24,647 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:03:24,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:03:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:03:25,087 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 185 proven. 54 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-25 03:03:25,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:03:25,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2224 states to 1902 states and 2224 transitions. [2024-11-25 03:03:25,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1902 states and 2224 transitions. [2024-11-25 03:03:25,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-25 03:03:25,332 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:03:25,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:03:25,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:03:25,694 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 152 proven. 83 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-25 03:03:26,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:03:26,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2241 states to 1917 states and 2241 transitions. [2024-11-25 03:03:26,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1917 states and 2241 transitions. [2024-11-25 03:03:26,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-25 03:03:26,366 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:03:26,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:03:26,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:03:26,857 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 155 proven. 86 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-25 03:03:28,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:03:28,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2286 states to 1954 states and 2286 transitions. [2024-11-25 03:03:28,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2286 transitions. [2024-11-25 03:03:28,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-25 03:03:28,434 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:03:28,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:03:28,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:03:28,799 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 174 proven. 28 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-25 03:03:29,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:03:29,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2298 states to 1965 states and 2298 transitions. [2024-11-25 03:03:29,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 2298 transitions. [2024-11-25 03:03:29,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-25 03:03:29,561 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:03:29,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:03:29,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:03:29,990 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 159 proven. 90 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-25 03:03:32,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:03:32,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2336 states to 1997 states and 2336 transitions. [2024-11-25 03:03:32,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 2336 transitions. [2024-11-25 03:03:32,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-25 03:03:32,230 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:03:32,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:03:32,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:03:32,509 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 186 proven. 34 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-25 03:03:33,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:03:33,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2343 states to 2003 states and 2343 transitions. [2024-11-25 03:03:33,741 INFO L276 IsEmpty]: Start isEmpty. Operand 2003 states and 2343 transitions. [2024-11-25 03:03:33,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-25 03:03:33,747 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:03:33,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:03:33,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:03:34,102 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 166 proven. 97 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-25 03:03:34,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:03:34,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2358 states to 2017 states and 2358 transitions. [2024-11-25 03:03:34,957 INFO L276 IsEmpty]: Start isEmpty. Operand 2017 states and 2358 transitions. [2024-11-25 03:03:34,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-25 03:03:34,958 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:03:34,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:03:34,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:03:35,244 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-25 03:03:36,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:03:36,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2406 states to 2058 states and 2406 transitions. [2024-11-25 03:03:36,734 INFO L276 IsEmpty]: Start isEmpty. Operand 2058 states and 2406 transitions. [2024-11-25 03:03:36,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-25 03:03:36,736 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:03:36,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:03:36,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:03:37,243 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 199 proven. 49 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-25 03:03:40,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:03:40,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2460 states to 2097 states and 2460 transitions. [2024-11-25 03:03:40,483 INFO L276 IsEmpty]: Start isEmpty. Operand 2097 states and 2460 transitions. [2024-11-25 03:03:40,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-25 03:03:40,485 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:03:40,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:03:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:03:40,945 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 169 proven. 100 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-25 03:03:41,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:03:41,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2111 states and 2475 transitions. [2024-11-25 03:03:41,662 INFO L276 IsEmpty]: Start isEmpty. Operand 2111 states and 2475 transitions. [2024-11-25 03:03:41,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-25 03:03:41,664 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:03:41,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:03:41,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:03:41,822 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-25 03:03:43,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:03:43,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2491 states to 2123 states and 2491 transitions. [2024-11-25 03:03:43,162 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 2491 transitions. [2024-11-25 03:03:43,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-25 03:03:43,164 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:03:43,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:03:43,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:03:43,306 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-25 03:03:43,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:03:43,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2493 states to 2125 states and 2493 transitions. [2024-11-25 03:03:43,841 INFO L276 IsEmpty]: Start isEmpty. Operand 2125 states and 2493 transitions. [2024-11-25 03:03:43,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-25 03:03:43,842 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:03:43,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:03:43,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:03:44,259 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 172 proven. 103 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-25 03:03:44,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:03:44,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2137 states and 2507 transitions. [2024-11-25 03:03:44,953 INFO L276 IsEmpty]: Start isEmpty. Operand 2137 states and 2507 transitions. [2024-11-25 03:03:44,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-25 03:03:44,954 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:03:44,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:03:44,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:03:45,261 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 172 proven. 103 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-25 03:03:45,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:03:45,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2138 states and 2507 transitions. [2024-11-25 03:03:45,478 INFO L276 IsEmpty]: Start isEmpty. Operand 2138 states and 2507 transitions. [2024-11-25 03:03:45,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-25 03:03:45,481 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:03:45,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:03:45,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:03:46,115 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 03:03:53,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:03:53,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2606 states to 2215 states and 2606 transitions. [2024-11-25 03:03:53,052 INFO L276 IsEmpty]: Start isEmpty. Operand 2215 states and 2606 transitions. [2024-11-25 03:03:53,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-25 03:03:53,054 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:03:53,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:03:53,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:03:53,351 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 03:03:54,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:03:54,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2622 states to 2232 states and 2622 transitions. [2024-11-25 03:03:54,747 INFO L276 IsEmpty]: Start isEmpty. Operand 2232 states and 2622 transitions. [2024-11-25 03:03:54,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-25 03:03:54,749 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:03:54,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:03:54,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:03:55,070 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 172 proven. 103 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-25 03:03:55,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:03:55,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2625 states to 2235 states and 2625 transitions. [2024-11-25 03:03:55,766 INFO L276 IsEmpty]: Start isEmpty. Operand 2235 states and 2625 transitions. [2024-11-25 03:03:55,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-25 03:03:55,768 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:03:55,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:03:55,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:03:56,206 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 179 proven. 104 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 03:03:56,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:03:56,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2634 states to 2244 states and 2634 transitions. [2024-11-25 03:03:56,446 INFO L276 IsEmpty]: Start isEmpty. Operand 2244 states and 2634 transitions. [2024-11-25 03:03:56,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-25 03:03:56,449 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:03:56,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:03:56,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:03:56,813 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 173 proven. 104 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2024-11-25 03:03:57,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:03:57,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2660 states to 2268 states and 2660 transitions. [2024-11-25 03:03:57,591 INFO L276 IsEmpty]: Start isEmpty. Operand 2268 states and 2660 transitions. [2024-11-25 03:03:57,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-25 03:03:57,593 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:03:57,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:03:57,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:03:58,166 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 03:04:01,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:04:01,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2719 states to 2313 states and 2719 transitions. [2024-11-25 03:04:01,282 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 2719 transitions. [2024-11-25 03:04:01,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-25 03:04:01,283 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:04:01,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:04:01,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:04:01,569 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 03:04:02,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:04:02,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2317 states and 2723 transitions. [2024-11-25 03:04:02,229 INFO L276 IsEmpty]: Start isEmpty. Operand 2317 states and 2723 transitions. [2024-11-25 03:04:02,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-25 03:04:02,231 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:04:02,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:04:02,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:04:02,599 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 207 proven. 34 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-25 03:04:05,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:04:05,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2747 states to 2332 states and 2747 transitions. [2024-11-25 03:04:05,614 INFO L276 IsEmpty]: Start isEmpty. Operand 2332 states and 2747 transitions. [2024-11-25 03:04:05,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-25 03:04:05,616 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:04:05,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:04:05,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:04:05,871 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 207 proven. 34 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-25 03:04:07,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:04:07,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2753 states to 2337 states and 2753 transitions. [2024-11-25 03:04:07,306 INFO L276 IsEmpty]: Start isEmpty. Operand 2337 states and 2753 transitions. [2024-11-25 03:04:07,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-25 03:04:07,308 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:04:07,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:04:07,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:04:07,683 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 175 proven. 106 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-25 03:04:08,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:04:08,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2759 states to 2340 states and 2759 transitions. [2024-11-25 03:04:08,543 INFO L276 IsEmpty]: Start isEmpty. Operand 2340 states and 2759 transitions. [2024-11-25 03:04:08,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-25 03:04:08,546 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:04:08,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:04:08,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:04:08,871 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 228 proven. 38 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-25 03:04:10,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:04:10,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2772 states to 2351 states and 2772 transitions. [2024-11-25 03:04:10,580 INFO L276 IsEmpty]: Start isEmpty. Operand 2351 states and 2772 transitions. [2024-11-25 03:04:10,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-25 03:04:10,582 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:04:10,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:04:10,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:04:11,263 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:04:18,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:04:18,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2840 states to 2412 states and 2840 transitions. [2024-11-25 03:04:18,248 INFO L276 IsEmpty]: Start isEmpty. Operand 2412 states and 2840 transitions. [2024-11-25 03:04:18,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-25 03:04:18,250 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:04:18,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:04:18,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:04:18,689 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:04:20,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:04:20,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2862 states to 2430 states and 2862 transitions. [2024-11-25 03:04:20,480 INFO L276 IsEmpty]: Start isEmpty. Operand 2430 states and 2862 transitions. [2024-11-25 03:04:20,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-25 03:04:20,482 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:04:20,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:04:20,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:04:20,893 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:04:24,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:04:24,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2890 states to 2459 states and 2890 transitions. [2024-11-25 03:04:24,643 INFO L276 IsEmpty]: Start isEmpty. Operand 2459 states and 2890 transitions. [2024-11-25 03:04:24,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-25 03:04:24,646 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:04:24,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:04:24,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:04:25,112 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:04:26,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:04:26,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2904 states to 2473 states and 2904 transitions. [2024-11-25 03:04:26,908 INFO L276 IsEmpty]: Start isEmpty. Operand 2473 states and 2904 transitions. [2024-11-25 03:04:26,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-25 03:04:26,909 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:04:26,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:04:26,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:04:27,254 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:04:27,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:04:27,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2905 states to 2475 states and 2905 transitions. [2024-11-25 03:04:27,601 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 2905 transitions. [2024-11-25 03:04:27,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-25 03:04:27,602 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:04:27,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:04:27,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:04:27,829 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-11-25 03:04:29,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:04:29,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2912 states to 2478 states and 2912 transitions. [2024-11-25 03:04:29,326 INFO L276 IsEmpty]: Start isEmpty. Operand 2478 states and 2912 transitions. [2024-11-25 03:04:29,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-25 03:04:29,329 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:04:29,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:04:29,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:04:29,455 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-11-25 03:04:30,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:04:30,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2912 states to 2479 states and 2912 transitions. [2024-11-25 03:04:30,163 INFO L276 IsEmpty]: Start isEmpty. Operand 2479 states and 2912 transitions. [2024-11-25 03:04:30,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-25 03:04:30,165 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:04:30,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:04:30,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:04:30,288 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-11-25 03:04:30,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:04:30,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2915 states to 2480 states and 2915 transitions. [2024-11-25 03:04:30,769 INFO L276 IsEmpty]: Start isEmpty. Operand 2480 states and 2915 transitions. [2024-11-25 03:04:30,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-25 03:04:30,770 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:04:30,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:04:30,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:04:31,084 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 186 proven. 111 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 03:04:31,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:04:31,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2922 states to 2487 states and 2922 transitions. [2024-11-25 03:04:31,361 INFO L276 IsEmpty]: Start isEmpty. Operand 2487 states and 2922 transitions. [2024-11-25 03:04:31,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-11-25 03:04:31,363 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:04:31,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:04:31,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:04:31,888 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 224 proven. 65 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-25 03:04:34,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:04:34,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2953 states to 2510 states and 2953 transitions. [2024-11-25 03:04:34,892 INFO L276 IsEmpty]: Start isEmpty. Operand 2510 states and 2953 transitions. [2024-11-25 03:04:34,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-25 03:04:34,893 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:04:34,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:04:34,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:04:35,284 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 185 proven. 152 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-25 03:04:39,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:04:39,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2986 states to 2541 states and 2986 transitions. [2024-11-25 03:04:39,425 INFO L276 IsEmpty]: Start isEmpty. Operand 2541 states and 2986 transitions. [2024-11-25 03:04:39,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-25 03:04:39,426 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:04:39,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:04:39,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:04:39,787 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 189 proven. 114 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 03:04:39,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:04:39,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2990 states to 2544 states and 2990 transitions. [2024-11-25 03:04:39,967 INFO L276 IsEmpty]: Start isEmpty. Operand 2544 states and 2990 transitions. [2024-11-25 03:04:39,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-25 03:04:39,968 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:04:39,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:04:39,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:04:40,339 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-25 03:04:42,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:04:42,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3005 states to 2556 states and 3005 transitions. [2024-11-25 03:04:42,010 INFO L276 IsEmpty]: Start isEmpty. Operand 2556 states and 3005 transitions. [2024-11-25 03:04:42,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-25 03:04:42,012 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:04:42,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:04:42,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:04:42,610 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 125 proven. 170 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-25 03:04:49,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:04:49,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3157 states to 2681 states and 3157 transitions. [2024-11-25 03:04:49,667 INFO L276 IsEmpty]: Start isEmpty. Operand 2681 states and 3157 transitions. [2024-11-25 03:04:49,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-25 03:04:49,669 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:04:49,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:04:49,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:04:50,659 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 03:04:53,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:04:53,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3226 states to 2742 states and 3226 transitions. [2024-11-25 03:04:53,743 INFO L276 IsEmpty]: Start isEmpty. Operand 2742 states and 3226 transitions. [2024-11-25 03:04:53,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-25 03:04:53,745 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:04:53,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:04:53,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:04:54,098 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 03:04:54,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:04:54,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3232 states to 2747 states and 3232 transitions. [2024-11-25 03:04:54,624 INFO L276 IsEmpty]: Start isEmpty. Operand 2747 states and 3232 transitions. [2024-11-25 03:04:54,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-25 03:04:54,626 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:04:54,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:04:54,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:04:54,859 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 134 proven. 180 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-11-25 03:04:54,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:04:54,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3232 states to 2748 states and 3232 transitions. [2024-11-25 03:04:54,952 INFO L276 IsEmpty]: Start isEmpty. Operand 2748 states and 3232 transitions. [2024-11-25 03:04:54,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-11-25 03:04:54,954 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:04:54,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:04:54,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:04:55,666 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 279 proven. 206 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-25 03:04:59,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:04:59,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3280 states to 2800 states and 3280 transitions. [2024-11-25 03:04:59,075 INFO L276 IsEmpty]: Start isEmpty. Operand 2800 states and 3280 transitions. [2024-11-25 03:04:59,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-25 03:04:59,076 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 98 iterations. [2024-11-25 03:04:59,085 INFO L726 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-11-25 03:05:41,294 INFO L77 FloydHoareUtils]: At program point L102(lines 102 400) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse8)) (.cse10 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse5 (= ~a16~0 4)) (.cse1 (= ~a12~0 8)) (.cse9 (not .cse3))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse8 .cse4) (and .cse9 (<= ~a16~0 5) (not .cse5)) (and (not (and (= ~a16~0 6) .cse8 .cse4)) .cse9 .cse7) (and .cse1 .cse10 .cse6 .cse2) (and .cse9 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse5) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse4) (and .cse9 (not (and .cse4 (= ~a17~0 ~a7~0))) .cse5) (and .cse9 (not .cse12) .cse11) (and .cse2 .cse9 (< 5 ~a16~0)) (and .cse0 .cse1 .cse10 .cse2 .cse5) (and .cse9 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse9 .cse8)))) [2024-11-25 03:05:41,294 INFO L77 FloydHoareUtils]: At program point L598(line 598) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:05:41,295 INFO L77 FloydHoareUtils]: At program point L334(lines 334 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:05:41,295 INFO L77 FloydHoareUtils]: At program point L302(lines 302 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:05:41,295 INFO L77 FloydHoareUtils]: At program point L170(lines 170 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:05:41,295 INFO L77 FloydHoareUtils]: At program point L204(lines 204 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:05:41,295 INFO L77 FloydHoareUtils]: At program point L72(lines 72 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse1 (not .cse8)) (.cse2 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse5 (= ~a16~0 4)) (.cse3 (not .cse7)) (.cse0 (not (= ~a7~0 1)))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse8 .cse4) (and .cse0 (not (and .cse2 (= ~a16~0 6) .cse4))) (and .cse2 .cse9 .cse6 .cse3) (and .cse2 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse1 .cse2 .cse6 .cse3 .cse4) (and .cse1 .cse0) (and .cse1 .cse2 .cse9 .cse3 .cse5) (and .cse3 .cse0)))) [2024-11-25 03:05:41,296 INFO L77 FloydHoareUtils]: At program point L271(lines 271 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:05:41,296 INFO L77 FloydHoareUtils]: At program point L139(lines 139 400) the Hoare annotation is: (let ((.cse5 (= ~a7~0 1)) (.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse8 (= 5 ~a16~0)) (.cse2 (not .cse10)) (.cse11 (= 14 ~a8~0)) (.cse4 (not .cse9)) (.cse7 (= ~a16~0 4)) (.cse3 (= ~a12~0 8)) (.cse0 (not .cse5)) (.cse6 (= ~a8~0 15))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (not (= ~a21~0 1)) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse3 .cse8 .cse9 .cse10 .cse6) (and .cse3 .cse11 .cse8 .cse4) (and .cse3 (= ~a8~0 13) .cse9 .cse10 .cse7) (and .cse2 .cse3 .cse8 .cse4 .cse6) (and .cse0 (not .cse7)) (and .cse2 .cse3 .cse11 .cse4 .cse7) (and .cse0 (not .cse3)) (and .cse0 (not (and .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))))))) [2024-11-25 03:05:41,297 INFO L77 FloydHoareUtils]: At program point L371(lines 371 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:05:41,298 INFO L77 FloydHoareUtils]: At program point L107(lines 107 400) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse8)) (.cse10 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse5 (= ~a16~0 4)) (.cse1 (= ~a12~0 8)) (.cse9 (not .cse3))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse8 .cse4) (and .cse9 (<= ~a16~0 5) (not .cse5)) (and (not (and (= ~a16~0 6) .cse8 .cse4)) .cse9 .cse7) (and .cse1 .cse10 .cse6 .cse2) (and .cse9 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse5) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse4) (and .cse9 (not (and .cse4 (= ~a17~0 ~a7~0))) .cse5) (and .cse9 (not .cse12) .cse11) (and .cse2 .cse9 (< 5 ~a16~0)) (and .cse0 .cse1 .cse10 .cse2 .cse5) (and .cse9 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse9 .cse8)))) [2024-11-25 03:05:41,298 INFO L77 FloydHoareUtils]: At program point L41(lines 41 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:05:41,298 INFO L77 FloydHoareUtils]: At program point L339(lines 339 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:05:41,298 INFO L77 FloydHoareUtils]: At program point L207(lines 207 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:05:41,299 INFO L77 FloydHoareUtils]: At program point L75(lines 75 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse1 (not .cse8)) (.cse2 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse5 (= ~a16~0 4)) (.cse3 (not .cse7)) (.cse0 (not (= ~a7~0 1)))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse8 .cse4) (and .cse0 (not (and .cse2 (= ~a16~0 6) .cse4))) (and .cse2 .cse9 .cse6 .cse3) (and .cse2 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse1 .cse2 .cse6 .cse3 .cse4) (and .cse1 .cse0) (and .cse1 .cse2 .cse9 .cse3 .cse5) (and .cse3 .cse0)))) [2024-11-25 03:05:41,299 INFO L77 FloydHoareUtils]: At program point L373(lines 373 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:05:41,299 INFO L77 FloydHoareUtils]: At program point L241(lines 241 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:05:41,299 INFO L77 FloydHoareUtils]: At program point L175(lines 175 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:05:41,299 INFO L77 FloydHoareUtils]: At program point L506-1(lines 40 585) the Hoare annotation is: (not (and (= ~a21~0 1) (= ~a7~0 1))) [2024-11-25 03:05:41,300 INFO L77 FloydHoareUtils]: At program point L275(lines 275 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:05:41,300 INFO L77 FloydHoareUtils]: At program point L375(lines 375 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:05:41,300 INFO L77 FloydHoareUtils]: At program point L309(lines 309 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:05:41,300 INFO L77 FloydHoareUtils]: At program point L45(lines 45 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:05:41,301 INFO L77 FloydHoareUtils]: At program point L343(lines 343 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:05:41,301 INFO L77 FloydHoareUtils]: At program point L112(lines 112 400) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse8)) (.cse10 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse5 (= ~a16~0 4)) (.cse1 (= ~a12~0 8)) (.cse9 (not .cse3))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse8 .cse4) (and .cse9 (<= ~a16~0 5) (not .cse5)) (and (not (and (= ~a16~0 6) .cse8 .cse4)) .cse9 .cse7) (and .cse1 .cse10 .cse6 .cse2) (and .cse9 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse5) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse4) (and .cse9 (not (and .cse4 (= ~a17~0 ~a7~0))) .cse5) (and .cse9 (not .cse12) .cse11) (and .cse2 .cse9 (< 5 ~a16~0)) (and .cse0 .cse1 .cse10 .cse2 .cse5) (and .cse9 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse9 .cse8)))) [2024-11-25 03:05:41,302 INFO L77 FloydHoareUtils]: At program point L509-1(lines 40 585) the Hoare annotation is: (not (and (= ~a21~0 1) (= ~a7~0 1))) [2024-11-25 03:05:41,302 INFO L77 FloydHoareUtils]: At program point L278(lines 278 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:05:41,302 INFO L77 FloydHoareUtils]: At program point L146(lines 146 400) the Hoare annotation is: (let ((.cse5 (= ~a7~0 1)) (.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse8 (= 5 ~a16~0)) (.cse2 (not .cse10)) (.cse11 (= 14 ~a8~0)) (.cse4 (not .cse9)) (.cse7 (= ~a16~0 4)) (.cse3 (= ~a12~0 8)) (.cse0 (not .cse5)) (.cse6 (= ~a8~0 15))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (not (= ~a21~0 1)) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse3 .cse8 .cse9 .cse10 .cse6) (and .cse3 .cse11 .cse8 .cse4) (and .cse3 (= ~a8~0 13) .cse9 .cse10 .cse7) (and .cse2 .cse3 .cse8 .cse4 .cse6) (and .cse0 (not .cse7)) (and .cse2 .cse3 .cse11 .cse4 .cse7) (and .cse0 (not .cse3)) (and .cse0 (not (and .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))))))) [2024-11-25 03:05:41,302 INFO L75 FloydHoareUtils]: For program point L510(line 510) no Hoare annotation was computed. [2024-11-25 03:05:41,303 INFO L77 FloydHoareUtils]: At program point L213(lines 213 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:05:41,304 INFO L77 FloydHoareUtils]: At program point L82(lines 82 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse1 (not .cse8)) (.cse2 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse5 (= ~a16~0 4)) (.cse3 (not .cse7)) (.cse0 (not (= ~a7~0 1)))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse8 .cse4) (and .cse0 (not (and .cse2 (= ~a16~0 6) .cse4))) (and .cse2 .cse9 .cse6 .cse3) (and .cse2 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse1 .cse2 .cse6 .cse3 .cse4) (and .cse1 .cse0) (and .cse1 .cse2 .cse9 .cse3 .cse5) (and .cse3 .cse0)))) [2024-11-25 03:05:41,305 INFO L77 FloydHoareUtils]: At program point L347(lines 347 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:05:41,305 INFO L77 FloydHoareUtils]: At program point L248(lines 248 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:05:41,305 INFO L77 FloydHoareUtils]: At program point L183(lines 183 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:05:41,305 INFO L77 FloydHoareUtils]: At program point L150(lines 150 400) the Hoare annotation is: (let ((.cse5 (= ~a7~0 1)) (.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse8 (= 5 ~a16~0)) (.cse2 (not .cse10)) (.cse11 (= 14 ~a8~0)) (.cse4 (not .cse9)) (.cse7 (= ~a16~0 4)) (.cse3 (= ~a12~0 8)) (.cse0 (not .cse5)) (.cse6 (= ~a8~0 15))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (not (= ~a21~0 1)) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse3 .cse8 .cse9 .cse10 .cse6) (and .cse3 .cse11 .cse8 .cse4) (and .cse3 (= ~a8~0 13) .cse9 .cse10 .cse7) (and .cse2 .cse3 .cse8 .cse4 .cse6) (and .cse0 (not .cse7)) (and .cse2 .cse3 .cse11 .cse4 .cse7) (and .cse0 (not .cse3)) (and .cse0 (not (and .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))))))) [2024-11-25 03:05:41,306 INFO L77 FloydHoareUtils]: At program point L382(lines 382 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:05:41,306 INFO L77 FloydHoareUtils]: At program point L316(lines 316 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:05:41,306 INFO L77 FloydHoareUtils]: At program point L283(lines 283 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:05:41,306 INFO L77 FloydHoareUtils]: At program point L118(lines 118 400) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse8)) (.cse10 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse5 (= ~a16~0 4)) (.cse1 (= ~a12~0 8)) (.cse9 (not .cse3))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse8 .cse4) (and .cse9 (<= ~a16~0 5) (not .cse5)) (and (not (and (= ~a16~0 6) .cse8 .cse4)) .cse9 .cse7) (and .cse1 .cse10 .cse6 .cse2) (and .cse9 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse5) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse4) (and .cse9 (not (and .cse4 (= ~a17~0 ~a7~0))) .cse5) (and .cse9 (not .cse12) .cse11) (and .cse2 .cse9 (< 5 ~a16~0)) (and .cse0 .cse1 .cse10 .cse2 .cse5) (and .cse9 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse9 .cse8)))) [2024-11-25 03:05:41,307 INFO L77 FloydHoareUtils]: At program point L218(lines 218 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:05:41,307 INFO L77 FloydHoareUtils]: At program point L53(lines 53 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:05:41,307 INFO L77 FloydHoareUtils]: At program point L154(lines 154 400) the Hoare annotation is: (let ((.cse5 (= ~a7~0 1)) (.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse8 (= 5 ~a16~0)) (.cse2 (not .cse10)) (.cse11 (= 14 ~a8~0)) (.cse4 (not .cse9)) (.cse7 (= ~a16~0 4)) (.cse3 (= ~a12~0 8)) (.cse0 (not .cse5)) (.cse6 (= ~a8~0 15))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (not (= ~a21~0 1)) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse3 .cse8 .cse9 .cse10 .cse6) (and .cse3 .cse11 .cse8 .cse4) (and .cse3 (= ~a8~0 13) .cse9 .cse10 .cse7) (and .cse2 .cse3 .cse8 .cse4 .cse6) (and .cse0 (not .cse7)) (and .cse2 .cse3 .cse11 .cse4 .cse7) (and .cse0 (not .cse3)) (and .cse0 (not (and .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))))))) [2024-11-25 03:05:41,307 INFO L77 FloydHoareUtils]: At program point L188(lines 188 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:05:41,308 INFO L77 FloydHoareUtils]: At program point L387(lines 387 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:05:41,308 INFO L77 FloydHoareUtils]: At program point L288(lines 288 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:05:41,308 INFO L77 FloydHoareUtils]: At program point L255(lines 255 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:05:41,308 INFO L77 FloydHoareUtils]: At program point L90(lines 90 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse1 (not .cse8)) (.cse2 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse5 (= ~a16~0 4)) (.cse3 (not .cse7)) (.cse0 (not (= ~a7~0 1)))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse8 .cse4) (and .cse0 (not (and .cse2 (= ~a16~0 6) .cse4))) (and .cse2 .cse9 .cse6 .cse3) (and .cse2 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse1 .cse2 .cse6 .cse3 .cse4) (and .cse1 .cse0) (and .cse1 .cse2 .cse9 .cse3 .cse5) (and .cse3 .cse0)))) [2024-11-25 03:05:41,308 INFO L77 FloydHoareUtils]: At program point L355(lines 355 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:05:41,309 INFO L77 FloydHoareUtils]: At program point L322(lines 322 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:05:41,309 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-25 03:05:41,309 INFO L77 FloydHoareUtils]: At program point L124(lines 124 400) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse8)) (.cse10 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse5 (= ~a16~0 4)) (.cse1 (= ~a12~0 8)) (.cse9 (not .cse3))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse8 .cse4) (and .cse9 (<= ~a16~0 5) (not .cse5)) (and (not (and (= ~a16~0 6) .cse8 .cse4)) .cse9 .cse7) (and .cse1 .cse10 .cse6 .cse2) (and .cse9 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse5) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse4) (and .cse9 (not (and .cse4 (= ~a17~0 ~a7~0))) .cse5) (and .cse9 (not .cse12) .cse11) (and .cse2 .cse9 (< 5 ~a16~0)) (and .cse0 .cse1 .cse10 .cse2 .cse5) (and .cse9 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse9 .cse8)))) [2024-11-25 03:05:41,309 INFO L77 FloydHoareUtils]: At program point L587(lines 587 604) the Hoare annotation is: true [2024-11-25 03:05:41,309 INFO L77 FloydHoareUtils]: At program point L224(lines 224 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:05:41,309 INFO L77 FloydHoareUtils]: At program point L158(lines 158 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:05:41,309 INFO L77 FloydHoareUtils]: At program point L59(lines 59 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:05:41,311 INFO L77 FloydHoareUtils]: At program point L94(lines 94 400) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse8)) (.cse10 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse5 (= ~a16~0 4)) (.cse1 (= ~a12~0 8)) (.cse9 (not .cse3))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse8 .cse4) (and .cse9 (<= ~a16~0 5) (not .cse5)) (and (not (and (= ~a16~0 6) .cse8 .cse4)) .cse9 .cse7) (and .cse1 .cse10 .cse6 .cse2) (and .cse9 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse5) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse4) (and .cse9 (not (and .cse4 (= ~a17~0 ~a7~0))) .cse5) (and .cse9 (not .cse12) .cse11) (and .cse2 .cse9 (< 5 ~a16~0)) (and .cse0 .cse1 .cse10 .cse2 .cse5) (and .cse9 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse9 .cse8)))) [2024-11-25 03:05:41,311 INFO L77 FloydHoareUtils]: At program point L392(lines 392 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:05:41,311 INFO L77 FloydHoareUtils]: At program point L326(lines 326 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:05:41,312 INFO L77 FloydHoareUtils]: At program point L260(lines 260 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:05:41,312 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-25 03:05:41,312 INFO L77 FloydHoareUtils]: At program point L228(lines 228 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:05:41,312 INFO L77 FloydHoareUtils]: At program point L162(lines 162 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:05:41,313 INFO L77 FloydHoareUtils]: At program point L129(lines 129 400) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse8)) (.cse10 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse5 (= ~a16~0 4)) (.cse1 (= ~a12~0 8)) (.cse9 (not .cse3))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse8 .cse4) (and .cse9 (<= ~a16~0 5) (not .cse5)) (and (not (and (= ~a16~0 6) .cse8 .cse4)) .cse9 .cse7) (and .cse1 .cse10 .cse6 .cse2) (and .cse9 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse5) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse4) (and .cse9 (not (and .cse4 (= ~a17~0 ~a7~0))) .cse5) (and .cse9 (not .cse12) .cse11) (and .cse2 .cse9 (< 5 ~a16~0)) (and .cse0 .cse1 .cse10 .cse2 .cse5) (and .cse9 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse9 .cse8)))) [2024-11-25 03:05:41,313 INFO L77 FloydHoareUtils]: At program point L328(lines 328 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:05:41,313 INFO L77 FloydHoareUtils]: At program point L196(lines 196 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:05:41,313 INFO L77 FloydHoareUtils]: At program point L64(lines 64 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse1 (not .cse8)) (.cse2 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse5 (= ~a16~0 4)) (.cse3 (not .cse7)) (.cse0 (not (= ~a7~0 1)))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse8 .cse4) (and .cse0 (not (and .cse2 (= ~a16~0 6) .cse4))) (and .cse2 .cse9 .cse6 .cse3) (and .cse2 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse1 .cse2 .cse6 .cse3 .cse4) (and .cse1 .cse0) (and .cse1 .cse2 .cse9 .cse3 .cse5) (and .cse3 .cse0)))) [2024-11-25 03:05:41,314 INFO L77 FloydHoareUtils]: At program point L593-2(lines 593 603) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:05:41,314 INFO L77 FloydHoareUtils]: At program point L296(lines 296 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:05:41,314 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 40 585) the Hoare annotation is: (not (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse6 (= 14 ~a8~0)) (.cse5 (= 5 ~a16~0)) (.cse2 (not .cse7)) (.cse1 (= ~a12~0 8)) (.cse4 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse0 .cse1 .cse5 .cse2 .cse3)) (not (and .cse0 .cse1 .cse6 .cse2 .cse4)) (not (and .cse1 .cse6 .cse5 .cse2)) (= ~a21~0 1) (not (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4)) (= ~a7~0 1))))) [2024-11-25 03:05:41,314 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 510) no Hoare annotation was computed. [2024-11-25 03:05:41,315 INFO L77 FloydHoareUtils]: At program point L363(lines 363 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:05:41,315 INFO L77 FloydHoareUtils]: At program point L199(lines 199 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:05:41,315 INFO L77 FloydHoareUtils]: At program point L365(lines 365 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:05:41,315 INFO L77 FloydHoareUtils]: At program point L266(lines 266 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:05:41,316 INFO L77 FloydHoareUtils]: At program point L233(lines 233 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-11-25 03:05:41,316 INFO L77 FloydHoareUtils]: At program point L134(lines 134 400) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse8)) (.cse10 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse5 (= ~a16~0 4)) (.cse1 (= ~a12~0 8)) (.cse9 (not .cse3))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse8 .cse4) (and .cse9 (<= ~a16~0 5) (not .cse5)) (and (not (and (= ~a16~0 6) .cse8 .cse4)) .cse9 .cse7) (and .cse1 .cse10 .cse6 .cse2) (and .cse9 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse5) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse4) (and .cse9 (not (and .cse4 (= ~a17~0 ~a7~0))) .cse5) (and .cse9 (not .cse12) .cse11) (and .cse2 .cse9 (< 5 ~a16~0)) (and .cse0 .cse1 .cse10 .cse2 .cse5) (and .cse9 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse9 .cse8)))) [2024-11-25 03:05:41,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 25.11 03:05:41 ImpRootNode [2024-11-25 03:05:41,341 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-25 03:05:41,342 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-25 03:05:41,342 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-25 03:05:41,343 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-25 03:05:41,343 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:01:59" (3/4) ... [2024-11-25 03:05:41,346 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-11-25 03:05:41,370 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 119 nodes and edges [2024-11-25 03:05:41,371 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-25 03:05:41,372 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-25 03:05:41,373 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-25 03:05:41,531 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd24d67c-7874-47a5-8c10-a814362f61df/bin/ukojak-verify-ENZ3QT5qd3/witness.graphml [2024-11-25 03:05:41,531 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd24d67c-7874-47a5-8c10-a814362f61df/bin/ukojak-verify-ENZ3QT5qd3/witness.yml [2024-11-25 03:05:41,531 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-25 03:05:41,532 INFO L158 Benchmark]: Toolchain (without parser) took 224833.56ms. Allocated memory was 117.4MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 90.9MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2024-11-25 03:05:41,536 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 117.4MB. Free memory is still 72.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 03:05:41,537 INFO L158 Benchmark]: CACSL2BoogieTranslator took 547.92ms. Allocated memory is still 117.4MB. Free memory was 90.7MB in the beginning and 63.3MB in the end (delta: 27.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-25 03:05:41,537 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.37ms. Allocated memory is still 117.4MB. Free memory was 63.3MB in the beginning and 58.0MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-25 03:05:41,537 INFO L158 Benchmark]: Boogie Preprocessor took 100.34ms. Allocated memory is still 117.4MB. Free memory was 57.8MB in the beginning and 53.7MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-25 03:05:41,537 INFO L158 Benchmark]: RCFGBuilder took 1961.24ms. Allocated memory is still 117.4MB. Free memory was 53.5MB in the beginning and 71.2MB in the end (delta: -17.8MB). Peak memory consumption was 33.2MB. Max. memory is 16.1GB. [2024-11-25 03:05:41,538 INFO L158 Benchmark]: CodeCheck took 221951.26ms. Allocated memory was 117.4MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 71.2MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 976.5MB. Max. memory is 16.1GB. [2024-11-25 03:05:41,538 INFO L158 Benchmark]: Witness Printer took 188.92ms. Allocated memory is still 2.4GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-25 03:05:41,541 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 179.7s, OverallIterations: 98, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 304837 SdHoareTripleChecker+Valid, 901.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 303971 mSDsluCounter, 41111 SdHoareTripleChecker+Invalid, 780.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 34904 mSDsCounter, 64475 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 658840 IncrementalHoareTripleChecker+Invalid, 723315 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64475 mSolverCounterUnsat, 6207 mSDtfsCounter, 658840 mSolverCounterSat, 8.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 133483 GetRequests, 125306 SyntacticMatches, 7201 SemanticMatches, 976 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672199 ImplicationChecksByTransitivity, 121.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.7s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 32.8s InterpolantComputationTime, 19766 NumberOfCodeBlocks, 19766 NumberOfCodeBlocksAsserted, 97 NumberOfCheckSat, 19669 ConstructedInterpolants, 0 QuantifiedInterpolants, 164205 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 97 InterpolantComputations, 22 PerfectInterpolantSequences, 17616/23173 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: 510]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 40]: Location Invariant Derived location invariant: !((((((!(((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a8 == 15)) && (a16 == 4)) && !(((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a8 == 15))) && !(((((a20 != 1) && (a12 == 8)) && (14 == a8)) && (a17 != 1)) && (a16 == 4))) && !((((a12 == 8) && (14 == a8)) && (5 == a16)) && (a17 != 1))) && (a21 == 1)) && !(((((a12 == 8) && (a8 == 13)) && (a17 == 1)) && (a20 == 1)) && (a16 == 4))) && (a7 == 1)) - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: !(((((((!(((((a12 == 8) && (5 == a16)) && (a17 == 1)) && (a20 == 1)) && (a8 == 15)) && !(((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a8 == 15)) && (a16 == 4))) && !(((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a8 == 15))) && !(((((a20 != 1) && (a12 == 8)) && (14 == a8)) && (a17 != 1)) && (a16 == 4))) && !((((a12 == 8) && (14 == a8)) && (5 == a16)) && (a17 != 1))) && (a21 == 1)) && !(((((a12 == 8) && (a8 == 13)) && (a17 == 1)) && (a20 == 1)) && (a16 == 4))) && (a7 == 1)) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.43ms. Allocated memory is still 117.4MB. Free memory is still 72.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 547.92ms. Allocated memory is still 117.4MB. Free memory was 90.7MB in the beginning and 63.3MB in the end (delta: 27.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.37ms. Allocated memory is still 117.4MB. Free memory was 63.3MB in the beginning and 58.0MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 100.34ms. Allocated memory is still 117.4MB. Free memory was 57.8MB in the beginning and 53.7MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1961.24ms. Allocated memory is still 117.4MB. Free memory was 53.5MB in the beginning and 71.2MB in the end (delta: -17.8MB). Peak memory consumption was 33.2MB. Max. memory is 16.1GB. * CodeCheck took 221951.26ms. Allocated memory was 117.4MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 71.2MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 976.5MB. Max. memory is 16.1GB. * Witness Printer took 188.92ms. Allocated memory is still 2.4GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-11-25 03:05:41,566 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd24d67c-7874-47a5-8c10-a814362f61df/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE