./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/reducercommutativity/rangesum20.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3a1149-20cd-4201-801f-299245c76e3a/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3a1149-20cd-4201-801f-299245c76e3a/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_9d3a1149-20cd-4201-801f-299245c76e3a/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3a1149-20cd-4201-801f-299245c76e3a/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/reducercommutativity/rangesum20.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3a1149-20cd-4201-801f-299245c76e3a/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_9d3a1149-20cd-4201-801f-299245c76e3a/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 66b03bf685aae9720ef4af0fb91907139a878375cd48373b4439b53b2302a22a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 23:02:04,873 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:02:04,975 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3a1149-20cd-4201-801f-299245c76e3a/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-08 23:02:04,981 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:02:04,981 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-08 23:02:05,009 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:02:05,010 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:02:05,011 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-08 23:02:05,012 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:02:05,012 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:02:05,013 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:02:05,014 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:02:05,014 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:02:05,015 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:02:05,015 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:02:05,016 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:02:05,016 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:02:05,017 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:02:05,017 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:02:05,018 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:02:05,018 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:02:05,019 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:02:05,020 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:02:05,020 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-08 23:02:05,021 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-08 23:02:05,021 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-08 23:02:05,022 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:02:05,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 23:02:05,023 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:02:05,023 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:02:05,024 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:02:05,024 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-08 23:02:05,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:02:05,025 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_9d3a1149-20cd-4201-801f-299245c76e3a/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_9d3a1149-20cd-4201-801f-299245c76e3a/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 -> 66b03bf685aae9720ef4af0fb91907139a878375cd48373b4439b53b2302a22a [2024-11-08 23:02:05,302 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:02:05,331 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:02:05,352 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:02:05,355 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:02:05,356 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:02:05,358 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3a1149-20cd-4201-801f-299245c76e3a/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/reducercommutativity/rangesum20.i Unable to find full path for "g++" [2024-11-08 23:02:07,602 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:02:07,887 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:02:07,888 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3a1149-20cd-4201-801f-299245c76e3a/sv-benchmarks/c/reducercommutativity/rangesum20.i [2024-11-08 23:02:07,897 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3a1149-20cd-4201-801f-299245c76e3a/bin/ukojak-verify-ImItNfHLgk/data/7881f8d69/e3aa824f8852473b8bdbde7ed88533e8/FLAG0b95f9cc5 [2024-11-08 23:02:08,214 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3a1149-20cd-4201-801f-299245c76e3a/bin/ukojak-verify-ImItNfHLgk/data/7881f8d69/e3aa824f8852473b8bdbde7ed88533e8 [2024-11-08 23:02:08,219 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:02:08,221 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:02:08,222 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:02:08,223 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:02:08,233 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:02:08,235 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:02:08" (1/1) ... [2024-11-08 23:02:08,237 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a6d9474 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:08, skipping insertion in model container [2024-11-08 23:02:08,238 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:02:08" (1/1) ... [2024-11-08 23:02:08,269 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:02:08,517 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_9d3a1149-20cd-4201-801f-299245c76e3a/sv-benchmarks/c/reducercommutativity/rangesum20.i[1465,1478] [2024-11-08 23:02:08,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:02:08,530 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:02:08,556 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_9d3a1149-20cd-4201-801f-299245c76e3a/sv-benchmarks/c/reducercommutativity/rangesum20.i[1465,1478] [2024-11-08 23:02:08,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:02:08,576 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:02:08,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:08 WrapperNode [2024-11-08 23:02:08,577 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:02:08,578 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:02:08,578 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:02:08,579 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:02:08,587 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:08" (1/1) ... [2024-11-08 23:02:08,595 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:08" (1/1) ... [2024-11-08 23:02:08,621 INFO L138 Inliner]: procedures = 17, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 69 [2024-11-08 23:02:08,622 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:02:08,623 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:02:08,623 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:02:08,624 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:02:08,640 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:08" (1/1) ... [2024-11-08 23:02:08,641 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:08" (1/1) ... [2024-11-08 23:02:08,646 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:08" (1/1) ... [2024-11-08 23:02:08,646 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:08" (1/1) ... [2024-11-08 23:02:08,654 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:08" (1/1) ... [2024-11-08 23:02:08,658 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:08" (1/1) ... [2024-11-08 23:02:08,659 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:08" (1/1) ... [2024-11-08 23:02:08,661 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:08" (1/1) ... [2024-11-08 23:02:08,663 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:02:08,664 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:02:08,665 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:02:08,665 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:02:08,670 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:08" (1/1) ... [2024-11-08 23:02:08,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 23:02:08,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3a1149-20cd-4201-801f-299245c76e3a/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-08 23:02:08,707 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3a1149-20cd-4201-801f-299245c76e3a/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-08 23:02:08,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3a1149-20cd-4201-801f-299245c76e3a/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-08 23:02:08,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:02:08,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 23:02:08,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 23:02:08,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-08 23:02:08,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:02:08,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:02:08,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-08 23:02:08,740 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2024-11-08 23:02:08,740 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2024-11-08 23:02:08,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 23:02:08,826 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:02:08,829 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:02:09,054 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-08 23:02:09,054 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:02:09,137 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:02:09,137 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 23:02:09,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:02:09 BoogieIcfgContainer [2024-11-08 23:02:09,138 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:02:09,140 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-08 23:02:09,141 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-08 23:02:09,154 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-08 23:02:09,155 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:02:09" (1/1) ... [2024-11-08 23:02:09,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:02:09,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:09,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 23 states and 31 transitions. [2024-11-08 23:02:09,239 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2024-11-08 23:02:09,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 23:02:09,244 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:09,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:09,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:09,839 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 23:02:09,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:09,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 24 states and 32 transitions. [2024-11-08 23:02:09,926 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2024-11-08 23:02:09,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 23:02:09,928 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:09,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:09,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:10,170 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 23:02:10,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:10,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 25 states and 33 transitions. [2024-11-08 23:02:10,218 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2024-11-08 23:02:10,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 23:02:10,219 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:10,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:10,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:10,469 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 23:02:10,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:10,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 26 states and 35 transitions. [2024-11-08 23:02:10,545 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2024-11-08 23:02:10,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 23:02:10,548 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:10,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:10,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:10,650 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 23:02:10,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:10,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 26 states and 34 transitions. [2024-11-08 23:02:10,748 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2024-11-08 23:02:10,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-08 23:02:10,749 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:10,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:10,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:10,899 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 23:02:10,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:10,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 27 states and 36 transitions. [2024-11-08 23:02:10,945 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2024-11-08 23:02:10,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 23:02:10,946 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:10,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:10,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:11,068 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 23:02:11,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:11,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 28 states and 37 transitions. [2024-11-08 23:02:11,097 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2024-11-08 23:02:11,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-08 23:02:11,098 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:11,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:11,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:11,292 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 23:02:11,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:11,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 29 states and 39 transitions. [2024-11-08 23:02:11,387 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2024-11-08 23:02:11,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 23:02:11,388 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:11,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:11,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:11,466 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 23:02:11,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:11,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 29 states and 38 transitions. [2024-11-08 23:02:11,562 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2024-11-08 23:02:11,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-08 23:02:11,563 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:11,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:11,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:11,718 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 23:02:11,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:11,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 30 states and 40 transitions. [2024-11-08 23:02:11,772 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2024-11-08 23:02:11,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 23:02:11,775 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:11,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:11,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:11,898 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 23:02:11,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:11,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 31 states and 41 transitions. [2024-11-08 23:02:11,925 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2024-11-08 23:02:11,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 23:02:11,927 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:11,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:11,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:12,126 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 23:02:12,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:12,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 32 states and 43 transitions. [2024-11-08 23:02:12,231 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2024-11-08 23:02:12,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-08 23:02:12,234 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:12,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:12,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:12,343 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 23:02:12,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:12,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 32 states and 42 transitions. [2024-11-08 23:02:12,463 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2024-11-08 23:02:12,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 23:02:12,464 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:12,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:12,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:12,650 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 23:02:12,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:12,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 34 states and 44 transitions. [2024-11-08 23:02:12,881 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2024-11-08 23:02:12,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-08 23:02:12,882 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:12,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:12,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:13,116 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 23:02:13,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:13,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 36 states and 46 transitions. [2024-11-08 23:02:13,334 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2024-11-08 23:02:13,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-08 23:02:13,335 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:13,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:13,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:13,572 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 23:02:13,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:13,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 38 states and 48 transitions. [2024-11-08 23:02:13,837 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2024-11-08 23:02:13,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-08 23:02:13,838 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:13,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:13,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:14,057 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 23:02:14,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:14,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 40 states and 50 transitions. [2024-11-08 23:02:14,322 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2024-11-08 23:02:14,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-08 23:02:14,322 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:14,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:14,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:14,567 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 23:02:14,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:14,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 42 states and 52 transitions. [2024-11-08 23:02:14,848 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2024-11-08 23:02:14,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-08 23:02:14,849 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:14,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:14,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:15,140 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 23:02:15,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:15,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 44 states and 54 transitions. [2024-11-08 23:02:15,445 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2024-11-08 23:02:15,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-08 23:02:15,445 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:15,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:15,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:15,752 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 23:02:16,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:16,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 46 states and 56 transitions. [2024-11-08 23:02:16,010 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2024-11-08 23:02:16,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-08 23:02:16,012 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:16,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:16,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:16,339 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 23:02:16,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:16,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 48 states and 58 transitions. [2024-11-08 23:02:16,657 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2024-11-08 23:02:16,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-08 23:02:16,658 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:16,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:16,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:16,960 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-08 23:02:17,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:17,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 50 states and 60 transitions. [2024-11-08 23:02:17,305 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2024-11-08 23:02:17,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-08 23:02:17,306 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:17,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:17,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:17,670 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-08 23:02:18,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:18,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 52 states and 62 transitions. [2024-11-08 23:02:18,034 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2024-11-08 23:02:18,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-08 23:02:18,034 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:18,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:18,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:18,403 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-08 23:02:18,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:18,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 54 states and 64 transitions. [2024-11-08 23:02:18,792 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2024-11-08 23:02:18,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-08 23:02:18,794 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:18,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:18,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:19,226 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-08 23:02:19,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:19,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 56 states and 66 transitions. [2024-11-08 23:02:19,643 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2024-11-08 23:02:19,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-08 23:02:19,644 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:19,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:19,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:20,086 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-08 23:02:20,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:20,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 58 states and 68 transitions. [2024-11-08 23:02:20,560 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2024-11-08 23:02:20,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-08 23:02:20,561 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:20,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:20,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:20,954 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-08 23:02:21,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:21,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 60 states and 70 transitions. [2024-11-08 23:02:21,432 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2024-11-08 23:02:21,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-08 23:02:21,437 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:21,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:21,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:21,838 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-08 23:02:22,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:22,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 62 states and 72 transitions. [2024-11-08 23:02:22,299 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2024-11-08 23:02:22,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-08 23:02:22,300 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:22,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:22,749 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-08 23:02:23,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:23,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 64 states and 74 transitions. [2024-11-08 23:02:23,316 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2024-11-08 23:02:23,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-08 23:02:23,317 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:23,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:23,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:23,801 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-08 23:02:24,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:24,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 66 states and 76 transitions. [2024-11-08 23:02:24,276 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2024-11-08 23:02:24,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-08 23:02:24,278 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:24,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:24,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:24,732 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-08 23:02:24,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:24,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 68 states and 77 transitions. [2024-11-08 23:02:24,996 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2024-11-08 23:02:24,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-08 23:02:24,997 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:24,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:25,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:25,232 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 430 trivial. 0 not checked. [2024-11-08 23:02:25,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:25,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 70 states and 79 transitions. [2024-11-08 23:02:25,610 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2024-11-08 23:02:25,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-08 23:02:25,611 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:25,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:25,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:25,843 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2024-11-08 23:02:26,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:26,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 72 states and 81 transitions. [2024-11-08 23:02:26,250 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2024-11-08 23:02:26,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-08 23:02:26,251 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:26,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:26,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:26,494 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2024-11-08 23:02:26,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:26,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 74 states and 83 transitions. [2024-11-08 23:02:26,905 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2024-11-08 23:02:26,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 23:02:26,908 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:26,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:26,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:27,200 INFO L134 CoverageAnalysis]: Checked inductivity of 671 backedges. 0 proven. 151 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2024-11-08 23:02:27,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:27,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 76 states and 85 transitions. [2024-11-08 23:02:27,652 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2024-11-08 23:02:27,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-08 23:02:27,653 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:27,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:27,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:27,963 INFO L134 CoverageAnalysis]: Checked inductivity of 776 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 566 trivial. 0 not checked. [2024-11-08 23:02:28,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:28,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 78 states and 87 transitions. [2024-11-08 23:02:28,421 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2024-11-08 23:02:28,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 23:02:28,422 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:28,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:28,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:28,767 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 0 proven. 279 refuted. 0 times theorem prover too weak. 620 trivial. 0 not checked. [2024-11-08 23:02:29,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:29,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 80 states and 89 transitions. [2024-11-08 23:02:29,232 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2024-11-08 23:02:29,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 23:02:29,234 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:29,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:29,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:29,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1040 backedges. 0 proven. 358 refuted. 0 times theorem prover too weak. 682 trivial. 0 not checked. [2024-11-08 23:02:30,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:30,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 82 states and 91 transitions. [2024-11-08 23:02:30,103 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2024-11-08 23:02:30,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 23:02:30,105 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:30,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:30,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:30,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 447 refuted. 0 times theorem prover too weak. 752 trivial. 0 not checked. [2024-11-08 23:02:31,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:31,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 84 states and 93 transitions. [2024-11-08 23:02:31,151 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2024-11-08 23:02:31,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-08 23:02:31,153 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:31,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:31,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:31,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1376 backedges. 0 proven. 546 refuted. 0 times theorem prover too weak. 830 trivial. 0 not checked. [2024-11-08 23:02:32,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:32,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 86 states and 95 transitions. [2024-11-08 23:02:32,197 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2024-11-08 23:02:32,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-08 23:02:32,199 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:32,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:32,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:32,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1571 backedges. 0 proven. 655 refuted. 0 times theorem prover too weak. 916 trivial. 0 not checked. [2024-11-08 23:02:33,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:33,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 88 states and 97 transitions. [2024-11-08 23:02:33,255 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2024-11-08 23:02:33,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-08 23:02:33,256 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:33,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:33,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1784 backedges. 0 proven. 774 refuted. 0 times theorem prover too weak. 1010 trivial. 0 not checked. [2024-11-08 23:02:34,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:34,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 90 states and 99 transitions. [2024-11-08 23:02:34,358 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2024-11-08 23:02:34,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-08 23:02:34,360 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:34,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:34,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:34,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2015 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 1112 trivial. 0 not checked. [2024-11-08 23:02:35,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:35,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 92 states and 101 transitions. [2024-11-08 23:02:35,367 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2024-11-08 23:02:35,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 23:02:35,369 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:35,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:35,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:36,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2264 backedges. 0 proven. 1042 refuted. 0 times theorem prover too weak. 1222 trivial. 0 not checked. [2024-11-08 23:02:36,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:36,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 94 states and 103 transitions. [2024-11-08 23:02:36,625 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2024-11-08 23:02:36,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-08 23:02:36,627 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:36,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:37,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2531 backedges. 0 proven. 1191 refuted. 0 times theorem prover too weak. 1340 trivial. 0 not checked. [2024-11-08 23:02:37,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:37,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 96 states and 105 transitions. [2024-11-08 23:02:37,842 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2024-11-08 23:02:37,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 23:02:37,844 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:37,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:37,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:38,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2816 backedges. 0 proven. 1350 refuted. 0 times theorem prover too weak. 1466 trivial. 0 not checked. [2024-11-08 23:02:39,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:39,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 98 states and 107 transitions. [2024-11-08 23:02:39,126 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2024-11-08 23:02:39,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-08 23:02:39,127 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:39,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:39,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:39,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3119 backedges. 0 proven. 1519 refuted. 0 times theorem prover too weak. 1600 trivial. 0 not checked. [2024-11-08 23:02:40,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:40,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 100 states and 109 transitions. [2024-11-08 23:02:40,472 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2024-11-08 23:02:40,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-08 23:02:40,473 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:40,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:41,398 INFO L134 CoverageAnalysis]: Checked inductivity of 3440 backedges. 0 proven. 1698 refuted. 0 times theorem prover too weak. 1742 trivial. 0 not checked. [2024-11-08 23:02:41,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:41,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 102 states and 111 transitions. [2024-11-08 23:02:41,968 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2024-11-08 23:02:41,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-08 23:02:41,969 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:41,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:42,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:42,692 INFO L134 CoverageAnalysis]: Checked inductivity of 3779 backedges. 0 proven. 1887 refuted. 0 times theorem prover too weak. 1892 trivial. 0 not checked. [2024-11-08 23:02:43,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:43,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 104 states and 112 transitions. [2024-11-08 23:02:43,055 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2024-11-08 23:02:43,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-08 23:02:43,056 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:43,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:43,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:43,484 INFO L134 CoverageAnalysis]: Checked inductivity of 4136 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4132 trivial. 0 not checked. [2024-11-08 23:02:43,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:43,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 106 states and 114 transitions. [2024-11-08 23:02:43,891 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2024-11-08 23:02:43,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-08 23:02:43,892 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:43,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:43,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:44,226 INFO L134 CoverageAnalysis]: Checked inductivity of 4141 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4132 trivial. 0 not checked. [2024-11-08 23:02:44,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:44,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 108 states and 116 transitions. [2024-11-08 23:02:44,715 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2024-11-08 23:02:44,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-08 23:02:44,716 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:44,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:44,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:45,165 INFO L134 CoverageAnalysis]: Checked inductivity of 4148 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4132 trivial. 0 not checked. [2024-11-08 23:02:45,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:45,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 110 states and 118 transitions. [2024-11-08 23:02:45,748 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2024-11-08 23:02:45,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-08 23:02:45,749 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:45,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:45,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:46,178 INFO L134 CoverageAnalysis]: Checked inductivity of 4157 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 4132 trivial. 0 not checked. [2024-11-08 23:02:46,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:46,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 112 states and 120 transitions. [2024-11-08 23:02:46,703 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2024-11-08 23:02:46,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-08 23:02:46,704 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:46,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:46,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:47,323 INFO L134 CoverageAnalysis]: Checked inductivity of 4168 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 4132 trivial. 0 not checked. [2024-11-08 23:02:47,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:47,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 114 states and 122 transitions. [2024-11-08 23:02:47,878 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2024-11-08 23:02:47,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-08 23:02:47,880 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:47,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:47,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:48,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4181 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 4132 trivial. 0 not checked. [2024-11-08 23:02:49,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:49,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 116 states and 124 transitions. [2024-11-08 23:02:49,164 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 124 transitions. [2024-11-08 23:02:49,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-08 23:02:49,165 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:49,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:49,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:49,719 INFO L134 CoverageAnalysis]: Checked inductivity of 4196 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 4132 trivial. 0 not checked. [2024-11-08 23:02:50,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:50,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 118 states and 126 transitions. [2024-11-08 23:02:50,352 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2024-11-08 23:02:50,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-08 23:02:50,353 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:50,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:50,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:50,968 INFO L134 CoverageAnalysis]: Checked inductivity of 4213 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 4132 trivial. 0 not checked. [2024-11-08 23:02:51,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:51,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 120 states and 128 transitions. [2024-11-08 23:02:51,662 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2024-11-08 23:02:51,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-08 23:02:51,663 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:51,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:51,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:52,292 INFO L134 CoverageAnalysis]: Checked inductivity of 4232 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 4132 trivial. 0 not checked. [2024-11-08 23:02:53,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:53,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 122 states and 130 transitions. [2024-11-08 23:02:53,053 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2024-11-08 23:02:53,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-08 23:02:53,054 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:53,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:53,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:53,650 INFO L134 CoverageAnalysis]: Checked inductivity of 4253 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 4132 trivial. 0 not checked. [2024-11-08 23:02:54,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:54,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 124 states and 132 transitions. [2024-11-08 23:02:54,312 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2024-11-08 23:02:54,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-08 23:02:54,313 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:54,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:54,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:55,038 INFO L134 CoverageAnalysis]: Checked inductivity of 4276 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 4132 trivial. 0 not checked. [2024-11-08 23:02:55,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:55,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 126 states and 134 transitions. [2024-11-08 23:02:55,718 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 134 transitions. [2024-11-08 23:02:55,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-08 23:02:55,720 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:55,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:55,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:56,512 INFO L134 CoverageAnalysis]: Checked inductivity of 4301 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 4132 trivial. 0 not checked. [2024-11-08 23:02:57,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:57,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 128 states and 136 transitions. [2024-11-08 23:02:57,180 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2024-11-08 23:02:57,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-08 23:02:57,182 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:57,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:57,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:57,817 INFO L134 CoverageAnalysis]: Checked inductivity of 4328 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 4132 trivial. 0 not checked. [2024-11-08 23:02:58,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:58,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 130 states and 138 transitions. [2024-11-08 23:02:58,495 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 138 transitions. [2024-11-08 23:02:58,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-08 23:02:58,497 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:58,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:58,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:59,125 INFO L134 CoverageAnalysis]: Checked inductivity of 4357 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 4132 trivial. 0 not checked. [2024-11-08 23:02:59,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:59,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 132 states and 140 transitions. [2024-11-08 23:02:59,815 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 140 transitions. [2024-11-08 23:02:59,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-08 23:02:59,816 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:59,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:59,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:00,543 INFO L134 CoverageAnalysis]: Checked inductivity of 4388 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 4132 trivial. 0 not checked. [2024-11-08 23:03:01,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:03:01,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 134 states and 142 transitions. [2024-11-08 23:03:01,293 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 142 transitions. [2024-11-08 23:03:01,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-08 23:03:01,294 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:03:01,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:03:01,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:02,013 INFO L134 CoverageAnalysis]: Checked inductivity of 4421 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 4132 trivial. 0 not checked. [2024-11-08 23:03:02,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:03:02,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 136 states and 144 transitions. [2024-11-08 23:03:02,894 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 144 transitions. [2024-11-08 23:03:02,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-08 23:03:02,896 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:03:02,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:03:02,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:03,450 INFO L134 CoverageAnalysis]: Checked inductivity of 4456 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 4132 trivial. 0 not checked. [2024-11-08 23:03:03,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:03:03,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 138 states and 145 transitions. [2024-11-08 23:03:03,844 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 145 transitions. [2024-11-08 23:03:03,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-08 23:03:03,845 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:03:03,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:03:09,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:03:14,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:03:14,425 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:03:18,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:03:18,948 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 66 iterations. [2024-11-08 23:03:19,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.11 11:03:19 ImpRootNode [2024-11-08 23:03:19,183 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-08 23:03:19,183 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:03:19,183 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:03:19,184 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:03:19,187 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:02:09" (3/4) ... [2024-11-08 23:03:19,188 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 23:03:19,367 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3a1149-20cd-4201-801f-299245c76e3a/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-08 23:03:19,368 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:03:19,369 INFO L158 Benchmark]: Toolchain (without parser) took 71147.79ms. Allocated memory was 144.7MB in the beginning and 1.1GB in the end (delta: 910.2MB). Free memory was 113.4MB in the beginning and 759.7MB in the end (delta: -646.3MB). Peak memory consumption was 265.6MB. Max. memory is 16.1GB. [2024-11-08 23:03:19,369 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 100.7MB. Free memory was 70.0MB in the beginning and 69.9MB in the end (delta: 26.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:03:19,370 INFO L158 Benchmark]: CACSL2BoogieTranslator took 354.81ms. Allocated memory is still 144.7MB. Free memory was 113.0MB in the beginning and 100.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 23:03:19,370 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.23ms. Allocated memory is still 144.7MB. Free memory was 100.5MB in the beginning and 98.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:03:19,370 INFO L158 Benchmark]: Boogie Preprocessor took 40.61ms. Allocated memory is still 144.7MB. Free memory was 98.5MB in the beginning and 97.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:03:19,371 INFO L158 Benchmark]: RCFGBuilder took 473.69ms. Allocated memory is still 144.7MB. Free memory was 97.1MB in the beginning and 81.7MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 23:03:19,371 INFO L158 Benchmark]: CodeCheck took 70042.36ms. Allocated memory was 144.7MB in the beginning and 1.1GB in the end (delta: 910.2MB). Free memory was 81.6MB in the beginning and 772.3MB in the end (delta: -690.7MB). Peak memory consumption was 221.6MB. Max. memory is 16.1GB. [2024-11-08 23:03:19,372 INFO L158 Benchmark]: Witness Printer took 184.78ms. Allocated memory is still 1.1GB. Free memory was 772.3MB in the beginning and 759.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 23:03:19,374 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: 69.8s, OverallIterations: 66, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6811 SdHoareTripleChecker+Valid, 37.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3451 mSDsluCounter, 1495 SdHoareTripleChecker+Invalid, 30.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 6453 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17448 IncrementalHoareTripleChecker+Invalid, 23901 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6453 mSolverCounterUnsat, 1495 mSDtfsCounter, 17448 mSolverCounterSat, 1.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30797 GetRequests, 29471 SyntacticMatches, 990 SemanticMatches, 336 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58350 ImplicationChecksByTransitivity, 29.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.5s SsaConstructionTime, 7.0s SatisfiabilityAnalysisTime, 23.7s InterpolantComputationTime, 7610 NumberOfCodeBlocks, 7610 NumberOfCodeBlocksAsserted, 66 NumberOfCheckSat, 7322 ConstructedInterpolants, 0 QuantifiedInterpolants, 9662 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 65 InterpolantComputations, 6 PerfectInterpolantSequences, 89410/107235 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[20]; [L43] CALL init_nondet(x) [L16] int i; [L17] i = 0 VAL [i=0, x={7:0}] [L17] COND FALSE !(i < 20) VAL [i=0, x={7:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=1, x={7:0}] [L17] COND FALSE !(i < 20) VAL [i=1, x={7:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=2, x={7:0}] [L17] COND FALSE !(i < 20) VAL [i=2, x={7:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=3, x={7:0}] [L17] COND FALSE !(i < 20) VAL [i=3, x={7:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=4, x={7:0}] [L17] COND FALSE !(i < 20) VAL [i=4, x={7:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=5, x={7:0}] [L17] COND FALSE !(i < 20) VAL [i=5, x={7:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=6, x={7:0}] [L17] COND FALSE !(i < 20) VAL [i=6, x={7:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=7, x={7:0}] [L17] COND FALSE !(i < 20) VAL [i=7, x={7:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=8, x={7:0}] [L17] COND FALSE !(i < 20) VAL [i=8, x={7:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=9, x={7:0}] [L17] COND FALSE !(i < 20) VAL [i=9, x={7:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=10, x={7:0}] [L17] COND FALSE !(i < 20) VAL [i=10, x={7:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=11, x={7:0}] [L17] COND FALSE !(i < 20) VAL [i=11, x={7:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=12, x={7:0}] [L17] COND FALSE !(i < 20) VAL [i=12, x={7:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=13, x={7:0}] [L17] COND FALSE !(i < 20) VAL [i=13, x={7:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=14, x={7:0}] [L17] COND FALSE !(i < 20) VAL [i=14, x={7:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=15, x={7:0}] [L17] COND FALSE !(i < 20) VAL [i=15, x={7:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=16, x={7:0}] [L17] COND FALSE !(i < 20) VAL [i=16, x={7:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=17, x={7:0}] [L17] COND FALSE !(i < 20) VAL [i=17, x={7:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=18, x={7:0}] [L17] COND FALSE !(i < 20) VAL [i=18, x={7:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=19, x={7:0}] [L17] COND FALSE !(i < 20) VAL [i=19, x={7:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=20, x={7:0}] [L17] COND TRUE i < 20 VAL [x={7:0}] [L43] RET init_nondet(x) [L44] int temp; [L45] int ret; [L46] int ret2; [L47] int ret5; VAL [x={7:0}] [L49] CALL, EXPR rangesum(x) VAL [\old(x)={7:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [\old(x)={7:0}, cnt=0, i=0, ret=0, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=0, i=0, ret=0, x={7:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={7:0}, cnt=0, i=1, ret=0, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=0, i=1, ret=0, x={7:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={7:0}, cnt=0, i=2, ret=0, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=0, i=2, ret=0, x={7:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={7:0}, cnt=0, i=3, ret=0, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=0, i=3, ret=0, x={7:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={7:0}, cnt=0, i=4, ret=0, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=0, i=4, ret=0, x={7:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={7:0}, cnt=0, i=5, ret=0, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=0, i=5, ret=0, x={7:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={7:0}, cnt=0, i=6, ret=0, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=0, i=6, ret=0, x={7:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={7:0}, cnt=0, i=7, ret=0, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=0, i=7, ret=0, x={7:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={7:0}, cnt=0, i=8, ret=0, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=0, i=8, ret=0, x={7:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={7:0}, cnt=0, i=9, ret=0, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=0, i=9, ret=0, x={7:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={7:0}, cnt=0, i=10, ret=0, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=0, i=10, ret=0, x={7:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={7:0}, cnt=0, i=11, ret=0, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=0, i=11, ret=0, x={7:0}] [L28] COND TRUE i < 20 [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={7:0}, cnt=1, i=12, ret=13, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=1, i=12, ret=13, x={7:0}] [L28] COND TRUE i < 20 [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={7:0}, cnt=2, i=13, ret=-59, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=2, i=13, ret=-59, x={7:0}] [L28] COND TRUE i < 20 [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={7:0}, cnt=3, i=14, ret=-54, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=3, i=14, ret=-54, x={7:0}] [L28] COND TRUE i < 20 [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={7:0}, cnt=4, i=15, ret=-50, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=4, i=15, ret=-50, x={7:0}] [L28] COND TRUE i < 20 [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={7:0}, cnt=5, i=16, ret=-42, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=5, i=16, ret=-42, x={7:0}] [L28] COND TRUE i < 20 [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={7:0}, cnt=6, i=17, ret=-33, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=6, i=17, ret=-33, x={7:0}] [L28] COND TRUE i < 20 [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={7:0}, cnt=7, i=18, ret=-23, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=7, i=18, ret=-23, x={7:0}] [L28] COND TRUE i < 20 [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={7:0}, cnt=8, i=19, ret=-16, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=8, i=19, ret=-16, x={7:0}] [L28] COND TRUE i < 20 [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={7:0}, cnt=9, i=20, ret=-10, x={7:0}] [L28] COND TRUE i < 20 VAL [\old(x)={7:0}, cnt=9, ret=-10, x={7:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; [L49] RET, EXPR rangesum(x) VAL [x={7: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={7:0}] [L52] CALL, EXPR rangesum(x) VAL [\old(x)={7:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [\old(x)={7:0}, cnt=0, i=0, ret=0, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=0, i=0, ret=0, x={7:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={7:0}, cnt=0, i=1, ret=0, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=0, i=1, ret=0, x={7:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={7:0}, cnt=0, i=2, ret=0, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=0, i=2, ret=0, x={7:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={7:0}, cnt=0, i=3, ret=0, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=0, i=3, ret=0, x={7:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={7:0}, cnt=0, i=4, ret=0, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=0, i=4, ret=0, x={7:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={7:0}, cnt=0, i=5, ret=0, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=0, i=5, ret=0, x={7:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={7:0}, cnt=0, i=6, ret=0, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=0, i=6, ret=0, x={7:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={7:0}, cnt=0, i=7, ret=0, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=0, i=7, ret=0, x={7:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={7:0}, cnt=0, i=8, ret=0, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=0, i=8, ret=0, x={7:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={7:0}, cnt=0, i=9, ret=0, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=0, i=9, ret=0, x={7:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={7:0}, cnt=0, i=10, ret=0, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=0, i=10, ret=0, x={7:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={7:0}, cnt=0, i=11, ret=0, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=0, i=11, ret=0, x={7:0}] [L28] COND TRUE i < 20 [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={7:0}, cnt=1, i=12, ret=13, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=1, i=12, ret=13, x={7:0}] [L28] COND TRUE i < 20 [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={7:0}, cnt=2, i=13, ret=-59, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=2, i=13, ret=-59, x={7:0}] [L28] COND TRUE i < 20 [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={7:0}, cnt=3, i=14, ret=-54, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=3, i=14, ret=-54, x={7:0}] [L28] COND TRUE i < 20 [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={7:0}, cnt=4, i=15, ret=-50, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=4, i=15, ret=-50, x={7:0}] [L28] COND TRUE i < 20 [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={7:0}, cnt=5, i=16, ret=-42, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=5, i=16, ret=-42, x={7:0}] [L28] COND TRUE i < 20 [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={7:0}, cnt=6, i=17, ret=-33, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=6, i=17, ret=-33, x={7:0}] [L28] COND TRUE i < 20 [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={7:0}, cnt=7, i=18, ret=-23, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=7, i=18, ret=-23, x={7:0}] [L28] COND TRUE i < 20 [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={7:0}, cnt=8, i=19, ret=-16, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=8, i=19, ret=-16, x={7:0}] [L28] COND TRUE i < 20 [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={7:0}, cnt=9, i=20, ret=-10, x={7:0}] [L28] COND TRUE i < 20 VAL [\old(x)={7:0}, cnt=9, ret=-10, x={7:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; [L52] RET, EXPR rangesum(x) VAL [ret=-1, x={7: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=5, x={7:0}] [L54] COND FALSE !(i<20 -1) VAL [i=0, ret2=-1, ret=-1, temp=5, x={7:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=1, ret2=-1, ret=-1, temp=5, x={7:0}] [L54] COND FALSE !(i<20 -1) VAL [i=1, ret2=-1, ret=-1, temp=5, x={7:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=2, ret2=-1, ret=-1, temp=5, x={7:0}] [L54] COND FALSE !(i<20 -1) VAL [i=2, ret2=-1, ret=-1, temp=5, x={7:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=3, ret2=-1, ret=-1, temp=5, x={7:0}] [L54] COND FALSE !(i<20 -1) VAL [i=3, ret2=-1, ret=-1, temp=5, x={7:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=4, ret2=-1, ret=-1, temp=5, x={7:0}] [L54] COND FALSE !(i<20 -1) VAL [i=4, ret2=-1, ret=-1, temp=5, x={7:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=5, ret2=-1, ret=-1, temp=5, x={7:0}] [L54] COND FALSE !(i<20 -1) VAL [i=5, ret2=-1, ret=-1, temp=5, x={7:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=6, ret2=-1, ret=-1, temp=5, x={7:0}] [L54] COND FALSE !(i<20 -1) VAL [i=6, ret2=-1, ret=-1, temp=5, x={7:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=7, ret2=-1, ret=-1, temp=5, x={7:0}] [L54] COND FALSE !(i<20 -1) VAL [i=7, ret2=-1, ret=-1, temp=5, x={7:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=8, ret2=-1, ret=-1, temp=5, x={7:0}] [L54] COND FALSE !(i<20 -1) VAL [i=8, ret2=-1, ret=-1, temp=5, x={7:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=9, ret2=-1, ret=-1, temp=5, x={7:0}] [L54] COND FALSE !(i<20 -1) VAL [i=9, ret2=-1, ret=-1, temp=5, x={7:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=10, ret2=-1, ret=-1, temp=5, x={7:0}] [L54] COND FALSE !(i<20 -1) VAL [i=10, ret2=-1, ret=-1, temp=5, x={7:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=11, ret2=-1, ret=-1, temp=5, x={7:0}] [L54] COND FALSE !(i<20 -1) VAL [i=11, ret2=-1, ret=-1, temp=5, x={7:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=12, ret2=-1, ret=-1, temp=5, x={7:0}] [L54] COND FALSE !(i<20 -1) VAL [i=12, ret2=-1, ret=-1, temp=5, x={7:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=13, ret2=-1, ret=-1, temp=5, x={7:0}] [L54] COND FALSE !(i<20 -1) VAL [i=13, ret2=-1, ret=-1, temp=5, x={7:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=14, ret2=-1, ret=-1, temp=5, x={7:0}] [L54] COND FALSE !(i<20 -1) VAL [i=14, ret2=-1, ret=-1, temp=5, x={7:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=15, ret2=-1, ret=-1, temp=5, x={7:0}] [L54] COND FALSE !(i<20 -1) VAL [i=15, ret2=-1, ret=-1, temp=5, x={7:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=16, ret2=-1, ret=-1, temp=5, x={7:0}] [L54] COND FALSE !(i<20 -1) VAL [i=16, ret2=-1, ret=-1, temp=5, x={7:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=17, ret2=-1, ret=-1, temp=5, x={7:0}] [L54] COND FALSE !(i<20 -1) VAL [i=17, ret2=-1, ret=-1, temp=5, x={7:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=18, ret2=-1, ret=-1, temp=5, x={7:0}] [L54] COND FALSE !(i<20 -1) VAL [i=18, ret2=-1, ret=-1, temp=5, x={7:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=19, ret2=-1, ret=-1, temp=5, x={7:0}] [L54] COND TRUE i<20 -1 VAL [ret2=-1, ret=-1, temp=5, x={7:0}] [L57] x[20 -1] = temp VAL [ret2=-1, ret=-1, x={7:0}] [L58] CALL, EXPR rangesum(x) VAL [\old(x)={7:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [\old(x)={7:0}, cnt=0, i=0, ret=0, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=0, i=0, ret=0, x={7:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={7:0}, cnt=0, i=1, ret=0, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=0, i=1, ret=0, x={7:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={7:0}, cnt=0, i=2, ret=0, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=0, i=2, ret=0, x={7:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={7:0}, cnt=0, i=3, ret=0, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=0, i=3, ret=0, x={7:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={7:0}, cnt=0, i=4, ret=0, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=0, i=4, ret=0, x={7:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={7:0}, cnt=0, i=5, ret=0, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=0, i=5, ret=0, x={7:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={7:0}, cnt=0, i=6, ret=0, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=0, i=6, ret=0, x={7:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={7:0}, cnt=0, i=7, ret=0, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=0, i=7, ret=0, x={7:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={7:0}, cnt=0, i=8, ret=0, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=0, i=8, ret=0, x={7:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={7:0}, cnt=0, i=9, ret=0, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=0, i=9, ret=0, x={7:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={7:0}, cnt=0, i=10, ret=0, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=0, i=10, ret=0, x={7:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={7:0}, cnt=0, i=11, ret=0, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=0, i=11, ret=0, x={7:0}] [L28] COND TRUE i < 20 [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={7:0}, cnt=1, i=12, ret=-72, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=1, i=12, ret=-72, x={7:0}] [L28] COND TRUE i < 20 [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={7:0}, cnt=2, i=13, ret=-67, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=2, i=13, ret=-67, x={7:0}] [L28] COND TRUE i < 20 [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={7:0}, cnt=3, i=14, ret=-63, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=3, i=14, ret=-63, x={7:0}] [L28] COND TRUE i < 20 [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={7:0}, cnt=4, i=15, ret=-55, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=4, i=15, ret=-55, x={7:0}] [L28] COND TRUE i < 20 [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={7:0}, cnt=5, i=16, ret=-46, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=5, i=16, ret=-46, x={7:0}] [L28] COND TRUE i < 20 [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={7:0}, cnt=6, i=17, ret=-36, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=6, i=17, ret=-36, x={7:0}] [L28] COND TRUE i < 20 [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={7:0}, cnt=7, i=18, ret=-29, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=7, i=18, ret=-29, x={7:0}] [L28] COND TRUE i < 20 [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={7:0}, cnt=8, i=19, ret=-23, x={7:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={7:0}, cnt=8, i=19, ret=-23, x={7:0}] [L28] COND TRUE i < 20 [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 [L28] i++ VAL [\old(x)={7:0}, cnt=9, i=20, ret=-18, x={7:0}] [L28] COND TRUE i < 20 VAL [\old(x)={7:0}, cnt=9, ret=-18, x={7:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; [L58] RET, EXPR rangesum(x) VAL [ret2=-1, ret=-1, x={7:0}] [L58] ret5 = rangesum(x) [L60] COND TRUE ret != ret2 || ret !=ret5 VAL [x={7:0}] [L61] reach_error() VAL [x={7:0}] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 100.7MB. Free memory was 70.0MB in the beginning and 69.9MB in the end (delta: 26.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 354.81ms. Allocated memory is still 144.7MB. Free memory was 113.0MB in the beginning and 100.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.23ms. Allocated memory is still 144.7MB. Free memory was 100.5MB in the beginning and 98.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.61ms. Allocated memory is still 144.7MB. Free memory was 98.5MB in the beginning and 97.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 473.69ms. Allocated memory is still 144.7MB. Free memory was 97.1MB in the beginning and 81.7MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * CodeCheck took 70042.36ms. Allocated memory was 144.7MB in the beginning and 1.1GB in the end (delta: 910.2MB). Free memory was 81.6MB in the beginning and 772.3MB in the end (delta: -690.7MB). Peak memory consumption was 221.6MB. Max. memory is 16.1GB. * Witness Printer took 184.78ms. Allocated memory is still 1.1GB. Free memory was 772.3MB in the beginning and 759.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-08 23:03:19,454 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3a1149-20cd-4201-801f-299245c76e3a/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