./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4_false-unreach-call.2.ufo.BOUNDED-8.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_95ce19ff-375d-4648-9f7b-af1e8b7dbf88/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_95ce19ff-375d-4648-9f7b-af1e8b7dbf88/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_95ce19ff-375d-4648-9f7b-af1e8b7dbf88/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_95ce19ff-375d-4648-9f7b-af1e8b7dbf88/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4_false-unreach-call.2.ufo.BOUNDED-8.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_95ce19ff-375d-4648-9f7b-af1e8b7dbf88/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_95ce19ff-375d-4648-9f7b-af1e8b7dbf88/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 5ece07e091f918f26c76e2a65f38501df262220c ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-11-10 12:30:50,638 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:30:50,640 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:30:50,647 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:30:50,647 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:30:50,648 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:30:50,648 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:30:50,650 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:30:50,651 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:30:50,651 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:30:50,652 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:30:50,652 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:30:50,653 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:30:50,653 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:30:50,654 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:30:50,654 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:30:50,655 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:30:50,656 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:30:50,657 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:30:50,658 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:30:50,659 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:30:50,660 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:30:50,661 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:30:50,661 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:30:50,662 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:30:50,662 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:30:50,663 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:30:50,664 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:30:50,664 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:30:50,665 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:30:50,665 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:30:50,666 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:30:50,666 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:30:50,666 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:30:50,667 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:30:50,667 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:30:50,668 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_95ce19ff-375d-4648-9f7b-af1e8b7dbf88/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-10 12:30:50,678 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:30:50,679 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:30:50,679 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 12:30:50,679 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 12:30:50,680 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 12:30:50,680 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 12:30:50,680 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:30:50,680 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 12:30:50,681 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:30:50,681 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 12:30:50,681 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:30:50,681 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 12:30:50,681 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 12:30:50,681 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 12:30:50,681 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 12:30:50,681 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:30:50,682 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 12:30:50,682 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-10 12:30:50,682 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-10 12:30:50,682 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:30:50,682 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 12:30:50,682 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 12:30:50,682 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:30:50,683 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 12:30:50,683 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 12:30:50,683 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-10 12:30:50,683 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 12:30:50,683 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 12:30:50,683 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_95ce19ff-375d-4648-9f7b-af1e8b7dbf88/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 -> 5ece07e091f918f26c76e2a65f38501df262220c [2018-11-10 12:30:50,707 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:30:50,716 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:30:50,718 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:30:50,720 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:30:50,720 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:30:50,720 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_95ce19ff-375d-4648-9f7b-af1e8b7dbf88/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4_false-unreach-call.2.ufo.BOUNDED-8.pals_true-termination.c [2018-11-10 12:30:50,766 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_95ce19ff-375d-4648-9f7b-af1e8b7dbf88/bin-2019/ukojak/data/c6420b8b8/d1cc789bd9e2427c9184d3f9e5ef9a97/FLAG35d042c4a [2018-11-10 12:30:51,092 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:30:51,092 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_95ce19ff-375d-4648-9f7b-af1e8b7dbf88/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4_false-unreach-call.2.ufo.BOUNDED-8.pals_true-termination.c [2018-11-10 12:30:51,098 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_95ce19ff-375d-4648-9f7b-af1e8b7dbf88/bin-2019/ukojak/data/c6420b8b8/d1cc789bd9e2427c9184d3f9e5ef9a97/FLAG35d042c4a [2018-11-10 12:30:51,110 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_95ce19ff-375d-4648-9f7b-af1e8b7dbf88/bin-2019/ukojak/data/c6420b8b8/d1cc789bd9e2427c9184d3f9e5ef9a97 [2018-11-10 12:30:51,112 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:30:51,113 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 12:30:51,114 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:30:51,114 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:30:51,117 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:30:51,118 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:30:51" (1/1) ... [2018-11-10 12:30:51,120 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b11911a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:30:51, skipping insertion in model container [2018-11-10 12:30:51,120 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:30:51" (1/1) ... [2018-11-10 12:30:51,129 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:30:51,156 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:30:51,316 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:30:51,320 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:30:51,354 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:30:51,365 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:30:51,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:30:51 WrapperNode [2018-11-10 12:30:51,365 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:30:51,366 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 12:30:51,366 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 12:30:51,366 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 12:30:51,371 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:30:51" (1/1) ... [2018-11-10 12:30:51,376 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:30:51" (1/1) ... [2018-11-10 12:30:51,434 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 12:30:51,435 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:30:51,435 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:30:51,435 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:30:51,441 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:30:51" (1/1) ... [2018-11-10 12:30:51,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:30:51" (1/1) ... [2018-11-10 12:30:51,443 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:30:51" (1/1) ... [2018-11-10 12:30:51,443 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:30:51" (1/1) ... [2018-11-10 12:30:51,447 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:30:51" (1/1) ... [2018-11-10 12:30:51,453 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:30:51" (1/1) ... [2018-11-10 12:30:51,455 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:30:51" (1/1) ... [2018-11-10 12:30:51,458 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:30:51,458 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:30:51,458 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:30:51,458 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:30:51,459 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:30:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95ce19ff-375d-4648-9f7b-af1e8b7dbf88/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-10 12:30:51,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:30:51,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:30:52,559 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:30:52,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:30:52 BoogieIcfgContainer [2018-11-10 12:30:52,560 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:30:52,561 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-10 12:30:52,561 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-10 12:30:52,567 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-10 12:30:52,568 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:30:52" (1/1) ... [2018-11-10 12:30:52,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:30:52,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:30:52,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 9 states and 11 transitions. [2018-11-10 12:30:52,599 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2018-11-10 12:30:52,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-11-10 12:30:52,601 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:30:52,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:30:52,894 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-10 12:30:52,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:30:52,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 12 states and 15 transitions. [2018-11-10 12:30:52,950 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 15 transitions. [2018-11-10 12:30:52,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-10 12:30:52,950 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:30:53,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:30:53,489 WARN L179 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 87 [2018-11-10 12:30:53,733 WARN L179 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 83 [2018-11-10 12:30:53,736 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-10 12:30:53,931 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 85 [2018-11-10 12:30:54,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:30:54,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 18 states and 27 transitions. [2018-11-10 12:30:54,594 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 27 transitions. [2018-11-10 12:30:54,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-10 12:30:54,597 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:30:54,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:30:54,894 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:30:55,138 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 92 [2018-11-10 12:30:55,544 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 90 [2018-11-10 12:30:55,949 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 98 [2018-11-10 12:30:56,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:30:56,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 26 states and 47 transitions. [2018-11-10 12:30:56,673 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 47 transitions. [2018-11-10 12:30:56,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-10 12:30:56,673 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:30:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:30:58,489 WARN L179 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 93 [2018-11-10 12:31:02,280 WARN L179 SmtUtils]: Spent 3.38 s on a formula simplification. DAG size of input: 566 DAG size of output: 267 [2018-11-10 12:31:07,649 WARN L179 SmtUtils]: Spent 5.14 s on a formula simplification. DAG size of input: 529 DAG size of output: 285 [2018-11-10 12:31:13,956 WARN L179 SmtUtils]: Spent 6.02 s on a formula simplification. DAG size of input: 521 DAG size of output: 276 [2018-11-10 12:31:16,475 WARN L179 SmtUtils]: Spent 2.28 s on a formula simplification. DAG size of input: 441 DAG size of output: 232 [2018-11-10 12:31:16,493 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-10 12:31:16,875 WARN L179 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 107 [2018-11-10 12:31:18,009 WARN L179 SmtUtils]: Spent 947.00 ms on a formula simplification. DAG size of input: 270 DAG size of output: 236 [2018-11-10 12:31:18,924 WARN L179 SmtUtils]: Spent 782.00 ms on a formula simplification. DAG size of input: 242 DAG size of output: 224 [2018-11-10 12:31:20,523 WARN L179 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 255 DAG size of output: 246 [2018-11-10 12:31:21,446 WARN L179 SmtUtils]: Spent 818.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 234 [2018-11-10 12:31:21,909 WARN L179 SmtUtils]: Spent 349.00 ms on a formula simplification that was a NOOP. DAG size: 247 [2018-11-10 12:31:23,447 WARN L179 SmtUtils]: Spent 897.00 ms on a formula simplification. DAG size of input: 268 DAG size of output: 234 [2018-11-10 12:31:24,957 WARN L179 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 253 DAG size of output: 244 [2018-11-10 12:31:25,761 WARN L179 SmtUtils]: Spent 688.00 ms on a formula simplification. DAG size of input: 233 DAG size of output: 232 [2018-11-10 12:31:26,653 WARN L179 SmtUtils]: Spent 775.00 ms on a formula simplification. DAG size of input: 245 DAG size of output: 242 [2018-11-10 12:31:27,654 WARN L179 SmtUtils]: Spent 912.00 ms on a formula simplification. DAG size of input: 262 DAG size of output: 257 [2018-11-10 12:31:28,805 WARN L179 SmtUtils]: Spent 988.00 ms on a formula simplification. DAG size of input: 256 DAG size of output: 256 [2018-11-10 12:31:29,675 WARN L179 SmtUtils]: Spent 818.00 ms on a formula simplification. DAG size of input: 263 DAG size of output: 259 [2018-11-10 12:31:30,320 WARN L179 SmtUtils]: Spent 497.00 ms on a formula simplification that was a NOOP. DAG size: 257 [2018-11-10 12:31:34,754 WARN L179 SmtUtils]: Spent 4.28 s on a formula simplification. DAG size of input: 260 DAG size of output: 260 [2018-11-10 12:31:35,655 WARN L179 SmtUtils]: Spent 755.00 ms on a formula simplification. DAG size of input: 252 DAG size of output: 249 [2018-11-10 12:31:36,546 WARN L179 SmtUtils]: Spent 730.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 247 [2018-11-10 12:31:37,529 WARN L179 SmtUtils]: Spent 925.00 ms on a formula simplification. DAG size of input: 254 DAG size of output: 254 [2018-11-10 12:31:38,566 WARN L179 SmtUtils]: Spent 880.00 ms on a formula simplification. DAG size of input: 250 DAG size of output: 250 [2018-11-10 12:31:40,486 WARN L179 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 255 DAG size of output: 253 [2018-11-10 12:31:41,236 WARN L179 SmtUtils]: Spent 666.00 ms on a formula simplification. DAG size of input: 263 DAG size of output: 213 [2018-11-10 12:31:42,030 WARN L179 SmtUtils]: Spent 643.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 212 [2018-11-10 12:31:42,531 WARN L179 SmtUtils]: Spent 437.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2018-11-10 12:31:43,046 WARN L179 SmtUtils]: Spent 351.00 ms on a formula simplification that was a NOOP. DAG size: 214 [2018-11-10 12:31:43,661 WARN L179 SmtUtils]: Spent 445.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2018-11-10 12:31:44,210 WARN L179 SmtUtils]: Spent 426.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2018-11-10 12:31:44,818 WARN L179 SmtUtils]: Spent 431.00 ms on a formula simplification that was a NOOP. DAG size: 264 [2018-11-10 12:31:45,373 WARN L179 SmtUtils]: Spent 473.00 ms on a formula simplification that was a NOOP. DAG size: 278 [2018-11-10 12:31:46,019 WARN L179 SmtUtils]: Spent 468.00 ms on a formula simplification that was a NOOP. DAG size: 279 [2018-11-10 12:31:46,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:31:46,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 38 states and 78 transitions. [2018-11-10 12:31:46,158 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 78 transitions. [2018-11-10 12:31:46,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-10 12:31:46,158 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:31:46,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:31:47,149 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-10 12:31:48,291 WARN L179 SmtUtils]: Spent 936.00 ms on a formula simplification. DAG size of input: 263 DAG size of output: 263 [2018-11-10 12:31:49,437 WARN L179 SmtUtils]: Spent 971.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 262 [2018-11-10 12:31:49,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:31:49,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 40 states and 81 transitions. [2018-11-10 12:31:49,899 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 81 transitions. [2018-11-10 12:31:49,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 12:31:49,900 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:31:50,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:31:50,757 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-10 12:31:51,836 WARN L179 SmtUtils]: Spent 720.00 ms on a formula simplification. DAG size of input: 221 DAG size of output: 217 [2018-11-10 12:31:52,705 WARN L179 SmtUtils]: Spent 726.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 221 [2018-11-10 12:31:53,236 WARN L179 SmtUtils]: Spent 356.00 ms on a formula simplification that was a NOOP. DAG size: 218 [2018-11-10 12:31:53,789 WARN L179 SmtUtils]: Spent 358.00 ms on a formula simplification that was a NOOP. DAG size: 222 [2018-11-10 12:31:54,577 WARN L179 SmtUtils]: Spent 659.00 ms on a formula simplification. DAG size of input: 219 DAG size of output: 215 [2018-11-10 12:31:55,312 WARN L179 SmtUtils]: Spent 662.00 ms on a formula simplification. DAG size of input: 221 DAG size of output: 219 [2018-11-10 12:31:55,844 WARN L179 SmtUtils]: Spent 353.00 ms on a formula simplification that was a NOOP. DAG size: 216 [2018-11-10 12:31:56,383 WARN L179 SmtUtils]: Spent 355.00 ms on a formula simplification that was a NOOP. DAG size: 220 [2018-11-10 12:31:56,721 WARN L179 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 272 DAG size of output: 39 [2018-11-10 12:31:57,809 WARN L179 SmtUtils]: Spent 912.00 ms on a formula simplification. DAG size of input: 274 DAG size of output: 272 [2018-11-10 12:31:58,570 WARN L179 SmtUtils]: Spent 452.00 ms on a formula simplification that was a NOOP. DAG size: 272 [2018-11-10 12:31:58,928 WARN L179 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 267 DAG size of output: 36 [2018-11-10 12:31:59,572 WARN L179 SmtUtils]: Spent 454.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2018-11-10 12:32:00,330 WARN L179 SmtUtils]: Spent 446.00 ms on a formula simplification that was a NOOP. DAG size: 270 [2018-11-10 12:32:00,653 WARN L179 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 282 DAG size of output: 50 [2018-11-10 12:32:01,213 WARN L179 SmtUtils]: Spent 480.00 ms on a formula simplification that was a NOOP. DAG size: 284 [2018-11-10 12:32:02,115 WARN L179 SmtUtils]: Spent 512.00 ms on a formula simplification that was a NOOP. DAG size: 285 [2018-11-10 12:32:02,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:32:02,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 48 states and 105 transitions. [2018-11-10 12:32:02,243 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 105 transitions. [2018-11-10 12:32:02,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 12:32:02,244 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:32:02,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:32:09,456 WARN L179 SmtUtils]: Spent 1.70 s on a formula simplification. DAG size of input: 421 DAG size of output: 92 [2018-11-10 12:32:29,367 WARN L179 SmtUtils]: Spent 18.31 s on a formula simplification. DAG size of input: 1194 DAG size of output: 420 [2018-11-10 12:32:48,945 WARN L179 SmtUtils]: Spent 18.21 s on a formula simplification. DAG size of input: 1195 DAG size of output: 456 [2018-11-10 12:33:13,713 WARN L179 SmtUtils]: Spent 23.19 s on a formula simplification. DAG size of input: 1499 DAG size of output: 580 [2018-11-10 12:33:38,287 WARN L179 SmtUtils]: Spent 22.97 s on a formula simplification. DAG size of input: 1496 DAG size of output: 574 [2018-11-10 12:34:01,401 WARN L179 SmtUtils]: Spent 21.65 s on a formula simplification. DAG size of input: 1422 DAG size of output: 742 [2018-11-10 12:34:25,090 WARN L179 SmtUtils]: Spent 22.12 s on a formula simplification. DAG size of input: 1418 DAG size of output: 717 [2018-11-10 12:34:45,686 WARN L179 SmtUtils]: Spent 19.15 s on a formula simplification. DAG size of input: 1347 DAG size of output: 667 [2018-11-10 12:35:00,484 WARN L179 SmtUtils]: Spent 13.60 s on a formula simplification. DAG size of input: 1118 DAG size of output: 471 [2018-11-10 12:35:15,199 WARN L179 SmtUtils]: Spent 13.43 s on a formula simplification. DAG size of input: 1114 DAG size of output: 467 [2018-11-10 12:35:15,282 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:35:15,474 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 86 [2018-11-10 12:35:15,913 WARN L179 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 89 [2018-11-10 12:35:20,848 WARN L179 SmtUtils]: Spent 4.42 s on a formula simplification. DAG size of input: 474 DAG size of output: 336 [2018-11-10 12:35:23,222 WARN L179 SmtUtils]: Spent 1.86 s on a formula simplification. DAG size of input: 359 DAG size of output: 349 [2018-11-10 12:35:26,573 WARN L179 SmtUtils]: Spent 3.27 s on a formula simplification. DAG size of input: 465 DAG size of output: 310 [2018-11-10 12:35:28,779 WARN L179 SmtUtils]: Spent 1.90 s on a formula simplification. DAG size of input: 333 DAG size of output: 294 [2018-11-10 12:35:29,654 WARN L179 SmtUtils]: Spent 591.00 ms on a formula simplification that was a NOOP. DAG size: 303 [2018-11-10 12:35:34,292 WARN L179 SmtUtils]: Spent 4.35 s on a formula simplification. DAG size of input: 508 DAG size of output: 268 [2018-11-10 12:35:38,301 WARN L179 SmtUtils]: Spent 3.51 s on a formula simplification. DAG size of input: 399 DAG size of output: 385 [2018-11-10 12:35:41,813 WARN L179 SmtUtils]: Spent 3.37 s on a formula simplification. DAG size of input: 490 DAG size of output: 314 [2018-11-10 12:35:42,986 WARN L179 SmtUtils]: Spent 896.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 255 [2018-11-10 12:35:44,110 WARN L179 SmtUtils]: Spent 829.00 ms on a formula simplification that was a NOOP. DAG size: 302 [2018-11-10 12:35:49,942 WARN L179 SmtUtils]: Spent 5.61 s on a formula simplification. DAG size of input: 595 DAG size of output: 528 [2018-11-10 12:35:55,007 WARN L179 SmtUtils]: Spent 4.49 s on a formula simplification. DAG size of input: 475 DAG size of output: 461 [2018-11-10 12:35:59,631 WARN L179 SmtUtils]: Spent 4.49 s on a formula simplification. DAG size of input: 577 DAG size of output: 527 [2018-11-10 12:36:03,924 WARN L179 SmtUtils]: Spent 3.77 s on a formula simplification. DAG size of input: 518 DAG size of output: 514 [2018-11-10 12:36:06,343 WARN L179 SmtUtils]: Spent 1.90 s on a formula simplification that was a NOOP. DAG size: 520 [2018-11-10 12:36:12,810 WARN L179 SmtUtils]: Spent 6.07 s on a formula simplification. DAG size of input: 584 DAG size of output: 519 [2018-11-10 12:36:17,811 WARN L179 SmtUtils]: Spent 4.37 s on a formula simplification. DAG size of input: 468 DAG size of output: 461 [2018-11-10 12:36:22,160 WARN L179 SmtUtils]: Spent 4.13 s on a formula simplification. DAG size of input: 578 DAG size of output: 543 [2018-11-10 12:36:26,642 WARN L179 SmtUtils]: Spent 3.84 s on a formula simplification. DAG size of input: 511 DAG size of output: 510 [2018-11-10 12:36:30,861 WARN L179 SmtUtils]: Spent 3.62 s on a formula simplification. DAG size of input: 535 DAG size of output: 534 [2018-11-10 12:36:43,456 WARN L179 SmtUtils]: Spent 12.18 s on a formula simplification. DAG size of input: 734 DAG size of output: 697 [2018-11-10 12:36:49,185 WARN L179 SmtUtils]: Spent 4.97 s on a formula simplification. DAG size of input: 630 DAG size of output: 601 [2018-11-10 12:36:54,564 WARN L179 SmtUtils]: Spent 5.18 s on a formula simplification. DAG size of input: 703 DAG size of output: 695 [2018-11-10 12:37:00,665 WARN L179 SmtUtils]: Spent 5.36 s on a formula simplification. DAG size of input: 690 DAG size of output: 690 [2018-11-10 12:37:04,113 WARN L179 SmtUtils]: Spent 2.69 s on a formula simplification that was a NOOP. DAG size: 696 [2018-11-10 12:37:14,616 WARN L179 SmtUtils]: Spent 8.98 s on a formula simplification. DAG size of input: 708 DAG size of output: 668 [2018-11-10 12:37:19,975 WARN L179 SmtUtils]: Spent 4.60 s on a formula simplification. DAG size of input: 603 DAG size of output: 597 [2018-11-10 12:37:28,172 WARN L179 SmtUtils]: Spent 7.94 s on a formula simplification. DAG size of input: 704 DAG size of output: 680 [2018-11-10 12:37:36,618 WARN L179 SmtUtils]: Spent 7.69 s on a formula simplification. DAG size of input: 663 DAG size of output: 648 [2018-11-10 12:37:46,186 WARN L179 SmtUtils]: Spent 8.79 s on a formula simplification. DAG size of input: 679 DAG size of output: 676 [2018-11-10 12:37:52,724 WARN L179 SmtUtils]: Spent 6.19 s on a formula simplification. DAG size of input: 680 DAG size of output: 535 [2018-11-10 12:37:59,068 WARN L179 SmtUtils]: Spent 5.65 s on a formula simplification. DAG size of input: 558 DAG size of output: 529 [2018-11-10 12:38:07,951 WARN L179 SmtUtils]: Spent 8.61 s on a formula simplification. DAG size of input: 645 DAG size of output: 643 [2018-11-10 12:38:13,897 WARN L179 SmtUtils]: Spent 5.34 s on a formula simplification. DAG size of input: 527 DAG size of output: 525 [2018-11-10 12:38:19,306 WARN L179 SmtUtils]: Spent 4.63 s on a formula simplification. DAG size of input: 644 DAG size of output: 644 [2018-11-10 12:38:26,136 WARN L179 SmtUtils]: Spent 6.16 s on a formula simplification. DAG size of input: 676 DAG size of output: 533 [2018-11-10 12:38:33,999 WARN L179 SmtUtils]: Spent 7.62 s on a formula simplification. DAG size of input: 641 DAG size of output: 637 [2018-11-10 12:38:39,965 WARN L179 SmtUtils]: Spent 5.35 s on a formula simplification. DAG size of input: 525 DAG size of output: 523 [2018-11-10 12:38:45,320 WARN L179 SmtUtils]: Spent 4.60 s on a formula simplification. DAG size of input: 638 DAG size of output: 638 [2018-11-10 12:38:53,744 WARN L179 SmtUtils]: Spent 7.74 s on a formula simplification. DAG size of input: 648 DAG size of output: 644 [2018-11-10 12:39:09,019 WARN L179 SmtUtils]: Spent 14.52 s on a formula simplification. DAG size of input: 645 DAG size of output: 645 [2018-11-10 12:39:12,322 WARN L179 SmtUtils]: Spent 2.42 s on a formula simplification. DAG size of input: 547 DAG size of output: 382 [2018-11-10 12:39:14,985 WARN L179 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 395 DAG size of output: 384 [2018-11-10 12:39:18,527 WARN L179 SmtUtils]: Spent 3.31 s on a formula simplification. DAG size of input: 537 DAG size of output: 535 [2018-11-10 12:39:20,104 WARN L179 SmtUtils]: Spent 1.01 s on a formula simplification that was a NOOP. DAG size: 381 [2018-11-10 12:39:22,382 WARN L179 SmtUtils]: Spent 1.62 s on a formula simplification that was a NOOP. DAG size: 535 [2018-11-10 12:39:26,145 WARN L179 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 391 DAG size of output: 380 [2018-11-10 12:39:28,026 WARN L179 SmtUtils]: Spent 1.61 s on a formula simplification that was a NOOP. DAG size: 532 [2018-11-10 12:39:30,362 WARN L179 SmtUtils]: Spent 1.65 s on a formula simplification that was a NOOP. DAG size: 533 [2018-11-10 12:39:32,304 WARN L179 SmtUtils]: Spent 1.67 s on a formula simplification that was a NOOP. DAG size: 547 [2018-11-10 12:39:34,655 WARN L179 SmtUtils]: Spent 1.67 s on a formula simplification that was a NOOP. DAG size: 548 [2018-11-10 12:39:35,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:39:35,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 70 states and 165 transitions. [2018-11-10 12:39:35,068 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 165 transitions. [2018-11-10 12:39:35,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 12:39:35,069 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:39:35,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:39:40,343 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:39:46,809 WARN L179 SmtUtils]: Spent 5.94 s on a formula simplification. DAG size of input: 574 DAG size of output: 541 [2018-11-10 12:39:52,745 WARN L179 SmtUtils]: Spent 5.75 s on a formula simplification. DAG size of input: 538 DAG size of output: 536 [2018-11-10 12:39:59,248 WARN L179 SmtUtils]: Spent 5.80 s on a formula simplification. DAG size of input: 533 DAG size of output: 531 [2018-11-10 12:40:03,691 WARN L179 SmtUtils]: Spent 3.74 s on a formula simplification. DAG size of input: 537 DAG size of output: 537 [2018-11-10 12:40:10,114 WARN L179 SmtUtils]: Spent 5.87 s on a formula simplification. DAG size of input: 572 DAG size of output: 539 [2018-11-10 12:40:16,295 WARN L179 SmtUtils]: Spent 5.97 s on a formula simplification. DAG size of input: 536 DAG size of output: 534 [2018-11-10 12:40:23,450 WARN L179 SmtUtils]: Spent 6.39 s on a formula simplification. DAG size of input: 531 DAG size of output: 529 [2018-11-10 12:40:28,712 WARN L179 SmtUtils]: Spent 4.45 s on a formula simplification. DAG size of input: 535 DAG size of output: 535 [2018-11-10 12:40:28,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:40:28,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 72 states and 170 transitions. [2018-11-10 12:40:28,853 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 170 transitions. [2018-11-10 12:40:28,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 12:40:28,854 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:40:29,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:40:34,856 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:40:42,288 WARN L179 SmtUtils]: Spent 6.52 s on a formula simplification. DAG size of input: 546 DAG size of output: 544 [2018-11-10 12:40:47,163 WARN L179 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 545 DAG size of output: 545 [2018-11-10 12:40:48,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:40:48,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 74 states and 173 transitions. [2018-11-10 12:40:48,620 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 173 transitions. [2018-11-10 12:40:48,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 12:40:48,621 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:40:48,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:40:51,089 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 18 proven. 52 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-10 12:40:54,530 WARN L179 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 389 DAG size of output: 383 [2018-11-10 12:40:57,255 WARN L179 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 390 DAG size of output: 386 [2018-11-10 12:40:59,121 WARN L179 SmtUtils]: Spent 1.15 s on a formula simplification that was a NOOP. DAG size: 383 [2018-11-10 12:41:00,909 WARN L179 SmtUtils]: Spent 1.07 s on a formula simplification that was a NOOP. DAG size: 387 [2018-11-10 12:41:03,789 WARN L179 SmtUtils]: Spent 2.51 s on a formula simplification. DAG size of input: 395 DAG size of output: 382 [2018-11-10 12:41:06,740 WARN L179 SmtUtils]: Spent 2.33 s on a formula simplification. DAG size of input: 397 DAG size of output: 385 [2018-11-10 12:41:08,688 WARN L179 SmtUtils]: Spent 1.14 s on a formula simplification that was a NOOP. DAG size: 382 [2018-11-10 12:41:10,522 WARN L179 SmtUtils]: Spent 1.07 s on a formula simplification that was a NOOP. DAG size: 385 [2018-11-10 12:41:11,628 WARN L179 SmtUtils]: Spent 752.00 ms on a formula simplification. DAG size of input: 537 DAG size of output: 38 [2018-11-10 12:41:16,133 WARN L179 SmtUtils]: Spent 3.76 s on a formula simplification. DAG size of input: 539 DAG size of output: 533 [2018-11-10 12:41:19,590 WARN L179 SmtUtils]: Spent 1.80 s on a formula simplification that was a NOOP. DAG size: 533 [2018-11-10 12:41:20,640 WARN L179 SmtUtils]: Spent 658.00 ms on a formula simplification. DAG size of input: 532 DAG size of output: 35 [2018-11-10 12:41:25,200 WARN L179 SmtUtils]: Spent 3.77 s on a formula simplification. DAG size of input: 534 DAG size of output: 530 [2018-11-10 12:41:28,443 WARN L179 SmtUtils]: Spent 1.95 s on a formula simplification that was a NOOP. DAG size: 531 [2018-11-10 12:41:29,492 WARN L179 SmtUtils]: Spent 754.00 ms on a formula simplification. DAG size of input: 547 DAG size of output: 49 [2018-11-10 12:41:33,854 WARN L179 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 549 DAG size of output: 545 [2018-11-10 12:41:37,187 WARN L179 SmtUtils]: Spent 1.97 s on a formula simplification that was a NOOP. DAG size: 546 [2018-11-10 12:41:37,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:41:37,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 81 states and 193 transitions. [2018-11-10 12:41:37,627 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 193 transitions. [2018-11-10 12:41:37,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-10 12:41:37,629 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:41:39,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:41:40,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:41:41,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:41:41,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:41:41,787 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 11 iterations. [2018-11-10 12:41:41,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 10.11 12:41:41 ImpRootNode [2018-11-10 12:41:41,863 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-10 12:41:41,864 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:41:41,864 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:41:41,864 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:41:41,865 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:30:52" (3/4) ... [2018-11-10 12:41:41,867 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 12:41:41,977 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_95ce19ff-375d-4648-9f7b-af1e8b7dbf88/bin-2019/ukojak/witness.graphml [2018-11-10 12:41:41,977 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:41:41,977 INFO L168 Benchmark]: Toolchain (without parser) took 650864.60 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 345.0 MB). Free memory was 962.9 MB in the beginning and 1.0 GB in the end (delta: -43.5 MB). Peak memory consumption was 301.5 MB. Max. memory is 11.5 GB. [2018-11-10 12:41:41,978 INFO L168 Benchmark]: CDTParser took 0.15 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-10 12:41:41,978 INFO L168 Benchmark]: CACSL2BoogieTranslator took 251.17 ms. Allocated memory is still 1.0 GB. Free memory was 962.9 MB in the beginning and 945.7 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2018-11-10 12:41:41,978 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 945.7 MB in the beginning and 1.2 GB in the end (delta: -211.0 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:41:41,978 INFO L168 Benchmark]: Boogie Preprocessor took 23.50 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:41:41,979 INFO L168 Benchmark]: RCFGBuilder took 1101.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 933.2 MB in the end (delta: 223.6 MB). Peak memory consumption was 223.6 MB. Max. memory is 11.5 GB. [2018-11-10 12:41:41,979 INFO L168 Benchmark]: CodeCheck took 649302.69 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 179.3 MB). Free memory was 933.2 MB in the beginning and 1.0 GB in the end (delta: -93.1 MB). Peak memory consumption was 86.2 MB. Max. memory is 11.5 GB. [2018-11-10 12:41:41,979 INFO L168 Benchmark]: Witness Printer took 113.22 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. [2018-11-10 12:41:41,980 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, 96 locations, 1 error locations. UNSAFE Result, 649.2s OverallTime, 11 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6864 SDtfs, 13310 SDslu, 21586 SDs, 0 SdLazy, 33434 SolverSat, 7426 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 30.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2296 GetRequests, 1977 SyntacticMatches, 97 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26410 ImplicationChecksByTransitivity, 616.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 226.6s InterpolantComputationTime, 219 NumberOfCodeBlocks, 219 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 176 ConstructedInterpolants, 0 QuantifiedInterpolants, 15659720 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 1 PerfectInterpolantSequences, 37/334 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: 432]: 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 ; [L97] char p4_old ; [L98] char p4_new ; [L99] char id4 ; [L100] char st4 ; [L102] _Bool mode4 ; [L103] _Bool alive4 ; [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 ; [L96] port_t p4 ; [L101] msg_t send4 ; [L238] void (*nodes[4])(void) = { & node1, & node2, & node3, & node4}; [L366] int c1 ; [L367] int i2 ; [L370] c1 = 0 [L371] r1 = __VERIFIER_nondet_char() [L372] id1 = __VERIFIER_nondet_char() [L373] st1 = __VERIFIER_nondet_char() [L374] send1 = __VERIFIER_nondet_char() [L375] mode1 = __VERIFIER_nondet_bool() [L376] alive1 = __VERIFIER_nondet_bool() [L377] id2 = __VERIFIER_nondet_char() [L378] st2 = __VERIFIER_nondet_char() [L379] send2 = __VERIFIER_nondet_char() [L380] mode2 = __VERIFIER_nondet_bool() [L381] alive2 = __VERIFIER_nondet_bool() [L382] id3 = __VERIFIER_nondet_char() [L383] st3 = __VERIFIER_nondet_char() [L384] send3 = __VERIFIER_nondet_char() [L385] mode3 = __VERIFIER_nondet_bool() [L386] alive3 = __VERIFIER_nondet_bool() [L387] id4 = __VERIFIER_nondet_char() [L388] st4 = __VERIFIER_nondet_char() [L389] send4 = __VERIFIER_nondet_char() [L390] mode4 = __VERIFIER_nondet_bool() [L391] alive4 = __VERIFIER_nondet_bool() [L392] CALL, EXPR init() [L241] int tmp ; [L244] COND TRUE (int )r1 == 0 [L245] COND TRUE (((int )alive1 + (int )alive2) + (int )alive3) + (int )alive4 >= 1 [L246] COND TRUE (int )id1 >= 0 [L247] COND TRUE (int )st1 == 0 [L248] COND TRUE (int )send1 == (int )id1 [L249] COND TRUE (int )mode1 == 0 [L250] COND TRUE (int )id2 >= 0 [L251] COND TRUE (int )st2 == 0 [L252] COND TRUE (int )send2 == (int )id2 [L253] COND TRUE (int )mode2 == 0 [L254] COND TRUE (int )id3 >= 0 [L255] COND TRUE (int )st3 == 0 [L256] COND TRUE (int )send3 == (int )id3 [L257] COND TRUE (int )mode3 == 0 [L258] COND TRUE (int )id4 >= 0 [L259] COND TRUE (int )st4 == 0 [L260] COND TRUE (int )send4 == (int )id4 [L261] COND TRUE (int )mode4 == 0 [L262] COND TRUE (int )id1 != (int )id2 [L263] COND TRUE (int )id1 != (int )id3 [L264] COND TRUE (int )id1 != (int )id4 [L265] COND TRUE (int )id2 != (int )id3 [L266] COND TRUE (int )id2 != (int )id4 [L267] COND TRUE (int )id3 != (int )id4 [L268] tmp = 1 [L341] RET return (tmp); [L392] EXPR init() [L392] i2 = init() [L394] p1_old = nomsg [L395] p1_new = nomsg [L396] p2_old = nomsg [L397] p2_new = nomsg [L398] p3_old = nomsg [L399] p3_new = nomsg [L400] p4_old = nomsg [L401] p4_new = nomsg [L402] i2 = 0 VAL [alive1=0, alive2=1, alive3=1, alive4=0, id1=127, id2=126, id3=2, id4=0, mode1=0, mode2=0, mode3=0, mode4=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, p4=0, p4_new=-1, p4_old=-1, r1=0, send1=127, send2=126, send3=2, send4=0, st1=0, st2=0, st3=0, st4=0] [L403] COND TRUE i2 < 8 [L405] CALL node1() [L106] msg_t m1 ; [L109] m1 = nomsg [L110] COND FALSE !(\read(mode1)) [L128] COND FALSE !(\read(alive1)) [L131] RET mode1 = (_Bool)1 [L405] node1() [L406] CALL node2() [L138] msg_t m2 ; [L141] m2 = nomsg [L142] COND FALSE !(\read(mode2)) [L159] COND TRUE \read(alive2) [L160] COND TRUE, EXPR send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L160] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L165] RET mode2 = (_Bool)1 [L406] node2() [L407] CALL node3() [L172] msg_t m3 ; [L175] m3 = nomsg [L176] COND FALSE !(\read(mode3)) [L193] COND TRUE \read(alive3) [L194] COND TRUE, EXPR send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L194] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L199] RET mode3 = (_Bool)1 [L407] node3() [L408] CALL node4() [L206] msg_t m4 ; [L209] m4 = nomsg [L210] COND FALSE !(\read(mode4)) [L227] COND FALSE !(\read(alive4)) [L230] COND FALSE !((int )send4 != (int )id4) [L233] RET mode4 = (_Bool)1 [L408] node4() [L409] p1_old = p1_new [L410] p1_new = nomsg [L411] p2_old = p2_new [L412] p2_new = nomsg [L413] p3_old = p3_new [L414] p3_new = nomsg [L415] p4_old = p4_new [L416] p4_new = nomsg [L417] CALL, EXPR check() [L346] int tmp ; [L349] COND TRUE (((int )st1 + (int )st2) + (int )st3) + (int )st4 <= 1 [L350] COND TRUE (int )r1 < 4 [L351] tmp = 1 [L361] RET return (tmp); [L417] EXPR check() [L417] c1 = check() [L418] CALL assert(c1) [L430] COND FALSE, RET !(! arg) VAL [alive1=0, alive2=1, alive3=1, alive4=0, id1=127, id2=126, id3=2, id4=0, mode1=1, mode2=1, mode3=1, mode4=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=2, p4=0, p4_new=-1, p4_old=-1, r1=0, send1=127, send2=126, send3=2, send4=0, st1=0, st2=0, st3=0, st4=0] [L418] assert(c1) [L419] i2 ++ VAL [alive1=0, alive2=1, alive3=1, alive4=0, id1=127, id2=126, id3=2, id4=0, mode1=1, mode2=1, mode3=1, mode4=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=2, p4=0, p4_new=-1, p4_old=-1, r1=0, send1=127, send2=126, send3=2, send4=0, st1=0, st2=0, st3=0, st4=0] [L403] COND TRUE i2 < 8 [L405] CALL node1() [L106] msg_t m1 ; [L109] m1 = nomsg [L110] COND TRUE \read(mode1) [L111] r1 = (char )((int )r1 + 1) [L112] m1 = p4_old [L113] p4_old = nomsg [L114] COND FALSE !((int )m1 != (int )nomsg) [L126] RET mode1 = (_Bool)0 [L405] node1() [L406] CALL node2() [L138] msg_t m2 ; [L141] m2 = nomsg [L142] COND TRUE \read(mode2) [L143] m2 = p1_old [L144] p1_old = nomsg [L145] COND FALSE !((int )m2 != (int )nomsg) [L157] RET mode2 = (_Bool)0 [L406] node2() [L407] CALL node3() [L172] msg_t m3 ; [L175] m3 = nomsg [L176] COND TRUE \read(mode3) [L177] m3 = p2_old [L178] p2_old = nomsg [L179] COND TRUE (int )m3 != (int )nomsg [L180] COND TRUE \read(alive3) [L181] COND TRUE (int )m3 > (int )id3 [L182] send3 = m3 [L191] RET mode3 = (_Bool)0 [L407] node3() [L408] CALL node4() [L206] msg_t m4 ; [L209] m4 = nomsg [L210] COND TRUE \read(mode4) [L211] m4 = p3_old [L212] p3_old = nomsg [L213] COND TRUE (int )m4 != (int )nomsg [L214] COND FALSE !(\read(alive4)) [L222] send4 = m4 [L225] RET mode4 = (_Bool)0 [L408] node4() [L409] p1_old = p1_new [L410] p1_new = nomsg [L411] p2_old = p2_new [L412] p2_new = nomsg [L413] p3_old = p3_new [L414] p3_new = nomsg [L415] p4_old = p4_new [L416] p4_new = nomsg [L417] CALL, EXPR check() [L346] int tmp ; [L349] COND TRUE (((int )st1 + (int )st2) + (int )st3) + (int )st4 <= 1 [L350] COND TRUE (int )r1 < 4 [L351] tmp = 1 [L361] RET return (tmp); [L417] EXPR check() [L417] c1 = check() [L418] CALL assert(c1) [L430] COND FALSE, RET !(! arg) VAL [alive1=0, alive2=1, alive3=1, alive4=0, id1=127, id2=126, id3=2, id4=0, mode1=0, mode2=0, mode3=0, mode4=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, p4=0, p4_new=-1, p4_old=-1, r1=1, send1=127, send2=126, send3=126, send4=2, st1=0, st2=0, st3=0, st4=0] [L418] assert(c1) [L419] i2 ++ VAL [alive1=0, alive2=1, alive3=1, alive4=0, id1=127, id2=126, id3=2, id4=0, mode1=0, mode2=0, mode3=0, mode4=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, p4=0, p4_new=-1, p4_old=-1, r1=1, send1=127, send2=126, send3=126, send4=2, st1=0, st2=0, st3=0, st4=0] [L403] COND TRUE i2 < 8 [L405] CALL node1() [L106] msg_t m1 ; [L109] m1 = nomsg [L110] COND FALSE !(\read(mode1)) [L128] COND FALSE !(\read(alive1)) [L131] RET mode1 = (_Bool)1 [L405] node1() [L406] CALL node2() [L138] msg_t m2 ; [L141] m2 = nomsg [L142] COND FALSE !(\read(mode2)) [L159] COND TRUE \read(alive2) [L160] COND TRUE, EXPR send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L160] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L165] RET mode2 = (_Bool)1 [L406] node2() [L407] CALL node3() [L172] msg_t m3 ; [L175] m3 = nomsg [L176] COND FALSE !(\read(mode3)) [L193] COND TRUE \read(alive3) [L194] COND TRUE, EXPR send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L194] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L199] RET mode3 = (_Bool)1 [L407] node3() [L408] CALL node4() [L206] msg_t m4 ; [L209] m4 = nomsg [L210] COND FALSE !(\read(mode4)) [L227] COND FALSE !(\read(alive4)) [L230] COND TRUE (int )send4 != (int )id4 [L231] COND TRUE, EXPR send4 != nomsg && p4_new == nomsg ? send4 : p4_new [L231] p4_new = send4 != nomsg && p4_new == nomsg ? send4 : p4_new [L233] RET mode4 = (_Bool)1 [L408] node4() [L409] p1_old = p1_new [L410] p1_new = nomsg [L411] p2_old = p2_new [L412] p2_new = nomsg [L413] p3_old = p3_new [L414] p3_new = nomsg [L415] p4_old = p4_new [L416] p4_new = nomsg [L417] CALL, EXPR check() [L346] int tmp ; [L349] COND TRUE (((int )st1 + (int )st2) + (int )st3) + (int )st4 <= 1 [L350] COND TRUE (int )r1 < 4 [L351] tmp = 1 [L361] RET return (tmp); [L417] EXPR check() [L417] c1 = check() [L418] CALL assert(c1) [L430] COND FALSE, RET !(! arg) VAL [alive1=0, alive2=1, alive3=1, alive4=0, id1=127, id2=126, id3=2, id4=0, mode1=1, mode2=1, mode3=1, mode4=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=126, p4=0, p4_new=-1, p4_old=2, r1=1, send1=127, send2=126, send3=126, send4=2, st1=0, st2=0, st3=0, st4=0] [L418] assert(c1) [L419] i2 ++ VAL [alive1=0, alive2=1, alive3=1, alive4=0, id1=127, id2=126, id3=2, id4=0, mode1=1, mode2=1, mode3=1, mode4=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=126, p4=0, p4_new=-1, p4_old=2, r1=1, send1=127, send2=126, send3=126, send4=2, st1=0, st2=0, st3=0, st4=0] [L403] COND TRUE i2 < 8 [L405] CALL node1() [L106] msg_t m1 ; [L109] m1 = nomsg [L110] COND TRUE \read(mode1) [L111] r1 = (char )((int )r1 + 1) [L112] m1 = p4_old [L113] p4_old = nomsg [L114] COND TRUE (int )m1 != (int )nomsg [L115] COND FALSE !(\read(alive1)) [L123] send1 = m1 [L126] RET mode1 = (_Bool)0 [L405] node1() [L406] CALL node2() [L138] msg_t m2 ; [L141] m2 = nomsg [L142] COND TRUE \read(mode2) [L143] m2 = p1_old [L144] p1_old = nomsg [L145] COND FALSE !((int )m2 != (int )nomsg) [L157] RET mode2 = (_Bool)0 [L406] node2() [L407] CALL node3() [L172] msg_t m3 ; [L175] m3 = nomsg [L176] COND TRUE \read(mode3) [L177] m3 = p2_old [L178] p2_old = nomsg [L179] COND TRUE (int )m3 != (int )nomsg [L180] COND TRUE \read(alive3) [L181] COND TRUE (int )m3 > (int )id3 [L182] send3 = m3 [L191] RET mode3 = (_Bool)0 [L407] node3() [L408] CALL node4() [L206] msg_t m4 ; [L209] m4 = nomsg [L210] COND TRUE \read(mode4) [L211] m4 = p3_old [L212] p3_old = nomsg [L213] COND TRUE (int )m4 != (int )nomsg [L214] COND FALSE !(\read(alive4)) [L222] send4 = m4 [L225] RET mode4 = (_Bool)0 [L408] node4() [L409] p1_old = p1_new [L410] p1_new = nomsg [L411] p2_old = p2_new [L412] p2_new = nomsg [L413] p3_old = p3_new [L414] p3_new = nomsg [L415] p4_old = p4_new [L416] p4_new = nomsg [L417] CALL, EXPR check() [L346] int tmp ; [L349] COND TRUE (((int )st1 + (int )st2) + (int )st3) + (int )st4 <= 1 [L350] COND TRUE (int )r1 < 4 [L351] tmp = 1 [L361] RET return (tmp); [L417] EXPR check() [L417] c1 = check() [L418] CALL assert(c1) [L430] COND FALSE, RET !(! arg) VAL [alive1=0, alive2=1, alive3=1, alive4=0, id1=127, id2=126, id3=2, id4=0, mode1=0, mode2=0, mode3=0, mode4=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, p4=0, p4_new=-1, p4_old=-1, r1=2, send1=2, send2=126, send3=126, send4=126, st1=0, st2=0, st3=0, st4=0] [L418] assert(c1) [L419] i2 ++ VAL [alive1=0, alive2=1, alive3=1, alive4=0, id1=127, id2=126, id3=2, id4=0, mode1=0, mode2=0, mode3=0, mode4=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, p4=0, p4_new=-1, p4_old=-1, r1=2, send1=2, send2=126, send3=126, send4=126, st1=0, st2=0, st3=0, st4=0] [L403] COND TRUE i2 < 8 [L405] CALL node1() [L106] msg_t m1 ; [L109] m1 = nomsg [L110] COND FALSE !(\read(mode1)) [L128] COND FALSE !(\read(alive1)) [L131] RET mode1 = (_Bool)1 [L405] node1() [L406] CALL node2() [L138] msg_t m2 ; [L141] m2 = nomsg [L142] COND FALSE !(\read(mode2)) [L159] COND TRUE \read(alive2) [L160] COND TRUE, EXPR send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L160] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L165] RET mode2 = (_Bool)1 [L406] node2() [L407] CALL node3() [L172] msg_t m3 ; [L175] m3 = nomsg [L176] COND FALSE !(\read(mode3)) [L193] COND TRUE \read(alive3) [L194] COND TRUE, EXPR send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L194] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L199] RET mode3 = (_Bool)1 [L407] node3() [L408] CALL node4() [L206] msg_t m4 ; [L209] m4 = nomsg [L210] COND FALSE !(\read(mode4)) [L227] COND FALSE !(\read(alive4)) [L230] COND TRUE (int )send4 != (int )id4 [L231] COND TRUE, EXPR send4 != nomsg && p4_new == nomsg ? send4 : p4_new [L231] p4_new = send4 != nomsg && p4_new == nomsg ? send4 : p4_new [L233] RET mode4 = (_Bool)1 [L408] node4() [L409] p1_old = p1_new [L410] p1_new = nomsg [L411] p2_old = p2_new [L412] p2_new = nomsg [L413] p3_old = p3_new [L414] p3_new = nomsg [L415] p4_old = p4_new [L416] p4_new = nomsg [L417] CALL, EXPR check() [L346] int tmp ; [L349] COND TRUE (((int )st1 + (int )st2) + (int )st3) + (int )st4 <= 1 [L350] COND TRUE (int )r1 < 4 [L351] tmp = 1 [L361] RET return (tmp); [L417] EXPR check() [L417] c1 = check() [L418] CALL assert(c1) [L430] COND FALSE, RET !(! arg) VAL [alive1=0, alive2=1, alive3=1, alive4=0, id1=127, id2=126, id3=2, id4=0, mode1=1, mode2=1, mode3=1, mode4=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=126, p4=0, p4_new=-1, p4_old=126, r1=2, send1=2, send2=126, send3=126, send4=126, st1=0, st2=0, st3=0, st4=0] [L418] assert(c1) [L419] i2 ++ VAL [alive1=0, alive2=1, alive3=1, alive4=0, id1=127, id2=126, id3=2, id4=0, mode1=1, mode2=1, mode3=1, mode4=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=126, p4=0, p4_new=-1, p4_old=126, r1=2, send1=2, send2=126, send3=126, send4=126, st1=0, st2=0, st3=0, st4=0] [L403] COND TRUE i2 < 8 [L405] CALL node1() [L106] msg_t m1 ; [L109] m1 = nomsg [L110] COND TRUE \read(mode1) [L111] r1 = (char )((int )r1 + 1) [L112] m1 = p4_old [L113] p4_old = nomsg [L114] COND TRUE (int )m1 != (int )nomsg [L115] COND FALSE !(\read(alive1)) [L123] send1 = m1 [L126] RET mode1 = (_Bool)0 [L405] node1() [L406] CALL node2() [L138] msg_t m2 ; [L141] m2 = nomsg [L142] COND TRUE \read(mode2) [L143] m2 = p1_old [L144] p1_old = nomsg [L145] COND FALSE !((int )m2 != (int )nomsg) [L157] RET mode2 = (_Bool)0 [L406] node2() [L407] CALL node3() [L172] msg_t m3 ; [L175] m3 = nomsg [L176] COND TRUE \read(mode3) [L177] m3 = p2_old [L178] p2_old = nomsg [L179] COND TRUE (int )m3 != (int )nomsg [L180] COND TRUE \read(alive3) [L181] COND TRUE (int )m3 > (int )id3 [L182] send3 = m3 [L191] RET mode3 = (_Bool)0 [L407] node3() [L408] CALL node4() [L206] msg_t m4 ; [L209] m4 = nomsg [L210] COND TRUE \read(mode4) [L211] m4 = p3_old [L212] p3_old = nomsg [L213] COND TRUE (int )m4 != (int )nomsg [L214] COND FALSE !(\read(alive4)) [L222] send4 = m4 [L225] RET mode4 = (_Bool)0 [L408] node4() [L409] p1_old = p1_new [L410] p1_new = nomsg [L411] p2_old = p2_new [L412] p2_new = nomsg [L413] p3_old = p3_new [L414] p3_new = nomsg [L415] p4_old = p4_new [L416] p4_new = nomsg [L417] CALL, EXPR check() [L346] int tmp ; [L349] COND TRUE (((int )st1 + (int )st2) + (int )st3) + (int )st4 <= 1 [L350] COND TRUE (int )r1 < 4 [L351] tmp = 1 [L361] RET return (tmp); [L417] EXPR check() [L417] c1 = check() [L418] CALL assert(c1) [L430] COND FALSE, RET !(! arg) VAL [alive1=0, alive2=1, alive3=1, alive4=0, id1=127, id2=126, id3=2, id4=0, mode1=0, mode2=0, mode3=0, mode4=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, p4=0, p4_new=-1, p4_old=-1, r1=3, send1=126, send2=126, send3=126, send4=126, st1=0, st2=0, st3=0, st4=0] [L418] assert(c1) [L419] i2 ++ VAL [alive1=0, alive2=1, alive3=1, alive4=0, id1=127, id2=126, id3=2, id4=0, mode1=0, mode2=0, mode3=0, mode4=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, p4=0, p4_new=-1, p4_old=-1, r1=3, send1=126, send2=126, send3=126, send4=126, st1=0, st2=0, st3=0, st4=0] [L403] COND TRUE i2 < 8 [L405] CALL node1() [L106] msg_t m1 ; [L109] m1 = nomsg [L110] COND FALSE !(\read(mode1)) [L128] COND FALSE !(\read(alive1)) [L131] RET mode1 = (_Bool)1 [L405] node1() [L406] CALL node2() [L138] msg_t m2 ; [L141] m2 = nomsg [L142] COND FALSE !(\read(mode2)) [L159] COND TRUE \read(alive2) [L160] COND TRUE, EXPR send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L160] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L165] RET mode2 = (_Bool)1 [L406] node2() [L407] CALL node3() [L172] msg_t m3 ; [L175] m3 = nomsg [L176] COND FALSE !(\read(mode3)) [L193] COND TRUE \read(alive3) [L194] COND TRUE, EXPR send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L194] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L199] RET mode3 = (_Bool)1 [L407] node3() [L408] CALL node4() [L206] msg_t m4 ; [L209] m4 = nomsg [L210] COND FALSE !(\read(mode4)) [L227] COND FALSE !(\read(alive4)) [L230] COND TRUE (int )send4 != (int )id4 [L231] COND TRUE, EXPR send4 != nomsg && p4_new == nomsg ? send4 : p4_new [L231] p4_new = send4 != nomsg && p4_new == nomsg ? send4 : p4_new [L233] RET mode4 = (_Bool)1 [L408] node4() [L409] p1_old = p1_new [L410] p1_new = nomsg [L411] p2_old = p2_new [L412] p2_new = nomsg [L413] p3_old = p3_new [L414] p3_new = nomsg [L415] p4_old = p4_new [L416] p4_new = nomsg [L417] CALL, EXPR check() [L346] int tmp ; [L349] COND TRUE (((int )st1 + (int )st2) + (int )st3) + (int )st4 <= 1 [L350] COND TRUE (int )r1 < 4 [L351] tmp = 1 [L361] RET return (tmp); [L417] EXPR check() [L417] c1 = check() [L418] CALL assert(c1) [L430] COND FALSE, RET !(! arg) VAL [alive1=0, alive2=1, alive3=1, alive4=0, id1=127, id2=126, id3=2, id4=0, mode1=1, mode2=1, mode3=1, mode4=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=126, p4=0, p4_new=-1, p4_old=126, r1=3, send1=126, send2=126, send3=126, send4=126, st1=0, st2=0, st3=0, st4=0] [L418] assert(c1) [L419] i2 ++ VAL [alive1=0, alive2=1, alive3=1, alive4=0, id1=127, id2=126, id3=2, id4=0, mode1=1, mode2=1, mode3=1, mode4=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=126, p4=0, p4_new=-1, p4_old=126, r1=3, send1=126, send2=126, send3=126, send4=126, st1=0, st2=0, st3=0, st4=0] [L403] COND TRUE i2 < 8 [L405] CALL node1() [L106] msg_t m1 ; [L109] m1 = nomsg [L110] COND TRUE \read(mode1) [L111] r1 = (char )((int )r1 + 1) [L112] m1 = p4_old [L113] p4_old = nomsg [L114] COND TRUE (int )m1 != (int )nomsg [L115] COND FALSE !(\read(alive1)) [L123] send1 = m1 [L126] RET mode1 = (_Bool)0 [L405] node1() [L406] CALL node2() [L138] msg_t m2 ; [L141] m2 = nomsg [L142] COND TRUE \read(mode2) [L143] m2 = p1_old [L144] p1_old = nomsg [L145] COND FALSE !((int )m2 != (int )nomsg) [L157] RET mode2 = (_Bool)0 [L406] node2() [L407] CALL node3() [L172] msg_t m3 ; [L175] m3 = nomsg [L176] COND TRUE \read(mode3) [L177] m3 = p2_old [L178] p2_old = nomsg [L179] COND TRUE (int )m3 != (int )nomsg [L180] COND TRUE \read(alive3) [L181] COND TRUE (int )m3 > (int )id3 [L182] send3 = m3 [L191] RET mode3 = (_Bool)0 [L407] node3() [L408] CALL node4() [L206] msg_t m4 ; [L209] m4 = nomsg [L210] COND TRUE \read(mode4) [L211] m4 = p3_old [L212] p3_old = nomsg [L213] COND TRUE (int )m4 != (int )nomsg [L214] COND FALSE !(\read(alive4)) [L222] send4 = m4 [L225] RET mode4 = (_Bool)0 [L408] node4() [L409] p1_old = p1_new [L410] p1_new = nomsg [L411] p2_old = p2_new [L412] p2_new = nomsg [L413] p3_old = p3_new [L414] p3_new = nomsg [L415] p4_old = p4_new [L416] p4_new = nomsg [L417] CALL, EXPR check() [L346] int tmp ; [L349] COND TRUE (((int )st1 + (int )st2) + (int )st3) + (int )st4 <= 1 [L350] COND FALSE !((int )r1 < 4) [L353] COND FALSE !((((int )st1 + (int )st2) + (int )st3) + (int )st4 == 1) [L356] tmp = 0 [L361] RET return (tmp); [L417] EXPR check() [L417] c1 = check() [L418] CALL assert(c1) [L430] COND TRUE ! arg VAL [alive1=0, alive2=1, alive3=1, alive4=0, id1=127, id2=126, id3=2, id4=0, mode1=0, mode2=0, mode3=0, mode4=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, p4=0, p4_new=-1, p4_old=-1, r1=4, send1=126, send2=126, send3=126, send4=126, st1=0, st2=0, st3=0, st4=0] [L432] __VERIFIER_error() VAL [alive1=0, alive2=1, alive3=1, alive4=0, id1=127, id2=126, id3=2, id4=0, mode1=0, mode2=0, mode3=0, mode4=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, p4=0, p4_new=-1, p4_old=-1, r1=4, send1=126, send2=126, send3=126, send4=126, st1=0, st2=0, st3=0, st4=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 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 251.17 ms. Allocated memory is still 1.0 GB. Free memory was 962.9 MB in the beginning and 945.7 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 68.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 945.7 MB in the beginning and 1.2 GB in the end (delta: -211.0 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.50 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1101.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 933.2 MB in the end (delta: 223.6 MB). Peak memory consumption was 223.6 MB. Max. memory is 11.5 GB. * CodeCheck took 649302.69 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 179.3 MB). Free memory was 933.2 MB in the beginning and 1.0 GB in the end (delta: -93.1 MB). Peak memory consumption was 86.2 MB. Max. memory is 11.5 GB. * Witness Printer took 113.22 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...