./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/reducercommutativity/rangesum10.i --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_08335f24-2234-4004-9354-2b0f8a0c8882/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08335f24-2234-4004-9354-2b0f8a0c8882/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_08335f24-2234-4004-9354-2b0f8a0c8882/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08335f24-2234-4004-9354-2b0f8a0c8882/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/reducercommutativity/rangesum10.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08335f24-2234-4004-9354-2b0f8a0c8882/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_08335f24-2234-4004-9354-2b0f8a0c8882/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 43671c88cb28f81a53d6c7fbea907e55b0f99c68f8a522c4103c0a12ddf9f652 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 02:24:38,156 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 02:24:38,211 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08335f24-2234-4004-9354-2b0f8a0c8882/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-06 02:24:38,215 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 02:24:38,215 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 02:24:38,235 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 02:24:38,235 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-06 02:24:38,236 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-06 02:24:38,236 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 02:24:38,236 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 02:24:38,236 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 02:24:38,236 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-06 02:24:38,236 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-06 02:24:38,236 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 02:24:38,237 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-06 02:24:38,237 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 02:24:38,237 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-06 02:24:38,237 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 02:24:38,237 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-06 02:24:38,237 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-06 02:24:38,237 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-06 02:24:38,237 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 02:24:38,237 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 02:24:38,237 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 02:24:38,237 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 02:24:38,238 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 02:24:38,238 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 02:24:38,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 02:24:38,238 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 02:24:38,238 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 02:24:38,238 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-06 02:24:38,238 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 02:24:38,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 02:24:38,238 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_08335f24-2234-4004-9354-2b0f8a0c8882/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 -> 43671c88cb28f81a53d6c7fbea907e55b0f99c68f8a522c4103c0a12ddf9f652 [2024-12-06 02:24:38,468 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 02:24:38,476 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 02:24:38,478 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 02:24:38,479 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 02:24:38,480 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 02:24:38,481 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08335f24-2234-4004-9354-2b0f8a0c8882/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/reducercommutativity/rangesum10.i [2024-12-06 02:24:41,218 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08335f24-2234-4004-9354-2b0f8a0c8882/bin/ukojak-verify-CZk0znPC7b/data/31046165f/b254c55f6b57455e8779ecdb348d9c75/FLAGc7006743e [2024-12-06 02:24:41,404 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 02:24:41,405 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08335f24-2234-4004-9354-2b0f8a0c8882/sv-benchmarks/c/reducercommutativity/rangesum10.i [2024-12-06 02:24:41,413 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08335f24-2234-4004-9354-2b0f8a0c8882/bin/ukojak-verify-CZk0znPC7b/data/31046165f/b254c55f6b57455e8779ecdb348d9c75/FLAGc7006743e [2024-12-06 02:24:41,768 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08335f24-2234-4004-9354-2b0f8a0c8882/bin/ukojak-verify-CZk0znPC7b/data/31046165f/b254c55f6b57455e8779ecdb348d9c75 [2024-12-06 02:24:41,770 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 02:24:41,771 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 02:24:41,772 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 02:24:41,772 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 02:24:41,774 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 02:24:41,775 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:24:41" (1/1) ... [2024-12-06 02:24:41,776 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@644b2f91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:24:41, skipping insertion in model container [2024-12-06 02:24:41,776 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:24:41" (1/1) ... [2024-12-06 02:24:41,786 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 02:24:41,905 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_08335f24-2234-4004-9354-2b0f8a0c8882/sv-benchmarks/c/reducercommutativity/rangesum10.i[1465,1478] [2024-12-06 02:24:41,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 02:24:41,916 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 02:24:41,935 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_08335f24-2234-4004-9354-2b0f8a0c8882/sv-benchmarks/c/reducercommutativity/rangesum10.i[1465,1478] [2024-12-06 02:24:41,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 02:24:41,947 INFO L204 MainTranslator]: Completed translation [2024-12-06 02:24:41,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:24:41 WrapperNode [2024-12-06 02:24:41,948 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 02:24:41,948 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 02:24:41,949 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 02:24:41,949 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 02:24:41,953 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:24:41" (1/1) ... [2024-12-06 02:24:41,958 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:24:41" (1/1) ... [2024-12-06 02:24:41,974 INFO L138 Inliner]: procedures = 17, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 69 [2024-12-06 02:24:41,975 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 02:24:41,975 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 02:24:41,975 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 02:24:41,976 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 02:24:41,981 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:24:41" (1/1) ... [2024-12-06 02:24:41,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:24:41" (1/1) ... [2024-12-06 02:24:41,983 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:24:41" (1/1) ... [2024-12-06 02:24:41,983 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:24:41" (1/1) ... [2024-12-06 02:24:41,989 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:24:41" (1/1) ... [2024-12-06 02:24:41,989 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:24:41" (1/1) ... [2024-12-06 02:24:41,993 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:24:41" (1/1) ... [2024-12-06 02:24:41,994 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:24:41" (1/1) ... [2024-12-06 02:24:41,995 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:24:41" (1/1) ... [2024-12-06 02:24:41,997 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 02:24:41,997 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 02:24:41,998 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 02:24:41,998 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 02:24:41,999 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:24:41" (1/1) ... [2024-12-06 02:24:42,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 02:24:42,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08335f24-2234-4004-9354-2b0f8a0c8882/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 02:24:42,023 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08335f24-2234-4004-9354-2b0f8a0c8882/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:24:42,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08335f24-2234-4004-9354-2b0f8a0c8882/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:24:42,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-06 02:24:42,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-06 02:24:42,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-12-06 02:24:42,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-12-06 02:24:42,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 02:24:42,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 02:24:42,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-12-06 02:24:42,047 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2024-12-06 02:24:42,047 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2024-12-06 02:24:42,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-12-06 02:24:42,103 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 02:24:42,105 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 02:24:42,231 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-12-06 02:24:42,231 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 02:24:42,278 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 02:24:42,278 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2024-12-06 02:24:42,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:24:42 BoogieIcfgContainer [2024-12-06 02:24:42,278 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 02:24:42,279 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 02:24:42,279 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 02:24:42,289 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 02:24:42,289 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:24:42" (1/1) ... [2024-12-06 02:24:42,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 02:24:42,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:24:42,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 17 states and 22 transitions. [2024-12-06 02:24:42,344 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2024-12-06 02:24:42,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-06 02:24:42,348 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:24:42,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:24:42,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:24:42,587 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-12-06 02:24:42,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:24:42,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 18 states and 23 transitions. [2024-12-06 02:24:42,640 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2024-12-06 02:24:42,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-06 02:24:42,640 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:24:42,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:24:42,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:24:42,772 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-12-06 02:24:42,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:24:42,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 19 states and 25 transitions. [2024-12-06 02:24:42,824 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2024-12-06 02:24:42,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 02:24:42,824 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:24:42,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:24:42,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:24:42,916 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 02:24:42,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:24:42,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 20 states and 27 transitions. [2024-12-06 02:24:42,948 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2024-12-06 02:24:42,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-06 02:24:42,949 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:24:42,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:24:42,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:24:43,040 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 02:24:43,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:24:43,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 21 states and 29 transitions. [2024-12-06 02:24:43,095 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 29 transitions. [2024-12-06 02:24:43,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-12-06 02:24:43,096 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:24:43,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:24:43,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:24:43,203 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-12-06 02:24:43,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:24:43,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 22 states and 31 transitions. [2024-12-06 02:24:43,233 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2024-12-06 02:24:43,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-12-06 02:24:43,234 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:24:43,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:24:43,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:24:43,341 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-12-06 02:24:43,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:24:43,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 23 states and 33 transitions. [2024-12-06 02:24:43,404 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 33 transitions. [2024-12-06 02:24:43,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-12-06 02:24:43,404 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:24:43,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:24:43,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:24:43,524 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-12-06 02:24:43,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:24:43,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 24 states and 34 transitions. [2024-12-06 02:24:43,587 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2024-12-06 02:24:43,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-12-06 02:24:43,588 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:24:43,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:24:43,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:24:43,728 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-12-06 02:24:43,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:24:43,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 25 states and 35 transitions. [2024-12-06 02:24:43,803 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2024-12-06 02:24:43,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-12-06 02:24:43,804 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:24:43,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:24:43,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:24:43,976 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-12-06 02:24:44,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:24:44,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 26 states and 36 transitions. [2024-12-06 02:24:44,054 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2024-12-06 02:24:44,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-12-06 02:24:44,054 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:24:44,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:24:44,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:24:44,236 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-12-06 02:24:44,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:24:44,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 27 states and 37 transitions. [2024-12-06 02:24:44,315 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2024-12-06 02:24:44,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-12-06 02:24:44,316 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:24:44,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:24:44,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:24:44,470 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-12-06 02:24:44,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:24:44,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 28 states and 38 transitions. [2024-12-06 02:24:44,552 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2024-12-06 02:24:44,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 02:24:44,553 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:24:44,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:24:44,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:24:44,716 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-12-06 02:24:44,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:24:44,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 29 states and 39 transitions. [2024-12-06 02:24:44,798 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2024-12-06 02:24:44,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-06 02:24:44,799 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:24:44,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:24:44,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:24:44,978 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-12-06 02:24:45,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:24:45,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 30 states and 40 transitions. [2024-12-06 02:24:45,068 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2024-12-06 02:24:45,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 02:24:45,069 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:24:45,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:24:45,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:24:45,254 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-12-06 02:24:45,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:24:45,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 31 states and 40 transitions. [2024-12-06 02:24:45,342 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2024-12-06 02:24:45,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-06 02:24:45,343 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:24:45,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:24:45,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:24:45,462 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-12-06 02:24:45,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:24:45,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 32 states and 41 transitions. [2024-12-06 02:24:45,557 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2024-12-06 02:24:45,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-12-06 02:24:45,558 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:24:45,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:24:45,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:24:45,687 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-12-06 02:24:45,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:24:45,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 33 states and 42 transitions. [2024-12-06 02:24:45,786 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2024-12-06 02:24:45,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-12-06 02:24:45,786 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:24:45,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:24:45,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:24:45,931 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-12-06 02:24:46,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:24:46,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 34 states and 43 transitions. [2024-12-06 02:24:46,041 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2024-12-06 02:24:46,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-12-06 02:24:46,042 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:24:46,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:24:46,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:24:46,209 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 89 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-12-06 02:24:46,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:24:46,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 35 states and 44 transitions. [2024-12-06 02:24:46,317 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2024-12-06 02:24:46,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-12-06 02:24:46,317 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:24:46,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:24:46,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:24:46,503 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-12-06 02:24:46,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:24:46,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 36 states and 45 transitions. [2024-12-06 02:24:46,610 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2024-12-06 02:24:46,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-12-06 02:24:46,611 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:24:46,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:24:46,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:24:46,814 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 0 proven. 158 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2024-12-06 02:24:46,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:24:46,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 37 states and 46 transitions. [2024-12-06 02:24:46,925 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2024-12-06 02:24:46,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-12-06 02:24:46,926 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:24:46,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:24:46,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:24:47,154 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2024-12-06 02:24:47,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:24:47,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 38 states and 47 transitions. [2024-12-06 02:24:47,273 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2024-12-06 02:24:47,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-12-06 02:24:47,274 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:24:47,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:24:47,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:24:47,518 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2024-12-06 02:24:47,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:24:47,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 39 states and 47 transitions. [2024-12-06 02:24:47,645 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2024-12-06 02:24:47,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-12-06 02:24:47,645 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:24:47,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:24:47,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:24:47,802 INFO L134 CoverageAnalysis]: Checked inductivity of 592 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2024-12-06 02:24:47,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:24:47,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 40 states and 48 transitions. [2024-12-06 02:24:47,934 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2024-12-06 02:24:47,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-12-06 02:24:47,934 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:24:47,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:24:47,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:24:48,108 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2024-12-06 02:24:48,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:24:48,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 41 states and 49 transitions. [2024-12-06 02:24:48,232 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2024-12-06 02:24:48,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-12-06 02:24:48,233 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:24:48,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:24:48,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:24:48,438 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2024-12-06 02:24:48,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:24:48,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 42 states and 50 transitions. [2024-12-06 02:24:48,579 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2024-12-06 02:24:48,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-12-06 02:24:48,580 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:24:48,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:24:48,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:24:48,812 INFO L134 CoverageAnalysis]: Checked inductivity of 604 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2024-12-06 02:24:48,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:24:48,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 43 states and 51 transitions. [2024-12-06 02:24:48,929 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2024-12-06 02:24:48,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-12-06 02:24:48,930 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:24:48,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:24:48,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:24:49,093 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2024-12-06 02:24:49,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:24:49,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 44 states and 52 transitions. [2024-12-06 02:24:49,223 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2024-12-06 02:24:49,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-12-06 02:24:49,223 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:24:49,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:24:49,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:24:49,399 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2024-12-06 02:24:49,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:24:49,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 45 states and 53 transitions. [2024-12-06 02:24:49,535 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2024-12-06 02:24:49,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-12-06 02:24:49,535 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:24:49,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:24:49,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:24:49,709 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2024-12-06 02:24:49,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:24:49,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 46 states and 53 transitions. [2024-12-06 02:24:49,856 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2024-12-06 02:24:49,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-12-06 02:24:49,857 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:24:49,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:24:50,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 02:24:51,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 02:24:51,387 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-06 02:24:51,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 02:24:51,788 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 30 iterations. [2024-12-06 02:24:51,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 06.12 02:24:51 ImpRootNode [2024-12-06 02:24:51,844 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-06 02:24:51,844 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-06 02:24:51,844 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-06 02:24:51,845 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-06 02:24:51,845 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:24:42" (3/4) ... [2024-12-06 02:24:51,846 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-12-06 02:24:51,908 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 97. [2024-12-06 02:24:51,986 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08335f24-2234-4004-9354-2b0f8a0c8882/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-06 02:24:51,987 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08335f24-2234-4004-9354-2b0f8a0c8882/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-06 02:24:51,987 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-06 02:24:51,988 INFO L158 Benchmark]: Toolchain (without parser) took 10216.93ms. Allocated memory was 117.4MB in the beginning and 243.3MB in the end (delta: 125.8MB). Free memory was 92.7MB in the beginning and 146.9MB in the end (delta: -54.2MB). Peak memory consumption was 70.5MB. Max. memory is 16.1GB. [2024-12-06 02:24:51,988 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 117.4MB. Free memory is still 72.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 02:24:51,988 INFO L158 Benchmark]: CACSL2BoogieTranslator took 176.37ms. Allocated memory is still 117.4MB. Free memory was 92.4MB in the beginning and 81.4MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 02:24:51,989 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.43ms. Allocated memory is still 117.4MB. Free memory was 81.1MB in the beginning and 80.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 02:24:51,989 INFO L158 Benchmark]: Boogie Preprocessor took 21.38ms. Allocated memory is still 117.4MB. Free memory was 80.1MB in the beginning and 79.0MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 02:24:51,989 INFO L158 Benchmark]: RCFGBuilder took 280.95ms. Allocated memory is still 117.4MB. Free memory was 79.0MB in the beginning and 63.7MB in the end (delta: 15.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 02:24:51,990 INFO L158 Benchmark]: CodeCheck took 9564.83ms. Allocated memory was 117.4MB in the beginning and 243.3MB in the end (delta: 125.8MB). Free memory was 63.7MB in the beginning and 157.8MB in the end (delta: -94.1MB). Peak memory consumption was 36.9MB. Max. memory is 16.1GB. [2024-12-06 02:24:51,990 INFO L158 Benchmark]: Witness Printer took 142.59ms. Allocated memory is still 243.3MB. Free memory was 157.8MB in the beginning and 146.9MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 02:24:51,992 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 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.5s, OverallIterations: 30, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1187 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 377 SdHoareTripleChecker+Invalid, 4.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1684 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2068 IncrementalHoareTripleChecker+Invalid, 3752 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1684 mSolverCounterUnsat, 377 mSDtfsCounter, 2068 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6062 GetRequests, 5852 SyntacticMatches, 100 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4578 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 1325 NumberOfCodeBlocks, 1325 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1227 ConstructedInterpolants, 0 QuantifiedInterpolants, 1537 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 2 PerfectInterpolantSequences, 5816/7056 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 - CounterExampleResult [Line: 61]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L42] int x[10]; [L43] CALL init_nondet(x) [L16] int i; [L17] i = 0 VAL [i=0, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=1, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=2, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=3, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=4, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=5, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=6, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=7, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=8, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=9, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=10, x={3:0}] [L17] COND FALSE !(i < 10) [L43] RET init_nondet(x) [L44] int temp; [L45] int ret; [L46] int ret2; [L47] int ret5; VAL [x={3:0}] [L49] CALL, EXPR rangesum(x) VAL [\old(x)={3:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] COND TRUE i < 10 [L29] COND FALSE !(i > 10/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] COND TRUE i < 10 [L29] COND FALSE !(i > 10/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] COND TRUE i < 10 [L29] COND FALSE !(i > 10/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] COND TRUE i < 10 [L29] COND FALSE !(i > 10/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L28] COND TRUE i < 10 [L29] COND FALSE !(i > 10/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L28] COND TRUE i < 10 [L29] COND FALSE !(i > 10/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L28] COND TRUE i < 10 [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={3:0}, cnt=1, i=7, ret=-9, x={3:0}] [L28] COND TRUE i < 10 [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={3:0}, cnt=2, i=8, ret=-8, x={3:0}] [L28] COND TRUE i < 10 [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={3:0}, cnt=3, i=9, ret=-7, x={3:0}] [L28] COND TRUE i < 10 [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={3:0}, cnt=4, i=10, ret=-5, x={3:0}] [L28] COND FALSE !(i < 10) [L34] COND TRUE cnt !=0 [L35] return ret / cnt; [L49] RET, EXPR rangesum(x) VAL [x={3:0}] [L49] ret = rangesum(x) [L51] EXPR x[0] [L51] temp=x[0] [L51] EXPR x[1] [L51] x[0] = x[1] [L51] x[1] = temp VAL [ret=-1, x={3:0}] [L52] CALL, EXPR rangesum(x) VAL [\old(x)={3:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] COND TRUE i < 10 [L29] COND FALSE !(i > 10/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] COND TRUE i < 10 [L29] COND FALSE !(i > 10/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] COND TRUE i < 10 [L29] COND FALSE !(i > 10/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] COND TRUE i < 10 [L29] COND FALSE !(i > 10/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L28] COND TRUE i < 10 [L29] COND FALSE !(i > 10/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L28] COND TRUE i < 10 [L29] COND FALSE !(i > 10/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L28] COND TRUE i < 10 [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={3:0}, cnt=1, i=7, ret=-9, x={3:0}] [L28] COND TRUE i < 10 [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={3:0}, cnt=2, i=8, ret=-8, x={3:0}] [L28] COND TRUE i < 10 [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={3:0}, cnt=3, i=9, ret=-7, x={3:0}] [L28] COND TRUE i < 10 [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={3:0}, cnt=4, i=10, ret=-5, x={3:0}] [L28] COND FALSE !(i < 10) [L34] COND TRUE cnt !=0 [L35] return ret / cnt; [L52] RET, EXPR rangesum(x) VAL [ret=-1, x={3:0}] [L52] ret2 = rangesum(x) [L53] EXPR x[0] [L53] temp=x[0] [L54] int i =0 ; VAL [i=0, ret2=-1, ret=-1, temp=3, x={3:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=1, ret2=-1, ret=-1, temp=3, x={3:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=2, ret2=-1, ret=-1, temp=3, x={3:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=3, ret2=-1, ret=-1, temp=3, x={3:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=4, ret2=-1, ret=-1, temp=3, x={3:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=5, ret2=-1, ret=-1, temp=3, x={3:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=6, ret2=-1, ret=-1, temp=3, x={3:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=7, ret2=-1, ret=-1, temp=3, x={3:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=8, ret2=-1, ret=-1, temp=3, x={3:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=9, ret2=-1, ret=-1, temp=3, x={3:0}] [L54] COND FALSE !(i<10 -1) [L57] x[10 -1] = temp VAL [ret2=-1, ret=-1, x={3:0}] [L58] CALL, EXPR rangesum(x) VAL [\old(x)={3:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] COND TRUE i < 10 [L29] COND FALSE !(i > 10/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] COND TRUE i < 10 [L29] COND FALSE !(i > 10/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] COND TRUE i < 10 [L29] COND FALSE !(i > 10/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] COND TRUE i < 10 [L29] COND FALSE !(i > 10/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L28] COND TRUE i < 10 [L29] COND FALSE !(i > 10/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L28] COND TRUE i < 10 [L29] COND FALSE !(i > 10/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L28] COND TRUE i < 10 [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={3:0}, cnt=1, i=7, ret=1, x={3:0}] [L28] COND TRUE i < 10 [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={3:0}, cnt=2, i=8, ret=2, x={3:0}] [L28] COND TRUE i < 10 [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={3:0}, cnt=3, i=9, ret=4, x={3:0}] [L28] COND TRUE i < 10 [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={3:0}, cnt=4, i=10, ret=7, x={3:0}] [L28] COND FALSE !(i < 10) [L34] COND TRUE cnt !=0 [L35] return ret / cnt; [L58] RET, EXPR rangesum(x) VAL [ret2=-1, ret=-1, x={3:0}] [L58] ret5 = rangesum(x) [L60] COND TRUE ret != ret2 || ret !=ret5 VAL [x={3:0}] [L61] reach_error() VAL [x={3:0}] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 117.4MB. Free memory is still 72.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 176.37ms. Allocated memory is still 117.4MB. Free memory was 92.4MB in the beginning and 81.4MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.43ms. Allocated memory is still 117.4MB. Free memory was 81.1MB in the beginning and 80.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.38ms. Allocated memory is still 117.4MB. Free memory was 80.1MB in the beginning and 79.0MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 280.95ms. Allocated memory is still 117.4MB. Free memory was 79.0MB in the beginning and 63.7MB in the end (delta: 15.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * CodeCheck took 9564.83ms. Allocated memory was 117.4MB in the beginning and 243.3MB in the end (delta: 125.8MB). Free memory was 63.7MB in the beginning and 157.8MB in the end (delta: -94.1MB). Peak memory consumption was 36.9MB. Max. memory is 16.1GB. * Witness Printer took 142.59ms. Allocated memory is still 243.3MB. Free memory was 157.8MB in the beginning and 146.9MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-12-06 02:24:52,013 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08335f24-2234-4004-9354-2b0f8a0c8882/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE