./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d5508ff9-a4c0-454c-928c-cd1e0b753c9c/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d5508ff9-a4c0-454c-928c-cd1e0b753c9c/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d5508ff9-a4c0-454c-928c-cd1e0b753c9c/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d5508ff9-a4c0-454c-928c-cd1e0b753c9c/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d5508ff9-a4c0-454c-928c-cd1e0b753c9c/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d5508ff9-a4c0-454c-928c-cd1e0b753c9c/bin-2019/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f2969d4725852fd68e7759cdb7f1d1929ca0124c ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 11:59:22,985 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 11:59:22,986 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 11:59:22,992 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 11:59:22,992 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 11:59:22,993 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 11:59:22,993 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 11:59:22,994 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 11:59:22,995 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 11:59:22,996 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 11:59:22,997 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 11:59:22,997 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 11:59:22,997 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 11:59:22,999 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 11:59:22,999 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 11:59:23,000 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 11:59:23,000 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 11:59:23,002 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 11:59:23,003 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 11:59:23,004 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 11:59:23,005 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 11:59:23,006 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 11:59:23,007 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 11:59:23,007 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 11:59:23,007 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 11:59:23,008 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 11:59:23,009 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 11:59:23,009 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 11:59:23,010 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 11:59:23,011 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 11:59:23,011 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 11:59:23,011 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 11:59:23,011 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 11:59:23,012 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 11:59:23,012 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 11:59:23,012 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 11:59:23,013 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d5508ff9-a4c0-454c-928c-cd1e0b753c9c/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-18 11:59:23,022 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 11:59:23,022 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 11:59:23,023 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 11:59:23,023 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 11:59:23,024 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 11:59:23,024 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 11:59:23,024 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 11:59:23,024 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 11:59:23,024 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 11:59:23,024 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 11:59:23,025 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 11:59:23,025 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 11:59:23,025 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 11:59:23,025 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 11:59:23,025 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 11:59:23,025 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 11:59:23,025 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 11:59:23,025 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 11:59:23,026 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-18 11:59:23,026 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-18 11:59:23,026 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 11:59:23,026 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 11:59:23,026 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-18 11:59:23,026 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 11:59:23,026 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 11:59:23,027 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 11:59:23,027 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-18 11:59:23,027 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 11:59:23,027 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 11:59:23,027 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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-vcloud-master/worker/working_dir_d5508ff9-a4c0-454c-928c-cd1e0b753c9c/bin-2019/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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(__VERIFIER_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 -> f2969d4725852fd68e7759cdb7f1d1929ca0124c [2018-11-18 11:59:23,051 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 11:59:23,060 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 11:59:23,063 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 11:59:23,064 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 11:59:23,064 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 11:59:23,065 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d5508ff9-a4c0-454c-928c-cd1e0b753c9c/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c [2018-11-18 11:59:23,103 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d5508ff9-a4c0-454c-928c-cd1e0b753c9c/bin-2019/ukojak/data/8b5047e25/2af5d24e03d047c6a4a7f2d73d2fdfcb/FLAG6d323152c [2018-11-18 11:59:23,523 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 11:59:23,523 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d5508ff9-a4c0-454c-928c-cd1e0b753c9c/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c [2018-11-18 11:59:23,528 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d5508ff9-a4c0-454c-928c-cd1e0b753c9c/bin-2019/ukojak/data/8b5047e25/2af5d24e03d047c6a4a7f2d73d2fdfcb/FLAG6d323152c [2018-11-18 11:59:23,539 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d5508ff9-a4c0-454c-928c-cd1e0b753c9c/bin-2019/ukojak/data/8b5047e25/2af5d24e03d047c6a4a7f2d73d2fdfcb [2018-11-18 11:59:23,541 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 11:59:23,542 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 11:59:23,543 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 11:59:23,543 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 11:59:23,545 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 11:59:23,545 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:59:23" (1/1) ... [2018-11-18 11:59:23,547 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20be4f24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:59:23, skipping insertion in model container [2018-11-18 11:59:23,547 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:59:23" (1/1) ... [2018-11-18 11:59:23,553 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 11:59:23,575 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 11:59:23,717 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:59:23,726 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 11:59:23,756 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:59:23,766 INFO L195 MainTranslator]: Completed translation [2018-11-18 11:59:23,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:59:23 WrapperNode [2018-11-18 11:59:23,767 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 11:59:23,767 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 11:59:23,767 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 11:59:23,767 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 11:59:23,808 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:59:23" (1/1) ... [2018-11-18 11:59:23,814 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:59:23" (1/1) ... [2018-11-18 11:59:23,834 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 11:59:23,834 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 11:59:23,834 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 11:59:23,834 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 11:59:23,840 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:59:23" (1/1) ... [2018-11-18 11:59:23,840 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:59:23" (1/1) ... [2018-11-18 11:59:23,842 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:59:23" (1/1) ... [2018-11-18 11:59:23,842 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:59:23" (1/1) ... [2018-11-18 11:59:23,844 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:59:23" (1/1) ... [2018-11-18 11:59:23,849 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:59:23" (1/1) ... [2018-11-18 11:59:23,851 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:59:23" (1/1) ... [2018-11-18 11:59:23,853 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 11:59:23,854 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 11:59:23,854 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 11:59:23,854 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 11:59:23,855 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:59:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d5508ff9-a4c0-454c-928c-cd1e0b753c9c/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-18 11:59:23,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 11:59:23,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 11:59:24,828 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 11:59:24,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:59:24 BoogieIcfgContainer [2018-11-18 11:59:24,829 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 11:59:24,829 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-18 11:59:24,830 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-18 11:59:24,839 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-18 11:59:24,839 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:59:24" (1/1) ... [2018-11-18 11:59:24,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:59:24,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:59:24,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 9 states and 11 transitions. [2018-11-18 11:59:24,878 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2018-11-18 11:59:24,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-11-18 11:59:24,880 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:59:25,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:59:25,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:59:25,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:59:25,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 12 states and 15 transitions. [2018-11-18 11:59:25,242 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 15 transitions. [2018-11-18 11:59:25,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-18 11:59:25,242 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:59:25,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:59:25,627 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 66 [2018-11-18 11:59:25,789 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 68 [2018-11-18 11:59:25,820 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:59:26,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:59:26,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 18 states and 30 transitions. [2018-11-18 11:59:26,767 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 30 transitions. [2018-11-18 11:59:26,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-18 11:59:26,770 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:59:26,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:59:27,085 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:59:28,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:59:28,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 24 states and 46 transitions. [2018-11-18 11:59:28,994 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 46 transitions. [2018-11-18 11:59:28,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-18 11:59:28,994 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:59:29,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:59:29,120 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:59:29,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:59:29,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 26 states and 50 transitions. [2018-11-18 11:59:29,483 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 50 transitions. [2018-11-18 11:59:29,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 11:59:29,483 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:59:29,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:59:30,270 WARN L180 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 65 [2018-11-18 11:59:32,207 WARN L180 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 299 DAG size of output: 166 [2018-11-18 11:59:33,431 WARN L180 SmtUtils]: Spent 999.00 ms on a formula simplification. DAG size of input: 278 DAG size of output: 146 [2018-11-18 11:59:34,243 WARN L180 SmtUtils]: Spent 667.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 115 [2018-11-18 11:59:35,118 WARN L180 SmtUtils]: Spent 711.00 ms on a formula simplification. DAG size of input: 260 DAG size of output: 111 [2018-11-18 11:59:35,130 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:59:35,259 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2018-11-18 11:59:35,488 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2018-11-18 11:59:36,160 WARN L180 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 155 [2018-11-18 11:59:36,595 WARN L180 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 147 [2018-11-18 11:59:37,053 WARN L180 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 172 [2018-11-18 11:59:37,557 WARN L180 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 155 [2018-11-18 11:59:37,883 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2018-11-18 11:59:38,390 WARN L180 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 153 [2018-11-18 11:59:38,852 WARN L180 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 170 [2018-11-18 11:59:39,354 WARN L180 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 151 [2018-11-18 11:59:39,684 WARN L180 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2018-11-18 11:59:40,160 WARN L180 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 132 [2018-11-18 11:59:40,524 WARN L180 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 128 [2018-11-18 11:59:40,802 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 106 [2018-11-18 11:59:41,110 WARN L180 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 138 [2018-11-18 11:59:41,447 WARN L180 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 128 [2018-11-18 11:59:41,821 WARN L180 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 138 [2018-11-18 11:59:42,146 WARN L180 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 121 [2018-11-18 11:59:42,411 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 100 [2018-11-18 11:59:42,583 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2018-11-18 11:59:42,798 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2018-11-18 11:59:43,035 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2018-11-18 11:59:43,286 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 142 [2018-11-18 11:59:43,551 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2018-11-18 11:59:43,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:59:43,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 36 states and 75 transitions. [2018-11-18 11:59:43,652 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 75 transitions. [2018-11-18 11:59:43,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 11:59:43,653 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:59:43,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:59:44,123 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:59:44,754 WARN L180 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 135 [2018-11-18 11:59:45,292 WARN L180 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 173 [2018-11-18 11:59:45,498 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2018-11-18 11:59:45,778 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2018-11-18 11:59:46,235 WARN L180 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 133 [2018-11-18 11:59:46,613 WARN L180 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 171 [2018-11-18 11:59:46,835 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2018-11-18 11:59:47,108 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2018-11-18 11:59:47,527 WARN L180 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 176 [2018-11-18 11:59:47,818 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 177 [2018-11-18 11:59:47,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:59:47,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 40 states and 85 transitions. [2018-11-18 11:59:47,933 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 85 transitions. [2018-11-18 11:59:47,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 11:59:47,934 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:59:48,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:59:48,248 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:59:48,822 WARN L180 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 129 [2018-11-18 11:59:49,153 WARN L180 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 130 [2018-11-18 11:59:49,373 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2018-11-18 11:59:49,596 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2018-11-18 11:59:49,782 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2018-11-18 11:59:50,068 WARN L180 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 124 [2018-11-18 11:59:50,296 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-11-18 11:59:50,522 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2018-11-18 11:59:50,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:59:50,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 43 states and 90 transitions. [2018-11-18 11:59:50,579 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 90 transitions. [2018-11-18 11:59:50,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 11:59:50,580 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:59:51,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:59:51,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:59:52,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:59:52,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:59:52,201 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 8 iterations. [2018-11-18 11:59:52,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 18.11 11:59:52 ImpRootNode [2018-11-18 11:59:52,259 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-18 11:59:52,259 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 11:59:52,259 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 11:59:52,259 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 11:59:52,260 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:59:24" (3/4) ... [2018-11-18 11:59:52,262 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 11:59:52,351 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d5508ff9-a4c0-454c-928c-cd1e0b753c9c/bin-2019/ukojak/witness.graphml [2018-11-18 11:59:52,351 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 11:59:52,352 INFO L168 Benchmark]: Toolchain (without parser) took 28810.33 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 569.9 MB). Free memory was 962.4 MB in the beginning and 989.5 MB in the end (delta: -27.2 MB). Peak memory consumption was 542.7 MB. Max. memory is 11.5 GB. [2018-11-18 11:59:52,353 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:59:52,353 INFO L168 Benchmark]: CACSL2BoogieTranslator took 224.22 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 946.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-18 11:59:52,353 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.89 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -160.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-11-18 11:59:52,353 INFO L168 Benchmark]: Boogie Preprocessor took 19.23 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:59:52,354 INFO L168 Benchmark]: RCFGBuilder took 975.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 951.2 MB in the end (delta: 155.4 MB). Peak memory consumption was 155.4 MB. Max. memory is 11.5 GB. [2018-11-18 11:59:52,354 INFO L168 Benchmark]: CodeCheck took 27429.20 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 454.0 MB). Free memory was 951.2 MB in the beginning and 1.0 GB in the end (delta: -54.1 MB). Peak memory consumption was 399.9 MB. Max. memory is 11.5 GB. [2018-11-18 11:59:52,354 INFO L168 Benchmark]: Witness Printer took 92.56 ms. Allocated memory is still 1.6 GB. Free memory was 1.0 GB in the beginning and 989.5 MB in the end (delta: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-18 11:59:52,355 INFO L336 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, 75 locations, 1 error locations. UNSAFE Result, 27.3s OverallTime, 8 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 732 SDtfs, 1208 SDslu, 2308 SDs, 0 SdLazy, 3846 SolverSat, 842 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1063 GetRequests, 904 SyntacticMatches, 53 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5399 ImplicationChecksByTransitivity, 23.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 120 NumberOfCodeBlocks, 120 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 88 ConstructedInterpolants, 0 QuantifiedInterpolants, 193132 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 15/101 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 352]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L71] char r1 ; [L73] char p1_old ; [L74] char p1_new ; [L75] char id1 ; [L76] char st1 ; [L78] _Bool mode1 ; [L79] _Bool alive1 ; [L81] char p2_old ; [L82] char p2_new ; [L83] char id2 ; [L84] char st2 ; [L86] _Bool mode2 ; [L87] _Bool alive2 ; [L89] char p3_old ; [L90] char p3_new ; [L91] char id3 ; [L92] char st3 ; [L94] _Bool mode3 ; [L95] _Bool alive3 ; [L70] msg_t nomsg = (msg_t )-1; [L72] port_t p1 ; [L77] msg_t send1 ; [L80] port_t p2 ; [L85] msg_t send2 ; [L88] port_t p3 ; [L93] msg_t send3 ; [L196] void (*nodes[3])(void) = { & node1, & node2, & node3}; [L296] int c1 ; [L297] int i2 ; [L300] c1 = 0 [L301] r1 = __VERIFIER_nondet_char() [L302] id1 = __VERIFIER_nondet_char() [L303] st1 = __VERIFIER_nondet_char() [L304] send1 = __VERIFIER_nondet_char() [L305] mode1 = __VERIFIER_nondet_bool() [L306] alive1 = __VERIFIER_nondet_bool() [L307] id2 = __VERIFIER_nondet_char() [L308] st2 = __VERIFIER_nondet_char() [L309] send2 = __VERIFIER_nondet_char() [L310] mode2 = __VERIFIER_nondet_bool() [L311] alive2 = __VERIFIER_nondet_bool() [L312] id3 = __VERIFIER_nondet_char() [L313] st3 = __VERIFIER_nondet_char() [L314] send3 = __VERIFIER_nondet_char() [L315] mode3 = __VERIFIER_nondet_bool() [L316] alive3 = __VERIFIER_nondet_bool() [L317] CALL, EXPR init() [L199] int tmp ; [L202] COND TRUE (int )r1 == 0 [L203] COND TRUE ((int )alive1 + (int )alive2) + (int )alive3 >= 1 [L204] COND TRUE (int )id1 >= 0 [L205] COND TRUE (int )st1 == 0 [L206] COND TRUE (int )send1 == (int )id1 [L207] COND TRUE (int )mode1 == 0 [L208] COND TRUE (int )id2 >= 0 [L209] COND TRUE (int )st2 == 0 [L210] COND TRUE (int )send2 == (int )id2 [L211] COND TRUE (int )mode2 == 0 [L212] COND TRUE (int )id3 >= 0 [L213] COND TRUE (int )st3 == 0 [L214] COND TRUE (int )send3 == (int )id3 [L215] COND TRUE (int )mode3 == 0 [L216] COND TRUE (int )id1 != (int )id2 [L217] COND TRUE (int )id1 != (int )id3 [L218] COND TRUE (int )id2 != (int )id3 [L219] tmp = 1 [L271] RET return (tmp); [L317] EXPR init() [L317] i2 = init() [L319] p1_old = nomsg [L320] p1_new = nomsg [L321] p2_old = nomsg [L322] p2_new = nomsg [L323] p3_old = nomsg [L324] p3_new = nomsg [L325] i2 = 0 VAL [alive1=0, alive2=1, alive3=1, id1=0, id2=1, id3=2, 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=1, send3=2, st1=0, st2=0, st3=0] [L326] COND TRUE i2 < 6 [L328] CALL node1() [L98] msg_t m1 ; [L101] m1 = nomsg [L102] COND FALSE !(\read(mode1)) [L120] COND FALSE !(\read(alive1)) [L123] RET mode1 = (_Bool)1 [L328] node1() [L329] CALL node2() [L130] msg_t m2 ; [L133] m2 = nomsg [L134] COND FALSE !(\read(mode2)) [L151] COND TRUE \read(alive2) [L152] COND TRUE, EXPR send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L152] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L157] RET mode2 = (_Bool)1 [L329] node2() [L330] CALL node3() [L164] msg_t m3 ; [L167] m3 = nomsg [L168] COND FALSE !(\read(mode3)) [L185] COND TRUE \read(alive3) [L186] COND TRUE, EXPR send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L186] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L191] RET mode3 = (_Bool)1 [L330] node3() [L331] p1_old = p1_new [L332] p1_new = nomsg [L333] p2_old = p2_new [L334] p2_new = nomsg [L335] p3_old = p3_new [L336] p3_new = nomsg [L337] CALL, EXPR check() [L276] int tmp ; [L279] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 [L280] COND TRUE (int )r1 < 3 [L281] tmp = 1 [L291] RET return (tmp); [L337] EXPR check() [L337] c1 = check() [L338] CALL assert(c1) [L350] COND FALSE, RET !(! arg) VAL [alive1=0, alive2=1, alive3=1, id1=0, id2=1, id3=2, 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=2, r1=0, send1=0, send2=1, send3=2, st1=0, st2=0, st3=0] [L338] assert(c1) [L339] i2 ++ VAL [alive1=0, alive2=1, alive3=1, id1=0, id2=1, id3=2, 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=2, r1=0, send1=0, send2=1, send3=2, st1=0, st2=0, st3=0] [L326] COND TRUE i2 < 6 [L328] CALL node1() [L98] msg_t m1 ; [L101] m1 = nomsg [L102] COND TRUE \read(mode1) [L103] r1 = (char )((int )r1 + 1) [L104] m1 = p3_old [L105] p3_old = nomsg [L106] COND TRUE (int )m1 != (int )nomsg [L107] COND FALSE !(\read(alive1)) [L115] send1 = m1 [L118] RET mode1 = (_Bool)0 [L328] node1() [L329] CALL node2() [L130] msg_t m2 ; [L133] m2 = nomsg [L134] COND TRUE \read(mode2) [L135] m2 = p1_old [L136] p1_old = nomsg [L137] COND FALSE !((int )m2 != (int )nomsg) [L149] RET mode2 = (_Bool)0 [L329] node2() [L330] CALL node3() [L164] msg_t m3 ; [L167] m3 = nomsg [L168] COND TRUE \read(mode3) [L169] m3 = p2_old [L170] p2_old = nomsg [L171] COND TRUE (int )m3 != (int )nomsg [L172] COND TRUE \read(alive3) [L173] COND FALSE !((int )m3 > (int )id3) [L176] COND FALSE !((int )m3 == (int )id3) [L183] RET mode3 = (_Bool)0 [L330] node3() [L331] p1_old = p1_new [L332] p1_new = nomsg [L333] p2_old = p2_new [L334] p2_new = nomsg [L335] p3_old = p3_new [L336] p3_new = nomsg [L337] CALL, EXPR check() [L276] int tmp ; [L279] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 [L280] COND TRUE (int )r1 < 3 [L281] tmp = 1 [L291] RET return (tmp); [L337] EXPR check() [L337] c1 = check() [L338] CALL assert(c1) [L350] COND FALSE, RET !(! arg) VAL [alive1=0, alive2=1, alive3=1, id1=0, id2=1, id3=2, 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=2, send2=1, send3=2, st1=0, st2=0, st3=0] [L338] assert(c1) [L339] i2 ++ VAL [alive1=0, alive2=1, alive3=1, id1=0, id2=1, id3=2, 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=2, send2=1, send3=2, st1=0, st2=0, st3=0] [L326] COND TRUE i2 < 6 [L328] CALL node1() [L98] msg_t m1 ; [L101] m1 = nomsg [L102] COND FALSE !(\read(mode1)) [L120] COND FALSE !(\read(alive1)) [L123] RET mode1 = (_Bool)1 [L328] node1() [L329] CALL node2() [L130] msg_t m2 ; [L133] m2 = nomsg [L134] COND FALSE !(\read(mode2)) [L151] COND TRUE \read(alive2) [L152] COND TRUE, EXPR send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L152] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L157] RET mode2 = (_Bool)1 [L329] node2() [L330] CALL node3() [L164] msg_t m3 ; [L167] m3 = nomsg [L168] COND FALSE !(\read(mode3)) [L185] COND TRUE \read(alive3) [L186] COND TRUE, EXPR send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L186] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L191] RET mode3 = (_Bool)1 [L330] node3() [L331] p1_old = p1_new [L332] p1_new = nomsg [L333] p2_old = p2_new [L334] p2_new = nomsg [L335] p3_old = p3_new [L336] p3_new = nomsg [L337] CALL, EXPR check() [L276] int tmp ; [L279] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 [L280] COND TRUE (int )r1 < 3 [L281] tmp = 1 [L291] RET return (tmp); [L337] EXPR check() [L337] c1 = check() [L338] CALL assert(c1) [L350] COND FALSE, RET !(! arg) VAL [alive1=0, alive2=1, alive3=1, id1=0, id2=1, id3=2, 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=2, r1=1, send1=2, send2=1, send3=2, st1=0, st2=0, st3=0] [L338] assert(c1) [L339] i2 ++ VAL [alive1=0, alive2=1, alive3=1, id1=0, id2=1, id3=2, 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=2, r1=1, send1=2, send2=1, send3=2, st1=0, st2=0, st3=0] [L326] COND TRUE i2 < 6 [L328] CALL node1() [L98] msg_t m1 ; [L101] m1 = nomsg [L102] COND TRUE \read(mode1) [L103] r1 = (char )((int )r1 + 1) [L104] m1 = p3_old [L105] p3_old = nomsg [L106] COND TRUE (int )m1 != (int )nomsg [L107] COND FALSE !(\read(alive1)) [L115] send1 = m1 [L118] RET mode1 = (_Bool)0 [L328] node1() [L329] CALL node2() [L130] msg_t m2 ; [L133] m2 = nomsg [L134] COND TRUE \read(mode2) [L135] m2 = p1_old [L136] p1_old = nomsg [L137] COND FALSE !((int )m2 != (int )nomsg) [L149] RET mode2 = (_Bool)0 [L329] node2() [L330] CALL node3() [L164] msg_t m3 ; [L167] m3 = nomsg [L168] COND TRUE \read(mode3) [L169] m3 = p2_old [L170] p2_old = nomsg [L171] COND TRUE (int )m3 != (int )nomsg [L172] COND TRUE \read(alive3) [L173] COND FALSE !((int )m3 > (int )id3) [L176] COND FALSE !((int )m3 == (int )id3) [L183] RET mode3 = (_Bool)0 [L330] node3() [L331] p1_old = p1_new [L332] p1_new = nomsg [L333] p2_old = p2_new [L334] p2_new = nomsg [L335] p3_old = p3_new [L336] p3_new = nomsg [L337] CALL, EXPR check() [L276] int tmp ; [L279] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 [L280] COND TRUE (int )r1 < 3 [L281] tmp = 1 [L291] RET return (tmp); [L337] EXPR check() [L337] c1 = check() [L338] CALL assert(c1) [L350] COND FALSE, RET !(! arg) VAL [alive1=0, alive2=1, alive3=1, id1=0, id2=1, id3=2, 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=2, send2=1, send3=2, st1=0, st2=0, st3=0] [L338] assert(c1) [L339] i2 ++ VAL [alive1=0, alive2=1, alive3=1, id1=0, id2=1, id3=2, 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=2, send2=1, send3=2, st1=0, st2=0, st3=0] [L326] COND TRUE i2 < 6 [L328] CALL node1() [L98] msg_t m1 ; [L101] m1 = nomsg [L102] COND FALSE !(\read(mode1)) [L120] COND FALSE !(\read(alive1)) [L123] RET mode1 = (_Bool)1 [L328] node1() [L329] CALL node2() [L130] msg_t m2 ; [L133] m2 = nomsg [L134] COND FALSE !(\read(mode2)) [L151] COND TRUE \read(alive2) [L152] COND TRUE, EXPR send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L152] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L157] RET mode2 = (_Bool)1 [L329] node2() [L330] CALL node3() [L164] msg_t m3 ; [L167] m3 = nomsg [L168] COND FALSE !(\read(mode3)) [L185] COND TRUE \read(alive3) [L186] COND TRUE, EXPR send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L186] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L191] RET mode3 = (_Bool)1 [L330] node3() [L331] p1_old = p1_new [L332] p1_new = nomsg [L333] p2_old = p2_new [L334] p2_new = nomsg [L335] p3_old = p3_new [L336] p3_new = nomsg [L337] CALL, EXPR check() [L276] int tmp ; [L279] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 [L280] COND TRUE (int )r1 < 3 [L281] tmp = 1 [L291] RET return (tmp); [L337] EXPR check() [L337] c1 = check() [L338] CALL assert(c1) [L350] COND FALSE, RET !(! arg) VAL [alive1=0, alive2=1, alive3=1, id1=0, id2=1, id3=2, 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=2, r1=2, send1=2, send2=1, send3=2, st1=0, st2=0, st3=0] [L338] assert(c1) [L339] i2 ++ VAL [alive1=0, alive2=1, alive3=1, id1=0, id2=1, id3=2, 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=2, r1=2, send1=2, send2=1, send3=2, st1=0, st2=0, st3=0] [L326] COND TRUE i2 < 6 [L328] CALL node1() [L98] msg_t m1 ; [L101] m1 = nomsg [L102] COND TRUE \read(mode1) [L103] r1 = (char )((int )r1 + 1) [L104] m1 = p3_old [L105] p3_old = nomsg [L106] COND TRUE (int )m1 != (int )nomsg [L107] COND FALSE !(\read(alive1)) [L115] send1 = m1 [L118] RET mode1 = (_Bool)0 [L328] node1() [L329] CALL node2() [L130] msg_t m2 ; [L133] m2 = nomsg [L134] COND TRUE \read(mode2) [L135] m2 = p1_old [L136] p1_old = nomsg [L137] COND FALSE !((int )m2 != (int )nomsg) [L149] RET mode2 = (_Bool)0 [L329] node2() [L330] CALL node3() [L164] msg_t m3 ; [L167] m3 = nomsg [L168] COND TRUE \read(mode3) [L169] m3 = p2_old [L170] p2_old = nomsg [L171] COND TRUE (int )m3 != (int )nomsg [L172] COND TRUE \read(alive3) [L173] COND FALSE !((int )m3 > (int )id3) [L176] COND FALSE !((int )m3 == (int )id3) [L183] RET mode3 = (_Bool)0 [L330] node3() [L331] p1_old = p1_new [L332] p1_new = nomsg [L333] p2_old = p2_new [L334] p2_new = nomsg [L335] p3_old = p3_new [L336] p3_new = nomsg [L337] CALL, EXPR check() [L276] int tmp ; [L279] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 [L280] COND FALSE !((int )r1 < 3) [L283] COND FALSE !(((int )st1 + (int )st2) + (int )st3 == 1) [L286] tmp = 0 [L291] RET return (tmp); [L337] EXPR check() [L337] c1 = check() [L338] CALL assert(c1) [L350] COND TRUE ! arg VAL [alive1=0, alive2=1, alive3=1, id1=0, id2=1, id3=2, 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=2, send2=1, send3=2, st1=0, st2=0, st3=0] [L352] __VERIFIER_error() VAL [alive1=0, alive2=1, alive3=1, id1=0, id2=1, id3=2, 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=2, send2=1, send3=2, st1=0, st2=0, st3=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 224.22 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 946.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.89 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -160.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.23 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 975.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 951.2 MB in the end (delta: 155.4 MB). Peak memory consumption was 155.4 MB. Max. memory is 11.5 GB. * CodeCheck took 27429.20 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 454.0 MB). Free memory was 951.2 MB in the beginning and 1.0 GB in the end (delta: -54.1 MB). Peak memory consumption was 399.9 MB. Max. memory is 11.5 GB. * Witness Printer took 92.56 ms. Allocated memory is still 1.6 GB. Free memory was 1.0 GB in the beginning and 989.5 MB in the end (delta: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...