./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label14.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_abf698d4-4d4d-4185-ab82-47d05fe0db23/bin/ukojak-verify-ENZ3QT5qd3/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf698d4-4d4d-4185-ab82-47d05fe0db23/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_abf698d4-4d4d-4185-ab82-47d05fe0db23/bin/ukojak-verify-ENZ3QT5qd3/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf698d4-4d4d-4185-ab82-47d05fe0db23/bin/ukojak-verify-ENZ3QT5qd3/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label14.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf698d4-4d4d-4185-ab82-47d05fe0db23/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_abf698d4-4d4d-4185-ab82-47d05fe0db23/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 471d591bac756b3641e5eebd3ed64b220338148881b3c7fbab3f4295451226cd --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-25 02:46:37,224 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-25 02:46:37,345 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf698d4-4d4d-4185-ab82-47d05fe0db23/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-25 02:46:37,351 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-25 02:46:37,352 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-25 02:46:37,394 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-25 02:46:37,396 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-25 02:46:37,397 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-25 02:46:37,397 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-25 02:46:37,398 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-25 02:46:37,398 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-25 02:46:37,399 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-25 02:46:37,399 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-25 02:46:37,399 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-25 02:46:37,399 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-25 02:46:37,400 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-25 02:46:37,400 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-25 02:46:37,400 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-25 02:46:37,400 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-25 02:46:37,400 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-25 02:46:37,400 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-25 02:46:37,400 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-25 02:46:37,400 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-25 02:46:37,400 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-25 02:46:37,400 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-25 02:46:37,400 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-25 02:46:37,401 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-25 02:46:37,401 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 02:46:37,401 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-25 02:46:37,401 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-25 02:46:37,401 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-25 02:46:37,401 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-25 02:46:37,403 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-25 02:46:37,403 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_abf698d4-4d4d-4185-ab82-47d05fe0db23/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 -> 471d591bac756b3641e5eebd3ed64b220338148881b3c7fbab3f4295451226cd [2024-11-25 02:46:37,747 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-25 02:46:37,758 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-25 02:46:37,761 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-25 02:46:37,762 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-25 02:46:37,763 INFO L274 PluginConnector]: CDTParser initialized [2024-11-25 02:46:37,764 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf698d4-4d4d-4185-ab82-47d05fe0db23/bin/ukojak-verify-ENZ3QT5qd3/../../sv-benchmarks/c/eca-rers2012/Problem02_label14.c [2024-11-25 02:46:40,949 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf698d4-4d4d-4185-ab82-47d05fe0db23/bin/ukojak-verify-ENZ3QT5qd3/data/5622343eb/724ff1a7e17b47b5be3c38f63e129f9e/FLAG28c60a1f9 [2024-11-25 02:46:41,354 INFO L384 CDTParser]: Found 1 translation units. [2024-11-25 02:46:41,359 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf698d4-4d4d-4185-ab82-47d05fe0db23/sv-benchmarks/c/eca-rers2012/Problem02_label14.c [2024-11-25 02:46:41,386 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf698d4-4d4d-4185-ab82-47d05fe0db23/bin/ukojak-verify-ENZ3QT5qd3/data/5622343eb/724ff1a7e17b47b5be3c38f63e129f9e/FLAG28c60a1f9 [2024-11-25 02:46:41,537 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf698d4-4d4d-4185-ab82-47d05fe0db23/bin/ukojak-verify-ENZ3QT5qd3/data/5622343eb/724ff1a7e17b47b5be3c38f63e129f9e [2024-11-25 02:46:41,540 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-25 02:46:41,542 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-25 02:46:41,544 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-25 02:46:41,544 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-25 02:46:41,550 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-25 02:46:41,551 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 02:46:41" (1/1) ... [2024-11-25 02:46:41,556 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45ce59d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:46:41, skipping insertion in model container [2024-11-25 02:46:41,556 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 02:46:41" (1/1) ... [2024-11-25 02:46:41,623 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-25 02:46:42,004 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_abf698d4-4d4d-4185-ab82-47d05fe0db23/sv-benchmarks/c/eca-rers2012/Problem02_label14.c[18715,18728] [2024-11-25 02:46:42,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 02:46:42,048 INFO L200 MainTranslator]: Completed pre-run [2024-11-25 02:46:42,177 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_abf698d4-4d4d-4185-ab82-47d05fe0db23/sv-benchmarks/c/eca-rers2012/Problem02_label14.c[18715,18728] [2024-11-25 02:46:42,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 02:46:42,208 INFO L204 MainTranslator]: Completed translation [2024-11-25 02:46:42,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:46:42 WrapperNode [2024-11-25 02:46:42,209 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-25 02:46:42,210 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-25 02:46:42,211 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-25 02:46:42,211 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-25 02:46:42,219 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:46:42" (1/1) ... [2024-11-25 02:46:42,249 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:46:42" (1/1) ... [2024-11-25 02:46:42,320 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668 [2024-11-25 02:46:42,321 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-25 02:46:42,322 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-25 02:46:42,322 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-25 02:46:42,322 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-25 02:46:42,331 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:46:42" (1/1) ... [2024-11-25 02:46:42,332 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:46:42" (1/1) ... [2024-11-25 02:46:42,336 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:46:42" (1/1) ... [2024-11-25 02:46:42,337 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:46:42" (1/1) ... [2024-11-25 02:46:42,375 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:46:42" (1/1) ... [2024-11-25 02:46:42,382 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:46:42" (1/1) ... [2024-11-25 02:46:42,391 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:46:42" (1/1) ... [2024-11-25 02:46:42,397 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:46:42" (1/1) ... [2024-11-25 02:46:42,400 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:46:42" (1/1) ... [2024-11-25 02:46:42,407 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-25 02:46:42,408 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-25 02:46:42,408 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-25 02:46:42,408 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-25 02:46:42,410 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:46:42" (1/1) ... [2024-11-25 02:46:42,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 02:46:42,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf698d4-4d4d-4185-ab82-47d05fe0db23/bin/ukojak-verify-ENZ3QT5qd3/z3 [2024-11-25 02:46:42,463 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf698d4-4d4d-4185-ab82-47d05fe0db23/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-25 02:46:42,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf698d4-4d4d-4185-ab82-47d05fe0db23/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-25 02:46:42,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-25 02:46:42,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-25 02:46:42,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-25 02:46:42,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-25 02:46:42,627 INFO L234 CfgBuilder]: Building ICFG [2024-11-25 02:46:42,629 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-25 02:46:44,274 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-25 02:46:44,275 INFO L283 CfgBuilder]: Performing block encoding [2024-11-25 02:46:44,696 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-25 02:46:44,698 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-25 02:46:44,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 02:46:44 BoogieIcfgContainer [2024-11-25 02:46:44,699 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-25 02:46:44,700 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-25 02:46:44,700 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-25 02:46:44,712 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-25 02:46:44,713 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 02:46:44" (1/1) ... [2024-11-25 02:46:44,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-25 02:46:44,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:46:44,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 85 states and 162 transitions. [2024-11-25 02:46:44,804 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 162 transitions. [2024-11-25 02:46:44,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-25 02:46:44,810 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:46:44,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:46:45,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:46:45,545 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 02:46:46,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:46:46,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 163 states and 250 transitions. [2024-11-25 02:46:46,402 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 250 transitions. [2024-11-25 02:46:46,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-25 02:46:46,408 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:46:46,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:46:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:46:46,841 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:46:47,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:46:47,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 242 states and 332 transitions. [2024-11-25 02:46:47,993 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 332 transitions. [2024-11-25 02:46:47,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-25 02:46:47,995 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:46:47,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:46:48,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:46:48,172 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:46:48,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:46:48,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 251 states and 343 transitions. [2024-11-25 02:46:48,336 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 343 transitions. [2024-11-25 02:46:48,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-25 02:46:48,339 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:46:48,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:46:48,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:46:48,535 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:46:48,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:46:48,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 256 states and 348 transitions. [2024-11-25 02:46:48,619 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 348 transitions. [2024-11-25 02:46:48,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-25 02:46:48,621 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:46:48,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:46:48,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:46:48,779 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-25 02:46:49,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:46:49,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 270 states and 364 transitions. [2024-11-25 02:46:49,087 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 364 transitions. [2024-11-25 02:46:49,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-25 02:46:49,090 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:46:49,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:46:49,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:46:49,237 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:46:49,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:46:49,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 277 states and 371 transitions. [2024-11-25 02:46:49,347 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 371 transitions. [2024-11-25 02:46:49,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-25 02:46:49,348 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:46:49,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:46:49,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:46:49,490 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:46:49,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:46:49,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 283 states and 377 transitions. [2024-11-25 02:46:49,585 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 377 transitions. [2024-11-25 02:46:49,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-25 02:46:49,586 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:46:49,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:46:49,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:46:49,773 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:46:50,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:46:50,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 307 states and 404 transitions. [2024-11-25 02:46:50,200 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 404 transitions. [2024-11-25 02:46:50,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-25 02:46:50,207 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:46:50,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:46:50,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:46:50,407 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:46:51,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:46:51,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 386 states and 502 transitions. [2024-11-25 02:46:51,539 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 502 transitions. [2024-11-25 02:46:51,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-25 02:46:51,545 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:46:51,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:46:51,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:46:51,687 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:46:52,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:46:52,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 410 states and 529 transitions. [2024-11-25 02:46:52,094 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 529 transitions. [2024-11-25 02:46:52,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-25 02:46:52,097 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:46:52,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:46:52,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:46:52,234 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-25 02:46:52,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:46:52,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 413 states and 534 transitions. [2024-11-25 02:46:52,513 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 534 transitions. [2024-11-25 02:46:52,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-25 02:46:52,515 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:46:52,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:46:52,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:46:52,626 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-25 02:46:52,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:46:52,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 422 states and 544 transitions. [2024-11-25 02:46:52,836 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 544 transitions. [2024-11-25 02:46:52,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-25 02:46:52,838 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:46:52,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:46:52,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:46:53,045 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-25 02:46:53,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:46:53,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 440 states and 565 transitions. [2024-11-25 02:46:53,348 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 565 transitions. [2024-11-25 02:46:53,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-25 02:46:53,350 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:46:53,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:46:53,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:46:53,456 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-25 02:46:53,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:46:53,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 443 states and 568 transitions. [2024-11-25 02:46:53,537 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 568 transitions. [2024-11-25 02:46:53,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-25 02:46:53,539 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:46:53,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:46:53,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:46:54,067 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 47 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:46:55,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:46:55,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 487 states and 619 transitions. [2024-11-25 02:46:55,514 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 619 transitions. [2024-11-25 02:46:55,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-25 02:46:55,516 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:46:55,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:46:55,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:46:55,730 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:46:56,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:46:56,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 566 states and 704 transitions. [2024-11-25 02:46:56,888 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 704 transitions. [2024-11-25 02:46:56,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-25 02:46:56,891 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:46:56,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:46:56,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:46:57,118 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-25 02:46:57,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:46:57,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 590 states and 733 transitions. [2024-11-25 02:46:57,771 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 733 transitions. [2024-11-25 02:46:57,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-25 02:46:57,774 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:46:57,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:46:57,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:46:57,937 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-25 02:46:58,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:46:58,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 611 states and 757 transitions. [2024-11-25 02:46:58,879 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 757 transitions. [2024-11-25 02:46:58,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-25 02:46:58,882 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:46:58,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:46:58,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:46:59,417 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 56 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:47:00,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:47:00,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 658 states and 815 transitions. [2024-11-25 02:47:00,561 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 815 transitions. [2024-11-25 02:47:00,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-25 02:47:00,564 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:47:00,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:47:00,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:47:00,692 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-25 02:47:00,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:47:00,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 661 states and 820 transitions. [2024-11-25 02:47:00,965 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 820 transitions. [2024-11-25 02:47:00,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-25 02:47:00,968 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:47:00,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:47:01,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:47:01,089 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-25 02:47:01,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:47:01,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 665 states and 826 transitions. [2024-11-25 02:47:01,806 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 826 transitions. [2024-11-25 02:47:01,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-25 02:47:01,808 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:47:01,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:47:01,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:47:01,886 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-25 02:47:03,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:47:03,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 680 states and 848 transitions. [2024-11-25 02:47:03,149 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 848 transitions. [2024-11-25 02:47:03,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-25 02:47:03,151 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:47:03,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:47:03,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:47:03,262 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-25 02:47:04,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:47:04,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 691 states and 859 transitions. [2024-11-25 02:47:04,034 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 859 transitions. [2024-11-25 02:47:04,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-25 02:47:04,040 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:47:04,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:47:04,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:47:04,142 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-25 02:47:05,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:47:05,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 721 states and 893 transitions. [2024-11-25 02:47:05,295 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 893 transitions. [2024-11-25 02:47:05,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-25 02:47:05,300 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:47:05,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:47:05,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:47:05,405 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-25 02:47:05,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:47:05,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 755 states and 930 transitions. [2024-11-25 02:47:05,764 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 930 transitions. [2024-11-25 02:47:05,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-25 02:47:05,767 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:47:05,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:47:05,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:47:05,898 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-25 02:47:06,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:47:06,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 774 states and 951 transitions. [2024-11-25 02:47:06,402 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 951 transitions. [2024-11-25 02:47:06,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-25 02:47:06,405 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:47:06,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:47:06,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:47:07,030 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 74 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-25 02:47:08,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:47:08,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 822 states and 1006 transitions. [2024-11-25 02:47:08,171 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1006 transitions. [2024-11-25 02:47:08,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-25 02:47:08,174 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:47:08,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:47:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:47:08,565 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 69 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:47:09,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:47:09,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 887 states and 1075 transitions. [2024-11-25 02:47:09,700 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1075 transitions. [2024-11-25 02:47:09,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-25 02:47:09,703 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:47:09,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:47:09,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:47:10,229 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 65 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:47:12,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:47:12,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 998 states and 1193 transitions. [2024-11-25 02:47:12,242 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1193 transitions. [2024-11-25 02:47:12,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-25 02:47:12,245 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:47:12,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:47:12,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:47:12,339 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-25 02:47:12,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:47:12,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1006 states and 1204 transitions. [2024-11-25 02:47:12,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1204 transitions. [2024-11-25 02:47:12,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-25 02:47:12,690 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:47:12,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:47:12,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:47:12,860 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-25 02:47:13,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:47:13,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1008 states and 1210 transitions. [2024-11-25 02:47:13,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1210 transitions. [2024-11-25 02:47:13,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-25 02:47:13,200 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:47:13,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:47:13,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:47:13,369 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-25 02:47:13,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:47:13,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1009 states and 1210 transitions. [2024-11-25 02:47:13,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1210 transitions. [2024-11-25 02:47:13,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-25 02:47:13,571 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:47:13,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:47:13,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:47:13,711 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-25 02:47:13,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:47:13,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1010 states and 1210 transitions. [2024-11-25 02:47:13,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1210 transitions. [2024-11-25 02:47:13,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-25 02:47:13,800 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:47:13,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:47:13,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:47:13,965 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-25 02:47:14,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:47:14,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 929 states and 1116 transitions. [2024-11-25 02:47:14,054 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1116 transitions. [2024-11-25 02:47:14,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-25 02:47:14,057 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 35 iterations. [2024-11-25 02:47:14,069 INFO L726 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-11-25 02:47:25,658 INFO L77 FloydHoareUtils]: At program point L301(lines 301 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,659 INFO L77 FloydHoareUtils]: At program point L235(lines 235 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,663 INFO L77 FloydHoareUtils]: At program point L169(lines 169 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,663 INFO L77 FloydHoareUtils]: At program point L303(lines 303 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,664 INFO L77 FloydHoareUtils]: At program point L105(lines 105 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,664 INFO L77 FloydHoareUtils]: At program point L40(lines 40 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,664 INFO L77 FloydHoareUtils]: At program point L371(lines 371 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,664 INFO L77 FloydHoareUtils]: At program point L307(lines 307 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,664 INFO L77 FloydHoareUtils]: At program point L175(lines 175 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,664 INFO L77 FloydHoareUtils]: At program point L109(lines 109 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,665 INFO L77 FloydHoareUtils]: At program point L242(lines 242 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,665 INFO L77 FloydHoareUtils]: At program point L45(lines 45 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,665 INFO L77 FloydHoareUtils]: At program point L244(lines 244 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,665 INFO L77 FloydHoareUtils]: At program point L179(lines 179 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,665 INFO L77 FloydHoareUtils]: At program point L378(lines 378 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,665 INFO L77 FloydHoareUtils]: At program point L48(lines 48 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,666 INFO L77 FloydHoareUtils]: At program point L247(lines 247 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,666 INFO L77 FloydHoareUtils]: At program point L116(lines 116 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,666 INFO L77 FloydHoareUtils]: At program point L52(lines 52 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,666 INFO L77 FloydHoareUtils]: At program point L185(lines 185 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,670 INFO L77 FloydHoareUtils]: At program point L385(lines 385 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,671 INFO L77 FloydHoareUtils]: At program point L319(lines 319 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,671 INFO L77 FloydHoareUtils]: At program point L189(lines 189 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,671 INFO L77 FloydHoareUtils]: At program point L123(lines 123 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,671 INFO L77 FloydHoareUtils]: At program point L57(lines 57 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,671 INFO L77 FloydHoareUtils]: At program point L388(lines 388 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,671 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-25 02:47:25,671 INFO L77 FloydHoareUtils]: At program point L390(lines 390 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,672 INFO L77 FloydHoareUtils]: At program point L324(lines 324 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,672 INFO L77 FloydHoareUtils]: At program point L258(lines 258 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,672 INFO L77 FloydHoareUtils]: At program point L60(lines 60 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,672 INFO L77 FloydHoareUtils]: At program point L195(lines 195 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,672 INFO L77 FloydHoareUtils]: At program point L129(lines 129 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,672 INFO L77 FloydHoareUtils]: At program point L64(lines 64 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,672 INFO L77 FloydHoareUtils]: At program point L263(lines 263 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,673 INFO L77 FloydHoareUtils]: At program point L197(lines 197 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,673 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 533) no Hoare annotation was computed. [2024-11-25 02:47:25,673 INFO L77 FloydHoareUtils]: At program point L529-1(lines 39 608) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)))) [2024-11-25 02:47:25,673 INFO L77 FloydHoareUtils]: At program point L199(lines 199 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,673 INFO L77 FloydHoareUtils]: At program point L133(lines 133 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,674 INFO L77 FloydHoareUtils]: At program point L399(lines 399 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,674 INFO L77 FloydHoareUtils]: At program point L201(lines 201 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,676 INFO L77 FloydHoareUtils]: At program point L69(lines 69 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,676 INFO L77 FloydHoareUtils]: At program point L532-1(lines 39 608) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)))) [2024-11-25 02:47:25,676 INFO L75 FloydHoareUtils]: For program point L533(line 533) no Hoare annotation was computed. [2024-11-25 02:47:25,676 INFO L77 FloydHoareUtils]: At program point L269(lines 269 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,677 INFO L77 FloydHoareUtils]: At program point L204(lines 204 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,677 INFO L77 FloydHoareUtils]: At program point L271(lines 271 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,677 INFO L77 FloydHoareUtils]: At program point L404(lines 404 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,677 INFO L77 FloydHoareUtils]: At program point L338(lines 338 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,677 INFO L77 FloydHoareUtils]: At program point L140(lines 140 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,678 INFO L77 FloydHoareUtils]: At program point L75(lines 75 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,678 INFO L77 FloydHoareUtils]: At program point L208(lines 208 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,678 INFO L77 FloydHoareUtils]: At program point L341(lines 341 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,678 INFO L77 FloydHoareUtils]: At program point L408(lines 408 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,678 INFO L77 FloydHoareUtils]: At program point L144(lines 144 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,679 INFO L77 FloydHoareUtils]: At program point L79(lines 79 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,679 INFO L77 FloydHoareUtils]: At program point L212(lines 212 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,679 INFO L77 FloydHoareUtils]: At program point L610(lines 610 627) the Hoare annotation is: true [2024-11-25 02:47:25,679 INFO L77 FloydHoareUtils]: At program point L412(lines 412 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,679 INFO L77 FloydHoareUtils]: At program point L347(lines 347 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,680 INFO L77 FloydHoareUtils]: At program point L149(lines 149 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,680 INFO L77 FloydHoareUtils]: At program point L414(lines 414 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,680 INFO L77 FloydHoareUtils]: At program point L84(lines 84 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,680 INFO L77 FloydHoareUtils]: At program point L417(lines 417 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,680 INFO L77 FloydHoareUtils]: At program point L153(lines 153 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,681 INFO L77 FloydHoareUtils]: At program point L616-2(lines 616 626) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,681 INFO L77 FloydHoareUtils]: At program point L286(lines 286 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,681 INFO L77 FloydHoareUtils]: At program point L419(lines 419 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,681 INFO L77 FloydHoareUtils]: At program point L222(lines 222 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,681 INFO L77 FloydHoareUtils]: At program point L290(lines 290 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,682 INFO L77 FloydHoareUtils]: At program point L158(lines 158 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,682 INFO L77 FloydHoareUtils]: At program point L92(lines 92 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,682 INFO L77 FloydHoareUtils]: At program point L621(line 621) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,682 INFO L77 FloydHoareUtils]: At program point L225(lines 225 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,683 INFO L77 FloydHoareUtils]: At program point L359(lines 359 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,683 INFO L77 FloydHoareUtils]: At program point L293(lines 293 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,683 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-25 02:47:25,683 INFO L77 FloydHoareUtils]: At program point L228(lines 228 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,683 INFO L77 FloydHoareUtils]: At program point L296(lines 296 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,683 INFO L77 FloydHoareUtils]: At program point L164(lines 164 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,684 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 39 608) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,684 INFO L77 FloydHoareUtils]: At program point L364(lines 364 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,684 INFO L77 FloydHoareUtils]: At program point L233(lines 233 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,684 INFO L77 FloydHoareUtils]: At program point L101(lines 101 423) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)) (not (and (= ~a17~0 8) (= ~a21~0 1) (= ~a19~0 1) (= ~a28~0 9))))) [2024-11-25 02:47:25,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 25.11 02:47:25 ImpRootNode [2024-11-25 02:47:25,707 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-25 02:47:25,708 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-25 02:47:25,708 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-25 02:47:25,708 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-25 02:47:25,709 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 02:46:44" (3/4) ... [2024-11-25 02:47:25,716 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-11-25 02:47:25,746 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 129 nodes and edges [2024-11-25 02:47:25,750 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-25 02:47:25,751 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-25 02:47:25,752 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-25 02:47:25,925 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf698d4-4d4d-4185-ab82-47d05fe0db23/bin/ukojak-verify-ENZ3QT5qd3/witness.graphml [2024-11-25 02:47:25,925 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf698d4-4d4d-4185-ab82-47d05fe0db23/bin/ukojak-verify-ENZ3QT5qd3/witness.yml [2024-11-25 02:47:25,926 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-25 02:47:25,927 INFO L158 Benchmark]: Toolchain (without parser) took 44384.26ms. Allocated memory was 117.4MB in the beginning and 394.3MB in the end (delta: 276.8MB). Free memory was 91.2MB in the beginning and 316.5MB in the end (delta: -225.3MB). Peak memory consumption was 48.6MB. Max. memory is 16.1GB. [2024-11-25 02:47:25,927 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 117.4MB. Free memory is still 74.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 02:47:25,927 INFO L158 Benchmark]: CACSL2BoogieTranslator took 665.84ms. Allocated memory is still 117.4MB. Free memory was 91.0MB in the beginning and 65.2MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-25 02:47:25,928 INFO L158 Benchmark]: Boogie Procedure Inliner took 110.61ms. Allocated memory is still 117.4MB. Free memory was 65.2MB in the beginning and 60.0MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-25 02:47:25,928 INFO L158 Benchmark]: Boogie Preprocessor took 85.68ms. Allocated memory is still 117.4MB. Free memory was 60.0MB in the beginning and 56.0MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 02:47:25,928 INFO L158 Benchmark]: RCFGBuilder took 2290.87ms. Allocated memory is still 117.4MB. Free memory was 56.0MB in the beginning and 78.4MB in the end (delta: -22.4MB). Peak memory consumption was 40.9MB. Max. memory is 16.1GB. [2024-11-25 02:47:25,929 INFO L158 Benchmark]: CodeCheck took 41007.84ms. Allocated memory was 117.4MB in the beginning and 394.3MB in the end (delta: 276.8MB). Free memory was 78.4MB in the beginning and 328.9MB in the end (delta: -250.6MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. [2024-11-25 02:47:25,929 INFO L158 Benchmark]: Witness Printer took 217.64ms. Allocated memory is still 394.3MB. Free memory was 328.9MB in the beginning and 316.5MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-25 02:47:25,931 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 29.3s, OverallIterations: 35, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 35728 SdHoareTripleChecker+Valid, 151.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 35430 mSDsluCounter, 6337 SdHoareTripleChecker+Invalid, 126.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5347 mSDsCounter, 16188 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 84575 IncrementalHoareTripleChecker+Invalid, 100763 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16188 mSolverCounterUnsat, 990 mSDtfsCounter, 84575 mSolverCounterSat, 2.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32346 GetRequests, 31554 SyntacticMatches, 546 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28747 ImplicationChecksByTransitivity, 12.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 4446 NumberOfCodeBlocks, 4446 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 4412 ConstructedInterpolants, 0 QuantifiedInterpolants, 11955 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 29 PerfectInterpolantSequences, 2117/2165 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: 533]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 39]: Location Invariant Derived location invariant: !(((((a28 < 10) && (a11 == 1)) && (7 < a28)) && (a25 != 1)) && !((((a17 == 8) && (a21 == 1)) && (a19 == 1)) && (a28 == 9))) - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: !(((((a28 < 10) && (a11 == 1)) && (7 < a28)) && (a25 != 1)) && !((((a17 == 8) && (a21 == 1)) && (a19 == 1)) && (a28 == 9))) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.51ms. Allocated memory is still 117.4MB. Free memory is still 74.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 665.84ms. Allocated memory is still 117.4MB. Free memory was 91.0MB in the beginning and 65.2MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 110.61ms. Allocated memory is still 117.4MB. Free memory was 65.2MB in the beginning and 60.0MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.68ms. Allocated memory is still 117.4MB. Free memory was 60.0MB in the beginning and 56.0MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 2290.87ms. Allocated memory is still 117.4MB. Free memory was 56.0MB in the beginning and 78.4MB in the end (delta: -22.4MB). Peak memory consumption was 40.9MB. Max. memory is 16.1GB. * CodeCheck took 41007.84ms. Allocated memory was 117.4MB in the beginning and 394.3MB in the end (delta: 276.8MB). Free memory was 78.4MB in the beginning and 328.9MB in the end (delta: -250.6MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. * Witness Printer took 217.64ms. Allocated memory is still 394.3MB. Free memory was 328.9MB in the beginning and 316.5MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-11-25 02:47:25,959 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf698d4-4d4d-4185-ab82-47d05fe0db23/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE