./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/xcsp/AllInterval-008.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c32bd34e-125a-4b31-96f8-49f2f243194e/bin/ukojak-verify-G8NBE6pJGL/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c32bd34e-125a-4b31-96f8-49f2f243194e/bin/ukojak-verify-G8NBE6pJGL/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c32bd34e-125a-4b31-96f8-49f2f243194e/bin/ukojak-verify-G8NBE6pJGL/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c32bd34e-125a-4b31-96f8-49f2f243194e/bin/ukojak-verify-G8NBE6pJGL/config/KojakReach.xml -i ../../sv-benchmarks/c/xcsp/AllInterval-008.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c32bd34e-125a-4b31-96f8-49f2f243194e/bin/ukojak-verify-G8NBE6pJGL/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c32bd34e-125a-4b31-96f8-49f2f243194e/bin/ukojak-verify-G8NBE6pJGL --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 8f1a1519dc3ac954bb27ae35f40dd4ee3500f707e2df097fc14441b899353328 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 03:23:00,213 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 03:23:00,333 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c32bd34e-125a-4b31-96f8-49f2f243194e/bin/ukojak-verify-G8NBE6pJGL/config/svcomp-Reach-32bit-Kojak_Default.epf [2023-11-19 03:23:00,343 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 03:23:00,344 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2023-11-19 03:23:00,381 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 03:23:00,382 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 03:23:00,382 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2023-11-19 03:23:00,383 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 03:23:00,388 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 03:23:00,390 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 03:23:00,390 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 03:23:00,391 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 03:23:00,392 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 03:23:00,393 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 03:23:00,393 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 03:23:00,394 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 03:23:00,394 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 03:23:00,394 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 03:23:00,395 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 03:23:00,395 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 03:23:00,396 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 03:23:00,396 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2023-11-19 03:23:00,398 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2023-11-19 03:23:00,399 INFO L153 SettingsManager]: * Theory for external solver=ALL [2023-11-19 03:23:00,399 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 03:23:00,400 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2023-11-19 03:23:00,400 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 03:23:00,401 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 03:23:00,401 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 03:23:00,403 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2023-11-19 03:23:00,403 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 03:23:00,403 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 03:23:00,403 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c32bd34e-125a-4b31-96f8-49f2f243194e/bin/ukojak-verify-G8NBE6pJGL/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c32bd34e-125a-4b31-96f8-49f2f243194e/bin/ukojak-verify-G8NBE6pJGL 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 -> 8f1a1519dc3ac954bb27ae35f40dd4ee3500f707e2df097fc14441b899353328 [2023-11-19 03:23:00,717 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 03:23:00,753 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 03:23:00,756 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 03:23:00,758 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 03:23:00,758 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 03:23:00,760 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c32bd34e-125a-4b31-96f8-49f2f243194e/bin/ukojak-verify-G8NBE6pJGL/../../sv-benchmarks/c/xcsp/AllInterval-008.c [2023-11-19 03:23:03,866 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 03:23:04,083 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 03:23:04,084 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c32bd34e-125a-4b31-96f8-49f2f243194e/sv-benchmarks/c/xcsp/AllInterval-008.c [2023-11-19 03:23:04,093 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c32bd34e-125a-4b31-96f8-49f2f243194e/bin/ukojak-verify-G8NBE6pJGL/data/ae30edae0/a676db88d973421f91ec40c0f8d8967a/FLAG8cca5fe56 [2023-11-19 03:23:04,110 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c32bd34e-125a-4b31-96f8-49f2f243194e/bin/ukojak-verify-G8NBE6pJGL/data/ae30edae0/a676db88d973421f91ec40c0f8d8967a [2023-11-19 03:23:04,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 03:23:04,118 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 03:23:04,121 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 03:23:04,122 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 03:23:04,127 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 03:23:04,128 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 03:23:04" (1/1) ... [2023-11-19 03:23:04,130 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@401b52b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:23:04, skipping insertion in model container [2023-11-19 03:23:04,131 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 03:23:04" (1/1) ... [2023-11-19 03:23:04,163 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 03:23:04,347 WARN L240 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_c32bd34e-125a-4b31-96f8-49f2f243194e/sv-benchmarks/c/xcsp/AllInterval-008.c[4334,4347] [2023-11-19 03:23:04,354 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 03:23:04,364 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 03:23:04,404 WARN L240 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_c32bd34e-125a-4b31-96f8-49f2f243194e/sv-benchmarks/c/xcsp/AllInterval-008.c[4334,4347] [2023-11-19 03:23:04,406 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 03:23:04,437 INFO L206 MainTranslator]: Completed translation [2023-11-19 03:23:04,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:23:04 WrapperNode [2023-11-19 03:23:04,437 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 03:23:04,439 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 03:23:04,439 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 03:23:04,439 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 03:23:04,447 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:23:04" (1/1) ... [2023-11-19 03:23:04,456 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:23:04" (1/1) ... [2023-11-19 03:23:04,512 INFO L138 Inliner]: procedures = 13, calls = 93, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 192 [2023-11-19 03:23:04,513 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 03:23:04,514 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 03:23:04,514 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 03:23:04,514 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 03:23:04,524 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:23:04" (1/1) ... [2023-11-19 03:23:04,524 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:23:04" (1/1) ... [2023-11-19 03:23:04,527 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:23:04" (1/1) ... [2023-11-19 03:23:04,527 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:23:04" (1/1) ... [2023-11-19 03:23:04,534 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:23:04" (1/1) ... [2023-11-19 03:23:04,536 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:23:04" (1/1) ... [2023-11-19 03:23:04,538 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:23:04" (1/1) ... [2023-11-19 03:23:04,540 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:23:04" (1/1) ... [2023-11-19 03:23:04,543 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 03:23:04,550 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 03:23:04,550 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 03:23:04,550 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 03:23:04,552 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:23:04" (1/1) ... [2023-11-19 03:23:04,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2023-11-19 03:23:04,574 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c32bd34e-125a-4b31-96f8-49f2f243194e/bin/ukojak-verify-G8NBE6pJGL/z3 [2023-11-19 03:23:04,585 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c32bd34e-125a-4b31-96f8-49f2f243194e/bin/ukojak-verify-G8NBE6pJGL/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2023-11-19 03:23:04,597 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c32bd34e-125a-4b31-96f8-49f2f243194e/bin/ukojak-verify-G8NBE6pJGL/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2023-11-19 03:23:04,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 03:23:04,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 03:23:04,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 03:23:04,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 03:23:04,617 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2023-11-19 03:23:04,617 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2023-11-19 03:23:04,697 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 03:23:04,699 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 03:23:05,130 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 03:23:05,221 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 03:23:05,221 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 03:23:05,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 03:23:05 BoogieIcfgContainer [2023-11-19 03:23:05,254 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 03:23:05,255 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2023-11-19 03:23:05,255 INFO L270 PluginConnector]: Initializing CodeCheck... [2023-11-19 03:23:05,266 INFO L274 PluginConnector]: CodeCheck initialized [2023-11-19 03:23:05,266 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 03:23:05" (1/1) ... [2023-11-19 03:23:05,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 03:23:05,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-19 03:23:05,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 114 states and 198 transitions. [2023-11-19 03:23:05,380 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 198 transitions. [2023-11-19 03:23:05,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2023-11-19 03:23:05,408 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-19 03:23:05,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 03:23:07,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 03:23:07,767 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 03:23:09,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 03:23:10,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 03:23:10,195 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 03:23:10,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 03:23:11,024 WARN L476 CodeCheckObserver]: This program is UNSAFE, Check terminated with 1 iterations. [2023-11-19 03:23:11,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 19.11 03:23:11 ImpRootNode [2023-11-19 03:23:11,142 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2023-11-19 03:23:11,143 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 03:23:11,143 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 03:23:11,143 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 03:23:11,144 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 03:23:05" (3/4) ... [2023-11-19 03:23:11,145 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-19 03:23:11,363 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c32bd34e-125a-4b31-96f8-49f2f243194e/bin/ukojak-verify-G8NBE6pJGL/witness.graphml [2023-11-19 03:23:11,363 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 03:23:11,366 INFO L158 Benchmark]: Toolchain (without parser) took 7248.40ms. Allocated memory was 169.9MB in the beginning and 274.7MB in the end (delta: 104.9MB). Free memory was 126.9MB in the beginning and 236.6MB in the end (delta: -109.7MB). Peak memory consumption was 124.5MB. Max. memory is 16.1GB. [2023-11-19 03:23:11,367 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 113.2MB. Free memory is still 61.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 03:23:11,367 INFO L158 Benchmark]: CACSL2BoogieTranslator took 316.58ms. Allocated memory is still 169.9MB. Free memory was 126.7MB in the beginning and 114.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-19 03:23:11,367 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.71ms. Allocated memory is still 169.9MB. Free memory was 113.7MB in the beginning and 111.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 03:23:11,368 INFO L158 Benchmark]: Boogie Preprocessor took 29.24ms. Allocated memory is still 169.9MB. Free memory was 111.6MB in the beginning and 110.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 03:23:11,368 INFO L158 Benchmark]: RCFGBuilder took 703.94ms. Allocated memory is still 169.9MB. Free memory was 110.2MB in the beginning and 141.0MB in the end (delta: -30.8MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. [2023-11-19 03:23:11,369 INFO L158 Benchmark]: CodeCheck took 5887.68ms. Allocated memory was 169.9MB in the beginning and 228.6MB in the end (delta: 58.7MB). Free memory was 140.3MB in the beginning and 69.3MB in the end (delta: 71.1MB). Peak memory consumption was 129.3MB. Max. memory is 16.1GB. [2023-11-19 03:23:11,369 INFO L158 Benchmark]: Witness Printer took 222.62ms. Allocated memory was 228.6MB in the beginning and 274.7MB in the end (delta: 46.1MB). Free memory was 69.3MB in the beginning and 236.6MB in the end (delta: -167.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-19 03:23:11,371 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, 114 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, 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.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 282 NumberOfCodeBlocks, 282 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 - CounterExampleResult [Line: 159]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] int cond0; [L25] int dummy = 0; [L26] int N; [L27] int var0; [L28] var0 = __VERIFIER_nondet_int() [L29] CALL assume(var0 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L29] RET assume(var0 >= 0) VAL [dummy=0, var0=6] [L30] CALL assume(var0 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L30] RET assume(var0 <= 7) VAL [dummy=0, var0=6] [L31] int var1; [L32] var1 = __VERIFIER_nondet_int() [L33] CALL assume(var1 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L33] RET assume(var1 >= 0) VAL [dummy=0, var0=6, var1=1] [L34] CALL assume(var1 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L34] RET assume(var1 <= 7) VAL [dummy=0, var0=6, var1=1] [L35] int var2; [L36] var2 = __VERIFIER_nondet_int() [L37] CALL assume(var2 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L37] RET assume(var2 >= 0) VAL [dummy=0, var0=6, var1=1, var2=7] [L38] CALL assume(var2 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L38] RET assume(var2 <= 7) VAL [dummy=0, var0=6, var1=1, var2=7] [L39] int var3; [L40] var3 = __VERIFIER_nondet_int() [L41] CALL assume(var3 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L41] RET assume(var3 >= 0) VAL [dummy=0, var0=6, var1=1, var2=7, var3=0] [L42] CALL assume(var3 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L42] RET assume(var3 <= 7) VAL [dummy=0, var0=6, var1=1, var2=7, var3=0] [L43] int var4; [L44] var4 = __VERIFIER_nondet_int() [L45] CALL assume(var4 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L45] RET assume(var4 >= 0) VAL [dummy=0, var0=6, var1=1, var2=7, var3=0, var4=4] [L46] CALL assume(var4 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L46] RET assume(var4 <= 7) VAL [dummy=0, var0=6, var1=1, var2=7, var3=0, var4=4] [L47] int var5; [L48] var5 = __VERIFIER_nondet_int() [L49] CALL assume(var5 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L49] RET assume(var5 >= 0) VAL [dummy=0, var0=6, var1=1, var2=7, var3=0, var4=4, var5=3] [L50] CALL assume(var5 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L50] RET assume(var5 <= 7) VAL [dummy=0, var0=6, var1=1, var2=7, var3=0, var4=4, var5=3] [L51] int var6; [L52] var6 = __VERIFIER_nondet_int() [L53] CALL assume(var6 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L53] RET assume(var6 >= 0) VAL [dummy=0, var0=6, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5] [L54] CALL assume(var6 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L54] RET assume(var6 <= 7) VAL [dummy=0, var0=6, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5] [L55] int var7; [L56] var7 = __VERIFIER_nondet_int() [L57] CALL assume(var7 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L57] RET assume(var7 >= 0) VAL [dummy=0, var0=6, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2] [L58] CALL assume(var7 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L58] RET assume(var7 <= 7) VAL [dummy=0, var0=6, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2] [L59] int var8; [L60] var8 = __VERIFIER_nondet_int() [L61] CALL assume(var8 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L61] RET assume(var8 >= 1) VAL [dummy=0, var0=6, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5] [L62] CALL assume(var8 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L62] RET assume(var8 <= 7) VAL [dummy=0, var0=6, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5] [L63] int var9; [L64] var9 = __VERIFIER_nondet_int() [L65] CALL assume(var9 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L65] RET assume(var9 >= 1) VAL [dummy=0, var0=6, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L66] CALL assume(var9 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L66] RET assume(var9 <= 7) VAL [dummy=0, var0=6, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L67] int var10; [L68] var10 = __VERIFIER_nondet_int() [L69] CALL assume(var10 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L69] RET assume(var10 >= 1) VAL [dummy=0, var0=6, var10=7, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L70] CALL assume(var10 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L70] RET assume(var10 <= 7) VAL [dummy=0, var0=6, var10=7, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L71] int var11; [L72] var11 = __VERIFIER_nondet_int() [L73] CALL assume(var11 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L73] RET assume(var11 >= 1) VAL [dummy=0, var0=6, var10=7, var11=4, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L74] CALL assume(var11 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L74] RET assume(var11 <= 7) VAL [dummy=0, var0=6, var10=7, var11=4, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L75] int var12; [L76] var12 = __VERIFIER_nondet_int() [L77] CALL assume(var12 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L77] RET assume(var12 >= 1) VAL [dummy=0, var0=6, var10=7, var11=4, var12=1, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L78] CALL assume(var12 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L78] RET assume(var12 <= 7) VAL [dummy=0, var0=6, var10=7, var11=4, var12=1, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L79] int var13; [L80] var13 = __VERIFIER_nondet_int() [L81] CALL assume(var13 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L81] RET assume(var13 >= 1) VAL [dummy=0, var0=6, var10=7, var11=4, var12=1, var13=2, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L82] CALL assume(var13 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L82] RET assume(var13 <= 7) VAL [dummy=0, var0=6, var10=7, var11=4, var12=1, var13=2, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L83] int var14; [L84] var14 = __VERIFIER_nondet_int() [L85] CALL assume(var14 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L85] RET assume(var14 >= 1) VAL [dummy=0, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L86] CALL assume(var14 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L86] RET assume(var14 <= 7) VAL [dummy=0, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L87] int myvar0 = 1; VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L88] CALL assume(var0 != var1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L88] RET assume(var0 != var1) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L89] CALL assume(var0 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L89] RET assume(var0 != var2) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L90] CALL assume(var0 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L90] RET assume(var0 != var3) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L91] CALL assume(var0 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L91] RET assume(var0 != var4) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L92] CALL assume(var0 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L92] RET assume(var0 != var5) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L93] CALL assume(var0 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L93] RET assume(var0 != var6) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L94] CALL assume(var0 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L94] RET assume(var0 != var7) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L95] CALL assume(var1 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L95] RET assume(var1 != var2) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L96] CALL assume(var1 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L96] RET assume(var1 != var3) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L97] CALL assume(var1 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L97] RET assume(var1 != var4) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L98] CALL assume(var1 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L98] RET assume(var1 != var5) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L99] CALL assume(var1 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L99] RET assume(var1 != var6) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L100] CALL assume(var1 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L100] RET assume(var1 != var7) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L101] CALL assume(var2 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L101] RET assume(var2 != var3) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L102] CALL assume(var2 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L102] RET assume(var2 != var4) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L103] CALL assume(var2 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L103] RET assume(var2 != var5) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L104] CALL assume(var2 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L104] RET assume(var2 != var6) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L105] CALL assume(var2 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L105] RET assume(var2 != var7) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L106] CALL assume(var3 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L106] RET assume(var3 != var4) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L107] CALL assume(var3 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L107] RET assume(var3 != var5) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L108] CALL assume(var3 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L108] RET assume(var3 != var6) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L109] CALL assume(var3 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L109] RET assume(var3 != var7) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L110] CALL assume(var4 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L110] RET assume(var4 != var5) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L111] CALL assume(var4 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L111] RET assume(var4 != var6) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L112] CALL assume(var4 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L112] RET assume(var4 != var7) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L113] CALL assume(var5 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L113] RET assume(var5 != var6) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L114] CALL assume(var5 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L114] RET assume(var5 != var7) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L115] CALL assume(var6 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L115] RET assume(var6 != var7) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L116] CALL assume(var8 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L116] RET assume(var8 != var9) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L117] CALL assume(var8 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L117] RET assume(var8 != var10) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L118] CALL assume(var8 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L118] RET assume(var8 != var11) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L119] CALL assume(var8 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L119] RET assume(var8 != var12) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L120] CALL assume(var8 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L120] RET assume(var8 != var13) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L121] CALL assume(var8 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L121] RET assume(var8 != var14) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L122] CALL assume(var9 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L122] RET assume(var9 != var10) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L123] CALL assume(var9 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L123] RET assume(var9 != var11) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L124] CALL assume(var9 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L124] RET assume(var9 != var12) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L125] CALL assume(var9 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L125] RET assume(var9 != var13) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L126] CALL assume(var9 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L126] RET assume(var9 != var14) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L127] CALL assume(var10 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L127] RET assume(var10 != var11) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L128] CALL assume(var10 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L128] RET assume(var10 != var12) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L129] CALL assume(var10 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L129] RET assume(var10 != var13) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L130] CALL assume(var10 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L130] RET assume(var10 != var14) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L131] CALL assume(var11 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L131] RET assume(var11 != var12) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L132] CALL assume(var11 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L132] RET assume(var11 != var13) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L133] CALL assume(var11 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L133] RET assume(var11 != var14) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L134] CALL assume(var12 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L134] RET assume(var12 != var13) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L135] CALL assume(var12 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L135] RET assume(var12 != var14) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L136] CALL assume(var13 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L136] RET assume(var13 != var14) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6] [L137] int var_for_abs; [L138] var_for_abs = var0 - var1 [L139] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6, var_for_abs=5] [L140] CALL assume(var8 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L140] RET assume(var8 == var_for_abs) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6, var_for_abs=5] [L141] var_for_abs = var1 - var2 [L142] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6, var_for_abs=6] [L143] CALL assume(var9 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L143] RET assume(var9 == var_for_abs) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6, var_for_abs=6] [L144] var_for_abs = var2 - var3 [L145] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6, var_for_abs=7] [L146] CALL assume(var10 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L146] RET assume(var10 == var_for_abs) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6, var_for_abs=7] [L147] var_for_abs = var3 - var4 [L148] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6, var_for_abs=4] [L149] CALL assume(var11 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L149] RET assume(var11 == var_for_abs) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6, var_for_abs=4] [L150] var_for_abs = var4 - var5 [L151] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6, var_for_abs=1] [L152] CALL assume(var12 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L152] RET assume(var12 == var_for_abs) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6, var_for_abs=1] [L153] var_for_abs = var5 - var6 [L154] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6, var_for_abs=2] [L155] CALL assume(var13 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L155] RET assume(var13 == var_for_abs) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6, var_for_abs=2] [L156] var_for_abs = var6 - var7 [L157] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6, var_for_abs=3] [L158] CALL assume(var14 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L158] RET assume(var14 == var_for_abs) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6, var_for_abs=3] [L159] reach_error() VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=1, var13=2, var14=3, var1=1, var2=7, var3=0, var4=4, var5=3, var6=5, var7=2, var8=5, var9=6, var_for_abs=3] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 113.2MB. Free memory is still 61.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 316.58ms. Allocated memory is still 169.9MB. Free memory was 126.7MB in the beginning and 114.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.71ms. Allocated memory is still 169.9MB. Free memory was 113.7MB in the beginning and 111.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.24ms. Allocated memory is still 169.9MB. Free memory was 111.6MB in the beginning and 110.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 703.94ms. Allocated memory is still 169.9MB. Free memory was 110.2MB in the beginning and 141.0MB in the end (delta: -30.8MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. * CodeCheck took 5887.68ms. Allocated memory was 169.9MB in the beginning and 228.6MB in the end (delta: 58.7MB). Free memory was 140.3MB in the beginning and 69.3MB in the end (delta: 71.1MB). Peak memory consumption was 129.3MB. Max. memory is 16.1GB. * Witness Printer took 222.62ms. Allocated memory was 228.6MB in the beginning and 274.7MB in the end (delta: 46.1MB). Free memory was 69.3MB in the beginning and 236.6MB in the end (delta: -167.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2023-11-19 03:23:11,421 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c32bd34e-125a-4b31-96f8-49f2f243194e/bin/ukojak-verify-G8NBE6pJGL/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