./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/fuzzle-programs/06_fuzzle_50x50_0-cycle.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a7b56b-f811-4b81-8fd1-7ee180c8ecf6/bin/ukojak-verify-ENZ3QT5qd3/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a7b56b-f811-4b81-8fd1-7ee180c8ecf6/bin/ukojak-verify-ENZ3QT5qd3/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a7b56b-f811-4b81-8fd1-7ee180c8ecf6/bin/ukojak-verify-ENZ3QT5qd3/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a7b56b-f811-4b81-8fd1-7ee180c8ecf6/bin/ukojak-verify-ENZ3QT5qd3/config/KojakReach.xml -i ../../sv-benchmarks/c/fuzzle-programs/06_fuzzle_50x50_0-cycle.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a7b56b-f811-4b81-8fd1-7ee180c8ecf6/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-64bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a7b56b-f811-4b81-8fd1-7ee180c8ecf6/bin/ukojak-verify-ENZ3QT5qd3 --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 64bit --witnessprinter.graph.data.programhash 0a59c76064ce69d1e37014ae76afc559513e38a7247de62a527cd2c3a23c4b09 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-25 04:01:04,433 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-25 04:01:04,511 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a7b56b-f811-4b81-8fd1-7ee180c8ecf6/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-64bit-Kojak_Default.epf [2024-11-25 04:01:04,515 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-25 04:01:04,516 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-25 04:01:04,553 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-25 04:01:04,554 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-25 04:01:04,554 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-25 04:01:04,555 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-25 04:01:04,555 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-25 04:01:04,555 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-25 04:01:04,555 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-25 04:01:04,555 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-25 04:01:04,555 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-25 04:01:04,555 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-25 04:01:04,556 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-25 04:01:04,556 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-25 04:01:04,557 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-25 04:01:04,557 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-25 04:01:04,557 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-25 04:01:04,558 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-25 04:01:04,558 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-25 04:01:04,558 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-25 04:01:04,558 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-25 04:01:04,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 04:01:04,558 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-25 04:01:04,558 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-25 04:01:04,559 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-25 04:01:04,559 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-25 04:01:04,559 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-25 04:01:04,559 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_38a7b56b-f811-4b81-8fd1-7ee180c8ecf6/bin/ukojak-verify-ENZ3QT5qd3 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0a59c76064ce69d1e37014ae76afc559513e38a7247de62a527cd2c3a23c4b09 [2024-11-25 04:01:04,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-25 04:01:04,894 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-25 04:01:04,898 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-25 04:01:04,899 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-25 04:01:04,900 INFO L274 PluginConnector]: CDTParser initialized [2024-11-25 04:01:04,901 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a7b56b-f811-4b81-8fd1-7ee180c8ecf6/bin/ukojak-verify-ENZ3QT5qd3/../../sv-benchmarks/c/fuzzle-programs/06_fuzzle_50x50_0-cycle.c [2024-11-25 04:01:07,747 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a7b56b-f811-4b81-8fd1-7ee180c8ecf6/bin/ukojak-verify-ENZ3QT5qd3/data/99dc56bdb/b5e759b7496544bb9d374af34efc8665/FLAG4d4c6abbf [2024-11-25 04:01:08,638 INFO L384 CDTParser]: Found 1 translation units. [2024-11-25 04:01:08,639 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a7b56b-f811-4b81-8fd1-7ee180c8ecf6/sv-benchmarks/c/fuzzle-programs/06_fuzzle_50x50_0-cycle.c [2024-11-25 04:01:08,719 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a7b56b-f811-4b81-8fd1-7ee180c8ecf6/bin/ukojak-verify-ENZ3QT5qd3/data/99dc56bdb/b5e759b7496544bb9d374af34efc8665/FLAG4d4c6abbf [2024-11-25 04:01:08,741 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a7b56b-f811-4b81-8fd1-7ee180c8ecf6/bin/ukojak-verify-ENZ3QT5qd3/data/99dc56bdb/b5e759b7496544bb9d374af34efc8665 [2024-11-25 04:01:08,743 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-25 04:01:08,744 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-25 04:01:08,745 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-25 04:01:08,745 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-25 04:01:08,749 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-25 04:01:08,749 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:01:08" (1/1) ... [2024-11-25 04:01:08,750 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58aab856 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:01:08, skipping insertion in model container [2024-11-25 04:01:08,750 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:01:08" (1/1) ... [2024-11-25 04:01:08,958 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-25 04:01:22,242 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_38a7b56b-f811-4b81-8fd1-7ee180c8ecf6/sv-benchmarks/c/fuzzle-programs/06_fuzzle_50x50_0-cycle.c[61998,62011] [2024-11-25 04:01:22,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 04:01:23,011 INFO L200 MainTranslator]: Completed pre-run [2024-11-25 04:01:23,073 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_38a7b56b-f811-4b81-8fd1-7ee180c8ecf6/sv-benchmarks/c/fuzzle-programs/06_fuzzle_50x50_0-cycle.c[61998,62011] [2024-11-25 04:01:23,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 04:01:24,800 INFO L204 MainTranslator]: Completed translation [2024-11-25 04:01:24,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:01:24 WrapperNode [2024-11-25 04:01:24,801 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-25 04:01:24,802 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-25 04:01:24,803 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-25 04:01:24,803 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-25 04:01:24,813 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:01:24" (1/1) ... [2024-11-25 04:01:24,965 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:01:24" (1/1) ... [2024-11-25 04:01:25,850 INFO L138 Inliner]: procedures = 2514, calls = 5009, calls flagged for inlining = 2504, calls inlined = 2504, statements flattened = 32516 [2024-11-25 04:01:25,851 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-25 04:01:25,852 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-25 04:01:25,853 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-25 04:01:25,853 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-25 04:01:25,860 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:01:24" (1/1) ... [2024-11-25 04:01:25,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:01:24" (1/1) ... [2024-11-25 04:01:25,927 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:01:24" (1/1) ... [2024-11-25 04:01:25,928 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:01:24" (1/1) ... [2024-11-25 04:01:26,272 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:01:24" (1/1) ... [2024-11-25 04:01:26,297 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:01:24" (1/1) ... [2024-11-25 04:01:26,414 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:01:24" (1/1) ... [2024-11-25 04:01:26,457 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:01:24" (1/1) ... [2024-11-25 04:01:26,512 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:01:24" (1/1) ... [2024-11-25 04:01:26,642 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-25 04:01:26,644 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-25 04:01:26,644 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-25 04:01:26,645 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-25 04:01:26,646 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:01:24" (1/1) ... [2024-11-25 04:01:26,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 04:01:26,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a7b56b-f811-4b81-8fd1-7ee180c8ecf6/bin/ukojak-verify-ENZ3QT5qd3/z3 [2024-11-25 04:01:26,677 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a7b56b-f811-4b81-8fd1-7ee180c8ecf6/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-25 04:01:26,686 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a7b56b-f811-4b81-8fd1-7ee180c8ecf6/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-25 04:01:26,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-25 04:01:26,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-25 04:01:26,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-25 04:01:26,709 INFO L130 BoogieDeclarations]: Found specification of procedure is_within_limit [2024-11-25 04:01:26,709 INFO L138 BoogieDeclarations]: Found implementation of procedure is_within_limit [2024-11-25 04:01:26,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-25 04:01:28,501 INFO L234 CfgBuilder]: Building ICFG [2024-11-25 04:01:28,503 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-25 04:01:41,999 INFO L? ?]: Removed 8158 outVars from TransFormulas that were not future-live. [2024-11-25 04:01:41,999 INFO L283 CfgBuilder]: Performing block encoding [2024-11-25 04:01:58,490 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-25 04:01:58,490 INFO L312 CfgBuilder]: Removed 1121 assume(true) statements. [2024-11-25 04:01:58,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:01:58 BoogieIcfgContainer [2024-11-25 04:01:58,491 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-25 04:01:58,492 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-25 04:01:58,492 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-25 04:01:58,501 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-25 04:01:58,502 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:01:58" (1/1) ... [2024-11-25 04:01:58,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-25 04:01:58,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:01:58,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19582 states to 12814 states and 19582 transitions. [2024-11-25 04:01:58,932 INFO L276 IsEmpty]: Start isEmpty. Operand 12814 states and 19582 transitions. [2024-11-25 04:01:59,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 982 [2024-11-25 04:01:59,013 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:01:59,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:02:00,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-25 04:02:00,697 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-25 04:02:01,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-25 04:02:02,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-25 04:02:02,451 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-25 04:02:02,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-25 04:02:03,191 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 1 iterations. [2024-11-25 04:02:03,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 25.11 04:02:03 ImpRootNode [2024-11-25 04:02:03,403 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-25 04:02:03,404 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-25 04:02:03,405 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-25 04:02:03,405 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-25 04:02:03,405 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:01:58" (3/4) ... [2024-11-25 04:02:03,406 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-25 04:02:03,626 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 755. [2024-11-25 04:02:03,928 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a7b56b-f811-4b81-8fd1-7ee180c8ecf6/bin/ukojak-verify-ENZ3QT5qd3/witness.graphml [2024-11-25 04:02:03,929 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a7b56b-f811-4b81-8fd1-7ee180c8ecf6/bin/ukojak-verify-ENZ3QT5qd3/witness.yml [2024-11-25 04:02:03,929 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-25 04:02:03,930 INFO L158 Benchmark]: Toolchain (without parser) took 55185.51ms. Allocated memory was 117.4MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 73.1MB in the beginning and 1.8GB in the end (delta: -1.8GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. [2024-11-25 04:02:03,930 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 142.6MB. Free memory is still 79.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 04:02:03,930 INFO L158 Benchmark]: CACSL2BoogieTranslator took 16056.86ms. Allocated memory was 117.4MB in the beginning and 704.6MB in the end (delta: 587.2MB). Free memory was 73.1MB in the beginning and 406.5MB in the end (delta: -333.4MB). Peak memory consumption was 313.7MB. Max. memory is 16.1GB. [2024-11-25 04:02:03,931 INFO L158 Benchmark]: Boogie Procedure Inliner took 1048.78ms. Allocated memory is still 704.6MB. Free memory was 406.5MB in the beginning and 241.3MB in the end (delta: 165.3MB). Peak memory consumption was 167.8MB. Max. memory is 16.1GB. [2024-11-25 04:02:03,931 INFO L158 Benchmark]: Boogie Preprocessor took 790.09ms. Allocated memory is still 704.6MB. Free memory was 241.3MB in the beginning and 447.2MB in the end (delta: -205.9MB). Peak memory consumption was 127.1MB. Max. memory is 16.1GB. [2024-11-25 04:02:03,931 INFO L158 Benchmark]: RCFGBuilder took 31847.04ms. Allocated memory was 704.6MB in the beginning and 3.9GB in the end (delta: 3.2GB). Free memory was 447.2MB in the beginning and 2.7GB in the end (delta: -2.2GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. [2024-11-25 04:02:03,932 INFO L158 Benchmark]: CodeCheck took 4911.38ms. Allocated memory is still 3.9GB. Free memory was 2.7GB in the beginning and 1.9GB in the end (delta: 805.3MB). Peak memory consumption was 805.3MB. Max. memory is 16.1GB. [2024-11-25 04:02:03,932 INFO L158 Benchmark]: Witness Printer took 525.30ms. Allocated memory is still 3.9GB. Free memory was 1.9GB in the beginning and 1.8GB in the end (delta: 46.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-25 04:02:03,934 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, 12814 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 1, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 981 NumberOfCodeBlocks, 981 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - CounterExampleResult [Line: 2515]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22521] int cnt = 0; [L22522] CALL func_0(cnt + 1) [L2518] CALL is_within_limit(cnt) VAL [\old(cnt)=1] [L2513] return cnt <= 2500; [L2518] RET is_within_limit(cnt) VAL [cnt=1] [L2518] COND TRUE is_within_limit(cnt) [L2519] char c = __VERIFIER_nondet_char(); [L2520] COND FALSE !(c < 0) VAL [c=0, cnt=1] [L2523] COND TRUE c >= 0 [L2524] CALL func_50(cnt + 1) [L2894] CALL is_within_limit(cnt) VAL [\old(cnt)=2] [L2513] return cnt <= 2500; [L2894] RET is_within_limit(cnt) VAL [cnt=2] [L2894] COND TRUE is_within_limit(cnt) [L2895] char c = __VERIFIER_nondet_char(); [L2897] CALL func_51(cnt + 1) [L2902] CALL is_within_limit(cnt) VAL [\old(cnt)=3] [L2513] return cnt <= 2500; [L2902] RET is_within_limit(cnt) VAL [cnt=3] [L2902] COND TRUE is_within_limit(cnt) [L2903] char c = __VERIFIER_nondet_char(); [L2904] COND TRUE c < 0 [L2905] CALL func_101(cnt + 1) [L3323] CALL is_within_limit(cnt) VAL [\old(cnt)=4] [L2513] return cnt <= 2500; [L3323] RET is_within_limit(cnt) VAL [cnt=4] [L3323] COND TRUE is_within_limit(cnt) [L3324] char c = __VERIFIER_nondet_char(); [L3325] COND TRUE c < 0 [L3326] CALL func_151(cnt + 1) [L3729] CALL is_within_limit(cnt) VAL [\old(cnt)=5] [L2513] return cnt <= 2500; [L3729] RET is_within_limit(cnt) VAL [cnt=5] [L3729] COND TRUE is_within_limit(cnt) [L3730] char c = __VERIFIER_nondet_char(); [L3731] COND FALSE !(c < 0) VAL [c=0, cnt=5] [L3734] COND TRUE c >= 0 [L3735] CALL func_201(cnt + 1) [L4111] CALL is_within_limit(cnt) VAL [\old(cnt)=6] [L2513] return cnt <= 2500; [L4111] RET is_within_limit(cnt) VAL [cnt=6] [L4111] COND TRUE is_within_limit(cnt) [L4112] char c = __VERIFIER_nondet_char(); [L4113] COND FALSE !(c < 0) VAL [c=0, cnt=6] [L4116] COND TRUE c >= 0 [L4117] CALL func_202(cnt + 1) [L4122] CALL is_within_limit(cnt) VAL [\old(cnt)=7] [L2513] return cnt <= 2500; [L4122] RET is_within_limit(cnt) VAL [cnt=7] [L4122] COND TRUE is_within_limit(cnt) [L4123] char c = __VERIFIER_nondet_char(); [L4125] CALL func_203(cnt + 1) [L4130] CALL is_within_limit(cnt) VAL [\old(cnt)=8] [L2513] return cnt <= 2500; [L4130] RET is_within_limit(cnt) VAL [cnt=8] [L4130] COND TRUE is_within_limit(cnt) [L4131] char c = __VERIFIER_nondet_char(); [L4132] COND FALSE !(c < 0) VAL [c=0, cnt=8] [L4135] COND TRUE c >= 0 [L4136] CALL func_253(cnt + 1) [L4539] CALL is_within_limit(cnt) VAL [\old(cnt)=9] [L2513] return cnt <= 2500; [L4539] RET is_within_limit(cnt) VAL [cnt=9] [L4539] COND TRUE is_within_limit(cnt) [L4540] char c = __VERIFIER_nondet_char(); [L4542] CALL func_254(cnt + 1) [L4547] CALL is_within_limit(cnt) VAL [\old(cnt)=10] [L2513] return cnt <= 2500; [L4547] RET is_within_limit(cnt) VAL [cnt=10] [L4547] COND TRUE is_within_limit(cnt) [L4548] char c = __VERIFIER_nondet_char(); [L4549] COND FALSE !(c < 0) VAL [c=0, cnt=10] [L4552] COND TRUE c >= 0 [L4553] CALL func_255(cnt + 1) [L4558] CALL is_within_limit(cnt) VAL [\old(cnt)=11] [L2513] return cnt <= 2500; [L4558] RET is_within_limit(cnt) VAL [cnt=11] [L4558] COND TRUE is_within_limit(cnt) [L4559] char c = __VERIFIER_nondet_char(); [L4560] COND FALSE !(c < 0) VAL [c=0, cnt=11] [L4563] COND TRUE c >= 0 [L4564] CALL func_305(cnt + 1) [L4967] CALL is_within_limit(cnt) VAL [\old(cnt)=12] [L2513] return cnt <= 2500; [L4967] RET is_within_limit(cnt) VAL [cnt=12] [L4967] COND TRUE is_within_limit(cnt) [L4968] char c = __VERIFIER_nondet_char(); [L4969] COND FALSE !(c < -43) VAL [c=42, cnt=12] [L4972] COND FALSE !(c < 42) VAL [c=42, cnt=12] [L4975] COND TRUE c >= 42 [L4976] CALL func_306(cnt + 1) [L4981] CALL is_within_limit(cnt) VAL [\old(cnt)=13] [L2513] return cnt <= 2500; [L4981] RET is_within_limit(cnt) VAL [cnt=13] [L4981] COND TRUE is_within_limit(cnt) [L4982] char c = __VERIFIER_nondet_char(); [L4983] COND TRUE c < 0 [L4984] CALL func_256(cnt + 1) [L4569] CALL is_within_limit(cnt) VAL [\old(cnt)=14] [L2513] return cnt <= 2500; [L4569] RET is_within_limit(cnt) VAL [cnt=14] [L4569] COND TRUE is_within_limit(cnt) [L4570] char c = __VERIFIER_nondet_char(); [L4572] CALL func_257(cnt + 1) [L4577] CALL is_within_limit(cnt) VAL [\old(cnt)=15] [L2513] return cnt <= 2500; [L4577] RET is_within_limit(cnt) VAL [cnt=15] [L4577] COND TRUE is_within_limit(cnt) [L4578] char c = __VERIFIER_nondet_char(); [L4580] CALL func_307(cnt + 1) [L4992] CALL is_within_limit(cnt) VAL [\old(cnt)=16] [L2513] return cnt <= 2500; [L4992] RET is_within_limit(cnt) VAL [cnt=16] [L4992] COND TRUE is_within_limit(cnt) [L4993] char c = __VERIFIER_nondet_char(); [L4995] CALL func_308(cnt + 1) [L5000] CALL is_within_limit(cnt) VAL [\old(cnt)=17] [L2513] return cnt <= 2500; [L5000] RET is_within_limit(cnt) VAL [cnt=17] [L5000] COND TRUE is_within_limit(cnt) [L5001] char c = __VERIFIER_nondet_char(); [L5002] COND TRUE c < 0 [L5003] CALL func_258(cnt + 1) [L4585] CALL is_within_limit(cnt) VAL [\old(cnt)=18] [L2513] return cnt <= 2500; [L4585] RET is_within_limit(cnt) VAL [cnt=18] [L4585] COND TRUE is_within_limit(cnt) [L4586] char c = __VERIFIER_nondet_char(); [L4587] COND TRUE c < 0 [L4588] CALL func_208(cnt + 1) [L4173] CALL is_within_limit(cnt) VAL [\old(cnt)=19] [L2513] return cnt <= 2500; [L4173] RET is_within_limit(cnt) VAL [cnt=19] [L4173] COND TRUE is_within_limit(cnt) [L4174] char c = __VERIFIER_nondet_char(); [L4176] CALL func_158(cnt + 1) [L3776] CALL is_within_limit(cnt) VAL [\old(cnt)=20] [L2513] return cnt <= 2500; [L3776] RET is_within_limit(cnt) VAL [cnt=20] [L3776] COND TRUE is_within_limit(cnt) [L3777] char c = __VERIFIER_nondet_char(); [L3779] CALL func_159(cnt + 1) [L3784] CALL is_within_limit(cnt) VAL [\old(cnt)=21] [L2513] return cnt <= 2500; [L3784] RET is_within_limit(cnt) VAL [cnt=21] [L3784] COND TRUE is_within_limit(cnt) [L3785] char c = __VERIFIER_nondet_char(); [L3787] CALL func_109(cnt + 1) [L3393] CALL is_within_limit(cnt) VAL [\old(cnt)=22] [L2513] return cnt <= 2500; [L3393] RET is_within_limit(cnt) VAL [cnt=22] [L3393] COND TRUE is_within_limit(cnt) [L3394] char c = __VERIFIER_nondet_char(); [L3395] COND TRUE c < 0 [L3396] CALL func_59(cnt + 1) [L2966] CALL is_within_limit(cnt) VAL [\old(cnt)=23] [L2513] return cnt <= 2500; [L2966] RET is_within_limit(cnt) VAL [cnt=23] [L2966] COND TRUE is_within_limit(cnt) [L2967] char c = __VERIFIER_nondet_char(); [L2969] CALL func_60(cnt + 1) [L2974] CALL is_within_limit(cnt) VAL [\old(cnt)=24] [L2513] return cnt <= 2500; [L2974] RET is_within_limit(cnt) VAL [cnt=24] [L2974] COND TRUE is_within_limit(cnt) [L2975] char c = __VERIFIER_nondet_char(); [L2977] CALL func_61(cnt + 1) [L2982] CALL is_within_limit(cnt) VAL [\old(cnt)=25] [L2513] return cnt <= 2500; [L2982] RET is_within_limit(cnt) VAL [cnt=25] [L2982] COND TRUE is_within_limit(cnt) [L2983] char c = __VERIFIER_nondet_char(); [L2984] COND FALSE !(c < 0) VAL [c=0, cnt=25] [L2987] COND TRUE c >= 0 [L2988] CALL func_62(cnt + 1) [L2993] CALL is_within_limit(cnt) VAL [\old(cnt)=26] [L2513] return cnt <= 2500; [L2993] RET is_within_limit(cnt) VAL [cnt=26] [L2993] COND TRUE is_within_limit(cnt) [L2994] char c = __VERIFIER_nondet_char(); [L2995] COND FALSE !(c < 0) VAL [c=0, cnt=26] [L2998] COND TRUE c >= 0 [L2999] CALL func_63(cnt + 1) [L3004] CALL is_within_limit(cnt) VAL [\old(cnt)=27] [L2513] return cnt <= 2500; [L3004] RET is_within_limit(cnt) VAL [cnt=27] [L3004] COND TRUE is_within_limit(cnt) [L3005] char c = __VERIFIER_nondet_char(); [L3006] COND FALSE !(c < 0) VAL [c=0, cnt=27] [L3009] COND TRUE c >= 0 [L3010] CALL func_64(cnt + 1) [L3015] CALL is_within_limit(cnt) VAL [\old(cnt)=28] [L2513] return cnt <= 2500; [L3015] RET is_within_limit(cnt) VAL [cnt=28] [L3015] COND TRUE is_within_limit(cnt) [L3016] char c = __VERIFIER_nondet_char(); [L3017] COND FALSE !(c < 0) VAL [c=0, cnt=28] [L3020] COND TRUE c >= 0 [L3021] CALL func_65(cnt + 1) [L3026] CALL is_within_limit(cnt) VAL [\old(cnt)=29] [L2513] return cnt <= 2500; [L3026] RET is_within_limit(cnt) VAL [cnt=29] [L3026] COND TRUE is_within_limit(cnt) [L3027] char c = __VERIFIER_nondet_char(); [L3029] CALL func_15(cnt + 1) [L2629] CALL is_within_limit(cnt) VAL [\old(cnt)=30] [L2513] return cnt <= 2500; [L2629] RET is_within_limit(cnt) VAL [cnt=30] [L2629] COND TRUE is_within_limit(cnt) [L2630] char c = __VERIFIER_nondet_char(); [L2632] CALL func_16(cnt + 1) [L2637] CALL is_within_limit(cnt) VAL [\old(cnt)=31] [L2513] return cnt <= 2500; [L2637] RET is_within_limit(cnt) VAL [cnt=31] [L2637] COND TRUE is_within_limit(cnt) [L2638] char c = __VERIFIER_nondet_char(); [L2639] COND TRUE c < 0 [L2640] CALL func_66(cnt + 1) [L3034] CALL is_within_limit(cnt) VAL [\old(cnt)=32] [L2513] return cnt <= 2500; [L3034] RET is_within_limit(cnt) VAL [cnt=32] [L3034] COND TRUE is_within_limit(cnt) [L3035] char c = __VERIFIER_nondet_char(); [L3037] CALL func_116(cnt + 1) [L3446] CALL is_within_limit(cnt) VAL [\old(cnt)=33] [L2513] return cnt <= 2500; [L3446] RET is_within_limit(cnt) VAL [cnt=33] [L3446] COND TRUE is_within_limit(cnt) [L3447] char c = __VERIFIER_nondet_char(); [L3449] CALL func_117(cnt + 1) [L3454] CALL is_within_limit(cnt) VAL [\old(cnt)=34] [L2513] return cnt <= 2500; [L3454] RET is_within_limit(cnt) VAL [cnt=34] [L3454] COND TRUE is_within_limit(cnt) [L3455] char c = __VERIFIER_nondet_char(); [L3457] CALL func_167(cnt + 1) [L3845] CALL is_within_limit(cnt) VAL [\old(cnt)=35] [L2513] return cnt <= 2500; [L3845] RET is_within_limit(cnt) VAL [cnt=35] [L3845] COND TRUE is_within_limit(cnt) [L3846] char c = __VERIFIER_nondet_char(); [L3848] CALL func_168(cnt + 1) [L3853] CALL is_within_limit(cnt) VAL [\old(cnt)=36] [L2513] return cnt <= 2500; [L3853] RET is_within_limit(cnt) VAL [cnt=36] [L3853] COND TRUE is_within_limit(cnt) [L3854] char c = __VERIFIER_nondet_char(); [L3856] CALL func_218(cnt + 1) [L4259] CALL is_within_limit(cnt) VAL [\old(cnt)=37] [L2513] return cnt <= 2500; [L4259] RET is_within_limit(cnt) VAL [cnt=37] [L4259] COND TRUE is_within_limit(cnt) [L4260] char c = __VERIFIER_nondet_char(); [L4262] CALL func_268(cnt + 1) [L4656] CALL is_within_limit(cnt) VAL [\old(cnt)=38] [L2513] return cnt <= 2500; [L4656] RET is_within_limit(cnt) VAL [cnt=38] [L4656] COND TRUE is_within_limit(cnt) [L4657] char c = __VERIFIER_nondet_char(); [L4658] COND FALSE !(c < -43) VAL [c=42, cnt=38] [L4661] COND FALSE !(c < 42) VAL [c=42, cnt=38] [L4664] COND TRUE c >= 42 [L4665] CALL func_269(cnt + 1) [L4670] CALL is_within_limit(cnt) VAL [\old(cnt)=39] [L2513] return cnt <= 2500; [L4670] RET is_within_limit(cnt) VAL [cnt=39] [L4670] COND TRUE is_within_limit(cnt) [L4671] char c = __VERIFIER_nondet_char(); [L4672] COND TRUE c < 0 [L4673] CALL func_219(cnt + 1) [L4267] CALL is_within_limit(cnt) VAL [\old(cnt)=40] [L2513] return cnt <= 2500; [L4267] RET is_within_limit(cnt) VAL [cnt=40] [L4267] COND TRUE is_within_limit(cnt) [L4268] char c = __VERIFIER_nondet_char(); [L4269] COND FALSE !(c < 0) VAL [c=0, cnt=40] [L4272] COND TRUE c >= 0 [L4273] CALL func_220(cnt + 1) [L4278] CALL is_within_limit(cnt) VAL [\old(cnt)=41] [L2513] return cnt <= 2500; [L4278] RET is_within_limit(cnt) VAL [cnt=41] [L4278] COND TRUE is_within_limit(cnt) [L4279] char c = __VERIFIER_nondet_char(); [L4281] CALL func_270(cnt + 1) [L4681] CALL is_within_limit(cnt) VAL [\old(cnt)=42] [L2513] return cnt <= 2500; [L4681] RET is_within_limit(cnt) VAL [cnt=42] [L4681] COND TRUE is_within_limit(cnt) [L4682] char c = __VERIFIER_nondet_char(); [L4683] COND FALSE !(c < 0) VAL [c=0, cnt=42] [L4686] COND TRUE c >= 0 [L4687] CALL func_271(cnt + 1) [L4692] CALL is_within_limit(cnt) VAL [\old(cnt)=43] [L2513] return cnt <= 2500; [L4692] RET is_within_limit(cnt) VAL [cnt=43] [L4692] COND TRUE is_within_limit(cnt) [L4693] char c = __VERIFIER_nondet_char(); [L4694] COND FALSE !(c < 0) VAL [c=0, cnt=43] [L4697] COND TRUE c >= 0 [L4698] CALL func_272(cnt + 1) [L4703] CALL is_within_limit(cnt) VAL [\old(cnt)=44] [L2513] return cnt <= 2500; [L4703] RET is_within_limit(cnt) VAL [cnt=44] [L4703] COND TRUE is_within_limit(cnt) [L4704] char c = __VERIFIER_nondet_char(); [L4706] CALL func_273(cnt + 1) [L4711] CALL is_within_limit(cnt) VAL [\old(cnt)=45] [L2513] return cnt <= 2500; [L4711] RET is_within_limit(cnt) VAL [cnt=45] [L4711] COND TRUE is_within_limit(cnt) [L4712] char c = __VERIFIER_nondet_char(); [L4713] COND FALSE !(c < 0) VAL [c=0, cnt=45] [L4716] COND TRUE c >= 0 [L4717] CALL func_274(cnt + 1) [L4722] CALL is_within_limit(cnt) VAL [\old(cnt)=46] [L2513] return cnt <= 2500; [L4722] RET is_within_limit(cnt) VAL [cnt=46] [L4722] COND TRUE is_within_limit(cnt) [L4723] char c = __VERIFIER_nondet_char(); [L4724] COND FALSE !(c < 0) VAL [c=0, cnt=46] [L4727] COND TRUE c >= 0 [L4728] CALL func_324(cnt + 1) [L5113] CALL is_within_limit(cnt) VAL [\old(cnt)=47] [L2513] return cnt <= 2500; [L5113] RET is_within_limit(cnt) VAL [cnt=47] [L5113] COND TRUE is_within_limit(cnt) [L5114] char c = __VERIFIER_nondet_char(); [L5116] CALL func_325(cnt + 1) [L5121] CALL is_within_limit(cnt) VAL [\old(cnt)=48] [L2513] return cnt <= 2500; [L5121] RET is_within_limit(cnt) VAL [cnt=48] [L5121] COND TRUE is_within_limit(cnt) [L5122] char c = __VERIFIER_nondet_char(); [L5124] CALL func_275(cnt + 1) [L4733] CALL is_within_limit(cnt) VAL [\old(cnt)=49] [L2513] return cnt <= 2500; [L4733] RET is_within_limit(cnt) VAL [cnt=49] [L4733] COND TRUE is_within_limit(cnt) [L4734] char c = __VERIFIER_nondet_char(); [L4736] CALL func_276(cnt + 1) [L4741] CALL is_within_limit(cnt) VAL [\old(cnt)=50] [L2513] return cnt <= 2500; [L4741] RET is_within_limit(cnt) VAL [cnt=50] [L4741] COND TRUE is_within_limit(cnt) [L4742] char c = __VERIFIER_nondet_char(); [L4743] COND FALSE !(c < 0) VAL [c=0, cnt=50] [L4746] COND TRUE c >= 0 [L4747] CALL func_277(cnt + 1) [L4752] CALL is_within_limit(cnt) VAL [\old(cnt)=51] [L2513] return cnt <= 2500; [L4752] RET is_within_limit(cnt) VAL [cnt=51] [L4752] COND TRUE is_within_limit(cnt) [L4753] char c = __VERIFIER_nondet_char(); [L4755] CALL func_278(cnt + 1) [L4760] CALL is_within_limit(cnt) VAL [\old(cnt)=52] [L2513] return cnt <= 2500; [L4760] RET is_within_limit(cnt) VAL [cnt=52] [L4760] COND TRUE is_within_limit(cnt) [L4761] char c = __VERIFIER_nondet_char(); [L4763] CALL func_328(cnt + 1) [L5139] CALL is_within_limit(cnt) VAL [\old(cnt)=53] [L2513] return cnt <= 2500; [L5139] RET is_within_limit(cnt) VAL [cnt=53] [L5139] COND TRUE is_within_limit(cnt) [L5140] char c = __VERIFIER_nondet_char(); [L5141] COND FALSE !(c < 0) VAL [c=0, cnt=53] [L5144] COND TRUE c >= 0 [L5145] CALL func_329(cnt + 1) [L5150] CALL is_within_limit(cnt) VAL [\old(cnt)=54] [L2513] return cnt <= 2500; [L5150] RET is_within_limit(cnt) VAL [cnt=54] [L5150] COND TRUE is_within_limit(cnt) [L5151] char c = __VERIFIER_nondet_char(); [L5153] CALL func_330(cnt + 1) [L5158] CALL is_within_limit(cnt) VAL [\old(cnt)=55] [L2513] return cnt <= 2500; [L5158] RET is_within_limit(cnt) VAL [cnt=55] [L5158] COND TRUE is_within_limit(cnt) [L5159] char c = __VERIFIER_nondet_char(); [L5160] COND FALSE !(c < 0) VAL [c=0, cnt=55] [L5163] COND TRUE c >= 0 [L5164] CALL func_331(cnt + 1) [L5169] CALL is_within_limit(cnt) VAL [\old(cnt)=56] [L2513] return cnt <= 2500; [L5169] RET is_within_limit(cnt) VAL [cnt=56] [L5169] COND TRUE is_within_limit(cnt) [L5170] char c = __VERIFIER_nondet_char(); [L5172] CALL func_381(cnt + 1) [L5554] CALL is_within_limit(cnt) VAL [\old(cnt)=57] [L2513] return cnt <= 2500; [L5554] RET is_within_limit(cnt) VAL [cnt=57] [L5554] COND TRUE is_within_limit(cnt) [L5555] char c = __VERIFIER_nondet_char(); [L5556] COND FALSE !(c < 0) VAL [c=0, cnt=57] [L5559] COND TRUE c >= 0 [L5560] CALL func_382(cnt + 1) [L5565] CALL is_within_limit(cnt) VAL [\old(cnt)=58] [L2513] return cnt <= 2500; [L5565] RET is_within_limit(cnt) VAL [cnt=58] [L5565] COND TRUE is_within_limit(cnt) [L5566] char c = __VERIFIER_nondet_char(); [L5567] COND FALSE !(c < 0) VAL [c=0, cnt=58] [L5570] COND TRUE c >= 0 [L5571] CALL func_432(cnt + 1) [L5980] CALL is_within_limit(cnt) VAL [\old(cnt)=59] [L2513] return cnt <= 2500; [L5980] RET is_within_limit(cnt) VAL [cnt=59] [L5980] COND TRUE is_within_limit(cnt) [L5981] char c = __VERIFIER_nondet_char(); [L5982] COND TRUE c < 0 [L5983] CALL func_482(cnt + 1) [L6398] CALL is_within_limit(cnt) VAL [\old(cnt)=60] [L2513] return cnt <= 2500; [L6398] RET is_within_limit(cnt) VAL [cnt=60] [L6398] COND TRUE is_within_limit(cnt) [L6399] char c = __VERIFIER_nondet_char(); [L6400] COND FALSE !(c < 0) VAL [c=0, cnt=60] [L6403] COND TRUE c >= 0 [L6404] CALL func_532(cnt + 1) [L6783] CALL is_within_limit(cnt) VAL [\old(cnt)=61] [L2513] return cnt <= 2500; [L6783] RET is_within_limit(cnt) VAL [cnt=61] [L6783] COND TRUE is_within_limit(cnt) [L6784] char c = __VERIFIER_nondet_char(); [L6786] CALL func_533(cnt + 1) [L6791] CALL is_within_limit(cnt) VAL [\old(cnt)=62] [L2513] return cnt <= 2500; [L6791] RET is_within_limit(cnt) VAL [cnt=62] [L6791] COND TRUE is_within_limit(cnt) [L6792] char c = __VERIFIER_nondet_char(); [L6794] CALL func_583(cnt + 1) [L7188] CALL is_within_limit(cnt) VAL [\old(cnt)=63] [L2513] return cnt <= 2500; [L7188] RET is_within_limit(cnt) VAL [cnt=63] [L7188] COND TRUE is_within_limit(cnt) [L7189] char c = __VERIFIER_nondet_char(); [L7190] COND FALSE !(c < 0) VAL [c=0, cnt=63] [L7193] COND TRUE c >= 0 [L7194] CALL func_584(cnt + 1) [L7199] CALL is_within_limit(cnt) VAL [\old(cnt)=64] [L2513] return cnt <= 2500; [L7199] RET is_within_limit(cnt) VAL [cnt=64] [L7199] COND TRUE is_within_limit(cnt) [L7200] char c = __VERIFIER_nondet_char(); [L7202] CALL func_534(cnt + 1) [L6799] CALL is_within_limit(cnt) VAL [\old(cnt)=65] [L2513] return cnt <= 2500; [L6799] RET is_within_limit(cnt) VAL [cnt=65] [L6799] COND TRUE is_within_limit(cnt) [L6800] char c = __VERIFIER_nondet_char(); [L6802] CALL func_484(cnt + 1) [L6414] CALL is_within_limit(cnt) VAL [\old(cnt)=66] [L2513] return cnt <= 2500; [L6414] RET is_within_limit(cnt) VAL [cnt=66] [L6414] COND TRUE is_within_limit(cnt) [L6415] char c = __VERIFIER_nondet_char(); [L6416] COND FALSE !(c < 0) VAL [c=0, cnt=66] [L6419] COND TRUE c >= 0 [L6420] CALL func_485(cnt + 1) [L6425] CALL is_within_limit(cnt) VAL [\old(cnt)=67] [L2513] return cnt <= 2500; [L6425] RET is_within_limit(cnt) VAL [cnt=67] [L6425] COND TRUE is_within_limit(cnt) [L6426] char c = __VERIFIER_nondet_char(); [L6427] COND FALSE !(c < 0) VAL [c=0, cnt=67] [L6430] COND TRUE c >= 0 [L6431] CALL func_486(cnt + 1) [L6436] CALL is_within_limit(cnt) VAL [\old(cnt)=68] [L2513] return cnt <= 2500; [L6436] RET is_within_limit(cnt) VAL [cnt=68] [L6436] COND TRUE is_within_limit(cnt) [L6437] char c = __VERIFIER_nondet_char(); [L6439] CALL func_487(cnt + 1) [L6444] CALL is_within_limit(cnt) VAL [\old(cnt)=69] [L2513] return cnt <= 2500; [L6444] RET is_within_limit(cnt) VAL [cnt=69] [L6444] COND TRUE is_within_limit(cnt) [L6445] char c = __VERIFIER_nondet_char(); [L6447] CALL func_437(cnt + 1) [L6023] CALL is_within_limit(cnt) VAL [\old(cnt)=70] [L2513] return cnt <= 2500; [L6023] RET is_within_limit(cnt) VAL [cnt=70] [L6023] COND TRUE is_within_limit(cnt) [L6024] char c = __VERIFIER_nondet_char(); [L6026] CALL func_438(cnt + 1) [L6031] CALL is_within_limit(cnt) VAL [\old(cnt)=71] [L2513] return cnt <= 2500; [L6031] RET is_within_limit(cnt) VAL [cnt=71] [L6031] COND TRUE is_within_limit(cnt) [L6032] char c = __VERIFIER_nondet_char(); [L6033] COND FALSE !(c < -43) VAL [c=42, cnt=71] [L6036] COND FALSE !(c < 42) VAL [c=42, cnt=71] [L6039] COND TRUE c >= 42 [L6040] CALL func_439(cnt + 1) [L6045] CALL is_within_limit(cnt) VAL [\old(cnt)=72] [L2513] return cnt <= 2500; [L6045] RET is_within_limit(cnt) VAL [cnt=72] [L6045] COND TRUE is_within_limit(cnt) [L6046] char c = __VERIFIER_nondet_char(); [L6048] CALL func_389(cnt + 1) [L5624] CALL is_within_limit(cnt) VAL [\old(cnt)=73] [L2513] return cnt <= 2500; [L5624] RET is_within_limit(cnt) VAL [cnt=73] [L5624] COND TRUE is_within_limit(cnt) [L5625] char c = __VERIFIER_nondet_char(); [L5627] CALL func_390(cnt + 1) [L5632] CALL is_within_limit(cnt) VAL [\old(cnt)=74] [L2513] return cnt <= 2500; [L5632] RET is_within_limit(cnt) VAL [cnt=74] [L5632] COND TRUE is_within_limit(cnt) [L5633] char c = __VERIFIER_nondet_char(); [L5635] CALL func_391(cnt + 1) [L5640] CALL is_within_limit(cnt) VAL [\old(cnt)=75] [L2513] return cnt <= 2500; [L5640] RET is_within_limit(cnt) VAL [cnt=75] [L5640] COND TRUE is_within_limit(cnt) [L5641] char c = __VERIFIER_nondet_char(); [L5642] COND FALSE !(c < -43) VAL [c=0, cnt=75] [L5645] COND TRUE c < 42 [L5646] CALL func_441(cnt + 1) [L6058] CALL is_within_limit(cnt) VAL [\old(cnt)=76] [L2513] return cnt <= 2500; [L6058] RET is_within_limit(cnt) VAL [cnt=76] [L6058] COND TRUE is_within_limit(cnt) [L6059] char c = __VERIFIER_nondet_char(); [L6060] COND TRUE c < 0 [L6061] CALL func_491(cnt + 1) [L6473] CALL is_within_limit(cnt) VAL [\old(cnt)=77] [L2513] return cnt <= 2500; [L6473] RET is_within_limit(cnt) VAL [cnt=77] [L6473] COND TRUE is_within_limit(cnt) [L6474] char c = __VERIFIER_nondet_char(); [L6476] CALL func_492(cnt + 1) [L6481] CALL is_within_limit(cnt) VAL [\old(cnt)=78] [L2513] return cnt <= 2500; [L6481] RET is_within_limit(cnt) VAL [cnt=78] [L6481] COND TRUE is_within_limit(cnt) [L6482] char c = __VERIFIER_nondet_char(); [L6484] CALL func_493(cnt + 1) [L6489] CALL is_within_limit(cnt) VAL [\old(cnt)=79] [L2513] return cnt <= 2500; [L6489] RET is_within_limit(cnt) VAL [cnt=79] [L6489] COND TRUE is_within_limit(cnt) [L6490] char c = __VERIFIER_nondet_char(); [L6492] CALL func_543(cnt + 1) [L6865] CALL is_within_limit(cnt) VAL [\old(cnt)=80] [L2513] return cnt <= 2500; [L6865] RET is_within_limit(cnt) VAL [cnt=80] [L6865] COND TRUE is_within_limit(cnt) [L6866] char c = __VERIFIER_nondet_char(); [L6867] COND FALSE !(c < 0) VAL [c=0, cnt=80] [L6870] COND TRUE c >= 0 [L6871] CALL func_544(cnt + 1) [L6876] CALL is_within_limit(cnt) VAL [\old(cnt)=81] [L2513] return cnt <= 2500; [L6876] RET is_within_limit(cnt) VAL [cnt=81] [L6876] COND TRUE is_within_limit(cnt) [L6877] char c = __VERIFIER_nondet_char(); [L6879] CALL func_594(cnt + 1) [L7285] CALL is_within_limit(cnt) VAL [\old(cnt)=82] [L2513] return cnt <= 2500; [L7285] RET is_within_limit(cnt) VAL [cnt=82] [L7285] COND TRUE is_within_limit(cnt) [L7286] char c = __VERIFIER_nondet_char(); [L7287] COND TRUE c < 0 [L7288] CALL func_593(cnt + 1) [L7274] CALL is_within_limit(cnt) VAL [\old(cnt)=83] [L2513] return cnt <= 2500; [L7274] RET is_within_limit(cnt) VAL [cnt=83] [L7274] COND TRUE is_within_limit(cnt) [L7275] char c = __VERIFIER_nondet_char(); [L7276] COND FALSE !(c < 0) VAL [c=0, cnt=83] [L7279] COND TRUE c >= 0 [L7280] CALL func_643(cnt + 1) [L7671] CALL is_within_limit(cnt) VAL [\old(cnt)=84] [L2513] return cnt <= 2500; [L7671] RET is_within_limit(cnt) VAL [cnt=84] [L7671] COND TRUE is_within_limit(cnt) [L7672] char c = __VERIFIER_nondet_char(); [L7674] CALL func_693(cnt + 1) [L8074] CALL is_within_limit(cnt) VAL [\old(cnt)=85] [L2513] return cnt <= 2500; [L8074] RET is_within_limit(cnt) VAL [cnt=85] [L8074] COND TRUE is_within_limit(cnt) [L8075] char c = __VERIFIER_nondet_char(); [L8076] COND FALSE !(c < 0) VAL [c=0, cnt=85] [L8079] COND TRUE c >= 0 [L8080] CALL func_694(cnt + 1) [L8085] CALL is_within_limit(cnt) VAL [\old(cnt)=86] [L2513] return cnt <= 2500; [L8085] RET is_within_limit(cnt) VAL [cnt=86] [L8085] COND TRUE is_within_limit(cnt) [L8086] char c = __VERIFIER_nondet_char(); [L8088] CALL func_744(cnt + 1) [L8461] CALL is_within_limit(cnt) VAL [\old(cnt)=87] [L2513] return cnt <= 2500; [L8461] RET is_within_limit(cnt) VAL [cnt=87] [L8461] COND TRUE is_within_limit(cnt) [L8462] char c = __VERIFIER_nondet_char(); [L8463] COND TRUE c < 0 [L8464] CALL func_794(cnt + 1) [L8861] CALL is_within_limit(cnt) VAL [\old(cnt)=88] [L2513] return cnt <= 2500; [L8861] RET is_within_limit(cnt) VAL [cnt=88] [L8861] COND TRUE is_within_limit(cnt) [L8862] char c = __VERIFIER_nondet_char(); [L8864] CALL func_844(cnt + 1) [L9270] CALL is_within_limit(cnt) VAL [\old(cnt)=89] [L2513] return cnt <= 2500; [L9270] RET is_within_limit(cnt) VAL [cnt=89] [L9270] COND TRUE is_within_limit(cnt) [L9271] char c = __VERIFIER_nondet_char(); [L9272] COND FALSE !(c < 0) VAL [c=0, cnt=89] [L9275] COND TRUE c >= 0 [L9276] CALL func_894(cnt + 1) [L9691] CALL is_within_limit(cnt) VAL [\old(cnt)=90] [L2513] return cnt <= 2500; [L9691] RET is_within_limit(cnt) VAL [cnt=90] [L9691] COND TRUE is_within_limit(cnt) [L9692] char c = __VERIFIER_nondet_char(); [L9693] COND FALSE !(c < 0) VAL [c=0, cnt=90] [L9696] COND TRUE c >= 0 [L9697] CALL func_944(cnt + 1) [L10088] CALL is_within_limit(cnt) VAL [\old(cnt)=91] [L2513] return cnt <= 2500; [L10088] RET is_within_limit(cnt) VAL [cnt=91] [L10088] COND TRUE is_within_limit(cnt) [L10089] char c = __VERIFIER_nondet_char(); [L10090] COND FALSE !(c < -43) VAL [c=42, cnt=91] [L10093] COND FALSE !(c < 42) VAL [c=42, cnt=91] [L10096] COND TRUE c >= 42 [L10097] CALL func_945(cnt + 1) [L10102] CALL is_within_limit(cnt) VAL [\old(cnt)=92] [L2513] return cnt <= 2500; [L10102] RET is_within_limit(cnt) VAL [cnt=92] [L10102] COND TRUE is_within_limit(cnt) [L10103] char c = __VERIFIER_nondet_char(); [L10105] CALL func_995(cnt + 1) [L10481] CALL is_within_limit(cnt) VAL [\old(cnt)=93] [L2513] return cnt <= 2500; [L10481] RET is_within_limit(cnt) VAL [cnt=93] [L10481] COND TRUE is_within_limit(cnt) [L10482] char c = __VERIFIER_nondet_char(); [L10483] COND FALSE !(c < 0) VAL [c=0, cnt=93] [L10486] COND TRUE c >= 0 [L10487] CALL func_996(cnt + 1) [L10492] CALL is_within_limit(cnt) VAL [\old(cnt)=94] [L2513] return cnt <= 2500; [L10492] RET is_within_limit(cnt) VAL [cnt=94] [L10492] COND TRUE is_within_limit(cnt) [L10493] char c = __VERIFIER_nondet_char(); [L10494] COND FALSE !(c < 0) VAL [c=0, cnt=94] [L10497] COND TRUE c >= 0 [L10498] CALL func_997(cnt + 1) [L10503] CALL is_within_limit(cnt) VAL [\old(cnt)=95] [L2513] return cnt <= 2500; [L10503] RET is_within_limit(cnt) VAL [cnt=95] [L10503] COND TRUE is_within_limit(cnt) [L10504] char c = __VERIFIER_nondet_char(); [L10505] COND FALSE !(c < 0) VAL [c=0, cnt=95] [L10508] COND TRUE c >= 0 [L10509] CALL func_998(cnt + 1) [L10514] CALL is_within_limit(cnt) VAL [\old(cnt)=96] [L2513] return cnt <= 2500; [L10514] RET is_within_limit(cnt) VAL [cnt=96] [L10514] COND TRUE is_within_limit(cnt) [L10515] char c = __VERIFIER_nondet_char(); [L10516] COND FALSE !(c < -43) VAL [c=0, cnt=96] [L10519] COND TRUE c < 42 [L10520] CALL func_1048(cnt + 1) [L10896] CALL is_within_limit(cnt) VAL [\old(cnt)=97] [L2513] return cnt <= 2500; [L10896] RET is_within_limit(cnt) VAL [cnt=97] [L10896] COND TRUE is_within_limit(cnt) [L10897] char c = __VERIFIER_nondet_char(); [L10898] COND FALSE !(c < 0) VAL [c=0, cnt=97] [L10901] COND TRUE c >= 0 [L10902] CALL func_1049(cnt + 1) [L10907] CALL is_within_limit(cnt) VAL [\old(cnt)=98] [L2513] return cnt <= 2500; [L10907] RET is_within_limit(cnt) VAL [cnt=98] [L10907] COND TRUE is_within_limit(cnt) [L10908] char c = __VERIFIER_nondet_char(); [L10910] CALL func_1099(cnt + 1) [L11313] CALL is_within_limit(cnt) VAL [\old(cnt)=99] [L2513] return cnt <= 2500; [L11313] RET is_within_limit(cnt) VAL [cnt=99] [L11313] COND TRUE is_within_limit(cnt) [L11314] char c = __VERIFIER_nondet_char(); [L11316] CALL func_1149(cnt + 1) [L11710] CALL is_within_limit(cnt) VAL [\old(cnt)=100] [L2513] return cnt <= 2500; [L11710] RET is_within_limit(cnt) VAL [cnt=100] [L11710] COND TRUE is_within_limit(cnt) [L11711] char c = __VERIFIER_nondet_char(); [L11713] CALL func_1199(cnt + 1) [L12107] CALL is_within_limit(cnt) VAL [\old(cnt)=101] [L2513] return cnt <= 2500; [L12107] RET is_within_limit(cnt) VAL [cnt=101] [L12107] COND TRUE is_within_limit(cnt) [L12108] char c = __VERIFIER_nondet_char(); [L12109] COND TRUE c < 0 [L12110] CALL func_1198(cnt + 1) [L12099] CALL is_within_limit(cnt) VAL [\old(cnt)=102] [L2513] return cnt <= 2500; [L12099] RET is_within_limit(cnt) VAL [cnt=102] [L12099] COND TRUE is_within_limit(cnt) [L12100] char c = __VERIFIER_nondet_char(); [L12102] CALL func_1248(cnt + 1) [L12517] CALL is_within_limit(cnt) VAL [\old(cnt)=103] [L2513] return cnt <= 2500; [L12517] RET is_within_limit(cnt) VAL [cnt=103] [L12517] COND TRUE is_within_limit(cnt) [L12518] char c = __VERIFIER_nondet_char(); [L12519] COND FALSE !(c < 0) VAL [c=0, cnt=103] [L12522] COND TRUE c >= 0 [L12523] CALL func_1298(cnt + 1) [L12914] CALL is_within_limit(cnt) VAL [\old(cnt)=104] [L2513] return cnt <= 2500; [L12914] RET is_within_limit(cnt) VAL [cnt=104] [L12914] COND TRUE is_within_limit(cnt) [L12915] char c = __VERIFIER_nondet_char(); [L12916] COND TRUE c < 0 [L12917] CALL func_1297(cnt + 1) [L12906] CALL is_within_limit(cnt) VAL [\old(cnt)=105] [L2513] return cnt <= 2500; [L12906] RET is_within_limit(cnt) VAL [cnt=105] [L12906] COND TRUE is_within_limit(cnt) [L12907] char c = __VERIFIER_nondet_char(); [L12909] CALL func_1347(cnt + 1) [L13306] CALL is_within_limit(cnt) VAL [\old(cnt)=106] [L2513] return cnt <= 2500; [L13306] RET is_within_limit(cnt) VAL [cnt=106] [L13306] COND TRUE is_within_limit(cnt) [L13307] char c = __VERIFIER_nondet_char(); [L13308] COND FALSE !(c < 0) VAL [c=0, cnt=106] [L13311] COND TRUE c >= 0 [L13312] CALL func_1397(cnt + 1) [L13685] CALL is_within_limit(cnt) VAL [\old(cnt)=107] [L2513] return cnt <= 2500; [L13685] RET is_within_limit(cnt) VAL [cnt=107] [L13685] COND TRUE is_within_limit(cnt) [L13686] char c = __VERIFIER_nondet_char(); [L13687] COND TRUE c < 0 [L13688] CALL func_1396(cnt + 1) [L13674] CALL is_within_limit(cnt) VAL [\old(cnt)=108] [L2513] return cnt <= 2500; [L13674] RET is_within_limit(cnt) VAL [cnt=108] [L13674] COND TRUE is_within_limit(cnt) [L13675] char c = __VERIFIER_nondet_char(); [L13676] COND FALSE !(c < 0) VAL [c=0, cnt=108] [L13679] COND TRUE c >= 0 [L13680] CALL func_1446(cnt + 1) [L14077] CALL is_within_limit(cnt) VAL [\old(cnt)=109] [L2513] return cnt <= 2500; [L14077] RET is_within_limit(cnt) VAL [cnt=109] [L14077] COND TRUE is_within_limit(cnt) [L14078] char c = __VERIFIER_nondet_char(); [L14079] COND TRUE c < 0 [L14080] CALL func_1496(cnt + 1) [L14462] CALL is_within_limit(cnt) VAL [\old(cnt)=110] [L2513] return cnt <= 2500; [L14462] RET is_within_limit(cnt) VAL [cnt=110] [L14462] COND TRUE is_within_limit(cnt) [L14463] char c = __VERIFIER_nondet_char(); [L14465] CALL func_1497(cnt + 1) [L14470] CALL is_within_limit(cnt) VAL [\old(cnt)=111] [L2513] return cnt <= 2500; [L14470] RET is_within_limit(cnt) VAL [cnt=111] [L14470] COND TRUE is_within_limit(cnt) [L14471] char c = __VERIFIER_nondet_char(); [L14472] COND TRUE c < 0 [L14473] CALL func_1547(cnt + 1) [L14894] CALL is_within_limit(cnt) VAL [\old(cnt)=112] [L2513] return cnt <= 2500; [L14894] RET is_within_limit(cnt) VAL [cnt=112] [L14894] COND TRUE is_within_limit(cnt) [L14895] char c = __VERIFIER_nondet_char(); [L14896] COND TRUE c < 0 [L14897] CALL func_1546(cnt + 1) [L14886] CALL is_within_limit(cnt) VAL [\old(cnt)=113] [L2513] return cnt <= 2500; [L14886] RET is_within_limit(cnt) VAL [cnt=113] [L14886] COND TRUE is_within_limit(cnt) [L14887] char c = __VERIFIER_nondet_char(); [L14889] CALL func_1596(cnt + 1) [L15280] CALL is_within_limit(cnt) VAL [\old(cnt)=114] [L2513] return cnt <= 2500; [L15280] RET is_within_limit(cnt) VAL [cnt=114] [L15280] COND TRUE is_within_limit(cnt) [L15281] char c = __VERIFIER_nondet_char(); [L15282] COND TRUE c < 0 [L15283] CALL func_1646(cnt + 1) [L15680] CALL is_within_limit(cnt) VAL [\old(cnt)=115] [L2513] return cnt <= 2500; [L15680] RET is_within_limit(cnt) VAL [cnt=115] [L15680] COND TRUE is_within_limit(cnt) [L15681] char c = __VERIFIER_nondet_char(); [L15682] COND FALSE !(c < 0) VAL [c=0, cnt=115] [L15685] COND TRUE c >= 0 [L15686] CALL func_1647(cnt + 1) [L15691] CALL is_within_limit(cnt) VAL [\old(cnt)=116] [L2513] return cnt <= 2500; [L15691] RET is_within_limit(cnt) VAL [cnt=116] [L15691] COND TRUE is_within_limit(cnt) [L15692] char c = __VERIFIER_nondet_char(); [L15694] CALL func_1648(cnt + 1) [L15699] CALL is_within_limit(cnt) VAL [\old(cnt)=117] [L2513] return cnt <= 2500; [L15699] RET is_within_limit(cnt) VAL [cnt=117] [L15699] COND TRUE is_within_limit(cnt) [L15700] char c = __VERIFIER_nondet_char(); [L15701] COND FALSE !(c < 0) VAL [c=0, cnt=117] [L15704] COND TRUE c >= 0 [L15705] CALL func_1698(cnt + 1) [L16096] CALL is_within_limit(cnt) VAL [\old(cnt)=118] [L2513] return cnt <= 2500; [L16096] RET is_within_limit(cnt) VAL [cnt=118] [L16096] COND TRUE is_within_limit(cnt) [L16097] char c = __VERIFIER_nondet_char(); [L16099] CALL func_1699(cnt + 1) [L16104] CALL is_within_limit(cnt) VAL [\old(cnt)=119] [L2513] return cnt <= 2500; [L16104] RET is_within_limit(cnt) VAL [cnt=119] [L16104] COND TRUE is_within_limit(cnt) [L16105] char c = __VERIFIER_nondet_char(); [L16106] COND FALSE !(c < 0) VAL [c=0, cnt=119] [L16109] COND TRUE c >= 0 [L16110] CALL func_1749(cnt + 1) [L16504] CALL is_within_limit(cnt) VAL [\old(cnt)=120] [L2513] return cnt <= 2500; [L16504] RET is_within_limit(cnt) VAL [cnt=120] [L16504] COND TRUE is_within_limit(cnt) [L16505] char c = __VERIFIER_nondet_char(); [L16506] COND FALSE !(c < 0) VAL [c=0, cnt=120] [L16509] COND TRUE c >= 0 [L16510] CALL func_1799(cnt + 1) [L16916] CALL is_within_limit(cnt) VAL [\old(cnt)=121] [L2513] return cnt <= 2500; [L16916] RET is_within_limit(cnt) VAL [cnt=121] [L16916] COND TRUE is_within_limit(cnt) [L16917] char c = __VERIFIER_nondet_char(); [L16919] CALL func_1849(cnt + 1) [L17328] CALL is_within_limit(cnt) VAL [\old(cnt)=122] [L2513] return cnt <= 2500; [L17328] RET is_within_limit(cnt) VAL [cnt=122] [L17328] COND TRUE is_within_limit(cnt) [L17329] char c = __VERIFIER_nondet_char(); [L17330] COND TRUE c < 0 [L17331] CALL func_1848(cnt + 1) [L17320] CALL is_within_limit(cnt) VAL [\old(cnt)=123] [L2513] return cnt <= 2500; [L17320] RET is_within_limit(cnt) VAL [cnt=123] [L17320] COND TRUE is_within_limit(cnt) [L17321] char c = __VERIFIER_nondet_char(); [L17323] CALL func_1847(cnt + 1) [L17306] CALL is_within_limit(cnt) VAL [\old(cnt)=124] [L2513] return cnt <= 2500; [L17306] RET is_within_limit(cnt) VAL [cnt=124] [L17306] COND TRUE is_within_limit(cnt) [L17307] char c = __VERIFIER_nondet_char(); [L17308] COND FALSE !(c < -43) VAL [c=42, cnt=124] [L17311] COND FALSE !(c < 42) VAL [c=42, cnt=124] [L17314] COND TRUE c >= 42 [L17315] CALL func_1897(cnt + 1) [L17691] CALL is_within_limit(cnt) VAL [\old(cnt)=125] [L2513] return cnt <= 2500; [L17691] RET is_within_limit(cnt) VAL [cnt=125] [L17691] COND TRUE is_within_limit(cnt) [L17692] char c = __VERIFIER_nondet_char(); [L17694] CALL func_1896(cnt + 1) [L17683] CALL is_within_limit(cnt) VAL [\old(cnt)=126] [L2513] return cnt <= 2500; [L17683] RET is_within_limit(cnt) VAL [cnt=126] [L17683] COND TRUE is_within_limit(cnt) [L17684] char c = __VERIFIER_nondet_char(); [L17686] CALL func_1946(cnt + 1) [L18077] CALL is_within_limit(cnt) VAL [\old(cnt)=127] [L2513] return cnt <= 2500; [L18077] RET is_within_limit(cnt) VAL [cnt=127] [L18077] COND TRUE is_within_limit(cnt) [L18078] char c = __VERIFIER_nondet_char(); [L18079] COND TRUE c < 0 [L18080] CALL func_1945(cnt + 1) [L18069] CALL is_within_limit(cnt) VAL [\old(cnt)=128] [L2513] return cnt <= 2500; [L18069] RET is_within_limit(cnt) VAL [cnt=128] [L18069] COND TRUE is_within_limit(cnt) [L18070] char c = __VERIFIER_nondet_char(); [L18072] CALL func_1995(cnt + 1) [L18475] CALL is_within_limit(cnt) VAL [\old(cnt)=129] [L2513] return cnt <= 2500; [L18475] RET is_within_limit(cnt) VAL [cnt=129] [L18475] COND TRUE is_within_limit(cnt) [L18476] char c = __VERIFIER_nondet_char(); [L18477] COND FALSE !(c < 0) VAL [c=0, cnt=129] [L18480] COND TRUE c >= 0 [L18481] CALL func_1996(cnt + 1) [L18486] CALL is_within_limit(cnt) VAL [\old(cnt)=130] [L2513] return cnt <= 2500; [L18486] RET is_within_limit(cnt) VAL [cnt=130] [L18486] COND TRUE is_within_limit(cnt) [L18487] char c = __VERIFIER_nondet_char(); [L18489] CALL func_1997(cnt + 1) [L18494] CALL is_within_limit(cnt) VAL [\old(cnt)=131] [L2513] return cnt <= 2500; [L18494] RET is_within_limit(cnt) VAL [cnt=131] [L18494] COND TRUE is_within_limit(cnt) [L18495] char c = __VERIFIER_nondet_char(); [L18496] COND TRUE c < 0 [L18497] CALL func_2047(cnt + 1) [L18894] CALL is_within_limit(cnt) VAL [\old(cnt)=132] [L2513] return cnt <= 2500; [L18894] RET is_within_limit(cnt) VAL [cnt=132] [L18894] COND TRUE is_within_limit(cnt) [L18895] char c = __VERIFIER_nondet_char(); [L18896] COND TRUE c < 0 [L18897] CALL func_2046(cnt + 1) [L18886] CALL is_within_limit(cnt) VAL [\old(cnt)=133] [L2513] return cnt <= 2500; [L18886] RET is_within_limit(cnt) VAL [cnt=133] [L18886] COND TRUE is_within_limit(cnt) [L18887] char c = __VERIFIER_nondet_char(); [L18889] CALL func_2096(cnt + 1) [L19289] CALL is_within_limit(cnt) VAL [\old(cnt)=134] [L2513] return cnt <= 2500; [L19289] RET is_within_limit(cnt) VAL [cnt=134] [L19289] COND TRUE is_within_limit(cnt) [L19290] char c = __VERIFIER_nondet_char(); [L19292] CALL func_2095(cnt + 1) [L19281] CALL is_within_limit(cnt) VAL [\old(cnt)=135] [L2513] return cnt <= 2500; [L19281] RET is_within_limit(cnt) VAL [cnt=135] [L19281] COND TRUE is_within_limit(cnt) [L19282] char c = __VERIFIER_nondet_char(); [L19284] CALL func_2145(cnt + 1) [L19678] CALL is_within_limit(cnt) VAL [\old(cnt)=136] [L2513] return cnt <= 2500; [L19678] RET is_within_limit(cnt) VAL [cnt=136] [L19678] COND TRUE is_within_limit(cnt) [L19679] char c = __VERIFIER_nondet_char(); [L19680] COND FALSE !(c < 0) VAL [c=0, cnt=136] [L19683] COND TRUE c >= 0 [L19684] CALL func_2146(cnt + 1) [L19689] CALL is_within_limit(cnt) VAL [\old(cnt)=137] [L2513] return cnt <= 2500; [L19689] RET is_within_limit(cnt) VAL [cnt=137] [L19689] COND TRUE is_within_limit(cnt) [L19690] char c = __VERIFIER_nondet_char(); [L19692] CALL func_2196(cnt + 1) [L20074] CALL is_within_limit(cnt) VAL [\old(cnt)=138] [L2513] return cnt <= 2500; [L20074] RET is_within_limit(cnt) VAL [cnt=138] [L20074] COND TRUE is_within_limit(cnt) [L20075] char c = __VERIFIER_nondet_char(); [L20076] COND TRUE c < -43 [L20077] CALL func_2195(cnt + 1) [L20066] CALL is_within_limit(cnt) VAL [\old(cnt)=139] [L2513] return cnt <= 2500; [L20066] RET is_within_limit(cnt) VAL [cnt=139] [L20066] COND TRUE is_within_limit(cnt) [L20067] char c = __VERIFIER_nondet_char(); [L20069] CALL func_2194(cnt + 1) [L20058] CALL is_within_limit(cnt) VAL [\old(cnt)=140] [L2513] return cnt <= 2500; [L20058] RET is_within_limit(cnt) VAL [cnt=140] [L20058] COND TRUE is_within_limit(cnt) [L20059] char c = __VERIFIER_nondet_char(); [L20061] CALL func_2193(cnt + 1) [L20047] CALL is_within_limit(cnt) VAL [\old(cnt)=141] [L2513] return cnt <= 2500; [L20047] RET is_within_limit(cnt) VAL [cnt=141] [L20047] COND TRUE is_within_limit(cnt) [L20048] char c = __VERIFIER_nondet_char(); [L20049] COND FALSE !(c < 0) VAL [c=0, cnt=141] [L20052] COND TRUE c >= 0 [L20053] CALL func_2243(cnt + 1) [L20462] CALL is_within_limit(cnt) VAL [\old(cnt)=142] [L2513] return cnt <= 2500; [L20462] RET is_within_limit(cnt) VAL [cnt=142] [L20462] COND TRUE is_within_limit(cnt) [L20463] char c = __VERIFIER_nondet_char(); [L20464] COND FALSE !(c < 0) VAL [c=0, cnt=142] [L20467] COND TRUE c >= 0 [L20468] CALL func_2293(cnt + 1) [L20853] CALL is_within_limit(cnt) VAL [\old(cnt)=143] [L2513] return cnt <= 2500; [L20853] RET is_within_limit(cnt) VAL [cnt=143] [L20853] COND TRUE is_within_limit(cnt) [L20854] char c = __VERIFIER_nondet_char(); [L20856] CALL func_2343(cnt + 1) [L21268] CALL is_within_limit(cnt) VAL [\old(cnt)=144] [L2513] return cnt <= 2500; [L21268] RET is_within_limit(cnt) VAL [cnt=144] [L21268] COND TRUE is_within_limit(cnt) [L21269] char c = __VERIFIER_nondet_char(); [L21270] COND FALSE !(c < -43) VAL [c=42, cnt=144] [L21273] COND FALSE !(c < 42) VAL [c=42, cnt=144] [L21276] COND TRUE c >= 42 [L21277] CALL func_2344(cnt + 1) [L21282] CALL is_within_limit(cnt) VAL [\old(cnt)=145] [L2513] return cnt <= 2500; [L21282] RET is_within_limit(cnt) VAL [cnt=145] [L21282] COND TRUE is_within_limit(cnt) [L21283] char c = __VERIFIER_nondet_char(); [L21285] CALL func_2345(cnt + 1) [L21290] CALL is_within_limit(cnt) VAL [\old(cnt)=146] [L2513] return cnt <= 2500; [L21290] RET is_within_limit(cnt) VAL [cnt=146] [L21290] COND TRUE is_within_limit(cnt) [L21291] char c = __VERIFIER_nondet_char(); [L21292] COND FALSE !(c < 0) VAL [c=0, cnt=146] [L21295] COND TRUE c >= 0 [L21296] CALL func_2346(cnt + 1) [L21301] CALL is_within_limit(cnt) VAL [\old(cnt)=147] [L2513] return cnt <= 2500; [L21301] RET is_within_limit(cnt) VAL [cnt=147] [L21301] COND TRUE is_within_limit(cnt) [L21302] char c = __VERIFIER_nondet_char(); [L21304] CALL func_2396(cnt + 1) [L21680] CALL is_within_limit(cnt) VAL [\old(cnt)=148] [L2513] return cnt <= 2500; [L21680] RET is_within_limit(cnt) VAL [cnt=148] [L21680] COND TRUE is_within_limit(cnt) [L21681] char c = __VERIFIER_nondet_char(); [L21682] COND TRUE c < 0 [L21683] CALL func_2446(cnt + 1) [L22116] CALL is_within_limit(cnt) VAL [\old(cnt)=149] [L2513] return cnt <= 2500; [L22116] RET is_within_limit(cnt) VAL [cnt=149] [L22116] COND TRUE is_within_limit(cnt) [L22117] char c = __VERIFIER_nondet_char(); [L22118] COND FALSE !(c < 0) VAL [c=0, cnt=149] [L22121] COND TRUE c >= 0 [L22122] CALL func_2447(cnt + 1) [L22127] CALL is_within_limit(cnt) VAL [\old(cnt)=150] [L2513] return cnt <= 2500; [L22127] RET is_within_limit(cnt) VAL [cnt=150] [L22127] COND TRUE is_within_limit(cnt) [L22128] char c = __VERIFIER_nondet_char(); [L22129] COND FALSE !(c < 0) VAL [c=0, cnt=150] [L22132] COND TRUE c >= 0 [L22133] CALL func_2448(cnt + 1) [L22138] CALL is_within_limit(cnt) VAL [\old(cnt)=151] [L2513] return cnt <= 2500; [L22138] RET is_within_limit(cnt) VAL [cnt=151] [L22138] COND TRUE is_within_limit(cnt) [L22139] char c = __VERIFIER_nondet_char(); [L22141] CALL func_2449(cnt + 1) [L22146] CALL is_within_limit(cnt) VAL [\old(cnt)=152] [L2513] return cnt <= 2500; [L22146] RET is_within_limit(cnt) VAL [cnt=152] [L22146] COND TRUE is_within_limit(cnt) [L22147] char c = __VERIFIER_nondet_char(); [L22149] CALL func_2499(cnt + 1) [L22513] CALL is_within_limit(cnt) VAL [\old(cnt)=153] [L2513] return cnt <= 2500; [L22513] RET is_within_limit(cnt) VAL [cnt=153] [L22513] COND TRUE is_within_limit(cnt) [L22514] char c = __VERIFIER_nondet_char(); [L22516] CALL func_bug(cnt + 1) [L2515] reach_error() * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 142.6MB. Free memory is still 79.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 16056.86ms. Allocated memory was 117.4MB in the beginning and 704.6MB in the end (delta: 587.2MB). Free memory was 73.1MB in the beginning and 406.5MB in the end (delta: -333.4MB). Peak memory consumption was 313.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 1048.78ms. Allocated memory is still 704.6MB. Free memory was 406.5MB in the beginning and 241.3MB in the end (delta: 165.3MB). Peak memory consumption was 167.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 790.09ms. Allocated memory is still 704.6MB. Free memory was 241.3MB in the beginning and 447.2MB in the end (delta: -205.9MB). Peak memory consumption was 127.1MB. Max. memory is 16.1GB. * RCFGBuilder took 31847.04ms. Allocated memory was 704.6MB in the beginning and 3.9GB in the end (delta: 3.2GB). Free memory was 447.2MB in the beginning and 2.7GB in the end (delta: -2.2GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. * CodeCheck took 4911.38ms. Allocated memory is still 3.9GB. Free memory was 2.7GB in the beginning and 1.9GB in the end (delta: 805.3MB). Peak memory consumption was 805.3MB. Max. memory is 16.1GB. * Witness Printer took 525.30ms. Allocated memory is still 3.9GB. Free memory was 1.9GB in the beginning and 1.8GB in the end (delta: 46.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-25 04:02:03,980 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a7b56b-f811-4b81-8fd1-7ee180c8ecf6/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE