./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- 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_214cd048-3533-444b-b083-7716d9340258/bin/ukojak-verify-ENZ3QT5qd3/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_214cd048-3533-444b-b083-7716d9340258/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_214cd048-3533-444b-b083-7716d9340258/bin/ukojak-verify-ENZ3QT5qd3/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_214cd048-3533-444b-b083-7716d9340258/bin/ukojak-verify-ENZ3QT5qd3/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_214cd048-3533-444b-b083-7716d9340258/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_214cd048-3533-444b-b083-7716d9340258/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 32bit --witnessprinter.graph.data.programhash a5deaf1c7eecf4d76182f6b98ab14efecb2cf3c3c2e7d8162af75087f90c331b --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-25 03:54:50,015 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-25 03:54:50,121 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_214cd048-3533-444b-b083-7716d9340258/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-25 03:54:50,131 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-25 03:54:50,131 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-25 03:54:50,172 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-25 03:54:50,174 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-25 03:54:50,175 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-25 03:54:50,175 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-25 03:54:50,176 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-25 03:54:50,177 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-25 03:54:50,178 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-25 03:54:50,178 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-25 03:54:50,178 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-25 03:54:50,178 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-25 03:54:50,179 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-25 03:54:50,179 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-25 03:54:50,179 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-25 03:54:50,179 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-25 03:54:50,179 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-25 03:54:50,179 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-25 03:54:50,179 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-25 03:54:50,180 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-25 03:54:50,180 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-25 03:54:50,180 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-25 03:54:50,180 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-25 03:54:50,180 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-25 03:54:50,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 03:54:50,181 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-25 03:54:50,181 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-25 03:54:50,181 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-25 03:54:50,181 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-25 03:54:50,181 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-25 03:54:50,182 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_214cd048-3533-444b-b083-7716d9340258/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a5deaf1c7eecf4d76182f6b98ab14efecb2cf3c3c2e7d8162af75087f90c331b [2024-11-25 03:54:50,535 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-25 03:54:50,548 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-25 03:54:50,555 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-25 03:54:50,557 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-25 03:54:50,557 INFO L274 PluginConnector]: CDTParser initialized [2024-11-25 03:54:50,559 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_214cd048-3533-444b-b083-7716d9340258/bin/ukojak-verify-ENZ3QT5qd3/../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c [2024-11-25 03:54:53,548 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_214cd048-3533-444b-b083-7716d9340258/bin/ukojak-verify-ENZ3QT5qd3/data/6d502432b/1eebcbfe7e844317aeff24f5ad854a0b/FLAG11af82b66 [2024-11-25 03:54:53,860 INFO L384 CDTParser]: Found 1 translation units. [2024-11-25 03:54:53,862 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_214cd048-3533-444b-b083-7716d9340258/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c [2024-11-25 03:54:53,896 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_214cd048-3533-444b-b083-7716d9340258/bin/ukojak-verify-ENZ3QT5qd3/data/6d502432b/1eebcbfe7e844317aeff24f5ad854a0b/FLAG11af82b66 [2024-11-25 03:54:54,104 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_214cd048-3533-444b-b083-7716d9340258/bin/ukojak-verify-ENZ3QT5qd3/data/6d502432b/1eebcbfe7e844317aeff24f5ad854a0b [2024-11-25 03:54:54,107 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-25 03:54:54,108 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-25 03:54:54,110 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-25 03:54:54,110 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-25 03:54:54,115 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-25 03:54:54,116 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:54:54" (1/1) ... [2024-11-25 03:54:54,117 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cbbca02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:54:54, skipping insertion in model container [2024-11-25 03:54:54,117 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:54:54" (1/1) ... [2024-11-25 03:54:54,140 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-25 03:54:54,358 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_214cd048-3533-444b-b083-7716d9340258/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c[6844,6857] [2024-11-25 03:54:54,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 03:54:54,379 INFO L200 MainTranslator]: Completed pre-run [2024-11-25 03:54:54,435 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_214cd048-3533-444b-b083-7716d9340258/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c[6844,6857] [2024-11-25 03:54:54,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 03:54:54,451 INFO L204 MainTranslator]: Completed translation [2024-11-25 03:54:54,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:54:54 WrapperNode [2024-11-25 03:54:54,452 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-25 03:54:54,453 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-25 03:54:54,453 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-25 03:54:54,453 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-25 03:54:54,460 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:54:54" (1/1) ... [2024-11-25 03:54:54,468 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:54:54" (1/1) ... [2024-11-25 03:54:54,505 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 249 [2024-11-25 03:54:54,506 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-25 03:54:54,506 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-25 03:54:54,509 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-25 03:54:54,509 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-25 03:54:54,517 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:54:54" (1/1) ... [2024-11-25 03:54:54,517 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:54:54" (1/1) ... [2024-11-25 03:54:54,523 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:54:54" (1/1) ... [2024-11-25 03:54:54,524 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:54:54" (1/1) ... [2024-11-25 03:54:54,533 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:54:54" (1/1) ... [2024-11-25 03:54:54,535 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:54:54" (1/1) ... [2024-11-25 03:54:54,543 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:54:54" (1/1) ... [2024-11-25 03:54:54,548 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:54:54" (1/1) ... [2024-11-25 03:54:54,552 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:54:54" (1/1) ... [2024-11-25 03:54:54,557 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-25 03:54:54,558 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-25 03:54:54,559 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-25 03:54:54,559 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-25 03:54:54,560 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:54:54" (1/1) ... [2024-11-25 03:54:54,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 03:54:54,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_214cd048-3533-444b-b083-7716d9340258/bin/ukojak-verify-ENZ3QT5qd3/z3 [2024-11-25 03:54:54,611 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_214cd048-3533-444b-b083-7716d9340258/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-25 03:54:54,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_214cd048-3533-444b-b083-7716d9340258/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-25 03:54:54,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-25 03:54:54,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-25 03:54:54,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-25 03:54:54,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-25 03:54:54,738 INFO L234 CfgBuilder]: Building ICFG [2024-11-25 03:54:54,740 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-25 03:54:55,231 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-11-25 03:54:55,231 INFO L283 CfgBuilder]: Performing block encoding [2024-11-25 03:54:55,667 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-25 03:54:55,667 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-25 03:54:55,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:54:55 BoogieIcfgContainer [2024-11-25 03:54:55,668 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-25 03:54:55,668 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-25 03:54:55,669 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-25 03:54:55,679 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-25 03:54:55,679 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:54:55" (1/1) ... [2024-11-25 03:54:55,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-25 03:54:55,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:55,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 7 states and 8 transitions. [2024-11-25 03:54:55,760 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2024-11-25 03:54:55,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-25 03:54:55,762 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:55,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:56,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:54:57,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:54:57,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:57,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 9 states and 12 transitions. [2024-11-25 03:54:57,805 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2024-11-25 03:54:57,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-25 03:54:57,805 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:57,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:57,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:55:01,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:55:03,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:55:03,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 13 states and 22 transitions. [2024-11-25 03:55:03,264 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 22 transitions. [2024-11-25 03:55:03,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-25 03:55:03,266 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:55:03,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:55:03,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:55:05,291 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:55:07,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:55:07,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 19 states and 38 transitions. [2024-11-25 03:55:07,962 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 38 transitions. [2024-11-25 03:55:07,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-25 03:55:07,963 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:55:07,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:55:08,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:55:22,441 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:55:36,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:55:36,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 29 states and 75 transitions. [2024-11-25 03:55:36,475 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 75 transitions. [2024-11-25 03:55:36,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-25 03:55:36,476 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:55:36,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:55:36,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:56:00,635 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:56:27,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:56:27,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 38 states and 116 transitions. [2024-11-25 03:56:27,552 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 116 transitions. [2024-11-25 03:56:27,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-25 03:56:27,553 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:56:27,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:56:27,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:56:30,536 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:56:40,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:56:40,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 44 states and 141 transitions. [2024-11-25 03:56:40,297 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 141 transitions. [2024-11-25 03:56:40,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-25 03:56:40,298 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:56:40,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:56:40,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:56:43,415 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:57:06,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:57:06,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 53 states and 184 transitions. [2024-11-25 03:57:06,645 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 184 transitions. [2024-11-25 03:57:06,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-25 03:57:06,646 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:57:06,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:57:07,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-25 03:57:07,200 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-25 03:57:07,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-25 03:57:07,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-25 03:57:07,956 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-25 03:57:08,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-25 03:57:08,511 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 8 iterations. [2024-11-25 03:57:08,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 25.11 03:57:08 ImpRootNode [2024-11-25 03:57:08,585 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-25 03:57:08,585 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-25 03:57:08,585 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-25 03:57:08,586 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-25 03:57:08,586 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:54:55" (3/4) ... [2024-11-25 03:57:08,587 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-25 03:57:08,695 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 158. [2024-11-25 03:57:08,857 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_214cd048-3533-444b-b083-7716d9340258/bin/ukojak-verify-ENZ3QT5qd3/witness.graphml [2024-11-25 03:57:08,857 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_214cd048-3533-444b-b083-7716d9340258/bin/ukojak-verify-ENZ3QT5qd3/witness.yml [2024-11-25 03:57:08,858 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-25 03:57:08,859 INFO L158 Benchmark]: Toolchain (without parser) took 134750.31ms. Allocated memory was 117.4MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 94.3MB in the beginning and 698.1MB in the end (delta: -603.8MB). Peak memory consumption was 585.5MB. Max. memory is 16.1GB. [2024-11-25 03:57:08,859 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 167.8MB. Free memory is still 105.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 03:57:08,860 INFO L158 Benchmark]: CACSL2BoogieTranslator took 342.14ms. Allocated memory is still 117.4MB. Free memory was 93.9MB in the beginning and 80.1MB in the end (delta: 13.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-25 03:57:08,860 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.07ms. Allocated memory is still 117.4MB. Free memory was 80.1MB in the beginning and 78.0MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-25 03:57:08,860 INFO L158 Benchmark]: Boogie Preprocessor took 51.57ms. Allocated memory is still 117.4MB. Free memory was 78.0MB in the beginning and 76.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 03:57:08,861 INFO L158 Benchmark]: RCFGBuilder took 1109.30ms. Allocated memory is still 117.4MB. Free memory was 76.5MB in the beginning and 53.3MB in the end (delta: 23.3MB). Peak memory consumption was 49.4MB. Max. memory is 16.1GB. [2024-11-25 03:57:08,861 INFO L158 Benchmark]: CodeCheck took 132916.32ms. Allocated memory was 117.4MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 53.3MB in the beginning and 714.7MB in the end (delta: -661.4MB). Peak memory consumption was 530.1MB. Max. memory is 16.1GB. [2024-11-25 03:57:08,862 INFO L158 Benchmark]: Witness Printer took 272.34ms. Allocated memory is still 1.3GB. Free memory was 714.7MB in the beginning and 698.1MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-25 03:57:08,864 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 1 procedures, 7 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 132.8s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 263 SdHoareTripleChecker+Valid, 7.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 222 mSDsluCounter, 367 SdHoareTripleChecker+Invalid, 6.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 360 mSDsCounter, 204 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1144 IncrementalHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 204 mSolverCounterUnsat, 7 mSDtfsCounter, 1144 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1164 GetRequests, 945 SyntacticMatches, 21 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20241 ImplicationChecksByTransitivity, 81.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 51.1s InterpolantComputationTime, 98 NumberOfCodeBlocks, 98 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 72 ConstructedInterpolants, 0 QuantifiedInterpolants, 7494 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 4/91 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: 311]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] msg_t nomsg = (msg_t )-1; [L26] char r1 ; [L27] port_t p1 ; [L28] char p1_old ; [L29] char p1_new ; [L30] char id1 ; [L31] char st1 ; [L32] msg_t send1 ; [L33] _Bool mode1 ; [L34] _Bool alive1 ; [L35] port_t p2 ; [L36] char p2_old ; [L37] char p2_new ; [L38] char id2 ; [L39] char st2 ; [L40] msg_t send2 ; [L41] _Bool mode2 ; [L42] _Bool alive2 ; [L43] port_t p3 ; [L44] char p3_old ; [L45] char p3_new ; [L46] char id3 ; [L47] char st3 ; [L48] msg_t send3 ; [L49] _Bool mode3 ; [L50] _Bool alive3 ; [L255] int c1 ; [L256] int i2 ; [L259] c1 = 0 [L260] r1 = __VERIFIER_nondet_char() [L261] id1 = __VERIFIER_nondet_char() [L262] st1 = __VERIFIER_nondet_char() [L263] send1 = __VERIFIER_nondet_char() [L264] mode1 = __VERIFIER_nondet_bool() [L265] alive1 = __VERIFIER_nondet_bool() [L266] id2 = __VERIFIER_nondet_char() [L267] st2 = __VERIFIER_nondet_char() [L268] send2 = __VERIFIER_nondet_char() [L269] mode2 = __VERIFIER_nondet_bool() [L270] alive2 = __VERIFIER_nondet_bool() [L271] id3 = __VERIFIER_nondet_char() [L272] st3 = __VERIFIER_nondet_char() [L273] send3 = __VERIFIER_nondet_char() [L274] mode3 = __VERIFIER_nondet_bool() [L275] alive3 = __VERIFIER_nondet_bool() [L276] CALL, EXPR init() [L158] int tmp ; [L161] COND TRUE (int )r1 == 0 [L162] COND TRUE ((int )alive1 + (int )alive2) + (int )alive3 >= 1 [L163] COND TRUE (int )id1 >= 0 [L164] COND TRUE (int )st1 == 0 [L165] COND TRUE (int )send1 == (int )id1 [L166] COND TRUE (int )mode1 == 0 [L167] COND TRUE (int )id2 >= 0 [L168] COND TRUE (int )st2 == 0 [L169] COND TRUE (int )send2 == (int )id2 [L170] COND TRUE (int )mode2 == 0 [L171] COND TRUE (int )id3 >= 0 [L172] COND TRUE (int )st3 == 0 [L173] COND TRUE (int )send3 == (int )id3 [L174] COND TRUE (int )mode3 == 0 [L175] COND TRUE (int )id1 != (int )id2 [L176] COND TRUE (int )id1 != (int )id3 [L177] COND TRUE (int )id2 != (int )id3 [L178] tmp = 1 [L230] return (tmp); [L276] RET, EXPR init() [L276] i2 = init() [L277] COND FALSE !(!(i2)) [L278] p1_old = nomsg [L279] p1_new = nomsg [L280] p2_old = nomsg [L281] p2_new = nomsg [L282] p3_old = nomsg [L283] p3_new = nomsg [L284] i2 = 0 VAL [alive1=1, alive2=1, alive3=0, i2=0, id1=12, id2=11, id3=10, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=12, send2=11, send3=10, st1=0, st2=0, st3=0] [L285] COND TRUE i2 < 6 [L287] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg [L57] COND FALSE !(\read(mode1)) [L77] COND TRUE \read(alive1) [L78] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L83] mode1 = (_Bool)1 [L287] RET node1() [L288] CALL node2() [L90] msg_t m2 ; [L93] m2 = nomsg [L94] COND FALSE !(\read(mode2)) [L111] COND TRUE \read(alive2) [L112] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L117] mode2 = (_Bool)1 [L288] RET node2() [L289] CALL node3() [L124] msg_t m3 ; [L127] m3 = nomsg [L128] COND FALSE !(\read(mode3)) [L145] COND FALSE !(\read(alive3)) [L148] COND FALSE !((int )send3 != (int )id3) [L151] mode3 = (_Bool)1 [L289] RET node3() [L290] p1_old = p1_new [L291] p1_new = nomsg [L292] p2_old = p2_new [L293] p2_new = nomsg [L294] p3_old = p3_new [L295] p3_new = nomsg [L296] CALL, EXPR check() [L235] int tmp ; [L238] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 [L239] COND TRUE (int )r1 < 3 [L240] tmp = 1 [L250] return (tmp); [L296] RET, EXPR check() [L296] c1 = check() [L297] CALL assert(c1) [L309] COND FALSE !(! arg) VAL [alive1=1, alive2=1, alive3=0, id1=12, id2=11, id3=10, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=12, p2=0, p2_new=-1, p2_old=11, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=12, send2=11, send3=10, st1=0, st2=0, st3=0] [L297] RET assert(c1) [L298] i2 ++ VAL [alive1=1, alive2=1, alive3=0, i2=1, id1=12, id2=11, id3=10, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=12, p2=0, p2_new=-1, p2_old=11, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=12, send2=11, send3=10, st1=0, st2=0, st3=0] [L285] COND TRUE i2 < 6 [L287] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg [L57] COND TRUE \read(mode1) [L58] r1 = (char )((int )r1 + 1) [L59] m1 = p3_old [L60] p3_old = nomsg [L61] COND FALSE !((int )m1 != (int )nomsg) [L75] mode1 = (_Bool)0 [L287] RET node1() [L288] CALL node2() [L90] msg_t m2 ; [L93] m2 = nomsg [L94] COND TRUE \read(mode2) [L95] m2 = p1_old [L96] p1_old = nomsg [L97] COND TRUE (int )m2 != (int )nomsg [L98] COND TRUE \read(alive2) [L99] COND TRUE (int )m2 > (int )id2 [L100] send2 = m2 [L109] mode2 = (_Bool)0 [L288] RET node2() [L289] CALL node3() [L124] msg_t m3 ; [L127] m3 = nomsg [L128] COND TRUE \read(mode3) [L129] m3 = p2_old [L130] p2_old = nomsg [L131] COND TRUE (int )m3 != (int )nomsg [L132] COND FALSE !(\read(alive3)) [L140] send3 = m3 [L143] mode3 = (_Bool)0 [L289] RET node3() [L290] p1_old = p1_new [L291] p1_new = nomsg [L292] p2_old = p2_new [L293] p2_new = nomsg [L294] p3_old = p3_new [L295] p3_new = nomsg [L296] CALL, EXPR check() [L235] int tmp ; [L238] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 [L239] COND TRUE (int )r1 < 3 [L240] tmp = 1 [L250] return (tmp); [L296] RET, EXPR check() [L296] c1 = check() [L297] CALL assert(c1) [L309] COND FALSE !(! arg) VAL [alive1=1, alive2=1, alive3=0, id1=12, id2=11, id3=10, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=12, send2=12, send3=11, st1=0, st2=0, st3=0] [L297] RET assert(c1) [L298] i2 ++ VAL [alive1=1, alive2=1, alive3=0, i2=2, id1=12, id2=11, id3=10, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=12, send2=12, send3=11, st1=0, st2=0, st3=0] [L285] COND TRUE i2 < 6 [L287] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg [L57] COND FALSE !(\read(mode1)) [L77] COND TRUE \read(alive1) [L78] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L83] mode1 = (_Bool)1 [L287] RET node1() [L288] CALL node2() [L90] msg_t m2 ; [L93] m2 = nomsg [L94] COND FALSE !(\read(mode2)) [L111] COND TRUE \read(alive2) [L112] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L117] mode2 = (_Bool)1 [L288] RET node2() [L289] CALL node3() [L124] msg_t m3 ; [L127] m3 = nomsg [L128] COND FALSE !(\read(mode3)) [L145] COND FALSE !(\read(alive3)) [L148] COND TRUE (int )send3 != (int )id3 [L149] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L151] mode3 = (_Bool)1 [L289] RET node3() [L290] p1_old = p1_new [L291] p1_new = nomsg [L292] p2_old = p2_new [L293] p2_new = nomsg [L294] p3_old = p3_new [L295] p3_new = nomsg [L296] CALL, EXPR check() [L235] int tmp ; [L238] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 [L239] COND TRUE (int )r1 < 3 [L240] tmp = 1 [L250] return (tmp); [L296] RET, EXPR check() [L296] c1 = check() [L297] CALL assert(c1) [L309] COND FALSE !(! arg) VAL [alive1=1, alive2=1, alive3=0, id1=12, id2=11, id3=10, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=12, p2=0, p2_new=-1, p2_old=12, p3=0, p3_new=-1, p3_old=11, r1=1, send1=12, send2=12, send3=11, st1=0, st2=0, st3=0] [L297] RET assert(c1) [L298] i2 ++ VAL [alive1=1, alive2=1, alive3=0, i2=3, id1=12, id2=11, id3=10, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=12, p2=0, p2_new=-1, p2_old=12, p3=0, p3_new=-1, p3_old=11, r1=1, send1=12, send2=12, send3=11, st1=0, st2=0, st3=0] [L285] COND TRUE i2 < 6 [L287] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg [L57] COND TRUE \read(mode1) [L58] r1 = (char )((int )r1 + 1) [L59] m1 = p3_old [L60] p3_old = nomsg [L61] COND TRUE (int )m1 != (int )nomsg [L62] COND TRUE \read(alive1) [L63] COND FALSE !((int )m1 > (int )id1) [L66] COND FALSE !((int )m1 == (int )id1) [L69] send1 = m1 [L75] mode1 = (_Bool)0 [L287] RET node1() [L288] CALL node2() [L90] msg_t m2 ; [L93] m2 = nomsg [L94] COND TRUE \read(mode2) [L95] m2 = p1_old [L96] p1_old = nomsg [L97] COND TRUE (int )m2 != (int )nomsg [L98] COND TRUE \read(alive2) [L99] COND TRUE (int )m2 > (int )id2 [L100] send2 = m2 [L109] mode2 = (_Bool)0 [L288] RET node2() [L289] CALL node3() [L124] msg_t m3 ; [L127] m3 = nomsg [L128] COND TRUE \read(mode3) [L129] m3 = p2_old [L130] p2_old = nomsg [L131] COND TRUE (int )m3 != (int )nomsg [L132] COND FALSE !(\read(alive3)) [L140] send3 = m3 [L143] mode3 = (_Bool)0 [L289] RET node3() [L290] p1_old = p1_new [L291] p1_new = nomsg [L292] p2_old = p2_new [L293] p2_new = nomsg [L294] p3_old = p3_new [L295] p3_new = nomsg [L296] CALL, EXPR check() [L235] int tmp ; [L238] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 [L239] COND TRUE (int )r1 < 3 [L240] tmp = 1 [L250] return (tmp); [L296] RET, EXPR check() [L296] c1 = check() [L297] CALL assert(c1) [L309] COND FALSE !(! arg) VAL [alive1=1, alive2=1, alive3=0, id1=12, id2=11, id3=10, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=11, send2=12, send3=12, st1=0, st2=0, st3=0] [L297] RET assert(c1) [L298] i2 ++ VAL [alive1=1, alive2=1, alive3=0, i2=4, id1=12, id2=11, id3=10, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=11, send2=12, send3=12, st1=0, st2=0, st3=0] [L285] COND TRUE i2 < 6 [L287] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg [L57] COND FALSE !(\read(mode1)) [L77] COND TRUE \read(alive1) [L78] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L83] mode1 = (_Bool)1 [L287] RET node1() [L288] CALL node2() [L90] msg_t m2 ; [L93] m2 = nomsg [L94] COND FALSE !(\read(mode2)) [L111] COND TRUE \read(alive2) [L112] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L117] mode2 = (_Bool)1 [L288] RET node2() [L289] CALL node3() [L124] msg_t m3 ; [L127] m3 = nomsg [L128] COND FALSE !(\read(mode3)) [L145] COND FALSE !(\read(alive3)) [L148] COND TRUE (int )send3 != (int )id3 [L149] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L151] mode3 = (_Bool)1 [L289] RET node3() [L290] p1_old = p1_new [L291] p1_new = nomsg [L292] p2_old = p2_new [L293] p2_new = nomsg [L294] p3_old = p3_new [L295] p3_new = nomsg [L296] CALL, EXPR check() [L235] int tmp ; [L238] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 [L239] COND TRUE (int )r1 < 3 [L240] tmp = 1 [L250] return (tmp); [L296] RET, EXPR check() [L296] c1 = check() [L297] CALL assert(c1) [L309] COND FALSE !(! arg) VAL [alive1=1, alive2=1, alive3=0, id1=12, id2=11, id3=10, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=11, p2=0, p2_new=-1, p2_old=12, p3=0, p3_new=-1, p3_old=12, r1=2, send1=11, send2=12, send3=12, st1=0, st2=0, st3=0] [L297] RET assert(c1) [L298] i2 ++ VAL [alive1=1, alive2=1, alive3=0, i2=5, id1=12, id2=11, id3=10, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=11, p2=0, p2_new=-1, p2_old=12, p3=0, p3_new=-1, p3_old=12, r1=2, send1=11, send2=12, send3=12, st1=0, st2=0, st3=0] [L285] COND TRUE i2 < 6 [L287] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg [L57] COND TRUE \read(mode1) [L58] r1 = (char )((int )r1 + 1) [L59] m1 = p3_old [L60] p3_old = nomsg [L61] COND TRUE (int )m1 != (int )nomsg [L62] COND TRUE \read(alive1) [L63] COND FALSE !((int )m1 > (int )id1) [L66] COND TRUE (int )m1 == (int )id1 [L67] st1 = (char)1 [L75] mode1 = (_Bool)0 [L287] RET node1() [L288] CALL node2() [L90] msg_t m2 ; [L93] m2 = nomsg [L94] COND TRUE \read(mode2) [L95] m2 = p1_old [L96] p1_old = nomsg [L97] COND TRUE (int )m2 != (int )nomsg [L98] COND TRUE \read(alive2) [L99] COND FALSE !((int )m2 > (int )id2) [L102] COND TRUE (int )m2 == (int )id2 [L103] st2 = (char)1 [L109] mode2 = (_Bool)0 [L288] RET node2() [L289] CALL node3() [L124] msg_t m3 ; [L127] m3 = nomsg [L128] COND TRUE \read(mode3) [L129] m3 = p2_old [L130] p2_old = nomsg [L131] COND TRUE (int )m3 != (int )nomsg [L132] COND FALSE !(\read(alive3)) [L140] send3 = m3 [L143] mode3 = (_Bool)0 [L289] RET node3() [L290] p1_old = p1_new [L291] p1_new = nomsg [L292] p2_old = p2_new [L293] p2_new = nomsg [L294] p3_old = p3_new [L295] p3_new = nomsg [L296] CALL, EXPR check() [L235] int tmp ; [L238] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L248] tmp = 0 [L250] return (tmp); [L296] RET, EXPR check() [L296] c1 = check() [L297] CALL assert(c1) [L309] COND TRUE ! arg VAL [alive1=1, alive2=1, alive3=0, id1=12, id2=11, id3=10, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=11, send2=12, send3=12, st1=1, st2=1, st3=0] [L311] reach_error() VAL [alive1=1, alive2=1, alive3=0, id1=12, id2=11, id3=10, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=11, send2=12, send3=12, st1=1, st2=1, st3=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.45ms. Allocated memory is still 167.8MB. Free memory is still 105.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 342.14ms. Allocated memory is still 117.4MB. Free memory was 93.9MB in the beginning and 80.1MB in the end (delta: 13.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.07ms. Allocated memory is still 117.4MB. Free memory was 80.1MB in the beginning and 78.0MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.57ms. Allocated memory is still 117.4MB. Free memory was 78.0MB in the beginning and 76.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1109.30ms. Allocated memory is still 117.4MB. Free memory was 76.5MB in the beginning and 53.3MB in the end (delta: 23.3MB). Peak memory consumption was 49.4MB. Max. memory is 16.1GB. * CodeCheck took 132916.32ms. Allocated memory was 117.4MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 53.3MB in the beginning and 714.7MB in the end (delta: -661.4MB). Peak memory consumption was 530.1MB. Max. memory is 16.1GB. * Witness Printer took 272.34ms. Allocated memory is still 1.3GB. Free memory was 714.7MB in the beginning and 698.1MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-25 03:57:08,909 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_214cd048-3533-444b-b083-7716d9340258/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE