./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5486ba12-a62a-48aa-a452-80fd35b1ba57/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5486ba12-a62a-48aa-a452-80fd35b1ba57/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_5486ba12-a62a-48aa-a452-80fd35b1ba57/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5486ba12-a62a-48aa-a452-80fd35b1ba57/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5486ba12-a62a-48aa-a452-80fd35b1ba57/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_5486ba12-a62a-48aa-a452-80fd35b1ba57/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 a7eb970df9460734baa401f9be0d88efb243a90e1dffe6744cd9f9a47afa0217 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 23:53:32,970 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:53:33,074 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5486ba12-a62a-48aa-a452-80fd35b1ba57/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-08 23:53:33,079 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:53:33,080 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-08 23:53:33,104 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:53:33,105 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:53:33,106 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-08 23:53:33,106 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:53:33,107 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:53:33,107 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:53:33,108 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:53:33,108 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:53:33,109 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:53:33,109 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:53:33,110 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:53:33,110 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:53:33,111 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:53:33,111 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:53:33,111 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:53:33,112 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:53:33,112 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:53:33,113 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:53:33,113 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-08 23:53:33,114 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-08 23:53:33,114 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-08 23:53:33,115 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:53:33,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 23:53:33,116 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:53:33,116 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:53:33,116 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:53:33,117 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-08 23:53:33,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:53:33,118 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_5486ba12-a62a-48aa-a452-80fd35b1ba57/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_5486ba12-a62a-48aa-a452-80fd35b1ba57/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 -> a7eb970df9460734baa401f9be0d88efb243a90e1dffe6744cd9f9a47afa0217 [2024-11-08 23:53:33,367 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:53:33,399 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:53:33,406 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:53:33,408 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:53:33,409 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:53:33,411 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5486ba12-a62a-48aa-a452-80fd35b1ba57/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c Unable to find full path for "g++" [2024-11-08 23:53:35,325 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:53:35,581 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:53:35,581 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5486ba12-a62a-48aa-a452-80fd35b1ba57/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2024-11-08 23:53:35,600 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5486ba12-a62a-48aa-a452-80fd35b1ba57/bin/ukojak-verify-ImItNfHLgk/data/719ef5954/58f6b0a0a6d44da7ad5c2fa6a2d08f97/FLAG073e7f96c [2024-11-08 23:53:35,623 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5486ba12-a62a-48aa-a452-80fd35b1ba57/bin/ukojak-verify-ImItNfHLgk/data/719ef5954/58f6b0a0a6d44da7ad5c2fa6a2d08f97 [2024-11-08 23:53:35,629 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:53:35,631 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:53:35,633 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:53:35,634 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:53:35,643 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:53:35,647 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:53:35" (1/1) ... [2024-11-08 23:53:35,649 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@411bea67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:53:35, skipping insertion in model container [2024-11-08 23:53:35,649 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:53:35" (1/1) ... [2024-11-08 23:53:35,693 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:53:36,007 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_5486ba12-a62a-48aa-a452-80fd35b1ba57/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c[6691,6704] [2024-11-08 23:53:36,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:53:36,028 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:53:36,087 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_5486ba12-a62a-48aa-a452-80fd35b1ba57/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c[6691,6704] [2024-11-08 23:53:36,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:53:36,119 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:53:36,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:53:36 WrapperNode [2024-11-08 23:53:36,120 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:53:36,121 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:53:36,121 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:53:36,121 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:53:36,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:53:36" (1/1) ... [2024-11-08 23:53:36,143 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:53:36" (1/1) ... [2024-11-08 23:53:36,196 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 246 [2024-11-08 23:53:36,196 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:53:36,197 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:53:36,197 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:53:36,198 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:53:36,215 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:53:36" (1/1) ... [2024-11-08 23:53:36,218 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:53:36" (1/1) ... [2024-11-08 23:53:36,222 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:53:36" (1/1) ... [2024-11-08 23:53:36,222 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:53:36" (1/1) ... [2024-11-08 23:53:36,230 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:53:36" (1/1) ... [2024-11-08 23:53:36,236 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:53:36" (1/1) ... [2024-11-08 23:53:36,239 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:53:36" (1/1) ... [2024-11-08 23:53:36,241 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:53:36" (1/1) ... [2024-11-08 23:53:36,245 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:53:36,246 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:53:36,246 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:53:36,247 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:53:36,248 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:53:36" (1/1) ... [2024-11-08 23:53:36,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 23:53:36,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5486ba12-a62a-48aa-a452-80fd35b1ba57/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-08 23:53:36,304 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5486ba12-a62a-48aa-a452-80fd35b1ba57/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-08 23:53:36,309 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5486ba12-a62a-48aa-a452-80fd35b1ba57/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-08 23:53:36,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:53:36,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 23:53:36,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:53:36,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:53:36,451 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:53:36,454 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:53:37,014 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-11-08 23:53:37,014 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:53:37,575 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:53:37,575 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 23:53:37,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:53:37 BoogieIcfgContainer [2024-11-08 23:53:37,576 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:53:37,577 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-08 23:53:37,578 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-08 23:53:37,592 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-08 23:53:37,592 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:53:37" (1/1) ... [2024-11-08 23:53:37,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:53:37,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:53:37,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 9 states and 11 transitions. [2024-11-08 23:53:37,668 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2024-11-08 23:53:37,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-08 23:53:37,671 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:53:37,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:53:38,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:53:39,692 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 23:53:39,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:53:39,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 12 states and 17 transitions. [2024-11-08 23:53:39,845 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 17 transitions. [2024-11-08 23:53:39,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 23:53:39,845 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:53:39,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:53:40,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:53:44,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:53:45,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:53:45,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 18 states and 31 transitions. [2024-11-08 23:53:45,732 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 31 transitions. [2024-11-08 23:53:45,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 23:53:45,736 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:53:45,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:53:45,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:53:48,608 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:53:50,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:53:50,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 26 states and 51 transitions. [2024-11-08 23:53:50,864 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 51 transitions. [2024-11-08 23:53:50,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 23:53:50,864 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:53:50,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:53:51,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:54:13,147 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:54:29,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:54:29,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 38 states and 84 transitions. [2024-11-08 23:54:29,115 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 84 transitions. [2024-11-08 23:54:29,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 23:54:29,116 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:54:29,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:54:29,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:55:02,576 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:55:48,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:55:48,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 52 states and 127 transitions. [2024-11-08 23:55:48,178 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 127 transitions. [2024-11-08 23:55:48,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 23:55:48,179 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:55:48,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:55:48,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:55:51,084 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:56:05,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:56:05,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 61 states and 158 transitions. [2024-11-08 23:56:05,900 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 158 transitions. [2024-11-08 23:56:05,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 23:56:05,902 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:56:05,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:56:06,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:09,460 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:56:28,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:56:28,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 69 states and 189 transitions. [2024-11-08 23:56:28,347 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 189 transitions. [2024-11-08 23:56:28,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 23:56:28,348 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:56:28,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:56:29,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:56:29,321 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:56:29,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:56:30,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:56:30,325 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:56:30,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:56:30,955 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 8 iterations. [2024-11-08 23:56:31,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.11 11:56:31 ImpRootNode [2024-11-08 23:56:31,070 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-08 23:56:31,071 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:56:31,071 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:56:31,071 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:56:31,072 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:53:37" (3/4) ... [2024-11-08 23:56:31,074 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 23:56:31,283 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5486ba12-a62a-48aa-a452-80fd35b1ba57/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-08 23:56:31,283 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:56:31,284 INFO L158 Benchmark]: Toolchain (without parser) took 175652.95ms. Allocated memory was 140.5MB in the beginning and 960.5MB in the end (delta: 820.0MB). Free memory was 106.3MB in the beginning and 528.2MB in the end (delta: -422.0MB). Peak memory consumption was 399.6MB. Max. memory is 16.1GB. [2024-11-08 23:56:31,284 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 104.9MB. Free memory is still 56.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:56:31,284 INFO L158 Benchmark]: CACSL2BoogieTranslator took 487.30ms. Allocated memory is still 140.5MB. Free memory was 106.3MB in the beginning and 90.1MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 23:56:31,285 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.61ms. Allocated memory is still 140.5MB. Free memory was 90.1MB in the beginning and 88.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:56:31,285 INFO L158 Benchmark]: Boogie Preprocessor took 48.22ms. Allocated memory is still 140.5MB. Free memory was 88.0MB in the beginning and 85.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:56:31,285 INFO L158 Benchmark]: RCFGBuilder took 1330.33ms. Allocated memory was 140.5MB in the beginning and 169.9MB in the end (delta: 29.4MB). Free memory was 85.9MB in the beginning and 89.0MB in the end (delta: -3.1MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. [2024-11-08 23:56:31,285 INFO L158 Benchmark]: CodeCheck took 173492.57ms. Allocated memory was 169.9MB in the beginning and 960.5MB in the end (delta: 790.6MB). Free memory was 87.9MB in the beginning and 538.7MB in the end (delta: -450.8MB). Peak memory consumption was 341.9MB. Max. memory is 16.1GB. [2024-11-08 23:56:31,286 INFO L158 Benchmark]: Witness Printer took 212.39ms. Allocated memory is still 960.5MB. Free memory was 538.7MB in the beginning and 528.2MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-08 23:56:31,287 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, 9 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 173.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, 382 SdHoareTripleChecker+Valid, 6.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 336 mSDsluCounter, 817 SdHoareTripleChecker+Invalid, 6.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 552 mSDsCounter, 204 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 908 IncrementalHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 204 mSolverCounterUnsat, 265 mSDtfsCounter, 908 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1299 GetRequests, 1075 SyntacticMatches, 32 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19630 ImplicationChecksByTransitivity, 104.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 69.8s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 14147 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 17/127 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: 306]: 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 ; [L250] int c1 ; [L251] int i2 ; [L254] c1 = 0 [L255] r1 = __VERIFIER_nondet_char() [L256] id1 = __VERIFIER_nondet_char() [L257] st1 = __VERIFIER_nondet_char() [L258] send1 = __VERIFIER_nondet_char() [L259] mode1 = __VERIFIER_nondet_bool() [L260] alive1 = __VERIFIER_nondet_bool() [L261] id2 = __VERIFIER_nondet_char() [L262] st2 = __VERIFIER_nondet_char() [L263] send2 = __VERIFIER_nondet_char() [L264] mode2 = __VERIFIER_nondet_bool() [L265] alive2 = __VERIFIER_nondet_bool() [L266] id3 = __VERIFIER_nondet_char() [L267] st3 = __VERIFIER_nondet_char() [L268] send3 = __VERIFIER_nondet_char() [L269] mode3 = __VERIFIER_nondet_bool() [L270] alive3 = __VERIFIER_nondet_bool() [L271] CALL, EXPR init() [L153] int tmp ; [L156] COND TRUE (int )r1 == 0 [L157] COND TRUE ((int )alive1 + (int )alive2) + (int )alive3 >= 1 [L158] COND TRUE (int )id1 >= 0 [L159] COND TRUE (int )st1 == 0 [L160] COND TRUE (int )send1 == (int )id1 [L161] COND TRUE (int )mode1 == 0 [L162] COND TRUE (int )id2 >= 0 [L163] COND TRUE (int )st2 == 0 [L164] COND TRUE (int )send2 == (int )id2 [L165] COND TRUE (int )mode2 == 0 [L166] COND TRUE (int )id3 >= 0 [L167] COND TRUE (int )st3 == 0 [L168] COND TRUE (int )send3 == (int )id3 [L169] COND TRUE (int )mode3 == 0 [L170] COND TRUE (int )id1 != (int )id2 [L171] COND TRUE (int )id1 != (int )id3 [L172] COND TRUE (int )id2 != (int )id3 [L173] tmp = 1 [L225] return (tmp); [L271] RET, EXPR init() [L271] i2 = init() [L272] COND FALSE !(!(i2)) [L273] p1_old = nomsg [L274] p1_new = nomsg [L275] p2_old = nomsg [L276] p2_new = nomsg [L277] p3_old = nomsg [L278] p3_new = nomsg [L279] i2 = 0 VAL [alive1=0, alive2=0, alive3=1, i2=0, id1=0, id2=2, id3=1, 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=0, send2=2, send3=1, st1=0, st2=0, st3=0] [L280] COND FALSE !(i2 < 6) VAL [alive1=0, alive2=0, alive3=1, i2=0, id1=0, id2=2, id3=1, 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=0, send2=2, send3=1, st1=0, st2=0, st3=0] [L280] COND TRUE i2 < 6 [L282] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg [L57] COND FALSE !(\read(mode1)) [L75] COND FALSE !(\read(alive1)) [L78] mode1 = (_Bool)1 [L282] RET node1() [L283] CALL node2() [L85] msg_t m2 ; [L88] m2 = nomsg [L89] COND FALSE !(\read(mode2)) [L106] COND FALSE !(\read(alive2)) [L109] COND FALSE !((int )send2 != (int )id2) [L112] mode2 = (_Bool)1 [L283] RET node2() [L284] CALL node3() [L119] msg_t m3 ; [L122] m3 = nomsg [L123] COND FALSE !(\read(mode3)) [L140] COND TRUE \read(alive3) [L141] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L146] mode3 = (_Bool)1 [L284] RET node3() [L285] p1_old = p1_new [L286] p1_new = nomsg [L287] p2_old = p2_new [L288] p2_new = nomsg [L289] p3_old = p3_new [L290] p3_new = nomsg [L291] CALL, EXPR check() [L230] int tmp ; [L233] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 [L234] COND TRUE (int )r1 < 3 [L235] tmp = 1 [L245] return (tmp); [L291] RET, EXPR check() [L291] c1 = check() [L292] CALL assert(c1) [L304] COND FALSE !(! arg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=2, id3=1, mode1=1, mode2=1, mode3=1, 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=0, send2=2, send3=1, st1=0, st2=0, st3=0] [L292] RET assert(c1) [L293] i2 ++ VAL [alive1=0, alive2=0, alive3=1, i2=1, id1=0, id2=2, id3=1, mode1=1, mode2=1, mode3=1, 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=0, send2=2, send3=1, st1=0, st2=0, st3=0] [L280] COND FALSE !(i2 < 6) VAL [alive1=0, alive2=0, alive3=1, i2=1, id1=0, id2=2, id3=1, mode1=1, mode2=1, mode3=1, 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=0, send2=2, send3=1, st1=0, st2=0, st3=0] [L280] COND TRUE i2 < 6 [L282] 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 FALSE !(\read(alive1)) [L70] send1 = m1 [L73] mode1 = (_Bool)0 [L282] RET node1() [L283] CALL node2() [L85] msg_t m2 ; [L88] m2 = nomsg [L89] COND TRUE \read(mode2) [L90] m2 = p1_old [L91] p1_old = nomsg [L92] COND FALSE !((int )m2 != (int )nomsg) [L104] mode2 = (_Bool)0 [L283] RET node2() [L284] CALL node3() [L119] msg_t m3 ; [L122] m3 = nomsg [L123] COND TRUE \read(mode3) [L124] m3 = p2_old [L125] p2_old = nomsg [L126] COND FALSE !((int )m3 != (int )nomsg) [L138] mode3 = (_Bool)0 [L284] RET node3() [L285] p1_old = p1_new [L286] p1_new = nomsg [L287] p2_old = p2_new [L288] p2_new = nomsg [L289] p3_old = p3_new [L290] p3_new = nomsg [L291] CALL, EXPR check() [L230] int tmp ; [L233] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 [L234] COND TRUE (int )r1 < 3 [L235] tmp = 1 [L245] return (tmp); [L291] RET, EXPR check() [L291] c1 = check() [L292] CALL assert(c1) [L304] COND FALSE !(! arg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=2, id3=1, 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=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L292] RET assert(c1) [L293] i2 ++ VAL [alive1=0, alive2=0, alive3=1, i2=2, id1=0, id2=2, id3=1, 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=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L280] COND FALSE !(i2 < 6) VAL [alive1=0, alive2=0, alive3=1, i2=2, id1=0, id2=2, id3=1, 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=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L280] COND TRUE i2 < 6 [L282] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg [L57] COND FALSE !(\read(mode1)) [L75] COND FALSE !(\read(alive1)) [L78] mode1 = (_Bool)1 [L282] RET node1() [L283] CALL node2() [L85] msg_t m2 ; [L88] m2 = nomsg [L89] COND FALSE !(\read(mode2)) [L106] COND FALSE !(\read(alive2)) [L109] COND FALSE !((int )send2 != (int )id2) [L112] mode2 = (_Bool)1 [L283] RET node2() [L284] CALL node3() [L119] msg_t m3 ; [L122] m3 = nomsg [L123] COND FALSE !(\read(mode3)) [L140] COND TRUE \read(alive3) [L141] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L146] mode3 = (_Bool)1 [L284] RET node3() [L285] p1_old = p1_new [L286] p1_new = nomsg [L287] p2_old = p2_new [L288] p2_new = nomsg [L289] p3_old = p3_new [L290] p3_new = nomsg [L291] CALL, EXPR check() [L230] int tmp ; [L233] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 [L234] COND TRUE (int )r1 < 3 [L235] tmp = 1 [L245] return (tmp); [L291] RET, EXPR check() [L291] c1 = check() [L292] CALL assert(c1) [L304] COND FALSE !(! arg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=2, id3=1, mode1=1, mode2=1, mode3=1, 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=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L292] RET assert(c1) [L293] i2 ++ VAL [alive1=0, alive2=0, alive3=1, i2=3, id1=0, id2=2, id3=1, mode1=1, mode2=1, mode3=1, 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=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L280] COND FALSE !(i2 < 6) VAL [alive1=0, alive2=0, alive3=1, i2=3, id1=0, id2=2, id3=1, mode1=1, mode2=1, mode3=1, 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=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L280] COND TRUE i2 < 6 [L282] 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 FALSE !(\read(alive1)) [L70] send1 = m1 [L73] mode1 = (_Bool)0 [L282] RET node1() [L283] CALL node2() [L85] msg_t m2 ; [L88] m2 = nomsg [L89] COND TRUE \read(mode2) [L90] m2 = p1_old [L91] p1_old = nomsg [L92] COND FALSE !((int )m2 != (int )nomsg) [L104] mode2 = (_Bool)0 [L283] RET node2() [L284] CALL node3() [L119] msg_t m3 ; [L122] m3 = nomsg [L123] COND TRUE \read(mode3) [L124] m3 = p2_old [L125] p2_old = nomsg [L126] COND FALSE !((int )m3 != (int )nomsg) [L138] mode3 = (_Bool)0 [L284] RET node3() [L285] p1_old = p1_new [L286] p1_new = nomsg [L287] p2_old = p2_new [L288] p2_new = nomsg [L289] p3_old = p3_new [L290] p3_new = nomsg [L291] CALL, EXPR check() [L230] int tmp ; [L233] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 [L234] COND TRUE (int )r1 < 3 [L235] tmp = 1 [L245] return (tmp); [L291] RET, EXPR check() [L291] c1 = check() [L292] CALL assert(c1) [L304] COND FALSE !(! arg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=2, id3=1, 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=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L292] RET assert(c1) [L293] i2 ++ VAL [alive1=0, alive2=0, alive3=1, i2=4, id1=0, id2=2, id3=1, 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=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L280] COND FALSE !(i2 < 6) VAL [alive1=0, alive2=0, alive3=1, i2=4, id1=0, id2=2, id3=1, 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=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L280] COND TRUE i2 < 6 [L282] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg [L57] COND FALSE !(\read(mode1)) [L75] COND FALSE !(\read(alive1)) [L78] mode1 = (_Bool)1 [L282] RET node1() [L283] CALL node2() [L85] msg_t m2 ; [L88] m2 = nomsg [L89] COND FALSE !(\read(mode2)) [L106] COND FALSE !(\read(alive2)) [L109] COND FALSE !((int )send2 != (int )id2) [L112] mode2 = (_Bool)1 [L283] RET node2() [L284] CALL node3() [L119] msg_t m3 ; [L122] m3 = nomsg [L123] COND FALSE !(\read(mode3)) [L140] COND TRUE \read(alive3) [L141] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L146] mode3 = (_Bool)1 [L284] RET node3() [L285] p1_old = p1_new [L286] p1_new = nomsg [L287] p2_old = p2_new [L288] p2_new = nomsg [L289] p3_old = p3_new [L290] p3_new = nomsg [L291] CALL, EXPR check() [L230] int tmp ; [L233] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 [L234] COND TRUE (int )r1 < 3 [L235] tmp = 1 [L245] return (tmp); [L291] RET, EXPR check() [L291] c1 = check() [L292] CALL assert(c1) [L304] COND FALSE !(! arg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=2, id3=1, mode1=1, mode2=1, mode3=1, 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=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L292] RET assert(c1) [L293] i2 ++ VAL [alive1=0, alive2=0, alive3=1, i2=5, id1=0, id2=2, id3=1, mode1=1, mode2=1, mode3=1, 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=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L280] COND FALSE !(i2 < 6) VAL [alive1=0, alive2=0, alive3=1, i2=5, id1=0, id2=2, id3=1, mode1=1, mode2=1, mode3=1, 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=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L280] COND TRUE i2 < 6 [L282] 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 FALSE !(\read(alive1)) [L70] send1 = m1 [L73] mode1 = (_Bool)0 [L282] RET node1() [L283] CALL node2() [L85] msg_t m2 ; [L88] m2 = nomsg [L89] COND TRUE \read(mode2) [L90] m2 = p1_old [L91] p1_old = nomsg [L92] COND FALSE !((int )m2 != (int )nomsg) [L104] mode2 = (_Bool)0 [L283] RET node2() [L284] CALL node3() [L119] msg_t m3 ; [L122] m3 = nomsg [L123] COND TRUE \read(mode3) [L124] m3 = p2_old [L125] p2_old = nomsg [L126] COND FALSE !((int )m3 != (int )nomsg) [L138] mode3 = (_Bool)0 [L284] RET node3() [L285] p1_old = p1_new [L286] p1_new = nomsg [L287] p2_old = p2_new [L288] p2_new = nomsg [L289] p3_old = p3_new [L290] p3_new = nomsg [L291] CALL, EXPR check() [L230] int tmp ; [L233] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 [L234] COND FALSE !((int )r1 < 3) [L237] COND FALSE !(((int )st1 + (int )st2) + (int )st3 == 1) [L240] tmp = 0 [L245] return (tmp); [L291] RET, EXPR check() [L291] c1 = check() [L292] CALL assert(c1) [L304] COND TRUE ! arg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=2, id3=1, 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=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L306] reach_error() VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=2, id3=1, 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=1, send2=2, send3=1, st1=0, st2=0, st3=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.39ms. Allocated memory is still 104.9MB. Free memory is still 56.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 487.30ms. Allocated memory is still 140.5MB. Free memory was 106.3MB in the beginning and 90.1MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.61ms. Allocated memory is still 140.5MB. Free memory was 90.1MB in the beginning and 88.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.22ms. Allocated memory is still 140.5MB. Free memory was 88.0MB in the beginning and 85.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1330.33ms. Allocated memory was 140.5MB in the beginning and 169.9MB in the end (delta: 29.4MB). Free memory was 85.9MB in the beginning and 89.0MB in the end (delta: -3.1MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. * CodeCheck took 173492.57ms. Allocated memory was 169.9MB in the beginning and 960.5MB in the end (delta: 790.6MB). Free memory was 87.9MB in the beginning and 538.7MB in the end (delta: -450.8MB). Peak memory consumption was 341.9MB. Max. memory is 16.1GB. * Witness Printer took 212.39ms. Allocated memory is still 960.5MB. Free memory was 538.7MB in the beginning and 528.2MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-08 23:56:31,340 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5486ba12-a62a-48aa-a452-80fd35b1ba57/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE