./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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_aeb023f2-968f-4b68-9331-233dc58b8724/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_aeb023f2-968f-4b68-9331-233dc58b8724/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_aeb023f2-968f-4b68-9331-233dc58b8724/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_aeb023f2-968f-4b68-9331-233dc58b8724/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_aeb023f2-968f-4b68-9331-233dc58b8724/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_aeb023f2-968f-4b68-9331-233dc58b8724/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-1dbac8b [2018-10-26 22:26:11,960 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 22:26:11,962 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 22:26:11,970 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 22:26:11,971 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 22:26:11,971 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 22:26:11,972 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 22:26:11,973 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 22:26:11,975 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 22:26:11,976 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 22:26:11,976 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 22:26:11,977 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 22:26:11,977 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 22:26:11,978 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 22:26:11,979 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 22:26:11,979 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 22:26:11,980 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 22:26:11,981 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 22:26:11,982 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 22:26:11,984 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 22:26:11,985 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 22:26:11,986 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 22:26:11,988 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 22:26:11,988 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 22:26:11,989 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 22:26:11,989 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 22:26:11,990 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 22:26:11,991 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 22:26:11,992 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 22:26:11,992 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 22:26:11,993 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 22:26:11,993 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 22:26:11,993 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 22:26:11,993 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 22:26:11,994 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 22:26:11,994 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 22:26:11,996 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_aeb023f2-968f-4b68-9331-233dc58b8724/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-10-26 22:26:12,006 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 22:26:12,006 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 22:26:12,007 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 22:26:12,007 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 22:26:12,008 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 22:26:12,008 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 22:26:12,008 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 22:26:12,008 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 22:26:12,008 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 22:26:12,008 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 22:26:12,008 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 22:26:12,009 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 22:26:12,009 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 22:26:12,009 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 22:26:12,009 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 22:26:12,009 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 22:26:12,009 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 22:26:12,009 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-10-26 22:26:12,009 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-10-26 22:26:12,010 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 22:26:12,010 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 22:26:12,010 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-26 22:26:12,010 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 22:26:12,010 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 22:26:12,010 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 22:26:12,010 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-10-26 22:26:12,011 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 22:26:12,013 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 22:26:12,013 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_aeb023f2-968f-4b68-9331-233dc58b8724/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-10-26 22:26:12,042 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 22:26:12,055 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 22:26:12,058 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 22:26:12,061 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 22:26:12,062 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 22:26:12,062 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_aeb023f2-968f-4b68-9331-233dc58b8724/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-10-26 22:26:12,113 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_aeb023f2-968f-4b68-9331-233dc58b8724/bin-2019/ukojak/data/bbc11e82b/5dd3ed6084564a9ba997c8dd5f15454a/FLAGfb8dc2da6 [2018-10-26 22:26:12,507 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 22:26:12,507 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_aeb023f2-968f-4b68-9331-233dc58b8724/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c [2018-10-26 22:26:12,514 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_aeb023f2-968f-4b68-9331-233dc58b8724/bin-2019/ukojak/data/bbc11e82b/5dd3ed6084564a9ba997c8dd5f15454a/FLAGfb8dc2da6 [2018-10-26 22:26:12,526 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_aeb023f2-968f-4b68-9331-233dc58b8724/bin-2019/ukojak/data/bbc11e82b/5dd3ed6084564a9ba997c8dd5f15454a [2018-10-26 22:26:12,529 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 22:26:12,531 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 22:26:12,531 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 22:26:12,531 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 22:26:12,535 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 22:26:12,535 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:26:12" (1/1) ... [2018-10-26 22:26:12,537 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31d595fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:26:12, skipping insertion in model container [2018-10-26 22:26:12,538 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:26:12" (1/1) ... [2018-10-26 22:26:12,546 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 22:26:12,571 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 22:26:12,734 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:26:12,740 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 22:26:12,774 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:26:12,788 INFO L193 MainTranslator]: Completed translation [2018-10-26 22:26:12,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:26:12 WrapperNode [2018-10-26 22:26:12,790 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 22:26:12,791 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 22:26:12,791 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 22:26:12,791 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 22:26:12,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:26:12" (1/1) ... [2018-10-26 22:26:12,806 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:26:12" (1/1) ... [2018-10-26 22:26:12,832 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 22:26:12,838 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 22:26:12,838 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 22:26:12,838 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 22:26:12,846 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:26:12" (1/1) ... [2018-10-26 22:26:12,846 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:26:12" (1/1) ... [2018-10-26 22:26:12,848 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:26:12" (1/1) ... [2018-10-26 22:26:12,855 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:26:12" (1/1) ... [2018-10-26 22:26:12,858 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:26:12" (1/1) ... [2018-10-26 22:26:12,875 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:26:12" (1/1) ... [2018-10-26 22:26:12,876 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:26:12" (1/1) ... [2018-10-26 22:26:12,878 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 22:26:12,879 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 22:26:12,883 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 22:26:12,883 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 22:26:12,884 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:26:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aeb023f2-968f-4b68-9331-233dc58b8724/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-10-26 22:26:13,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 22:26:13,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 22:26:15,361 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 22:26:15,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:26:15 BoogieIcfgContainer [2018-10-26 22:26:15,361 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 22:26:15,362 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-10-26 22:26:15,362 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-10-26 22:26:15,375 INFO L276 PluginConnector]: CodeCheck initialized [2018-10-26 22:26:15,375 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:26:15" (1/1) ... [2018-10-26 22:26:15,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:26:15,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:26:15,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 9 states and 11 transitions. [2018-10-26 22:26:15,422 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2018-10-26 22:26:15,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-26 22:26:15,427 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:26:15,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:26:15,877 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-10-26 22:26:15,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:26:16,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:26:16,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 12 states and 15 transitions. [2018-10-26 22:26:16,173 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 15 transitions. [2018-10-26 22:26:16,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-26 22:26:16,174 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:26:16,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:26:16,713 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 57 [2018-10-26 22:26:16,894 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2018-10-26 22:26:16,900 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:26:17,245 WARN L179 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2018-10-26 22:26:17,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:26:17,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 18 states and 27 transitions. [2018-10-26 22:26:17,866 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 27 transitions. [2018-10-26 22:26:17,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-26 22:26:17,869 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:26:17,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:26:18,243 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:26:19,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:26:19,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 26 states and 47 transitions. [2018-10-26 22:26:19,771 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 47 transitions. [2018-10-26 22:26:19,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-26 22:26:19,774 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:26:19,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:26:20,811 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 60 [2018-10-26 22:26:21,750 WARN L179 SmtUtils]: Spent 816.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 151 [2018-10-26 22:26:22,825 WARN L179 SmtUtils]: Spent 942.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 148 [2018-10-26 22:26:23,667 WARN L179 SmtUtils]: Spent 750.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 130 [2018-10-26 22:26:24,304 WARN L179 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 89 [2018-10-26 22:26:24,745 WARN L179 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 84 [2018-10-26 22:26:24,759 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:26:25,092 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2018-10-26 22:26:25,288 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2018-10-26 22:26:25,860 WARN L179 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 169 [2018-10-26 22:26:26,131 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2018-10-26 22:26:26,543 WARN L179 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 172 [2018-10-26 22:26:26,880 WARN L179 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2018-10-26 22:26:27,208 WARN L179 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2018-10-26 22:26:27,742 WARN L179 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 167 [2018-10-26 22:26:28,007 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2018-10-26 22:26:28,463 WARN L179 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 171 [2018-10-26 22:26:28,779 WARN L179 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 167 [2018-10-26 22:26:29,305 WARN L179 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 171 [2018-10-26 22:26:29,671 WARN L179 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 134 [2018-10-26 22:26:29,940 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2018-10-26 22:26:30,251 WARN L179 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 139 [2018-10-26 22:26:30,524 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2018-10-26 22:26:30,743 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2018-10-26 22:26:31,126 WARN L179 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 132 [2018-10-26 22:26:31,432 WARN L179 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 137 [2018-10-26 22:26:31,703 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2018-10-26 22:26:31,915 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2018-10-26 22:26:32,184 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 90 [2018-10-26 22:26:32,505 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 86 [2018-10-26 22:26:32,781 WARN L179 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 130 [2018-10-26 22:26:33,269 WARN L179 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2018-10-26 22:26:33,498 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 85 [2018-10-26 22:26:33,715 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 80 [2018-10-26 22:26:33,878 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2018-10-26 22:26:34,259 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2018-10-26 22:26:34,502 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2018-10-26 22:26:34,730 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2018-10-26 22:26:34,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:26:34,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 38 states and 77 transitions. [2018-10-26 22:26:34,849 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 77 transitions. [2018-10-26 22:26:34,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-26 22:26:34,850 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:26:35,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:26:35,413 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:26:35,902 WARN L179 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 144 [2018-10-26 22:26:36,204 WARN L179 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2018-10-26 22:26:36,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:26:36,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 40 states and 80 transitions. [2018-10-26 22:26:36,375 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 80 transitions. [2018-10-26 22:26:36,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-26 22:26:36,376 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:26:36,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:26:37,910 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:26:38,320 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 87 [2018-10-26 22:26:39,113 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 83 [2018-10-26 22:26:39,901 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 69 [2018-10-26 22:26:40,423 WARN L179 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 131 [2018-10-26 22:26:40,777 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2018-10-26 22:26:40,997 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 66 [2018-10-26 22:26:41,309 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2018-10-26 22:26:42,172 WARN L179 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2018-10-26 22:26:42,384 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 74 [2018-10-26 22:26:42,575 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2018-10-26 22:26:42,990 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2018-10-26 22:26:43,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:26:43,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 48 states and 101 transitions. [2018-10-26 22:26:43,062 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 101 transitions. [2018-10-26 22:26:43,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 22:26:43,063 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:26:43,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 22:26:44,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 22:26:44,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 22:26:46,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 22:26:46,218 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 7 iterations. [2018-10-26 22:26:46,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 26.10 10:26:46 ImpRootNode [2018-10-26 22:26:46,328 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-10-26 22:26:46,328 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 22:26:46,328 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 22:26:46,328 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 22:26:46,329 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:26:15" (3/4) ... [2018-10-26 22:26:46,332 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-26 22:26:46,457 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_aeb023f2-968f-4b68-9331-233dc58b8724/bin-2019/ukojak/witness.graphml [2018-10-26 22:26:46,457 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 22:26:46,458 INFO L168 Benchmark]: Toolchain (without parser) took 33927.63 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 403.7 MB). Free memory was 953.1 MB in the beginning and 905.0 MB in the end (delta: 48.1 MB). Peak memory consumption was 451.8 MB. Max. memory is 11.5 GB. [2018-10-26 22:26:46,458 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 22:26:46,458 INFO L168 Benchmark]: CACSL2BoogieTranslator took 258.95 ms. Allocated memory is still 1.0 GB. Free memory was 953.1 MB in the beginning and 937.0 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-10-26 22:26:46,460 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.81 ms. Allocated memory is still 1.0 GB. Free memory was 937.0 MB in the beginning and 934.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-26 22:26:46,460 INFO L168 Benchmark]: Boogie Preprocessor took 40.57 ms. Allocated memory is still 1.0 GB. Free memory is still 934.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 22:26:46,460 INFO L168 Benchmark]: RCFGBuilder took 2483.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 934.3 MB in the beginning and 974.7 MB in the end (delta: -40.3 MB). Peak memory consumption was 107.4 MB. Max. memory is 11.5 GB. [2018-10-26 22:26:46,461 INFO L168 Benchmark]: CodeCheck took 30965.68 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 269.0 MB). Free memory was 974.7 MB in the beginning and 916.0 MB in the end (delta: 58.6 MB). Peak memory consumption was 327.6 MB. Max. memory is 11.5 GB. [2018-10-26 22:26:46,461 INFO L168 Benchmark]: Witness Printer took 129.00 ms. Allocated memory is still 1.4 GB. Free memory was 916.0 MB in the beginning and 905.0 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 11.5 GB. [2018-10-26 22:26:46,463 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, 30.8s OverallTime, 7 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 416 SDtfs, 796 SDslu, 1280 SDs, 0 SdLazy, 1936 SolverSat, 424 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 899 GetRequests, 746 SyntacticMatches, 35 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6828 ImplicationChecksByTransitivity, 24.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 107 NumberOfCodeBlocks, 107 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 76 ConstructedInterpolants, 0 QuantifiedInterpolants, 136616 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 1 PerfectInterpolantSequences, 11/91 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=0, id1=2, id2=1, id3=0, 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=2, send2=1, send3=0, 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 FALSE !(\read(alive3)) [L188] COND FALSE !((int )send3 != (int )id3) [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=0, id1=2, id2=1, id3=0, 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=2, send2=1, send3=0, st1=0, st2=0, st3=0] [L338] assert(c1) [L339] i2 ++ VAL [alive1=0, alive2=1, alive3=0, id1=2, id2=1, id3=0, 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=2, send2=1, send3=0, 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 FALSE !((int )m1 != (int )nomsg) [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 FALSE !(\read(alive3)) [L180] send3 = m3 [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=0, id1=2, id2=1, id3=0, 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=1, st1=0, st2=0, st3=0] [L338] assert(c1) [L339] i2 ++ VAL [alive1=0, alive2=1, alive3=0, id1=2, id2=1, id3=0, 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=1, 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 FALSE !(\read(alive3)) [L188] COND TRUE (int )send3 != (int )id3 [L189] COND TRUE, EXPR send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L189] 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=0, id1=2, id2=1, id3=0, 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=2, send2=1, send3=1, st1=0, st2=0, st3=0] [L338] assert(c1) [L339] i2 ++ VAL [alive1=0, alive2=1, alive3=0, id1=2, id2=1, id3=0, 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=2, send2=1, send3=1, 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 FALSE !(\read(alive3)) [L180] send3 = m3 [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=0, id1=2, id2=1, id3=0, 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=1, send3=1, st1=0, st2=0, st3=0] [L338] assert(c1) [L339] i2 ++ VAL [alive1=0, alive2=1, alive3=0, id1=2, id2=1, id3=0, 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=1, send3=1, 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 FALSE !(\read(alive3)) [L188] COND TRUE (int )send3 != (int )id3 [L189] COND TRUE, EXPR send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L189] 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=0, id1=2, id2=1, id3=0, 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=1, send3=1, st1=0, st2=0, st3=0] [L338] assert(c1) [L339] i2 ++ VAL [alive1=0, alive2=1, alive3=0, id1=2, id2=1, id3=0, 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=1, send3=1, 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 FALSE !(\read(alive3)) [L180] send3 = m3 [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=0, id1=2, id2=1, id3=0, 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=1, send3=1, st1=0, st2=0, st3=0] [L352] __VERIFIER_error() VAL [alive1=0, alive2=1, alive3=0, id1=2, id2=1, id3=0, 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=1, 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 258.95 ms. Allocated memory is still 1.0 GB. Free memory was 953.1 MB in the beginning and 937.0 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 46.81 ms. Allocated memory is still 1.0 GB. Free memory was 937.0 MB in the beginning and 934.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.57 ms. Allocated memory is still 1.0 GB. Free memory is still 934.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 2483.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 934.3 MB in the beginning and 974.7 MB in the end (delta: -40.3 MB). Peak memory consumption was 107.4 MB. Max. memory is 11.5 GB. * CodeCheck took 30965.68 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 269.0 MB). Free memory was 974.7 MB in the beginning and 916.0 MB in the end (delta: 58.6 MB). Peak memory consumption was 327.6 MB. Max. memory is 11.5 GB. * Witness Printer took 129.00 ms. Allocated memory is still 1.4 GB. Free memory was 916.0 MB in the beginning and 905.0 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...