./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 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c059d7c3-676f-4e41-a7df-8c096436b568/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c059d7c3-676f-4e41-a7df-8c096436b568/bin/ukojak-verify-EEHR8qb7sm/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c059d7c3-676f-4e41-a7df-8c096436b568/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c059d7c3-676f-4e41-a7df-8c096436b568/bin/ukojak-verify-EEHR8qb7sm/config/KojakReach.xml -i ../../sv-benchmarks/c/reducercommutativity/rangesum20.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c059d7c3-676f-4e41-a7df-8c096436b568/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c059d7c3-676f-4e41-a7df-8c096436b568/bin/ukojak-verify-EEHR8qb7sm --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.3.0-dev-826ab2b [2024-11-13 22:35:33,642 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 22:35:33,697 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c059d7c3-676f-4e41-a7df-8c096436b568/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-13 22:35:33,701 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 22:35:33,702 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 22:35:33,722 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 22:35:33,723 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 22:35:33,723 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 22:35:33,724 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 22:35:33,724 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 22:35:33,724 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 22:35:33,724 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 22:35:33,724 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 22:35:33,724 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 22:35:33,724 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 22:35:33,725 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 22:35:33,725 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 22:35:33,725 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 22:35:33,725 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 22:35:33,725 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 22:35:33,727 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 22:35:33,727 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 22:35:33,727 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 22:35:33,727 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 22:35:33,727 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 22:35:33,727 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 22:35:33,727 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 22:35:33,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 22:35:33,728 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 22:35:33,728 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 22:35:33,728 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 22:35:33,728 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 22:35:33,728 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 22:35:33,728 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c059d7c3-676f-4e41-a7df-8c096436b568/bin/ukojak-verify-EEHR8qb7sm 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-13 22:35:34,045 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 22:35:34,053 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 22:35:34,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 22:35:34,060 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 22:35:34,061 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 22:35:34,062 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c059d7c3-676f-4e41-a7df-8c096436b568/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/reducercommutativity/rangesum20.i Unable to find full path for "g++" [2024-11-13 22:35:35,957 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 22:35:36,244 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 22:35:36,248 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c059d7c3-676f-4e41-a7df-8c096436b568/sv-benchmarks/c/reducercommutativity/rangesum20.i [2024-11-13 22:35:36,256 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c059d7c3-676f-4e41-a7df-8c096436b568/bin/ukojak-verify-EEHR8qb7sm/data/30c7d3892/a878f1b07cd54bf190b54a56247f5d1e/FLAGd45534b20 [2024-11-13 22:35:36,277 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c059d7c3-676f-4e41-a7df-8c096436b568/bin/ukojak-verify-EEHR8qb7sm/data/30c7d3892/a878f1b07cd54bf190b54a56247f5d1e [2024-11-13 22:35:36,280 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 22:35:36,282 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 22:35:36,283 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 22:35:36,284 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 22:35:36,288 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 22:35:36,289 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 10:35:36" (1/1) ... [2024-11-13 22:35:36,292 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44654a09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:35:36, skipping insertion in model container [2024-11-13 22:35:36,292 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 10:35:36" (1/1) ... [2024-11-13 22:35:36,310 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 22:35:36,483 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_c059d7c3-676f-4e41-a7df-8c096436b568/sv-benchmarks/c/reducercommutativity/rangesum20.i[1465,1478] [2024-11-13 22:35:36,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 22:35:36,496 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 22:35:36,516 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_c059d7c3-676f-4e41-a7df-8c096436b568/sv-benchmarks/c/reducercommutativity/rangesum20.i[1465,1478] [2024-11-13 22:35:36,517 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 22:35:36,531 INFO L204 MainTranslator]: Completed translation [2024-11-13 22:35:36,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:35:36 WrapperNode [2024-11-13 22:35:36,532 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 22:35:36,533 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 22:35:36,533 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 22:35:36,533 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 22:35:36,540 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:35:36" (1/1) ... [2024-11-13 22:35:36,545 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:35:36" (1/1) ... [2024-11-13 22:35:36,565 INFO L138 Inliner]: procedures = 17, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 69 [2024-11-13 22:35:36,566 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 22:35:36,566 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 22:35:36,566 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 22:35:36,566 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 22:35:36,576 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:35:36" (1/1) ... [2024-11-13 22:35:36,577 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:35:36" (1/1) ... [2024-11-13 22:35:36,580 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:35:36" (1/1) ... [2024-11-13 22:35:36,581 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:35:36" (1/1) ... [2024-11-13 22:35:36,587 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:35:36" (1/1) ... [2024-11-13 22:35:36,590 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:35:36" (1/1) ... [2024-11-13 22:35:36,591 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:35:36" (1/1) ... [2024-11-13 22:35:36,592 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:35:36" (1/1) ... [2024-11-13 22:35:36,594 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 22:35:36,594 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 22:35:36,595 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 22:35:36,595 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 22:35:36,596 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:35:36" (1/1) ... [2024-11-13 22:35:36,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 22:35:36,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c059d7c3-676f-4e41-a7df-8c096436b568/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 22:35:36,629 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c059d7c3-676f-4e41-a7df-8c096436b568/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 22:35:36,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c059d7c3-676f-4e41-a7df-8c096436b568/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 22:35:36,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 22:35:36,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 22:35:36,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 22:35:36,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-13 22:35:36,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 22:35:36,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 22:35:36,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-13 22:35:36,653 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2024-11-13 22:35:36,653 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2024-11-13 22:35:36,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 22:35:36,733 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 22:35:36,735 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 22:35:36,910 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-13 22:35:36,910 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 22:35:36,962 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 22:35:36,963 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-13 22:35:36,965 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 10:35:36 BoogieIcfgContainer [2024-11-13 22:35:36,965 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 22:35:36,966 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 22:35:36,966 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 22:35:36,973 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 22:35:36,973 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 10:35:36" (1/1) ... [2024-11-13 22:35:36,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 22:35:37,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:37,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 17 states and 22 transitions. [2024-11-13 22:35:37,031 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2024-11-13 22:35:37,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 22:35:37,036 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:37,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:37,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:37,385 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 22:35:37,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:37,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 18 states and 23 transitions. [2024-11-13 22:35:37,447 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2024-11-13 22:35:37,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 22:35:37,448 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:37,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:37,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:37,717 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 22:35:37,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:37,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 19 states and 25 transitions. [2024-11-13 22:35:37,795 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2024-11-13 22:35:37,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 22:35:37,796 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:37,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:37,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:37,983 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 22:35:38,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:38,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 20 states and 27 transitions. [2024-11-13 22:35:38,028 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2024-11-13 22:35:38,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 22:35:38,029 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:38,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:38,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:38,219 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 22:35:38,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:38,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 21 states and 29 transitions. [2024-11-13 22:35:38,315 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 29 transitions. [2024-11-13 22:35:38,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-13 22:35:38,316 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:38,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:38,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:38,488 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-13 22:35:38,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:38,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 22 states and 31 transitions. [2024-11-13 22:35:38,533 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2024-11-13 22:35:38,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-13 22:35:38,534 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:38,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:38,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:38,732 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-13 22:35:38,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:38,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 23 states and 33 transitions. [2024-11-13 22:35:38,810 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 33 transitions. [2024-11-13 22:35:38,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-13 22:35:38,810 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:38,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:38,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:38,992 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-13 22:35:39,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:39,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 24 states and 34 transitions. [2024-11-13 22:35:39,092 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2024-11-13 22:35:39,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-13 22:35:39,094 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:39,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:39,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:39,291 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-13 22:35:39,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:39,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 25 states and 35 transitions. [2024-11-13 22:35:39,391 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2024-11-13 22:35:39,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-13 22:35:39,392 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:39,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:39,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:39,623 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-13 22:35:39,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:39,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 26 states and 36 transitions. [2024-11-13 22:35:39,732 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2024-11-13 22:35:39,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-13 22:35:39,733 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:39,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:39,978 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-13 22:35:40,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:40,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 27 states and 37 transitions. [2024-11-13 22:35:40,083 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2024-11-13 22:35:40,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-13 22:35:40,087 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:40,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:40,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:40,371 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-13 22:35:40,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:40,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 28 states and 38 transitions. [2024-11-13 22:35:40,492 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2024-11-13 22:35:40,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 22:35:40,493 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:40,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:40,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:40,739 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-13 22:35:40,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:40,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 29 states and 39 transitions. [2024-11-13 22:35:40,849 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2024-11-13 22:35:40,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 22:35:40,850 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:40,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:40,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:41,067 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-13 22:35:41,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:41,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 30 states and 40 transitions. [2024-11-13 22:35:41,178 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2024-11-13 22:35:41,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 22:35:41,179 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:41,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:41,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:41,451 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-13 22:35:41,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:41,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 31 states and 41 transitions. [2024-11-13 22:35:41,581 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2024-11-13 22:35:41,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-13 22:35:41,581 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:41,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:41,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:41,872 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-13 22:35:41,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:42,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 32 states and 42 transitions. [2024-11-13 22:35:42,000 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2024-11-13 22:35:42,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 22:35:42,000 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:42,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:42,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:42,282 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-13 22:35:42,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:42,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 33 states and 43 transitions. [2024-11-13 22:35:42,417 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2024-11-13 22:35:42,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 22:35:42,417 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:42,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:42,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:42,745 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-13 22:35:42,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:42,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 34 states and 44 transitions. [2024-11-13 22:35:42,909 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2024-11-13 22:35:42,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-13 22:35:42,910 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:42,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:42,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:43,227 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-13 22:35:43,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:43,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 35 states and 45 transitions. [2024-11-13 22:35:43,375 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2024-11-13 22:35:43,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 22:35:43,376 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:43,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:43,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:43,667 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-13 22:35:43,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:43,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 36 states and 46 transitions. [2024-11-13 22:35:43,833 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2024-11-13 22:35:43,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-13 22:35:43,833 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:43,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:43,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:44,133 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-13 22:35:44,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:44,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 37 states and 47 transitions. [2024-11-13 22:35:44,283 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2024-11-13 22:35:44,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-13 22:35:44,284 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:44,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:44,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:44,603 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-13 22:35:44,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:44,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 38 states and 48 transitions. [2024-11-13 22:35:44,764 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2024-11-13 22:35:44,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-13 22:35:44,764 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:44,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:44,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:45,123 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-13 22:35:45,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:45,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 39 states and 49 transitions. [2024-11-13 22:35:45,287 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2024-11-13 22:35:45,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-13 22:35:45,287 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:45,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:45,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:45,612 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-13 22:35:45,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:45,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 40 states and 50 transitions. [2024-11-13 22:35:45,776 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2024-11-13 22:35:45,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-13 22:35:45,777 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:45,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:46,123 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-13 22:35:46,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:46,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 41 states and 50 transitions. [2024-11-13 22:35:46,300 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2024-11-13 22:35:46,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-13 22:35:46,300 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:46,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:46,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:46,467 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-11-13 22:35:46,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:46,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 42 states and 51 transitions. [2024-11-13 22:35:46,644 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2024-11-13 22:35:46,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-13 22:35:46,645 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:46,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:46,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:46,842 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-13 22:35:47,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:47,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 43 states and 52 transitions. [2024-11-13 22:35:47,023 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2024-11-13 22:35:47,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-13 22:35:47,024 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:47,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:47,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:47,244 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2024-11-13 22:35:47,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:47,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 44 states and 53 transitions. [2024-11-13 22:35:47,443 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2024-11-13 22:35:47,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-13 22:35:47,444 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:47,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:47,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:47,729 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 0 proven. 89 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2024-11-13 22:35:47,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:47,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 45 states and 54 transitions. [2024-11-13 22:35:47,951 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2024-11-13 22:35:47,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-13 22:35:47,952 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:47,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:48,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:48,211 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2024-11-13 22:35:48,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:48,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 46 states and 55 transitions. [2024-11-13 22:35:48,413 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2024-11-13 22:35:48,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-13 22:35:48,413 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:48,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:48,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:48,691 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 158 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2024-11-13 22:35:48,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:48,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 47 states and 56 transitions. [2024-11-13 22:35:48,890 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2024-11-13 22:35:48,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-13 22:35:48,891 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:48,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:48,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:49,204 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-11-13 22:35:49,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:49,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 48 states and 57 transitions. [2024-11-13 22:35:49,417 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2024-11-13 22:35:49,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-13 22:35:49,419 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:49,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:49,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:49,767 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 407 trivial. 0 not checked. [2024-11-13 22:35:49,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:49,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 49 states and 58 transitions. [2024-11-13 22:35:49,980 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2024-11-13 22:35:49,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-13 22:35:49,981 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:49,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:50,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:50,312 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 0 proven. 299 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2024-11-13 22:35:50,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:50,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 50 states and 59 transitions. [2024-11-13 22:35:50,536 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2024-11-13 22:35:50,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-13 22:35:50,538 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:50,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:50,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:50,909 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 0 proven. 356 refuted. 0 times theorem prover too weak. 493 trivial. 0 not checked. [2024-11-13 22:35:51,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:51,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 51 states and 60 transitions. [2024-11-13 22:35:51,139 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2024-11-13 22:35:51,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-13 22:35:51,139 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:51,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:51,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:51,543 INFO L134 CoverageAnalysis]: Checked inductivity of 960 backedges. 0 proven. 418 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2024-11-13 22:35:51,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:51,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 52 states and 61 transitions. [2024-11-13 22:35:51,764 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2024-11-13 22:35:51,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-13 22:35:51,765 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:51,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:51,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:52,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 0 proven. 485 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2024-11-13 22:35:52,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:52,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 53 states and 62 transitions. [2024-11-13 22:35:52,445 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2024-11-13 22:35:52,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-13 22:35:52,446 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:52,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:52,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:52,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1209 backedges. 0 proven. 557 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2024-11-13 22:35:53,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:53,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 54 states and 63 transitions. [2024-11-13 22:35:53,102 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2024-11-13 22:35:53,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-13 22:35:53,103 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:53,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:53,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:53,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1347 backedges. 0 proven. 634 refuted. 0 times theorem prover too weak. 713 trivial. 0 not checked. [2024-11-13 22:35:53,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:53,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 55 states and 64 transitions. [2024-11-13 22:35:53,777 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2024-11-13 22:35:53,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-13 22:35:53,778 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:53,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:53,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:54,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1494 backedges. 0 proven. 716 refuted. 0 times theorem prover too weak. 778 trivial. 0 not checked. [2024-11-13 22:35:54,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:54,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 56 states and 65 transitions. [2024-11-13 22:35:54,486 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2024-11-13 22:35:54,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-13 22:35:54,487 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:54,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:54,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:55,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 0 proven. 803 refuted. 0 times theorem prover too weak. 847 trivial. 0 not checked. [2024-11-13 22:35:55,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:55,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 57 states and 66 transitions. [2024-11-13 22:35:55,326 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2024-11-13 22:35:55,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-13 22:35:55,327 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:55,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:55,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:55,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1815 backedges. 0 proven. 895 refuted. 0 times theorem prover too weak. 920 trivial. 0 not checked. [2024-11-13 22:35:56,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:56,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 58 states and 67 transitions. [2024-11-13 22:35:56,126 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2024-11-13 22:35:56,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 22:35:56,127 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:56,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:56,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:56,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1989 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 997 trivial. 0 not checked. [2024-11-13 22:35:56,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:56,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 59 states and 67 transitions. [2024-11-13 22:35:56,972 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2024-11-13 22:35:56,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-13 22:35:56,973 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:56,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:57,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:57,243 INFO L134 CoverageAnalysis]: Checked inductivity of 2172 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2024-11-13 22:35:57,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:57,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 60 states and 68 transitions. [2024-11-13 22:35:57,505 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2024-11-13 22:35:57,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 22:35:57,506 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:57,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:57,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:57,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2175 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2024-11-13 22:35:58,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:58,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 61 states and 69 transitions. [2024-11-13 22:35:58,049 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2024-11-13 22:35:58,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-13 22:35:58,050 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:58,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:58,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:58,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2179 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2024-11-13 22:35:58,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:58,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 62 states and 70 transitions. [2024-11-13 22:35:58,673 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2024-11-13 22:35:58,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-13 22:35:58,674 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:58,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:58,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:59,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2184 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2024-11-13 22:35:59,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:59,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 63 states and 71 transitions. [2024-11-13 22:35:59,279 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2024-11-13 22:35:59,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-13 22:35:59,280 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:59,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:59,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:35:59,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2190 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2024-11-13 22:35:59,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:35:59,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 64 states and 72 transitions. [2024-11-13 22:35:59,927 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2024-11-13 22:35:59,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-13 22:35:59,928 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:35:59,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:35:59,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:00,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2197 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2024-11-13 22:36:00,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:00,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 65 states and 73 transitions. [2024-11-13 22:36:00,595 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2024-11-13 22:36:00,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-13 22:36:00,596 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:00,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:00,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2205 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2024-11-13 22:36:01,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:01,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 66 states and 74 transitions. [2024-11-13 22:36:01,284 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2024-11-13 22:36:01,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-13 22:36:01,284 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:01,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:01,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:01,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2214 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2024-11-13 22:36:01,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:01,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 67 states and 75 transitions. [2024-11-13 22:36:01,908 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2024-11-13 22:36:01,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-13 22:36:01,909 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:01,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:01,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:02,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2224 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2024-11-13 22:36:02,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:02,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 68 states and 76 transitions. [2024-11-13 22:36:02,631 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2024-11-13 22:36:02,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-13 22:36:02,632 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:02,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:02,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:03,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2235 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2024-11-13 22:36:03,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:03,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 69 states and 77 transitions. [2024-11-13 22:36:03,274 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2024-11-13 22:36:03,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-13 22:36:03,275 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:03,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:03,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:03,880 INFO L134 CoverageAnalysis]: Checked inductivity of 2247 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2024-11-13 22:36:04,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:04,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 70 states and 78 transitions. [2024-11-13 22:36:04,131 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2024-11-13 22:36:04,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-13 22:36:04,131 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:04,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:04,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:04,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2260 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2024-11-13 22:36:04,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:04,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 71 states and 79 transitions. [2024-11-13 22:36:04,891 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2024-11-13 22:36:04,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-13 22:36:04,892 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:04,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:04,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:05,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2274 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2024-11-13 22:36:05,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:05,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 72 states and 80 transitions. [2024-11-13 22:36:05,696 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2024-11-13 22:36:05,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 22:36:05,698 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:05,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:05,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:06,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2289 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2024-11-13 22:36:06,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:06,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 73 states and 81 transitions. [2024-11-13 22:36:06,446 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2024-11-13 22:36:06,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 22:36:06,447 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:06,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:06,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:07,046 INFO L134 CoverageAnalysis]: Checked inductivity of 2305 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2024-11-13 22:36:07,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:07,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 74 states and 82 transitions. [2024-11-13 22:36:07,297 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2024-11-13 22:36:07,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 22:36:07,298 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:07,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:07,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:07,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2322 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2024-11-13 22:36:08,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:08,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 75 states and 83 transitions. [2024-11-13 22:36:08,195 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2024-11-13 22:36:08,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-13 22:36:08,196 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:08,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:08,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:36:08,769 INFO L134 CoverageAnalysis]: Checked inductivity of 2340 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2024-11-13 22:36:09,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:36:09,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 76 states and 83 transitions. [2024-11-13 22:36:09,032 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2024-11-13 22:36:09,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-13 22:36:09,033 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:36:09,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:36:11,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 22:36:14,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 22:36:14,955 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 22:36:18,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 22:36:18,440 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 60 iterations. [2024-11-13 22:36:18,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 10:36:18 ImpRootNode [2024-11-13 22:36:18,562 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 22:36:18,563 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 22:36:18,563 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 22:36:18,563 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 22:36:18,564 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 10:35:36" (3/4) ... [2024-11-13 22:36:18,565 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-13 22:36:18,678 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c059d7c3-676f-4e41-a7df-8c096436b568/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 22:36:18,678 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 22:36:18,679 INFO L158 Benchmark]: Toolchain (without parser) took 42398.06ms. Allocated memory was 117.4MB in the beginning and 746.6MB in the end (delta: 629.1MB). Free memory was 91.7MB in the beginning and 568.8MB in the end (delta: -477.1MB). Peak memory consumption was 147.1MB. Max. memory is 16.1GB. [2024-11-13 22:36:18,679 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 83.9MB. Free memory is still 40.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 22:36:18,680 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.05ms. Allocated memory is still 117.4MB. Free memory was 91.3MB in the beginning and 80.1MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 22:36:18,681 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.86ms. Allocated memory is still 117.4MB. Free memory was 80.1MB in the beginning and 78.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 22:36:18,681 INFO L158 Benchmark]: Boogie Preprocessor took 27.60ms. Allocated memory is still 117.4MB. Free memory was 78.9MB in the beginning and 78.0MB in the end (delta: 876.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 22:36:18,682 INFO L158 Benchmark]: RCFGBuilder took 370.65ms. Allocated memory is still 117.4MB. Free memory was 77.6MB in the beginning and 63.0MB in the end (delta: 14.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 22:36:18,682 INFO L158 Benchmark]: CodeCheck took 41596.86ms. Allocated memory was 117.4MB in the beginning and 746.6MB in the end (delta: 629.1MB). Free memory was 63.0MB in the beginning and 577.2MB in the end (delta: -514.2MB). Peak memory consumption was 113.6MB. Max. memory is 16.1GB. [2024-11-13 22:36:18,684 INFO L158 Benchmark]: Witness Printer took 115.03ms. Allocated memory is still 746.6MB. Free memory was 577.2MB in the beginning and 568.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 22:36:18,686 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 41.5s, OverallIterations: 60, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2417 SdHoareTripleChecker+Valid, 20.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 826 SdHoareTripleChecker+Invalid, 17.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 6964 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7709 IncrementalHoareTripleChecker+Invalid, 14673 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6964 mSolverCounterUnsat, 826 mSDtfsCounter, 7709 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17997 GetRequests, 17272 SyntacticMatches, 495 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21313 ImplicationChecksByTransitivity, 13.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.4s SsaConstructionTime, 4.7s SatisfiabilityAnalysisTime, 17.4s InterpolantComputationTime, 4150 NumberOfCodeBlocks, 4150 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 3972 ConstructedInterpolants, 0 QuantifiedInterpolants, 5192 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 59 InterpolantComputations, 2 PerfectInterpolantSequences, 47241/56821 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={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=1, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=2, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=3, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=4, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=5, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=6, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=7, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=8, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=9, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=10, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=11, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=12, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=13, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=14, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=15, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=16, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=17, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=18, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=19, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=20, x={3:0}] [L17] COND FALSE !(i < 20) [L43] RET init_nondet(x) [L44] int temp; [L45] int ret; [L46] int ret2; [L47] int ret5; VAL [x={3:0}] [L49] CALL, EXPR rangesum(x) VAL [\old(x)={3:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=7, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=8, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=9, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=10, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=11, ret=0, x={3: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)={3:0}, cnt=1, i=12, ret=6, x={3: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)={3:0}, cnt=2, i=13, ret=9, x={3: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)={3:0}, cnt=3, i=14, ret=14, x={3: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)={3:0}, cnt=4, i=15, ret=15, x={3: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)={3:0}, cnt=5, i=16, ret=-57, x={3: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)={3:0}, cnt=6, i=17, ret=-42, x={3: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)={3:0}, cnt=7, i=18, ret=-28, x={3: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)={3:0}, cnt=8, i=19, ret=-24, x={3: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)={3:0}, cnt=9, i=20, ret=-19, x={3:0}] [L28] COND FALSE !(i < 20) [L34] COND TRUE cnt !=0 [L35] return ret / cnt; [L49] RET, EXPR rangesum(x) VAL [x={3:0}] [L49] ret = rangesum(x) [L51] EXPR x[0] [L51] temp=x[0] [L51] EXPR x[1] [L51] x[0] = x[1] [L51] x[1] = temp VAL [ret=-2, x={3:0}] [L52] CALL, EXPR rangesum(x) VAL [\old(x)={3:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=7, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=8, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=9, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=10, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=11, ret=0, x={3: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)={3:0}, cnt=1, i=12, ret=6, x={3: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)={3:0}, cnt=2, i=13, ret=9, x={3: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)={3:0}, cnt=3, i=14, ret=14, x={3: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)={3:0}, cnt=4, i=15, ret=15, x={3: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)={3:0}, cnt=5, i=16, ret=-57, x={3: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)={3:0}, cnt=6, i=17, ret=-42, x={3: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)={3:0}, cnt=7, i=18, ret=-28, x={3: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)={3:0}, cnt=8, i=19, ret=-24, x={3: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)={3:0}, cnt=9, i=20, ret=-19, x={3:0}] [L28] COND FALSE !(i < 20) [L34] COND TRUE cnt !=0 [L35] return ret / cnt; [L52] RET, EXPR rangesum(x) VAL [ret=-2, x={3:0}] [L52] ret2 = rangesum(x) [L53] EXPR x[0] [L53] temp=x[0] [L54] int i =0 ; VAL [i=0, ret2=-2, ret=-2, temp=8, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=1, ret2=-2, ret=-2, temp=8, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=2, ret2=-2, ret=-2, temp=8, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=3, ret2=-2, ret=-2, temp=8, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=4, ret2=-2, ret=-2, temp=8, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=5, ret2=-2, ret=-2, temp=8, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=6, ret2=-2, ret=-2, temp=8, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=7, ret2=-2, ret=-2, temp=8, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=8, ret2=-2, ret=-2, temp=8, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=9, ret2=-2, ret=-2, temp=8, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=10, ret2=-2, ret=-2, temp=8, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=11, ret2=-2, ret=-2, temp=8, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=12, ret2=-2, ret=-2, temp=8, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=13, ret2=-2, ret=-2, temp=8, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=14, ret2=-2, ret=-2, temp=8, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=15, ret2=-2, ret=-2, temp=8, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=16, ret2=-2, ret=-2, temp=8, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=17, ret2=-2, ret=-2, temp=8, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=18, ret2=-2, ret=-2, temp=8, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=19, ret2=-2, ret=-2, temp=8, x={3:0}] [L54] COND FALSE !(i<20 -1) [L57] x[20 -1] = temp VAL [ret2=-2, ret=-2, x={3:0}] [L58] CALL, EXPR rangesum(x) VAL [\old(x)={3:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=7, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=8, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=9, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=10, ret=0, x={3:0}] [L28] COND TRUE i < 20 [L29] COND FALSE !(i > 20/2) [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=11, ret=0, x={3: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)={3:0}, cnt=1, i=12, ret=3, x={3: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)={3:0}, cnt=2, i=13, ret=8, x={3: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)={3:0}, cnt=3, i=14, ret=9, x={3: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)={3:0}, cnt=4, i=15, ret=-63, x={3: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)={3:0}, cnt=5, i=16, ret=-48, x={3: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)={3:0}, cnt=6, i=17, ret=-34, x={3: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)={3:0}, cnt=7, i=18, ret=-30, x={3: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)={3:0}, cnt=8, i=19, ret=-25, x={3: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)={3:0}, cnt=9, i=20, ret=-17, x={3:0}] [L28] COND FALSE !(i < 20) [L34] COND TRUE cnt !=0 [L35] return ret / cnt; [L58] RET, EXPR rangesum(x) VAL [ret2=-2, ret=-2, x={3:0}] [L58] ret5 = rangesum(x) [L60] COND TRUE ret != ret2 || ret !=ret5 VAL [x={3:0}] [L61] reach_error() VAL [x={3:0}] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 83.9MB. Free memory is still 40.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 249.05ms. Allocated memory is still 117.4MB. Free memory was 91.3MB in the beginning and 80.1MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.86ms. Allocated memory is still 117.4MB. Free memory was 80.1MB in the beginning and 78.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.60ms. Allocated memory is still 117.4MB. Free memory was 78.9MB in the beginning and 78.0MB in the end (delta: 876.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 370.65ms. Allocated memory is still 117.4MB. Free memory was 77.6MB in the beginning and 63.0MB in the end (delta: 14.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * CodeCheck took 41596.86ms. Allocated memory was 117.4MB in the beginning and 746.6MB in the end (delta: 629.1MB). Free memory was 63.0MB in the beginning and 577.2MB in the end (delta: -514.2MB). Peak memory consumption was 113.6MB. Max. memory is 16.1GB. * Witness Printer took 115.03ms. Allocated memory is still 746.6MB. Free memory was 577.2MB in the beginning and 568.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-13 22:36:18,733 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c059d7c3-676f-4e41-a7df-8c096436b568/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE