./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label04.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_b8769628-c5e1-465b-9bf3-c11e03c67846/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8769628-c5e1-465b-9bf3-c11e03c67846/bin/ukojak-verify-CZk0znPC7b/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8769628-c5e1-465b-9bf3-c11e03c67846/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8769628-c5e1-465b-9bf3-c11e03c67846/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label04.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8769628-c5e1-465b-9bf3-c11e03c67846/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8769628-c5e1-465b-9bf3-c11e03c67846/bin/ukojak-verify-CZk0znPC7b --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dfc7a2daf16de8ab0ea0e11c62b30033c40981748d5071b1cd9dbc5bcc0c3347 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 02:17:07,534 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 02:17:07,586 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8769628-c5e1-465b-9bf3-c11e03c67846/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-06 02:17:07,590 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 02:17:07,590 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 02:17:07,608 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 02:17:07,609 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-06 02:17:07,609 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-06 02:17:07,610 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 02:17:07,610 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 02:17:07,610 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 02:17:07,610 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-06 02:17:07,610 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-06 02:17:07,610 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 02:17:07,610 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-06 02:17:07,610 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 02:17:07,610 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-06 02:17:07,611 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 02:17:07,611 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-06 02:17:07,611 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-06 02:17:07,611 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-06 02:17:07,611 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 02:17:07,611 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 02:17:07,611 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 02:17:07,611 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 02:17:07,611 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 02:17:07,611 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 02:17:07,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 02:17:07,611 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 02:17:07,611 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 02:17:07,612 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-06 02:17:07,612 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 02:17:07,612 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 02:17:07,612 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_b8769628-c5e1-465b-9bf3-c11e03c67846/bin/ukojak-verify-CZk0znPC7b Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dfc7a2daf16de8ab0ea0e11c62b30033c40981748d5071b1cd9dbc5bcc0c3347 [2024-12-06 02:17:07,810 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 02:17:07,818 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 02:17:07,820 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 02:17:07,821 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 02:17:07,822 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 02:17:07,823 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8769628-c5e1-465b-9bf3-c11e03c67846/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/eca-rers2012/Problem02_label04.c [2024-12-06 02:17:10,441 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8769628-c5e1-465b-9bf3-c11e03c67846/bin/ukojak-verify-CZk0znPC7b/data/e8fb718ec/2caa1a2c35cc4735b78dcc6b14ce2c14/FLAG54bf76f2a [2024-12-06 02:17:10,656 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 02:17:10,657 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8769628-c5e1-465b-9bf3-c11e03c67846/sv-benchmarks/c/eca-rers2012/Problem02_label04.c [2024-12-06 02:17:10,669 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8769628-c5e1-465b-9bf3-c11e03c67846/bin/ukojak-verify-CZk0znPC7b/data/e8fb718ec/2caa1a2c35cc4735b78dcc6b14ce2c14/FLAG54bf76f2a [2024-12-06 02:17:10,682 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8769628-c5e1-465b-9bf3-c11e03c67846/bin/ukojak-verify-CZk0znPC7b/data/e8fb718ec/2caa1a2c35cc4735b78dcc6b14ce2c14 [2024-12-06 02:17:10,684 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 02:17:10,685 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 02:17:10,686 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 02:17:10,686 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 02:17:10,689 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 02:17:10,690 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:17:10" (1/1) ... [2024-12-06 02:17:10,691 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@284aab7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:17:10, skipping insertion in model container [2024-12-06 02:17:10,691 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:17:10" (1/1) ... [2024-12-06 02:17:10,717 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 02:17:10,934 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_b8769628-c5e1-465b-9bf3-c11e03c67846/sv-benchmarks/c/eca-rers2012/Problem02_label04.c[17470,17483] [2024-12-06 02:17:10,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 02:17:10,964 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 02:17:11,019 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_b8769628-c5e1-465b-9bf3-c11e03c67846/sv-benchmarks/c/eca-rers2012/Problem02_label04.c[17470,17483] [2024-12-06 02:17:11,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 02:17:11,041 INFO L204 MainTranslator]: Completed translation [2024-12-06 02:17:11,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:17:11 WrapperNode [2024-12-06 02:17:11,042 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 02:17:11,042 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 02:17:11,042 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 02:17:11,043 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 02:17:11,047 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:17:11" (1/1) ... [2024-12-06 02:17:11,057 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:17:11" (1/1) ... [2024-12-06 02:17:11,083 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668 [2024-12-06 02:17:11,083 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 02:17:11,084 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 02:17:11,084 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 02:17:11,084 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 02:17:11,091 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:17:11" (1/1) ... [2024-12-06 02:17:11,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:17:11" (1/1) ... [2024-12-06 02:17:11,095 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:17:11" (1/1) ... [2024-12-06 02:17:11,095 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:17:11" (1/1) ... [2024-12-06 02:17:11,111 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:17:11" (1/1) ... [2024-12-06 02:17:11,113 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:17:11" (1/1) ... [2024-12-06 02:17:11,120 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:17:11" (1/1) ... [2024-12-06 02:17:11,125 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:17:11" (1/1) ... [2024-12-06 02:17:11,127 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:17:11" (1/1) ... [2024-12-06 02:17:11,133 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 02:17:11,134 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 02:17:11,134 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 02:17:11,134 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 02:17:11,135 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:17:11" (1/1) ... [2024-12-06 02:17:11,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 02:17:11,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8769628-c5e1-465b-9bf3-c11e03c67846/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 02:17:11,164 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8769628-c5e1-465b-9bf3-c11e03c67846/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 02:17:11,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8769628-c5e1-465b-9bf3-c11e03c67846/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 02:17:11,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-06 02:17:11,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-06 02:17:11,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 02:17:11,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 02:17:11,248 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 02:17:11,249 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 02:17:12,091 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-12-06 02:17:12,092 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 02:17:12,282 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 02:17:12,282 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-06 02:17:12,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:17:12 BoogieIcfgContainer [2024-12-06 02:17:12,283 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 02:17:12,283 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 02:17:12,284 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 02:17:12,290 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 02:17:12,291 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:17:12" (1/1) ... [2024-12-06 02:17:12,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 02:17:12,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:12,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 85 states and 162 transitions. [2024-12-06 02:17:12,340 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 162 transitions. [2024-12-06 02:17:12,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-12-06 02:17:12,343 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:12,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:12,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:12,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:17:13,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:13,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 163 states and 250 transitions. [2024-12-06 02:17:13,306 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 250 transitions. [2024-12-06 02:17:13,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-12-06 02:17:13,308 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:13,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:13,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:13,505 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:17:14,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:14,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 242 states and 332 transitions. [2024-12-06 02:17:14,220 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 332 transitions. [2024-12-06 02:17:14,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-12-06 02:17:14,222 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:14,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:14,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:14,311 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:17:14,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:14,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 251 states and 343 transitions. [2024-12-06 02:17:14,406 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 343 transitions. [2024-12-06 02:17:14,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-12-06 02:17:14,409 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:14,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:14,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:14,494 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:17:14,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:14,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 256 states and 348 transitions. [2024-12-06 02:17:14,536 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 348 transitions. [2024-12-06 02:17:14,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-12-06 02:17:14,538 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:14,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:14,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:14,624 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 02:17:14,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:14,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 270 states and 364 transitions. [2024-12-06 02:17:14,794 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 364 transitions. [2024-12-06 02:17:14,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-12-06 02:17:14,795 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:14,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:14,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:14,873 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:17:14,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:14,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 277 states and 371 transitions. [2024-12-06 02:17:14,928 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 371 transitions. [2024-12-06 02:17:14,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-12-06 02:17:14,929 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:14,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:14,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:15,021 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:17:15,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:15,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 283 states and 377 transitions. [2024-12-06 02:17:15,070 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 377 transitions. [2024-12-06 02:17:15,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-12-06 02:17:15,071 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:15,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:15,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:15,185 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:17:15,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:15,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 307 states and 404 transitions. [2024-12-06 02:17:15,457 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 404 transitions. [2024-12-06 02:17:15,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-12-06 02:17:15,460 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:15,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:15,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:15,538 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:17:16,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:16,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 386 states and 502 transitions. [2024-12-06 02:17:16,202 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 502 transitions. [2024-12-06 02:17:16,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-12-06 02:17:16,203 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:16,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:16,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:16,263 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:17:16,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:16,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 410 states and 529 transitions. [2024-12-06 02:17:16,519 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 529 transitions. [2024-12-06 02:17:16,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-12-06 02:17:16,521 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:16,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:16,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:16,614 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-12-06 02:17:16,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:16,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 413 states and 534 transitions. [2024-12-06 02:17:16,773 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 534 transitions. [2024-12-06 02:17:16,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-12-06 02:17:16,775 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:16,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:16,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:16,851 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-12-06 02:17:16,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:16,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 422 states and 544 transitions. [2024-12-06 02:17:16,982 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 544 transitions. [2024-12-06 02:17:16,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-12-06 02:17:16,984 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:16,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:17,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:17,087 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-12-06 02:17:17,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:17,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 440 states and 565 transitions. [2024-12-06 02:17:17,281 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 565 transitions. [2024-12-06 02:17:17,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-12-06 02:17:17,282 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:17,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:17,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:17,352 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-12-06 02:17:17,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:17,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 443 states and 568 transitions. [2024-12-06 02:17:17,399 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 568 transitions. [2024-12-06 02:17:17,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-12-06 02:17:17,400 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:17,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:17,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:17,726 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 47 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:17:18,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:18,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 487 states and 619 transitions. [2024-12-06 02:17:18,714 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 619 transitions. [2024-12-06 02:17:18,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-12-06 02:17:18,716 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:18,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:18,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:18,841 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:17:19,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:19,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 566 states and 704 transitions. [2024-12-06 02:17:19,532 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 704 transitions. [2024-12-06 02:17:19,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-12-06 02:17:19,534 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:19,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:19,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:19,675 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 02:17:20,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:20,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 590 states and 733 transitions. [2024-12-06 02:17:20,050 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 733 transitions. [2024-12-06 02:17:20,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-12-06 02:17:20,052 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:20,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:20,134 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-12-06 02:17:20,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:20,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 611 states and 757 transitions. [2024-12-06 02:17:20,660 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 757 transitions. [2024-12-06 02:17:20,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-12-06 02:17:20,662 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:20,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:20,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:20,944 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 56 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:17:21,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:21,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 658 states and 815 transitions. [2024-12-06 02:17:21,561 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 815 transitions. [2024-12-06 02:17:21,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-12-06 02:17:21,562 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:21,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:21,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:21,621 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-12-06 02:17:21,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:21,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 661 states and 820 transitions. [2024-12-06 02:17:21,768 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 820 transitions. [2024-12-06 02:17:21,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-12-06 02:17:21,770 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:21,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:21,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:21,852 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-06 02:17:22,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:22,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 665 states and 826 transitions. [2024-12-06 02:17:22,283 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 826 transitions. [2024-12-06 02:17:22,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-12-06 02:17:22,285 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:22,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:22,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:22,348 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 02:17:23,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:23,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 680 states and 848 transitions. [2024-12-06 02:17:23,109 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 848 transitions. [2024-12-06 02:17:23,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-12-06 02:17:23,110 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:23,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:23,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:23,202 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-06 02:17:23,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:23,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 691 states and 859 transitions. [2024-12-06 02:17:23,574 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 859 transitions. [2024-12-06 02:17:23,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-12-06 02:17:23,575 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:23,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:23,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:23,616 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-12-06 02:17:24,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:24,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 721 states and 893 transitions. [2024-12-06 02:17:24,212 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 893 transitions. [2024-12-06 02:17:24,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-12-06 02:17:24,212 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:24,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:24,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:24,253 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 02:17:24,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:24,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 755 states and 930 transitions. [2024-12-06 02:17:24,450 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 930 transitions. [2024-12-06 02:17:24,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-12-06 02:17:24,451 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:24,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:24,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:24,525 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 02:17:24,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:24,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 774 states and 951 transitions. [2024-12-06 02:17:24,778 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 951 transitions. [2024-12-06 02:17:24,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-12-06 02:17:24,779 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:24,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:24,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:25,083 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 74 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-12-06 02:17:25,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:25,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 822 states and 1006 transitions. [2024-12-06 02:17:25,856 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1006 transitions. [2024-12-06 02:17:25,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-12-06 02:17:25,857 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:25,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:25,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:26,165 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 69 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:17:26,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:26,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 887 states and 1075 transitions. [2024-12-06 02:17:26,947 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1075 transitions. [2024-12-06 02:17:26,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-12-06 02:17:26,948 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:26,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:26,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:27,220 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 65 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:17:28,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:28,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 998 states and 1193 transitions. [2024-12-06 02:17:28,503 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1193 transitions. [2024-12-06 02:17:28,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-12-06 02:17:28,504 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:28,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:28,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:28,547 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-12-06 02:17:28,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:28,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1006 states and 1204 transitions. [2024-12-06 02:17:28,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1204 transitions. [2024-12-06 02:17:28,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-12-06 02:17:28,769 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:28,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:28,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:28,864 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-12-06 02:17:29,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:29,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1008 states and 1210 transitions. [2024-12-06 02:17:29,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1210 transitions. [2024-12-06 02:17:29,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-12-06 02:17:29,076 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:29,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:29,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:29,145 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-12-06 02:17:29,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:29,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1009 states and 1210 transitions. [2024-12-06 02:17:29,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1210 transitions. [2024-12-06 02:17:29,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-06 02:17:29,269 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:29,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:29,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:29,356 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-12-06 02:17:29,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:29,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1010 states and 1210 transitions. [2024-12-06 02:17:29,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1210 transitions. [2024-12-06 02:17:29,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-12-06 02:17:29,402 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:29,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:29,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:29,504 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-12-06 02:17:29,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:29,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 929 states and 1116 transitions. [2024-12-06 02:17:29,546 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1116 transitions. [2024-12-06 02:17:29,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-12-06 02:17:29,546 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 35 iterations. [2024-12-06 02:17:29,553 INFO L726 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-12-06 02:17:37,706 INFO L77 FloydHoareUtils]: At program point L499-1(lines 39 608) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)))) [2024-12-06 02:17:37,706 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-12-06 02:17:37,707 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-12-06 02:17:37,707 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-12-06 02:17:37,707 INFO L75 FloydHoareUtils]: For program point L500(line 500) no Hoare annotation was computed. [2024-12-06 02:17:37,707 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-12-06 02:17:37,707 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-12-06 02:17:37,707 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-12-06 02:17:37,707 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-12-06 02:17:37,707 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-12-06 02:17:37,708 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-12-06 02:17:37,708 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-12-06 02:17:37,708 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-12-06 02:17:37,708 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-12-06 02:17:37,708 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-12-06 02:17:37,708 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-12-06 02:17:37,708 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-12-06 02:17:37,708 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-12-06 02:17:37,709 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-12-06 02:17:37,709 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-12-06 02:17:37,709 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-12-06 02:17:37,709 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-12-06 02:17:37,709 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-12-06 02:17:37,709 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-12-06 02:17:37,709 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-12-06 02:17:37,709 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-12-06 02:17:37,710 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-12-06 02:17:37,710 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-12-06 02:17:37,710 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-12-06 02:17:37,710 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-12-06 02:17:37,710 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-12-06 02:17:37,710 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-12-06 02:17:37,710 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-12-06 02:17:37,710 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-12-06 02:17:37,711 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-12-06 02:17:37,711 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-12-06 02:17:37,711 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-12-06 02:17:37,711 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-12-06 02:17:37,711 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 500) no Hoare annotation was computed. [2024-12-06 02:17:37,711 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-12-06 02:17:37,711 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-12-06 02:17:37,711 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-12-06 02:17:37,711 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-12-06 02:17:37,712 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-12-06 02:17:37,712 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-12-06 02:17:37,712 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-12-06 02:17:37,712 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-12-06 02:17:37,712 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-12-06 02:17:37,712 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-12-06 02:17:37,712 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-12-06 02:17:37,712 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-12-06 02:17:37,712 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-12-06 02:17:37,713 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-12-06 02:17:37,713 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-12-06 02:17:37,713 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-12-06 02:17:37,713 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-12-06 02:17:37,713 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-12-06 02:17:37,713 INFO L77 FloydHoareUtils]: At program point L610(lines 610 627) the Hoare annotation is: true [2024-12-06 02:17:37,713 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-12-06 02:17:37,713 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-12-06 02:17:37,713 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-12-06 02:17:37,713 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-12-06 02:17:37,714 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-12-06 02:17:37,714 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-12-06 02:17:37,714 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-12-06 02:17:37,714 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-12-06 02:17:37,714 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-12-06 02:17:37,714 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-12-06 02:17:37,714 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-12-06 02:17:37,714 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-12-06 02:17:37,714 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-12-06 02:17:37,714 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-12-06 02:17:37,714 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-12-06 02:17:37,714 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-12-06 02:17:37,714 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-12-06 02:17:37,714 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-12-06 02:17:37,714 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-12-06 02:17:37,714 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-12-06 02:17:37,715 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-12-06 02:17:37,715 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-12-06 02:17:37,715 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-12-06 02:17:37,715 INFO L77 FloydHoareUtils]: At program point L496-1(lines 39 608) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0) (not (= ~a25~0 1)))) [2024-12-06 02:17:37,715 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-12-06 02:17:37,715 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-12-06 02:17:37,715 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-12-06 02:17:37,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 06.12 02:17:37 ImpRootNode [2024-12-06 02:17:37,727 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-06 02:17:37,728 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-06 02:17:37,728 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-06 02:17:37,728 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-06 02:17:37,728 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:17:12" (3/4) ... [2024-12-06 02:17:37,730 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-12-06 02:17:37,743 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 129 nodes and edges [2024-12-06 02:17:37,744 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-12-06 02:17:37,745 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-12-06 02:17:37,746 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-12-06 02:17:37,855 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8769628-c5e1-465b-9bf3-c11e03c67846/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-06 02:17:37,855 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8769628-c5e1-465b-9bf3-c11e03c67846/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-06 02:17:37,855 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-06 02:17:37,856 INFO L158 Benchmark]: Toolchain (without parser) took 27170.88ms. Allocated memory was 117.4MB in the beginning and 394.3MB in the end (delta: 276.8MB). Free memory was 90.7MB in the beginning and 253.4MB in the end (delta: -162.6MB). Peak memory consumption was 116.0MB. Max. memory is 16.1GB. [2024-12-06 02:17:37,857 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 117.4MB. Free memory is still 73.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 02:17:37,857 INFO L158 Benchmark]: CACSL2BoogieTranslator took 355.70ms. Allocated memory is still 117.4MB. Free memory was 90.6MB in the beginning and 64.6MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-06 02:17:37,857 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.10ms. Allocated memory is still 117.4MB. Free memory was 64.6MB in the beginning and 59.4MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 02:17:37,857 INFO L158 Benchmark]: Boogie Preprocessor took 49.42ms. Allocated memory is still 117.4MB. Free memory was 59.4MB in the beginning and 55.4MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 02:17:37,858 INFO L158 Benchmark]: RCFGBuilder took 1148.90ms. Allocated memory is still 117.4MB. Free memory was 55.4MB in the beginning and 28.5MB in the end (delta: 26.9MB). Peak memory consumption was 41.3MB. Max. memory is 16.1GB. [2024-12-06 02:17:37,858 INFO L158 Benchmark]: CodeCheck took 25443.47ms. Allocated memory was 117.4MB in the beginning and 394.3MB in the end (delta: 276.8MB). Free memory was 28.5MB in the beginning and 266.0MB in the end (delta: -237.5MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. [2024-12-06 02:17:37,858 INFO L158 Benchmark]: Witness Printer took 127.98ms. Allocated memory is still 394.3MB. Free memory was 266.0MB in the beginning and 253.4MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-06 02:17:37,860 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: 17.2s, 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, 94.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 35430 mSDsluCounter, 6337 SdHoareTripleChecker+Invalid, 79.0s 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, 1.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32346 GetRequests, 31554 SyntacticMatches, 546 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28747 ImplicationChecksByTransitivity, 7.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.4s 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: 500]: 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.27ms. Allocated memory is still 117.4MB. Free memory is still 73.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 355.70ms. Allocated memory is still 117.4MB. Free memory was 90.6MB in the beginning and 64.6MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.10ms. Allocated memory is still 117.4MB. Free memory was 64.6MB in the beginning and 59.4MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.42ms. Allocated memory is still 117.4MB. Free memory was 59.4MB in the beginning and 55.4MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1148.90ms. Allocated memory is still 117.4MB. Free memory was 55.4MB in the beginning and 28.5MB in the end (delta: 26.9MB). Peak memory consumption was 41.3MB. Max. memory is 16.1GB. * CodeCheck took 25443.47ms. Allocated memory was 117.4MB in the beginning and 394.3MB in the end (delta: 276.8MB). Free memory was 28.5MB in the beginning and 266.0MB in the end (delta: -237.5MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. * Witness Printer took 127.98ms. Allocated memory is still 394.3MB. Free memory was 266.0MB in the beginning and 253.4MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-12-06 02:17:37,879 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8769628-c5e1-465b-9bf3-c11e03c67846/bin/ukojak-verify-CZk0znPC7b/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