./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 a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425bf157-f0a2-4e08-85c0-f67c8dc0eab8/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425bf157-f0a2-4e08-85c0-f67c8dc0eab8/bin/ukojak-verify-ImItNfHLgk/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425bf157-f0a2-4e08-85c0-f67c8dc0eab8/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425bf157-f0a2-4e08-85c0-f67c8dc0eab8/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/reducercommutativity/rangesum10.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425bf157-f0a2-4e08-85c0-f67c8dc0eab8/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425bf157-f0a2-4e08-85c0-f67c8dc0eab8/bin/ukojak-verify-ImItNfHLgk --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.2.5-dev-a016563 [2024-11-08 19:45:05,026 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:45:05,162 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425bf157-f0a2-4e08-85c0-f67c8dc0eab8/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-08 19:45:05,166 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:45:05,166 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-08 19:45:05,199 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:45:05,201 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:45:05,202 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-08 19:45:05,203 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:45:05,204 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:45:05,205 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:45:05,205 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:45:05,205 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:45:05,206 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:45:05,206 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:45:05,208 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:45:05,209 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:45:05,209 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:45:05,209 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:45:05,209 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:45:05,210 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:45:05,214 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:45:05,214 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:45:05,215 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-08 19:45:05,215 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-08 19:45:05,215 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-08 19:45:05,215 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:45:05,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 19:45:05,216 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:45:05,216 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:45:05,216 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:45:05,216 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-08 19:45:05,217 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:45:05,217 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425bf157-f0a2-4e08-85c0-f67c8dc0eab8/bin/ukojak-verify-ImItNfHLgk/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_425bf157-f0a2-4e08-85c0-f67c8dc0eab8/bin/ukojak-verify-ImItNfHLgk 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-11-08 19:45:05,485 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:45:05,539 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:45:05,545 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:45:05,550 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:45:05,551 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:45:05,553 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425bf157-f0a2-4e08-85c0-f67c8dc0eab8/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/reducercommutativity/rangesum10.i Unable to find full path for "g++" [2024-11-08 19:45:07,511 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:45:07,793 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:45:07,794 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425bf157-f0a2-4e08-85c0-f67c8dc0eab8/sv-benchmarks/c/reducercommutativity/rangesum10.i [2024-11-08 19:45:07,802 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425bf157-f0a2-4e08-85c0-f67c8dc0eab8/bin/ukojak-verify-ImItNfHLgk/data/ce8e2a5ed/cbe44ddf8f494ba0afb5ec0998acb116/FLAG85955dad5 [2024-11-08 19:45:07,822 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425bf157-f0a2-4e08-85c0-f67c8dc0eab8/bin/ukojak-verify-ImItNfHLgk/data/ce8e2a5ed/cbe44ddf8f494ba0afb5ec0998acb116 [2024-11-08 19:45:07,825 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:45:07,827 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:45:07,829 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:45:07,829 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:45:07,837 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:45:07,838 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:45:07" (1/1) ... [2024-11-08 19:45:07,840 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e9e43ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:45:07, skipping insertion in model container [2024-11-08 19:45:07,840 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:45:07" (1/1) ... [2024-11-08 19:45:07,875 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:45:08,142 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_425bf157-f0a2-4e08-85c0-f67c8dc0eab8/sv-benchmarks/c/reducercommutativity/rangesum10.i[1465,1478] [2024-11-08 19:45:08,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:45:08,165 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:45:08,197 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_425bf157-f0a2-4e08-85c0-f67c8dc0eab8/sv-benchmarks/c/reducercommutativity/rangesum10.i[1465,1478] [2024-11-08 19:45:08,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:45:08,227 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:45:08,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:45:08 WrapperNode [2024-11-08 19:45:08,228 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:45:08,229 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:45:08,229 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:45:08,229 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:45:08,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:45:08" (1/1) ... [2024-11-08 19:45:08,250 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:45:08" (1/1) ... [2024-11-08 19:45:08,278 INFO L138 Inliner]: procedures = 17, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 69 [2024-11-08 19:45:08,279 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:45:08,280 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:45:08,281 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:45:08,281 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:45:08,291 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:45:08" (1/1) ... [2024-11-08 19:45:08,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:45:08" (1/1) ... [2024-11-08 19:45:08,294 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:45:08" (1/1) ... [2024-11-08 19:45:08,294 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:45:08" (1/1) ... [2024-11-08 19:45:08,305 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:45:08" (1/1) ... [2024-11-08 19:45:08,316 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:45:08" (1/1) ... [2024-11-08 19:45:08,318 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:45:08" (1/1) ... [2024-11-08 19:45:08,323 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:45:08" (1/1) ... [2024-11-08 19:45:08,325 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:45:08,326 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:45:08,327 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:45:08,331 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:45:08,332 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:45:08" (1/1) ... [2024-11-08 19:45:08,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 19:45:08,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425bf157-f0a2-4e08-85c0-f67c8dc0eab8/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-08 19:45:08,367 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425bf157-f0a2-4e08-85c0-f67c8dc0eab8/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-08 19:45:08,370 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425bf157-f0a2-4e08-85c0-f67c8dc0eab8/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-08 19:45:08,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:45:08,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 19:45:08,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 19:45:08,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-08 19:45:08,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:45:08,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:45:08,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-08 19:45:08,411 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2024-11-08 19:45:08,411 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2024-11-08 19:45:08,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 19:45:08,534 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:45:08,536 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:45:08,725 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-08 19:45:08,725 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:45:08,825 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:45:08,826 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 19:45:08,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:45:08 BoogieIcfgContainer [2024-11-08 19:45:08,826 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:45:08,827 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-08 19:45:08,828 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-08 19:45:08,839 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-08 19:45:08,839 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:45:08" (1/1) ... [2024-11-08 19:45:08,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:45:08,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:45:08,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 23 states and 31 transitions. [2024-11-08 19:45:08,899 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2024-11-08 19:45:08,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 19:45:08,905 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:45:08,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:45:09,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:09,340 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 19:45:09,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:45:09,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 24 states and 32 transitions. [2024-11-08 19:45:09,417 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2024-11-08 19:45:09,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 19:45:09,418 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:45:09,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:45:09,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:09,560 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 19:45:09,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:45:09,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 25 states and 33 transitions. [2024-11-08 19:45:09,591 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2024-11-08 19:45:09,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 19:45:09,592 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:45:09,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:45:09,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:09,776 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 19:45:09,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:45:09,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 26 states and 35 transitions. [2024-11-08 19:45:09,845 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2024-11-08 19:45:09,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 19:45:09,847 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:45:09,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:45:09,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:09,938 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 19:45:10,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:45:10,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 26 states and 34 transitions. [2024-11-08 19:45:10,013 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2024-11-08 19:45:10,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-08 19:45:10,014 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:45:10,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:45:10,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:10,153 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 19:45:10,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:45:10,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 27 states and 36 transitions. [2024-11-08 19:45:10,182 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2024-11-08 19:45:10,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 19:45:10,183 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:45:10,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:45:10,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:10,254 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 19:45:10,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:45:10,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 28 states and 37 transitions. [2024-11-08 19:45:10,274 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2024-11-08 19:45:10,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-08 19:45:10,275 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:45:10,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:45:10,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:10,420 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 19:45:10,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:45:10,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 29 states and 39 transitions. [2024-11-08 19:45:10,498 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2024-11-08 19:45:10,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 19:45:10,499 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:45:10,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:45:10,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:10,582 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-08 19:45:10,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:45:10,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 29 states and 38 transitions. [2024-11-08 19:45:10,662 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2024-11-08 19:45:10,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-08 19:45:10,663 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:45:10,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:45:10,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:10,792 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-08 19:45:10,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:45:10,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 30 states and 40 transitions. [2024-11-08 19:45:10,837 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2024-11-08 19:45:10,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 19:45:10,839 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:45:10,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:45:10,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:10,948 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-08 19:45:10,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:45:10,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 31 states and 41 transitions. [2024-11-08 19:45:10,973 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2024-11-08 19:45:10,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 19:45:10,974 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:45:10,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:45:11,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:11,168 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-08 19:45:11,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:45:11,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 32 states and 43 transitions. [2024-11-08 19:45:11,249 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2024-11-08 19:45:11,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-08 19:45:11,251 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:45:11,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:45:11,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:11,356 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-08 19:45:11,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:45:11,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 32 states and 42 transitions. [2024-11-08 19:45:11,455 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2024-11-08 19:45:11,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 19:45:11,456 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:45:11,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:45:11,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:11,636 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-08 19:45:11,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:45:11,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 34 states and 44 transitions. [2024-11-08 19:45:11,813 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2024-11-08 19:45:11,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-08 19:45:11,814 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:45:11,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:45:11,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:12,005 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-08 19:45:12,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:45:12,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 36 states and 46 transitions. [2024-11-08 19:45:12,219 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2024-11-08 19:45:12,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-08 19:45:12,220 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:45:12,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:45:12,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:12,434 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-08 19:45:12,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:45:12,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 38 states and 48 transitions. [2024-11-08 19:45:12,647 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2024-11-08 19:45:12,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-08 19:45:12,649 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:45:12,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:45:12,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:12,857 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-08 19:45:13,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:45:13,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 40 states and 50 transitions. [2024-11-08 19:45:13,068 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2024-11-08 19:45:13,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-08 19:45:13,069 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:45:13,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:45:13,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:13,315 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-08 19:45:13,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:45:13,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 42 states and 52 transitions. [2024-11-08 19:45:13,525 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2024-11-08 19:45:13,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-08 19:45:13,526 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:45:13,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:45:13,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:13,730 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-08 19:45:13,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:45:13,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 44 states and 54 transitions. [2024-11-08 19:45:13,986 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2024-11-08 19:45:13,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-08 19:45:13,987 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:45:13,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:45:14,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:14,216 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-08 19:45:14,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:45:14,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 46 states and 56 transitions. [2024-11-08 19:45:14,474 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2024-11-08 19:45:14,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-08 19:45:14,474 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:45:14,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:45:14,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:14,700 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-08 19:45:14,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:45:14,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 48 states and 57 transitions. [2024-11-08 19:45:14,849 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2024-11-08 19:45:14,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-08 19:45:14,851 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:45:14,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:45:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:15,013 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2024-11-08 19:45:15,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:45:15,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 50 states and 59 transitions. [2024-11-08 19:45:15,243 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2024-11-08 19:45:15,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-08 19:45:15,244 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:45:15,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:45:15,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:15,420 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-11-08 19:45:15,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:45:15,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 52 states and 61 transitions. [2024-11-08 19:45:15,712 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2024-11-08 19:45:15,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-08 19:45:15,714 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:45:15,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:45:15,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:15,945 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2024-11-08 19:45:16,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:45:16,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 54 states and 63 transitions. [2024-11-08 19:45:16,206 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2024-11-08 19:45:16,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-08 19:45:16,207 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:45:16,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:45:16,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:16,447 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 0 proven. 151 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-08 19:45:16,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:45:16,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 56 states and 65 transitions. [2024-11-08 19:45:16,734 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2024-11-08 19:45:16,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-08 19:45:16,736 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:45:16,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:45:16,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:17,007 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2024-11-08 19:45:17,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:45:17,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 58 states and 67 transitions. [2024-11-08 19:45:17,307 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2024-11-08 19:45:17,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-08 19:45:17,308 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:45:17,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:45:17,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:17,616 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 0 proven. 279 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2024-11-08 19:45:17,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:45:17,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 60 states and 69 transitions. [2024-11-08 19:45:17,913 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2024-11-08 19:45:17,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-08 19:45:17,916 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:45:17,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:45:17,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:18,276 INFO L134 CoverageAnalysis]: Checked inductivity of 740 backedges. 0 proven. 358 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2024-11-08 19:45:18,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:45:18,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 62 states and 71 transitions. [2024-11-08 19:45:18,600 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2024-11-08 19:45:18,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-08 19:45:18,601 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:45:18,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:45:18,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:18,900 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 0 proven. 447 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2024-11-08 19:45:19,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:45:19,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 64 states and 72 transitions. [2024-11-08 19:45:19,092 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2024-11-08 19:45:19,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 19:45:19,093 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:45:19,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:45:19,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:19,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1076 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1072 trivial. 0 not checked. [2024-11-08 19:45:19,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:45:19,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 66 states and 74 transitions. [2024-11-08 19:45:19,614 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2024-11-08 19:45:19,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 19:45:19,616 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:45:19,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:45:19,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:19,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1072 trivial. 0 not checked. [2024-11-08 19:45:20,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:45:20,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 68 states and 76 transitions. [2024-11-08 19:45:20,237 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2024-11-08 19:45:20,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 19:45:20,239 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:45:20,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:45:20,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:20,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1088 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1072 trivial. 0 not checked. [2024-11-08 19:45:20,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:45:20,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 70 states and 78 transitions. [2024-11-08 19:45:20,842 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2024-11-08 19:45:20,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 19:45:20,843 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:45:20,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:45:20,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:21,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1097 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 1072 trivial. 0 not checked. [2024-11-08 19:45:21,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:45:21,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 72 states and 80 transitions. [2024-11-08 19:45:21,490 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2024-11-08 19:45:21,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 19:45:21,491 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:45:21,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:45:21,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:21,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1108 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1072 trivial. 0 not checked. [2024-11-08 19:45:22,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:45:22,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 74 states and 82 transitions. [2024-11-08 19:45:22,150 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2024-11-08 19:45:22,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 19:45:22,151 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:45:22,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:45:22,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:22,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1121 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 1072 trivial. 0 not checked. [2024-11-08 19:45:22,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:45:22,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 76 states and 84 transitions. [2024-11-08 19:45:22,830 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2024-11-08 19:45:22,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 19:45:22,832 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:45:22,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:45:22,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:45:23,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1136 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 1072 trivial. 0 not checked. [2024-11-08 19:45:23,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:45:23,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 78 states and 85 transitions. [2024-11-08 19:45:23,317 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2024-11-08 19:45:23,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 19:45:23,318 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:45:23,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:45:24,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 19:45:24,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:45:24,568 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 19:45:25,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:45:25,432 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 36 iterations. [2024-11-08 19:45:25,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.11 07:45:25 ImpRootNode [2024-11-08 19:45:25,555 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-08 19:45:25,556 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 19:45:25,556 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 19:45:25,556 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 19:45:25,556 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:45:08" (3/4) ... [2024-11-08 19:45:25,557 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 19:45:25,685 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425bf157-f0a2-4e08-85c0-f67c8dc0eab8/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-08 19:45:25,686 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 19:45:25,686 INFO L158 Benchmark]: Toolchain (without parser) took 17859.57ms. Allocated memory was 172.0MB in the beginning and 360.7MB in the end (delta: 188.7MB). Free memory was 141.0MB in the beginning and 200.8MB in the end (delta: -59.7MB). Peak memory consumption was 131.3MB. Max. memory is 16.1GB. [2024-11-08 19:45:25,687 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 115.3MB. Free memory is still 89.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:45:25,687 INFO L158 Benchmark]: CACSL2BoogieTranslator took 399.27ms. Allocated memory is still 172.0MB. Free memory was 141.0MB in the beginning and 128.1MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 19:45:25,687 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.94ms. Allocated memory is still 172.0MB. Free memory was 128.1MB in the beginning and 126.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 19:45:25,688 INFO L158 Benchmark]: Boogie Preprocessor took 45.13ms. Allocated memory is still 172.0MB. Free memory was 126.5MB in the beginning and 125.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:45:25,688 INFO L158 Benchmark]: RCFGBuilder took 500.19ms. Allocated memory is still 172.0MB. Free memory was 124.9MB in the beginning and 109.8MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 19:45:25,689 INFO L158 Benchmark]: CodeCheck took 16727.74ms. Allocated memory was 172.0MB in the beginning and 360.7MB in the end (delta: 188.7MB). Free memory was 109.8MB in the beginning and 209.1MB in the end (delta: -99.4MB). Peak memory consumption was 91.4MB. Max. memory is 16.1GB. [2024-11-08 19:45:25,689 INFO L158 Benchmark]: Witness Printer took 130.33ms. Allocated memory is still 360.7MB. Free memory was 209.1MB in the beginning and 200.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-08 19:45:25,691 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, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.6s, OverallIterations: 36, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2641 SdHoareTripleChecker+Valid, 10.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 841 mSDsluCounter, 805 SdHoareTripleChecker+Invalid, 8.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1878 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4743 IncrementalHoareTripleChecker+Invalid, 6621 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1878 mSolverCounterUnsat, 805 mSDtfsCounter, 4743 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10262 GetRequests, 9906 SyntacticMatches, 200 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11830 ImplicationChecksByTransitivity, 6.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 2410 NumberOfCodeBlocks, 2410 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2252 ConstructedInterpolants, 0 QuantifiedInterpolants, 2832 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 6 PerfectInterpolantSequences, 10500/12670 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 - 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 FALSE !(i < 10) 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 FALSE !(i < 10) 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 FALSE !(i < 10) 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 FALSE !(i < 10) 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 FALSE !(i < 10) 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 FALSE !(i < 10) 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 FALSE !(i < 10) 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 FALSE !(i < 10) 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 FALSE !(i < 10) 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 FALSE !(i < 10) 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 TRUE i < 10 VAL [x={3:0}] [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 FALSE !(i < 10) 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 FALSE !(i < 10) 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 FALSE !(i < 10) 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 FALSE !(i < 10) 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 FALSE !(i < 10) 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 FALSE !(i < 10) 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 FALSE !(i < 10) 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 FALSE !(i < 10) 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 FALSE !(i < 10) 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 FALSE !(i < 10) 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=11, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=4, ret=11, x={3:0}] [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=2, 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 FALSE !(i < 10) 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 FALSE !(i < 10) 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 FALSE !(i < 10) 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 FALSE !(i < 10) 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 FALSE !(i < 10) 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 FALSE !(i < 10) 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 FALSE !(i < 10) 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 FALSE !(i < 10) 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 FALSE !(i < 10) 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 FALSE !(i < 10) 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=11, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=4, ret=11, x={3:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; [L52] RET, EXPR rangesum(x) VAL [ret=2, x={3:0}] [L52] ret2 = rangesum(x) [L53] EXPR x[0] [L53] temp=x[0] [L54] int i =0 ; VAL [i=0, ret2=2, ret=2, temp=2147483643, x={3:0}] [L54] COND FALSE !(i<10 -1) VAL [i=0, ret2=2, ret=2, temp=2147483643, 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=2, ret=2, temp=2147483643, x={3:0}] [L54] COND FALSE !(i<10 -1) VAL [i=1, ret2=2, ret=2, temp=2147483643, 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=2, ret=2, temp=2147483643, x={3:0}] [L54] COND FALSE !(i<10 -1) VAL [i=2, ret2=2, ret=2, temp=2147483643, 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=2, ret=2, temp=2147483643, x={3:0}] [L54] COND FALSE !(i<10 -1) VAL [i=3, ret2=2, ret=2, temp=2147483643, 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=2, ret=2, temp=2147483643, x={3:0}] [L54] COND FALSE !(i<10 -1) VAL [i=4, ret2=2, ret=2, temp=2147483643, 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=2, ret=2, temp=2147483643, x={3:0}] [L54] COND FALSE !(i<10 -1) VAL [i=5, ret2=2, ret=2, temp=2147483643, 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=2, ret=2, temp=2147483643, x={3:0}] [L54] COND FALSE !(i<10 -1) VAL [i=6, ret2=2, ret=2, temp=2147483643, 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=2, ret=2, temp=2147483643, x={3:0}] [L54] COND FALSE !(i<10 -1) VAL [i=7, ret2=2, ret=2, temp=2147483643, 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=2, ret=2, temp=2147483643, x={3:0}] [L54] COND FALSE !(i<10 -1) VAL [i=8, ret2=2, ret=2, temp=2147483643, 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=2, ret=2, temp=2147483643, x={3:0}] [L54] COND TRUE i<10 -1 VAL [ret2=2, ret=2, temp=2147483643, x={3:0}] [L57] x[10 -1] = temp VAL [ret2=2, ret=2, 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 FALSE !(i < 10) 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 FALSE !(i < 10) 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 FALSE !(i < 10) 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 FALSE !(i < 10) 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 FALSE !(i < 10) 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 FALSE !(i < 10) 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 FALSE !(i < 10) 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 FALSE !(i < 10) 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=3, x={3:0}] [L28] COND FALSE !(i < 10) VAL [\old(x)={3:0}, cnt=2, i=8, ret=3, 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=10, x={3:0}] [L28] COND FALSE !(i < 10) VAL [\old(x)={3:0}, cnt=3, i=9, ret=10, 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=2147483653, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=4, ret=2147483653, x={3:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; [L58] RET, EXPR rangesum(x) VAL [ret2=2, ret=2, 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.44ms. Allocated memory is still 115.3MB. Free memory is still 89.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 399.27ms. Allocated memory is still 172.0MB. Free memory was 141.0MB in the beginning and 128.1MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.94ms. Allocated memory is still 172.0MB. Free memory was 128.1MB in the beginning and 126.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.13ms. Allocated memory is still 172.0MB. Free memory was 126.5MB in the beginning and 125.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 500.19ms. Allocated memory is still 172.0MB. Free memory was 124.9MB in the beginning and 109.8MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * CodeCheck took 16727.74ms. Allocated memory was 172.0MB in the beginning and 360.7MB in the end (delta: 188.7MB). Free memory was 109.8MB in the beginning and 209.1MB in the end (delta: -99.4MB). Peak memory consumption was 91.4MB. Max. memory is 16.1GB. * Witness Printer took 130.33ms. Allocated memory is still 360.7MB. Free memory was 209.1MB in the beginning and 200.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-08 19:45:25,735 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_425bf157-f0a2-4e08-85c0-f67c8dc0eab8/bin/ukojak-verify-ImItNfHLgk/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE