./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 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_8e8339d2-2130-43e1-96b5-0215968af6ff/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e8339d2-2130-43e1-96b5-0215968af6ff/bin/ukojak-verify-ImItNfHLgk/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e8339d2-2130-43e1-96b5-0215968af6ff/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e8339d2-2130-43e1-96b5-0215968af6ff/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e8339d2-2130-43e1-96b5-0215968af6ff/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e8339d2-2130-43e1-96b5-0215968af6ff/bin/ukojak-verify-ImItNfHLgk --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d0cee5b1964cd71f7406ad577c9568bfea84778de80728dfc08113baa4a027fc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 22:05:30,612 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:05:30,714 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e8339d2-2130-43e1-96b5-0215968af6ff/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-08 22:05:30,721 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:05:30,721 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-08 22:05:30,761 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:05:30,764 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:05:30,765 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-08 22:05:30,766 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:05:30,767 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:05:30,768 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:05:30,769 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:05:30,770 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:05:30,770 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 22:05:30,772 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:05:30,773 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:05:30,773 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:05:30,774 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:05:30,774 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:05:30,774 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:05:30,775 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:05:30,779 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:05:30,779 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:05:30,780 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-08 22:05:30,780 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-08 22:05:30,780 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-08 22:05:30,781 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:05:30,781 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 22:05:30,781 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:05:30,782 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:05:30,782 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:05:30,782 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-08 22:05:30,785 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 22:05:30,785 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_8e8339d2-2130-43e1-96b5-0215968af6ff/bin/ukojak-verify-ImItNfHLgk/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e8339d2-2130-43e1-96b5-0215968af6ff/bin/ukojak-verify-ImItNfHLgk Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d0cee5b1964cd71f7406ad577c9568bfea84778de80728dfc08113baa4a027fc [2024-11-08 22:05:31,071 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:05:31,101 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:05:31,106 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:05:31,108 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:05:31,108 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:05:31,110 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e8339d2-2130-43e1-96b5-0215968af6ff/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c Unable to find full path for "g++" [2024-11-08 22:05:33,397 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:05:33,674 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:05:33,675 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e8339d2-2130-43e1-96b5-0215968af6ff/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c [2024-11-08 22:05:33,686 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e8339d2-2130-43e1-96b5-0215968af6ff/bin/ukojak-verify-ImItNfHLgk/data/d9743b37e/cff49a50ad7049e79dbf0e1656144874/FLAG70411853b [2024-11-08 22:05:33,700 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e8339d2-2130-43e1-96b5-0215968af6ff/bin/ukojak-verify-ImItNfHLgk/data/d9743b37e/cff49a50ad7049e79dbf0e1656144874 [2024-11-08 22:05:33,702 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:05:33,703 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:05:33,705 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:05:33,705 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:05:33,711 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:05:33,712 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:05:33" (1/1) ... [2024-11-08 22:05:33,714 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47d84123 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:05:33, skipping insertion in model container [2024-11-08 22:05:33,714 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:05:33" (1/1) ... [2024-11-08 22:05:33,755 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:05:34,003 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_8e8339d2-2130-43e1-96b5-0215968af6ff/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c[6940,6953] [2024-11-08 22:05:34,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:05:34,018 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:05:34,065 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_8e8339d2-2130-43e1-96b5-0215968af6ff/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c[6940,6953] [2024-11-08 22:05:34,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:05:34,086 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:05:34,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:05:34 WrapperNode [2024-11-08 22:05:34,087 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:05:34,088 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:05:34,088 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:05:34,088 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:05:34,096 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:05:34" (1/1) ... [2024-11-08 22:05:34,107 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:05:34" (1/1) ... [2024-11-08 22:05:34,142 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 249 [2024-11-08 22:05:34,142 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:05:34,143 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:05:34,143 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:05:34,143 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:05:34,155 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:05:34" (1/1) ... [2024-11-08 22:05:34,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:05:34" (1/1) ... [2024-11-08 22:05:34,162 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:05:34" (1/1) ... [2024-11-08 22:05:34,162 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:05:34" (1/1) ... [2024-11-08 22:05:34,169 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:05:34" (1/1) ... [2024-11-08 22:05:34,173 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:05:34" (1/1) ... [2024-11-08 22:05:34,175 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:05:34" (1/1) ... [2024-11-08 22:05:34,177 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:05:34" (1/1) ... [2024-11-08 22:05:34,183 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:05:34,184 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:05:34,185 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:05:34,185 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:05:34,190 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:05:34" (1/1) ... [2024-11-08 22:05:34,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 22:05:34,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e8339d2-2130-43e1-96b5-0215968af6ff/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-08 22:05:34,235 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e8339d2-2130-43e1-96b5-0215968af6ff/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-08 22:05:34,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e8339d2-2130-43e1-96b5-0215968af6ff/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-08 22:05:34,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:05:34,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 22:05:34,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:05:34,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:05:34,343 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:05:34,345 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:05:34,806 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2024-11-08 22:05:34,806 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:05:35,232 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:05:35,232 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:05:35,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:05:35 BoogieIcfgContainer [2024-11-08 22:05:35,233 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:05:35,233 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-08 22:05:35,234 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-08 22:05:35,245 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-08 22:05:35,245 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:05:35" (1/1) ... [2024-11-08 22:05:35,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:05:35,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:35,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 7 states and 8 transitions. [2024-11-08 22:05:35,310 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2024-11-08 22:05:35,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-08 22:05:35,313 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:35,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:35,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:37,084 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-08 22:05:37,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:37,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 8 states and 10 transitions. [2024-11-08 22:05:37,212 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2024-11-08 22:05:37,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-08 22:05:37,216 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:37,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:37,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:42,268 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-08 22:05:43,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:43,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 12 states and 18 transitions. [2024-11-08 22:05:43,744 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 18 transitions. [2024-11-08 22:05:43,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 22:05:43,745 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:43,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:43,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:05:46,550 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:05:49,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:05:49,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 18 states and 30 transitions. [2024-11-08 22:05:49,480 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 30 transitions. [2024-11-08 22:05:49,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 22:05:49,484 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:05:49,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:05:49,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:10,077 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-08 22:06:29,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:06:29,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 27 states and 52 transitions. [2024-11-08 22:06:29,560 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 52 transitions. [2024-11-08 22:06:29,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 22:06:29,561 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:06:29,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:06:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:06:49,377 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-08 22:07:24,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:24,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 37 states and 78 transitions. [2024-11-08 22:07:24,616 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 78 transitions. [2024-11-08 22:07:24,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 22:07:24,617 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:24,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:24,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:28,840 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-08 22:07:38,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:38,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 43 states and 100 transitions. [2024-11-08 22:07:38,917 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 100 transitions. [2024-11-08 22:07:38,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 22:07:38,918 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:38,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:39,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:07:41,942 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:07:55,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:07:55,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 48 states and 119 transitions. [2024-11-08 22:07:55,172 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 119 transitions. [2024-11-08 22:07:55,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-08 22:07:55,173 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:07:55,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:07:55,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:07:55,704 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 22:07:56,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:07:57,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:07:57,286 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 22:07:58,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:07:58,564 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 8 iterations. [2024-11-08 22:07:58,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.11 10:07:58 ImpRootNode [2024-11-08 22:07:58,630 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-08 22:07:58,630 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 22:07:58,630 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 22:07:58,631 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 22:07:58,631 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:05:35" (3/4) ... [2024-11-08 22:07:58,632 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 22:07:58,766 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e8339d2-2130-43e1-96b5-0215968af6ff/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-08 22:07:58,766 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 22:07:58,767 INFO L158 Benchmark]: Toolchain (without parser) took 145063.69ms. Allocated memory was 186.6MB in the beginning and 866.1MB in the end (delta: 679.5MB). Free memory was 155.9MB in the beginning and 491.1MB in the end (delta: -335.2MB). Peak memory consumption was 346.1MB. Max. memory is 16.1GB. [2024-11-08 22:07:58,767 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 121.6MB. Free memory is still 77.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:07:58,767 INFO L158 Benchmark]: CACSL2BoogieTranslator took 382.67ms. Allocated memory is still 186.6MB. Free memory was 155.9MB in the beginning and 140.1MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 22:07:58,768 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.53ms. Allocated memory is still 186.6MB. Free memory was 140.1MB in the beginning and 137.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 22:07:58,768 INFO L158 Benchmark]: Boogie Preprocessor took 40.53ms. Allocated memory is still 186.6MB. Free memory was 137.1MB in the beginning and 135.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 22:07:58,768 INFO L158 Benchmark]: RCFGBuilder took 1048.29ms. Allocated memory is still 186.6MB. Free memory was 135.0MB in the beginning and 135.4MB in the end (delta: -409.8kB). Peak memory consumption was 69.8MB. Max. memory is 16.1GB. [2024-11-08 22:07:58,769 INFO L158 Benchmark]: CodeCheck took 143396.30ms. Allocated memory was 186.6MB in the beginning and 866.1MB in the end (delta: 679.5MB). Free memory was 135.4MB in the beginning and 499.7MB in the end (delta: -364.4MB). Peak memory consumption was 318.3MB. Max. memory is 16.1GB. [2024-11-08 22:07:58,770 INFO L158 Benchmark]: Witness Printer took 135.97ms. Allocated memory is still 866.1MB. Free memory was 499.7MB in the beginning and 491.1MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-08 22:07:58,772 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: 143.3s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 262 SdHoareTripleChecker+Valid, 6.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 212 mSDsluCounter, 323 SdHoareTripleChecker+Invalid, 6.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 316 mSDsCounter, 199 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 827 IncrementalHoareTripleChecker+Invalid, 1026 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 199 mSolverCounterUnsat, 7 mSDtfsCounter, 827 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 971 GetRequests, 764 SyntacticMatches, 23 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17756 ImplicationChecksByTransitivity, 85.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 55.1s InterpolantComputationTime, 98 NumberOfCodeBlocks, 98 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 72 ConstructedInterpolants, 0 QuantifiedInterpolants, 8779 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 12/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 - CounterExampleResult [Line: 316]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] msg_t nomsg = (msg_t )-1; [L29] unsigned char r1 ; [L30] port_t p1 ; [L31] char p1_old ; [L32] char p1_new ; [L33] char id1 ; [L34] char st1 ; [L35] msg_t send1 ; [L36] _Bool mode1 ; [L37] _Bool alive1 ; [L38] port_t p2 ; [L39] char p2_old ; [L40] char p2_new ; [L41] char id2 ; [L42] char st2 ; [L43] msg_t send2 ; [L44] _Bool mode2 ; [L45] _Bool alive2 ; [L46] port_t p3 ; [L47] char p3_old ; [L48] char p3_new ; [L49] char id3 ; [L50] char st3 ; [L51] msg_t send3 ; [L52] _Bool mode3 ; [L53] _Bool alive3 ; [L261] int c1 ; [L262] int i2 ; [L265] c1 = 0 [L266] r1 = __VERIFIER_nondet_uchar() [L267] id1 = __VERIFIER_nondet_char() [L268] st1 = __VERIFIER_nondet_char() [L269] send1 = __VERIFIER_nondet_char() [L270] mode1 = __VERIFIER_nondet_bool() [L271] alive1 = __VERIFIER_nondet_bool() [L272] id2 = __VERIFIER_nondet_char() [L273] st2 = __VERIFIER_nondet_char() [L274] send2 = __VERIFIER_nondet_char() [L275] mode2 = __VERIFIER_nondet_bool() [L276] alive2 = __VERIFIER_nondet_bool() [L277] id3 = __VERIFIER_nondet_char() [L278] st3 = __VERIFIER_nondet_char() [L279] send3 = __VERIFIER_nondet_char() [L280] mode3 = __VERIFIER_nondet_bool() [L281] alive3 = __VERIFIER_nondet_bool() [L282] CALL, EXPR init() [L164] int tmp ; [L167] COND TRUE (int )r1 == 0 [L168] COND TRUE ((int )alive1 + (int )alive2) + (int )alive3 >= 1 [L169] COND TRUE (int )id1 >= 0 [L170] COND TRUE (int )st1 == 0 [L171] COND TRUE (int )send1 == (int )id1 [L172] COND TRUE (int )mode1 == 0 [L173] COND TRUE (int )id2 >= 0 [L174] COND TRUE (int )st2 == 0 [L175] COND TRUE (int )send2 == (int )id2 [L176] COND TRUE (int )mode2 == 0 [L177] COND TRUE (int )id3 >= 0 [L178] COND TRUE (int )st3 == 0 [L179] COND TRUE (int )send3 == (int )id3 [L180] COND TRUE (int )mode3 == 0 [L181] COND TRUE (int )id1 != (int )id2 [L182] COND TRUE (int )id1 != (int )id3 [L183] COND TRUE (int )id2 != (int )id3 [L184] tmp = 1 [L236] return (tmp); [L282] RET, EXPR init() [L282] i2 = init() [L283] CALL assume_abort_if_not(i2) [L22] COND FALSE !(!cond) [L283] RET assume_abort_if_not(i2) [L284] p1_old = nomsg [L285] p1_new = nomsg [L286] p2_old = nomsg [L287] p2_new = nomsg [L288] p3_old = nomsg [L289] p3_new = nomsg [L290] i2 = 0 VAL [alive1=1, alive2=1, alive3=0, id1=127, id2=125, id3=126, 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=127, send2=125, send3=126, st1=0, st2=0, st3=0] [L291] COND TRUE 1 [L293] CALL node1() [L56] msg_t m1 ; [L59] m1 = nomsg [L60] COND FALSE !(\read(mode1)) [L83] COND TRUE \read(alive1) [L84] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L89] mode1 = (_Bool)1 [L293] RET node1() [L294] CALL node2() [L96] msg_t m2 ; [L99] m2 = nomsg [L100] COND FALSE !(\read(mode2)) [L117] COND TRUE \read(alive2) [L118] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L123] mode2 = (_Bool)1 [L294] RET node2() [L295] CALL node3() [L130] msg_t m3 ; [L133] m3 = nomsg [L134] COND FALSE !(\read(mode3)) [L151] COND FALSE !(\read(alive3)) [L154] COND FALSE !((int )send3 != (int )id3) [L157] mode3 = (_Bool)1 [L295] RET node3() [L296] p1_old = p1_new [L297] p1_new = nomsg [L298] p2_old = p2_new [L299] p2_new = nomsg [L300] p3_old = p3_new [L301] p3_new = nomsg [L302] CALL, EXPR check() [L241] int tmp ; [L244] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 [L245] COND TRUE (int )r1 < 3 [L246] tmp = 1 [L256] return (tmp); [L302] RET, EXPR check() [L302] c1 = check() [L303] CALL assert(c1) [L314] COND FALSE !(! arg) VAL [alive1=1, alive2=1, alive3=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=125, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=127, send2=125, send3=126, st1=0, st2=0, st3=0] [L303] RET assert(c1) [L291] COND TRUE 1 [L293] CALL node1() [L56] msg_t m1 ; [L59] m1 = nomsg [L60] COND TRUE \read(mode1) [L61] COND FALSE !(r1 == 255) [L64] r1 = r1 + 1 [L65] m1 = p3_old [L66] p3_old = nomsg [L67] COND FALSE !((int )m1 != (int )nomsg) [L81] mode1 = (_Bool)0 [L293] RET node1() [L294] CALL node2() [L96] msg_t m2 ; [L99] m2 = nomsg [L100] COND TRUE \read(mode2) [L101] m2 = p1_old [L102] p1_old = nomsg [L103] COND TRUE (int )m2 != (int )nomsg [L104] COND TRUE \read(alive2) [L105] COND TRUE (int )m2 > (int )id2 [L106] send2 = m2 [L115] mode2 = (_Bool)0 [L294] RET node2() [L295] CALL node3() [L130] msg_t m3 ; [L133] m3 = nomsg [L134] COND TRUE \read(mode3) [L135] m3 = p2_old [L136] p2_old = nomsg [L137] COND TRUE (int )m3 != (int )nomsg [L138] COND FALSE !(\read(alive3)) [L146] send3 = m3 [L149] mode3 = (_Bool)0 [L295] RET node3() [L296] p1_old = p1_new [L297] p1_new = nomsg [L298] p2_old = p2_new [L299] p2_new = nomsg [L300] p3_old = p3_new [L301] p3_new = nomsg [L302] CALL, EXPR check() [L241] int tmp ; [L244] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 [L245] COND TRUE (int )r1 < 3 [L246] tmp = 1 [L256] return (tmp); [L302] RET, EXPR check() [L302] c1 = check() [L303] CALL assert(c1) [L314] COND FALSE !(! arg) VAL [alive1=1, alive2=1, alive3=0, id1=127, id2=125, id3=126, 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=127, send2=127, send3=125, st1=0, st2=0, st3=0] [L303] RET assert(c1) [L291] COND TRUE 1 [L293] CALL node1() [L56] msg_t m1 ; [L59] m1 = nomsg [L60] COND FALSE !(\read(mode1)) [L83] COND TRUE \read(alive1) [L84] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L89] mode1 = (_Bool)1 [L293] RET node1() [L294] CALL node2() [L96] msg_t m2 ; [L99] m2 = nomsg [L100] COND FALSE !(\read(mode2)) [L117] COND TRUE \read(alive2) [L118] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L123] mode2 = (_Bool)1 [L294] RET node2() [L295] CALL node3() [L130] msg_t m3 ; [L133] m3 = nomsg [L134] COND FALSE !(\read(mode3)) [L151] COND FALSE !(\read(alive3)) [L154] COND TRUE (int )send3 != (int )id3 [L155] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L157] mode3 = (_Bool)1 [L295] RET node3() [L296] p1_old = p1_new [L297] p1_new = nomsg [L298] p2_old = p2_new [L299] p2_new = nomsg [L300] p3_old = p3_new [L301] p3_new = nomsg [L302] CALL, EXPR check() [L241] int tmp ; [L244] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 [L245] COND TRUE (int )r1 < 3 [L246] tmp = 1 [L256] return (tmp); [L302] RET, EXPR check() [L302] c1 = check() [L303] CALL assert(c1) [L314] COND FALSE !(! arg) VAL [alive1=1, alive2=1, alive3=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=125, r1=1, send1=127, send2=127, send3=125, st1=0, st2=0, st3=0] [L303] RET assert(c1) [L291] COND TRUE 1 [L293] CALL node1() [L56] msg_t m1 ; [L59] m1 = nomsg [L60] COND TRUE \read(mode1) [L61] COND FALSE !(r1 == 255) [L64] r1 = r1 + 1 [L65] m1 = p3_old [L66] p3_old = nomsg [L67] COND TRUE (int )m1 != (int )nomsg [L68] COND TRUE \read(alive1) [L69] COND FALSE !((int )m1 > (int )id1) [L72] COND FALSE !((int )m1 == (int )id1) [L75] send1 = m1 [L81] mode1 = (_Bool)0 [L293] RET node1() [L294] CALL node2() [L96] msg_t m2 ; [L99] m2 = nomsg [L100] COND TRUE \read(mode2) [L101] m2 = p1_old [L102] p1_old = nomsg [L103] COND TRUE (int )m2 != (int )nomsg [L104] COND TRUE \read(alive2) [L105] COND TRUE (int )m2 > (int )id2 [L106] send2 = m2 [L115] mode2 = (_Bool)0 [L294] RET node2() [L295] CALL node3() [L130] msg_t m3 ; [L133] m3 = nomsg [L134] COND TRUE \read(mode3) [L135] m3 = p2_old [L136] p2_old = nomsg [L137] COND TRUE (int )m3 != (int )nomsg [L138] COND FALSE !(\read(alive3)) [L146] send3 = m3 [L149] mode3 = (_Bool)0 [L295] RET node3() [L296] p1_old = p1_new [L297] p1_new = nomsg [L298] p2_old = p2_new [L299] p2_new = nomsg [L300] p3_old = p3_new [L301] p3_new = nomsg [L302] CALL, EXPR check() [L241] int tmp ; [L244] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 [L245] COND TRUE (int )r1 < 3 [L246] tmp = 1 [L256] return (tmp); [L302] RET, EXPR check() [L302] c1 = check() [L303] CALL assert(c1) [L314] COND FALSE !(! arg) VAL [alive1=1, alive2=1, alive3=0, id1=127, id2=125, id3=126, 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=125, send2=127, send3=127, st1=0, st2=0, st3=0] [L303] RET assert(c1) [L291] COND TRUE 1 [L293] CALL node1() [L56] msg_t m1 ; [L59] m1 = nomsg [L60] COND FALSE !(\read(mode1)) [L83] COND TRUE \read(alive1) [L84] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L89] mode1 = (_Bool)1 [L293] RET node1() [L294] CALL node2() [L96] msg_t m2 ; [L99] m2 = nomsg [L100] COND FALSE !(\read(mode2)) [L117] COND TRUE \read(alive2) [L118] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L123] mode2 = (_Bool)1 [L294] RET node2() [L295] CALL node3() [L130] msg_t m3 ; [L133] m3 = nomsg [L134] COND FALSE !(\read(mode3)) [L151] COND FALSE !(\read(alive3)) [L154] COND TRUE (int )send3 != (int )id3 [L155] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L157] mode3 = (_Bool)1 [L295] RET node3() [L296] p1_old = p1_new [L297] p1_new = nomsg [L298] p2_old = p2_new [L299] p2_new = nomsg [L300] p3_old = p3_new [L301] p3_new = nomsg [L302] CALL, EXPR check() [L241] int tmp ; [L244] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 [L245] COND TRUE (int )r1 < 3 [L246] tmp = 1 [L256] return (tmp); [L302] RET, EXPR check() [L302] c1 = check() [L303] CALL assert(c1) [L314] COND FALSE !(! arg) VAL [alive1=1, alive2=1, alive3=0, id1=127, id2=125, id3=126, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=127, r1=2, send1=125, send2=127, send3=127, st1=0, st2=0, st3=0] [L303] RET assert(c1) [L291] COND TRUE 1 [L293] CALL node1() [L56] msg_t m1 ; [L59] m1 = nomsg [L60] COND TRUE \read(mode1) [L61] COND FALSE !(r1 == 255) [L64] r1 = r1 + 1 [L65] m1 = p3_old [L66] p3_old = nomsg [L67] COND TRUE (int )m1 != (int )nomsg [L68] COND TRUE \read(alive1) [L69] COND FALSE !((int )m1 > (int )id1) [L72] COND TRUE (int )m1 == (int )id1 [L73] st1 = (char)1 [L81] mode1 = (_Bool)0 [L293] RET node1() [L294] CALL node2() [L96] msg_t m2 ; [L99] m2 = nomsg [L100] COND TRUE \read(mode2) [L101] m2 = p1_old [L102] p1_old = nomsg [L103] COND TRUE (int )m2 != (int )nomsg [L104] COND TRUE \read(alive2) [L105] COND FALSE !((int )m2 > (int )id2) [L108] COND TRUE (int )m2 == (int )id2 [L109] st2 = (char)1 [L115] mode2 = (_Bool)0 [L294] RET node2() [L295] CALL node3() [L130] msg_t m3 ; [L133] m3 = nomsg [L134] COND TRUE \read(mode3) [L135] m3 = p2_old [L136] p2_old = nomsg [L137] COND TRUE (int )m3 != (int )nomsg [L138] COND FALSE !(\read(alive3)) [L146] send3 = m3 [L149] mode3 = (_Bool)0 [L295] RET node3() [L296] p1_old = p1_new [L297] p1_new = nomsg [L298] p2_old = p2_new [L299] p2_new = nomsg [L300] p3_old = p3_new [L301] p3_new = nomsg [L302] CALL, EXPR check() [L241] int tmp ; [L244] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L254] tmp = 0 [L256] return (tmp); [L302] RET, EXPR check() [L302] c1 = check() [L303] CALL assert(c1) [L314] COND TRUE ! arg VAL [alive1=1, alive2=1, alive3=0, id1=127, id2=125, id3=126, 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=125, send2=127, send3=127, st1=1, st2=1, st3=0] [L316] reach_error() VAL [alive1=1, alive2=1, alive3=0, id1=127, id2=125, id3=126, 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=125, send2=127, send3=127, st1=1, st2=1, st3=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 121.6MB. Free memory is still 77.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 382.67ms. Allocated memory is still 186.6MB. Free memory was 155.9MB in the beginning and 140.1MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.53ms. Allocated memory is still 186.6MB. Free memory was 140.1MB in the beginning and 137.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.53ms. Allocated memory is still 186.6MB. Free memory was 137.1MB in the beginning and 135.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1048.29ms. Allocated memory is still 186.6MB. Free memory was 135.0MB in the beginning and 135.4MB in the end (delta: -409.8kB). Peak memory consumption was 69.8MB. Max. memory is 16.1GB. * CodeCheck took 143396.30ms. Allocated memory was 186.6MB in the beginning and 866.1MB in the end (delta: 679.5MB). Free memory was 135.4MB in the beginning and 499.7MB in the end (delta: -364.4MB). Peak memory consumption was 318.3MB. Max. memory is 16.1GB. * Witness Printer took 135.97ms. Allocated memory is still 866.1MB. Free memory was 499.7MB in the beginning and 491.1MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-08 22:07:58,815 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e8339d2-2130-43e1-96b5-0215968af6ff/bin/ukojak-verify-ImItNfHLgk/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