./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.3.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_916b09ea-9abc-4d84-94d5-00877d3dc6ed/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_916b09ea-9abc-4d84-94d5-00877d3dc6ed/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_916b09ea-9abc-4d84-94d5-00877d3dc6ed/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_916b09ea-9abc-4d84-94d5-00877d3dc6ed/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.3.ufo.UNBOUNDED.pals.c -s /tmp/vcloud-vcloud-master/worker/working_dir_916b09ea-9abc-4d84-94d5-00877d3dc6ed/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_916b09ea-9abc-4d84-94d5-00877d3dc6ed/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 00d162608be697d65baff4581155da4ea0225a1e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-635dfa2 [2018-12-09 02:59:04,910 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 02:59:04,911 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 02:59:04,917 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 02:59:04,917 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 02:59:04,918 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 02:59:04,918 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 02:59:04,919 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 02:59:04,920 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 02:59:04,921 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 02:59:04,921 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 02:59:04,921 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 02:59:04,922 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 02:59:04,922 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 02:59:04,923 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 02:59:04,923 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 02:59:04,923 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 02:59:04,924 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 02:59:04,925 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 02:59:04,926 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 02:59:04,927 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 02:59:04,927 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 02:59:04,928 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 02:59:04,928 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 02:59:04,929 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 02:59:04,929 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 02:59:04,929 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 02:59:04,930 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 02:59:04,930 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 02:59:04,931 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 02:59:04,931 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 02:59:04,931 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 02:59:04,931 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 02:59:04,932 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 02:59:04,932 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 02:59:04,932 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 02:59:04,933 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_916b09ea-9abc-4d84-94d5-00877d3dc6ed/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-12-09 02:59:04,940 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 02:59:04,940 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 02:59:04,940 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 02:59:04,940 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-12-09 02:59:04,941 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 02:59:04,941 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 02:59:04,941 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 02:59:04,941 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 02:59:04,941 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 02:59:04,941 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 02:59:04,941 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 02:59:04,941 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 02:59:04,941 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 02:59:04,942 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 02:59:04,942 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 02:59:04,942 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 02:59:04,942 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 02:59:04,942 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 02:59:04,942 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-09 02:59:04,942 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-09 02:59:04,942 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 02:59:04,942 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 02:59:04,942 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-09 02:59:04,943 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 02:59:04,943 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 02:59:04,943 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 02:59:04,943 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-12-09 02:59:04,943 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 02:59:04,943 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 02:59:04,943 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_916b09ea-9abc-4d84-94d5-00877d3dc6ed/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 -> 00d162608be697d65baff4581155da4ea0225a1e [2018-12-09 02:59:04,960 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 02:59:04,968 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 02:59:04,970 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 02:59:04,971 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 02:59:04,972 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 02:59:04,972 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_916b09ea-9abc-4d84-94d5-00877d3dc6ed/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.3.ufo.UNBOUNDED.pals.c [2018-12-09 02:59:05,008 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_916b09ea-9abc-4d84-94d5-00877d3dc6ed/bin-2019/ukojak/data/52d9d2aef/8dd90863d2a644a884463067b457e79f/FLAGd6221feb4 [2018-12-09 02:59:05,377 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 02:59:05,377 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_916b09ea-9abc-4d84-94d5-00877d3dc6ed/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.3.ufo.UNBOUNDED.pals.c [2018-12-09 02:59:05,382 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_916b09ea-9abc-4d84-94d5-00877d3dc6ed/bin-2019/ukojak/data/52d9d2aef/8dd90863d2a644a884463067b457e79f/FLAGd6221feb4 [2018-12-09 02:59:05,758 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_916b09ea-9abc-4d84-94d5-00877d3dc6ed/bin-2019/ukojak/data/52d9d2aef/8dd90863d2a644a884463067b457e79f [2018-12-09 02:59:05,761 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 02:59:05,762 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 02:59:05,762 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 02:59:05,763 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 02:59:05,765 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 02:59:05,766 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:59:05" (1/1) ... [2018-12-09 02:59:05,768 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6952e9a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:59:05, skipping insertion in model container [2018-12-09 02:59:05,768 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:59:05" (1/1) ... [2018-12-09 02:59:05,773 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 02:59:05,791 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 02:59:05,911 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 02:59:05,916 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 02:59:05,984 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 02:59:05,999 INFO L195 MainTranslator]: Completed translation [2018-12-09 02:59:05,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:59:05 WrapperNode [2018-12-09 02:59:05,999 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 02:59:06,000 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 02:59:06,000 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 02:59:06,000 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 02:59:06,007 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:59:05" (1/1) ... [2018-12-09 02:59:06,014 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:59:05" (1/1) ... [2018-12-09 02:59:06,033 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 02:59:06,033 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 02:59:06,033 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 02:59:06,033 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 02:59:06,039 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:59:05" (1/1) ... [2018-12-09 02:59:06,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:59:05" (1/1) ... [2018-12-09 02:59:06,040 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:59:05" (1/1) ... [2018-12-09 02:59:06,041 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:59:05" (1/1) ... [2018-12-09 02:59:06,044 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:59:05" (1/1) ... [2018-12-09 02:59:06,049 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:59:05" (1/1) ... [2018-12-09 02:59:06,051 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:59:05" (1/1) ... [2018-12-09 02:59:06,053 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 02:59:06,053 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 02:59:06,053 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 02:59:06,053 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 02:59:06,054 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:59:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_916b09ea-9abc-4d84-94d5-00877d3dc6ed/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-12-09 02:59:06,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 02:59:06,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 02:59:07,428 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 02:59:07,428 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2018-12-09 02:59:07,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:59:07 BoogieIcfgContainer [2018-12-09 02:59:07,428 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 02:59:07,429 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-09 02:59:07,429 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-09 02:59:07,435 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-09 02:59:07,435 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:59:07" (1/1) ... [2018-12-09 02:59:07,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:59:07,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:59:07,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 18 states and 29 transitions. [2018-12-09 02:59:07,465 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 29 transitions. [2018-12-09 02:59:07,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-09 02:59:07,467 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:59:07,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:59:07,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:59:07,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:59:07,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 19 states and 31 transitions. [2018-12-09 02:59:07,725 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 31 transitions. [2018-12-09 02:59:07,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-09 02:59:07,725 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:59:07,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:59:07,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:59:07,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:59:07,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 22 states and 37 transitions. [2018-12-09 02:59:07,991 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 37 transitions. [2018-12-09 02:59:07,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-09 02:59:07,993 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:59:08,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:59:08,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:59:08,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:59:08,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 26 states and 45 transitions. [2018-12-09 02:59:08,310 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 45 transitions. [2018-12-09 02:59:08,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-09 02:59:08,310 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:59:08,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:59:08,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:59:08,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:59:08,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 31 states and 55 transitions. [2018-12-09 02:59:08,791 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 55 transitions. [2018-12-09 02:59:08,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 02:59:08,792 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:59:08,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:59:08,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:59:09,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:59:09,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 38 states and 67 transitions. [2018-12-09 02:59:09,491 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 67 transitions. [2018-12-09 02:59:09,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-09 02:59:09,492 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:59:09,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:59:09,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:59:10,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:59:10,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 44 states and 78 transitions. [2018-12-09 02:59:10,447 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 78 transitions. [2018-12-09 02:59:10,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-09 02:59:10,448 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:59:10,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:59:10,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:59:10,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:59:10,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 45 states and 78 transitions. [2018-12-09 02:59:10,648 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 78 transitions. [2018-12-09 02:59:10,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 02:59:10,648 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:59:10,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:59:10,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:59:10,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:59:10,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 46 states and 79 transitions. [2018-12-09 02:59:10,687 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 79 transitions. [2018-12-09 02:59:10,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 02:59:10,687 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:59:10,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:59:10,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:59:12,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:59:12,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 56 states and 95 transitions. [2018-12-09 02:59:12,321 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 95 transitions. [2018-12-09 02:59:12,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 02:59:12,322 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:59:12,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:59:12,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:59:12,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:59:12,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 59 states and 107 transitions. [2018-12-09 02:59:12,601 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 107 transitions. [2018-12-09 02:59:12,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 02:59:12,602 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:59:12,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:59:13,137 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:59:17,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:59:17,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 74 states and 135 transitions. [2018-12-09 02:59:17,544 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 135 transitions. [2018-12-09 02:59:17,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 02:59:17,545 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:59:17,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:59:17,805 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:59:21,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:59:21,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 89 states and 164 transitions. [2018-12-09 02:59:21,157 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 164 transitions. [2018-12-09 02:59:21,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 02:59:21,158 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:59:21,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:59:21,257 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:59:21,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:59:21,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 90 states and 166 transitions. [2018-12-09 02:59:21,427 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 166 transitions. [2018-12-09 02:59:21,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 02:59:21,428 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:59:21,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:59:21,728 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:59:28,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:59:28,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 107 states and 197 transitions. [2018-12-09 02:59:28,534 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 197 transitions. [2018-12-09 02:59:28,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 02:59:28,534 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:59:28,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:59:28,649 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:59:28,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:59:28,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 108 states and 201 transitions. [2018-12-09 02:59:28,902 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 201 transitions. [2018-12-09 02:59:28,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 02:59:28,902 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:59:28,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:59:29,012 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:59:29,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:59:29,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 109 states and 205 transitions. [2018-12-09 02:59:29,277 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 205 transitions. [2018-12-09 02:59:29,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 02:59:29,277 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:59:29,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:59:29,657 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:59:33,048 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2018-12-09 02:59:33,356 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2018-12-09 02:59:35,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:59:35,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 122 states and 231 transitions. [2018-12-09 02:59:35,068 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 231 transitions. [2018-12-09 02:59:35,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 02:59:35,069 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:59:35,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:59:35,103 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:59:36,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:59:36,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 125 states and 239 transitions. [2018-12-09 02:59:36,512 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 239 transitions. [2018-12-09 02:59:36,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 02:59:36,513 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:59:36,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:59:36,561 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:59:36,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:59:36,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 126 states and 244 transitions. [2018-12-09 02:59:36,862 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 244 transitions. [2018-12-09 02:59:36,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 02:59:36,862 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:59:36,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:59:37,838 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:59:39,696 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2018-12-09 02:59:42,171 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2018-12-09 02:59:45,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:59:45,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 145 states and 273 transitions. [2018-12-09 02:59:45,933 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 273 transitions. [2018-12-09 02:59:45,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 02:59:45,933 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:59:45,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:59:46,762 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:59:49,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 02:59:49,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 150 states and 282 transitions. [2018-12-09 02:59:49,761 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 282 transitions. [2018-12-09 02:59:49,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 02:59:49,762 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 02:59:49,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:59:51,248 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:59:55,618 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2018-12-09 03:00:00,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 03:00:00,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 157 states and 300 transitions. [2018-12-09 03:00:00,840 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 300 transitions. [2018-12-09 03:00:00,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 03:00:00,840 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 03:00:00,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:00:01,843 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:00:15,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 03:00:15,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 170 states and 348 transitions. [2018-12-09 03:00:15,414 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 348 transitions. [2018-12-09 03:00:15,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 03:00:15,415 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 03:00:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:00:16,244 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:00:25,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 03:00:25,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 182 states and 377 transitions. [2018-12-09 03:00:25,896 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 377 transitions. [2018-12-09 03:00:25,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 03:00:25,896 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 03:00:25,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:00:25,937 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:00:26,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 03:00:26,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 183 states and 382 transitions. [2018-12-09 03:00:26,399 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 382 transitions. [2018-12-09 03:00:26,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 03:00:26,400 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 03:00:26,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:00:28,655 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:00:35,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 03:00:35,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 195 states and 407 transitions. [2018-12-09 03:00:35,893 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 407 transitions. [2018-12-09 03:00:35,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 03:00:35,894 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 03:00:35,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:00:36,033 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:00:36,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 03:00:36,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 196 states and 411 transitions. [2018-12-09 03:00:36,927 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 411 transitions. [2018-12-09 03:00:36,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 03:00:36,928 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 03:00:36,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:00:41,120 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:00:47,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 03:00:47,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 209 states and 438 transitions. [2018-12-09 03:00:47,403 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 438 transitions. [2018-12-09 03:00:47,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 03:00:47,404 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 03:00:47,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:00:47,632 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:00:48,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 03:00:48,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 210 states and 441 transitions. [2018-12-09 03:00:48,116 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 441 transitions. [2018-12-09 03:00:48,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 03:00:48,117 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 03:00:48,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:00:49,256 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:00:55,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 03:00:55,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 212 states and 444 transitions. [2018-12-09 03:00:55,341 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 444 transitions. [2018-12-09 03:00:55,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 03:00:55,343 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 03:00:55,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:00:55,578 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:01:03,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 03:01:03,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 217 states and 460 transitions. [2018-12-09 03:01:03,827 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 460 transitions. [2018-12-09 03:01:03,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 03:01:03,829 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 03:01:03,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:01:04,043 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:01:06,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 03:01:06,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 219 states and 463 transitions. [2018-12-09 03:01:06,328 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 463 transitions. [2018-12-09 03:01:06,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 03:01:06,328 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 03:01:06,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:01:07,041 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:01:15,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 03:01:15,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 235 states and 515 transitions. [2018-12-09 03:01:15,050 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 515 transitions. [2018-12-09 03:01:15,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 03:01:15,050 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 03:01:15,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:01:15,162 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:01:16,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 03:01:16,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 237 states and 525 transitions. [2018-12-09 03:01:16,481 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 525 transitions. [2018-12-09 03:01:16,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 03:01:16,481 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 03:01:16,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:01:16,587 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:01:17,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 03:01:17,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 238 states and 531 transitions. [2018-12-09 03:01:17,240 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 531 transitions. [2018-12-09 03:01:17,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 03:01:17,240 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 03:01:17,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:01:17,873 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:01:21,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 03:01:21,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 240 states and 538 transitions. [2018-12-09 03:01:21,385 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 538 transitions. [2018-12-09 03:01:21,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 03:01:21,386 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 03:01:21,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:01:21,802 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:01:24,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 03:01:24,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 242 states and 550 transitions. [2018-12-09 03:01:24,063 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 550 transitions. [2018-12-09 03:01:24,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 03:01:24,064 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 03:01:24,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:01:24,496 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:01:27,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 03:01:27,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 245 states and 554 transitions. [2018-12-09 03:01:27,354 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 554 transitions. [2018-12-09 03:01:27,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 03:01:27,355 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 03:01:27,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:01:27,779 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:01:29,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 03:01:29,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 247 states and 556 transitions. [2018-12-09 03:01:29,354 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 556 transitions. [2018-12-09 03:01:29,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 03:01:29,354 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 03:01:29,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 03:01:29,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 03:01:30,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 03:01:30,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 03:01:30,760 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 40 iterations. [2018-12-09 03:01:30,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 09.12 03:01:30 ImpRootNode [2018-12-09 03:01:30,832 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-09 03:01:30,832 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 03:01:30,832 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 03:01:30,832 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 03:01:30,832 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:59:07" (3/4) ... [2018-12-09 03:01:30,834 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 03:01:30,916 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_916b09ea-9abc-4d84-94d5-00877d3dc6ed/bin-2019/ukojak/witness.graphml [2018-12-09 03:01:30,916 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 03:01:30,917 INFO L168 Benchmark]: Toolchain (without parser) took 145155.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 220.2 MB). Free memory was 956.0 MB in the beginning and 932.4 MB in the end (delta: 23.6 MB). Peak memory consumption was 243.8 MB. Max. memory is 11.5 GB. [2018-12-09 03:01:30,917 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 03:01:30,917 INFO L168 Benchmark]: CACSL2BoogieTranslator took 237.00 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -149.1 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2018-12-09 03:01:30,917 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.11 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-09 03:01:30,918 INFO L168 Benchmark]: Boogie Preprocessor took 19.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-09 03:01:30,918 INFO L168 Benchmark]: RCFGBuilder took 1375.53 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 101.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -97.1 MB). Peak memory consumption was 331.3 MB. Max. memory is 11.5 GB. [2018-12-09 03:01:30,918 INFO L168 Benchmark]: CodeCheck took 143402.86 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 10.5 MB). Free memory was 1.2 GB in the beginning and 959.0 MB in the end (delta: 227.4 MB). Peak memory consumption was 237.9 MB. Max. memory is 11.5 GB. [2018-12-09 03:01:30,918 INFO L168 Benchmark]: Witness Printer took 84.40 ms. Allocated memory is still 1.2 GB. Free memory was 959.0 MB in the beginning and 932.4 MB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. [2018-12-09 03:01:30,919 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, 134 locations, 1 error locations. UNSAFE Result, 143.3s OverallTime, 40 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 0 SDtfs, -318140508 SDslu, 0 SDs, 0 SdLazy, -2020130324 SolverSat, 627893952 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 64.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10993 GetRequests, 9508 SyntacticMatches, 587 SemanticMatches, 898 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516151 ImplicationChecksByTransitivity, 135.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 17.9s InterpolantComputationTime, 1039 NumberOfCodeBlocks, 1039 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 955 ConstructedInterpolants, 0 QuantifiedInterpolants, 364633 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 10 PerfectInterpolantSequences, 111/588 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: 610]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L70] msg_t nomsg = (msg_t )-1; [L71] port_t p12 ; [L72] char p12_old ; [L73] char p12_new ; [L74] _Bool ep12 ; [L75] port_t p13 ; [L76] char p13_old ; [L77] char p13_new ; [L78] _Bool ep13 ; [L79] port_t p21 ; [L80] char p21_old ; [L81] char p21_new ; [L82] _Bool ep21 ; [L83] port_t p23 ; [L84] char p23_old ; [L85] char p23_new ; [L86] _Bool ep23 ; [L87] port_t p31 ; [L88] char p31_old ; [L89] char p31_new ; [L90] _Bool ep31 ; [L91] port_t p32 ; [L92] char p32_old ; [L93] char p32_new ; [L94] _Bool ep32 ; [L95] char id1 ; [L96] unsigned char r1 ; [L97] char st1 ; [L98] char nl1 ; [L99] char m1 ; [L100] char max1 ; [L101] _Bool mode1 ; [L102] char id2 ; [L103] unsigned char r2 ; [L104] char st2 ; [L105] char nl2 ; [L106] char m2 ; [L107] char max2 ; [L108] _Bool mode2 ; [L109] char id3 ; [L110] unsigned char r3 ; [L111] char st3 ; [L112] char nl3 ; [L113] char m3 ; [L114] char max3 ; [L115] _Bool mode3 ; [L254] void (*nodes[3])(void) = { & node1, & node2, & node3}; [L532] int c1 ; [L533] int i2 ; [L536] c1 = 0 [L537] ep12 = __VERIFIER_nondet_bool() [L538] ep13 = __VERIFIER_nondet_bool() [L539] ep21 = __VERIFIER_nondet_bool() [L540] ep23 = __VERIFIER_nondet_bool() [L541] ep31 = __VERIFIER_nondet_bool() [L542] ep32 = __VERIFIER_nondet_bool() [L543] id1 = __VERIFIER_nondet_char() [L544] r1 = __VERIFIER_nondet_uchar() [L545] st1 = __VERIFIER_nondet_char() [L546] nl1 = __VERIFIER_nondet_char() [L547] m1 = __VERIFIER_nondet_char() [L548] max1 = __VERIFIER_nondet_char() [L549] mode1 = __VERIFIER_nondet_bool() [L550] id2 = __VERIFIER_nondet_char() [L551] r2 = __VERIFIER_nondet_uchar() [L552] st2 = __VERIFIER_nondet_char() [L553] nl2 = __VERIFIER_nondet_char() [L554] m2 = __VERIFIER_nondet_char() [L555] max2 = __VERIFIER_nondet_char() [L556] mode2 = __VERIFIER_nondet_bool() [L557] id3 = __VERIFIER_nondet_char() [L558] r3 = __VERIFIER_nondet_uchar() [L559] st3 = __VERIFIER_nondet_char() [L560] nl3 = __VERIFIER_nondet_char() [L561] m3 = __VERIFIER_nondet_char() [L562] max3 = __VERIFIER_nondet_char() [L563] mode3 = __VERIFIER_nondet_bool() [L257] _Bool r121 ; [L258] _Bool r131 ; [L259] _Bool r211 ; [L260] _Bool r231 ; [L261] _Bool r311 ; [L262] _Bool r321 ; [L263] _Bool r122 ; [L264] int tmp ; [L265] _Bool r132 ; [L266] int tmp___0 ; [L267] _Bool r212 ; [L268] int tmp___1 ; [L269] _Bool r232 ; [L270] int tmp___2 ; [L271] _Bool r312 ; [L272] int tmp___3 ; [L273] _Bool r322 ; [L274] int tmp___4 ; [L275] int tmp___5 ; [L278] r121 = ep12 [L279] r131 = ep13 [L280] r211 = ep21 [L281] r231 = ep23 [L282] r311 = ep31 [L283] r321 = ep32 [L284] COND TRUE \read(r121) [L285] tmp = 1 [L296] r122 = (_Bool )tmp [L297] COND FALSE !(\read(r131)) [L300] COND TRUE \read(r121) [L301] COND TRUE \read(ep23) [L302] tmp___0 = 1 [L309] r132 = (_Bool )tmp___0 [L310] COND FALSE !(\read(r211)) [L313] COND TRUE \read(r231) [L314] COND TRUE \read(ep31) [L315] tmp___1 = 1 [L322] r212 = (_Bool )tmp___1 [L323] COND TRUE \read(r231) [L324] tmp___2 = 1 [L335] r232 = (_Bool )tmp___2 [L336] COND TRUE \read(r311) [L337] tmp___3 = 1 [L348] r312 = (_Bool )tmp___3 [L349] COND TRUE \read(r321) [L350] tmp___4 = 1 [L361] r322 = (_Bool )tmp___4 [L362] COND TRUE (int )id1 != (int )id2 [L363] COND TRUE (int )id1 != (int )id3 [L364] COND TRUE (int )id2 != (int )id3 [L365] COND TRUE (int )id1 >= 0 [L366] COND TRUE (int )id2 >= 0 [L367] COND TRUE (int )id3 >= 0 [L368] COND TRUE (int )r1 == 0 [L369] COND TRUE (int )r2 == 0 [L370] COND TRUE (int )r3 == 0 [L371] COND TRUE \read(r122) [L372] COND TRUE \read(r132) [L373] COND TRUE \read(r212) [L374] COND TRUE \read(r232) [L375] COND TRUE \read(r312) [L376] COND TRUE \read(r322) [L377] COND TRUE (int )max1 == (int )id1 [L378] COND TRUE (int )max2 == (int )id2 [L379] COND TRUE (int )max3 == (int )id3 [L380] COND TRUE (int )st1 == 0 [L381] COND TRUE (int )st2 == 0 [L382] COND TRUE (int )st3 == 0 [L383] COND TRUE (int )nl1 == 0 [L384] COND TRUE (int )nl2 == 0 [L385] COND TRUE (int )nl3 == 0 [L386] COND TRUE (int )mode1 == 0 [L387] COND TRUE (int )mode2 == 0 [L388] COND TRUE (int )mode3 == 0 [L389] tmp___5 = 1 [L471] return (tmp___5); [L564] i2 = init() [L566] p12_old = nomsg [L567] p12_new = nomsg [L568] p13_old = nomsg [L569] p13_new = nomsg [L570] p21_old = nomsg [L571] p21_new = nomsg [L572] p23_old = nomsg [L573] p23_new = nomsg [L574] p31_old = nomsg [L575] p31_new = nomsg [L576] p32_old = nomsg [L577] p32_new = nomsg [L578] i2 = 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=2, id3=4, m1=0, m2=127, m3=5, max1=3, max2=2, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L579] COND TRUE 1 [L121] COND FALSE !(\read(mode1)) [L149] COND TRUE (int )r1 < 2 [L150] COND TRUE \read(ep12) [L151] EXPR max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L151] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L153] COND FALSE !(\read(ep13)) [L157] mode1 = (_Bool)1 [L167] COND FALSE !(\read(mode2)) [L195] COND TRUE (int )r2 < 2 [L196] COND FALSE !(\read(ep21)) [L199] COND TRUE \read(ep23) [L200] EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L200] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L203] mode2 = (_Bool)1 [L213] COND FALSE !(\read(mode3)) [L241] COND TRUE (int )r3 < 2 [L242] COND TRUE \read(ep31) [L243] EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L243] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L245] COND TRUE \read(ep32) [L246] EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L246] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L249] mode3 = (_Bool)1 [L584] p12_old = p12_new [L585] p12_new = nomsg [L586] p13_old = p13_new [L587] p13_new = nomsg [L588] p21_old = p21_new [L589] p21_new = nomsg [L590] p23_old = p23_new [L591] p23_new = nomsg [L592] p31_old = p31_new [L593] p31_new = nomsg [L594] p32_old = p32_new [L595] p32_new = nomsg [L476] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=2, id3=4, m1=0, m2=127, m3=5, max1=3, max2=2, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L479] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=2, id3=4, m1=0, m2=127, m3=5, max1=3, max2=2, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L480] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=2, id3=4, m1=0, m2=127, m3=5, max1=3, max2=2, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L481] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=2, id3=4, m1=0, m2=127, m3=5, max1=3, max2=2, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L482] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=2, id3=4, m1=0, m2=127, m3=5, max1=3, max2=2, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L483] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=2, id3=4, m1=0, m2=127, m3=5, max1=3, max2=2, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L486] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=2, id3=4, m1=0, m2=127, m3=5, max1=3, max2=2, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L488] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=2, id3=4, m1=0, m2=127, m3=5, max1=3, max2=2, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L493] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=2, id3=4, m1=0, m2=127, m3=5, max1=3, max2=2, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L496] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=2, id3=4, m1=0, m2=127, m3=5, max1=3, max2=2, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L498] COND TRUE (int )r1 < 2 [L499] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=2, id3=4, m1=0, m2=127, m3=5, max1=3, max2=2, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L527] return (tmp); [L596] c1 = check() [L608] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=2, id3=4, m1=0, m2=127, m3=5, max1=3, max2=2, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L579] COND TRUE 1 [L121] COND TRUE \read(mode1) [L122] COND FALSE !(r1 == 255) [L125] r1 = r1 + 1 [L126] COND FALSE !(\read(ep21)) [L133] COND TRUE \read(ep31) [L134] m1 = p31_old [L135] p31_old = nomsg [L136] COND TRUE (int )m1 > (int )max1 [L137] max1 = m1 [L140] COND FALSE !((int )r1 == 2) [L147] mode1 = (_Bool)0 [L167] COND TRUE \read(mode2) [L168] COND FALSE !(r2 == 255) [L171] r2 = r2 + 1 [L172] COND TRUE \read(ep12) [L173] m2 = p12_old [L174] p12_old = nomsg [L175] COND TRUE (int )m2 > (int )max2 [L176] max2 = m2 [L179] COND TRUE \read(ep32) [L180] m2 = p32_old [L181] p32_old = nomsg [L182] COND TRUE (int )m2 > (int )max2 [L183] max2 = m2 [L186] COND FALSE !((int )r2 == 2) [L193] mode2 = (_Bool)0 [L213] COND TRUE \read(mode3) [L214] COND FALSE !(r3 == 255) [L217] r3 = r3 + 1 [L218] COND FALSE !(\read(ep13)) [L225] COND TRUE \read(ep23) [L226] m3 = p23_old [L227] p23_old = nomsg [L228] COND FALSE !((int )m3 > (int )max3) [L232] COND FALSE !((int )r3 == 2) [L239] mode3 = (_Bool)0 [L584] p12_old = p12_new [L585] p12_new = nomsg [L586] p13_old = p13_new [L587] p13_new = nomsg [L588] p21_old = p21_new [L589] p21_new = nomsg [L590] p23_old = p23_new [L591] p23_new = nomsg [L592] p31_old = p31_new [L593] p31_new = nomsg [L594] p32_old = p32_new [L595] p32_new = nomsg [L476] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=2, id3=4, m1=4, m2=4, m3=2, max1=4, max2=4, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L479] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=2, id3=4, m1=4, m2=4, m3=2, max1=4, max2=4, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L480] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=2, id3=4, m1=4, m2=4, m3=2, max1=4, max2=4, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L481] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=2, id3=4, m1=4, m2=4, m3=2, max1=4, max2=4, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L482] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=2, id3=4, m1=4, m2=4, m3=2, max1=4, max2=4, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L483] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=2, id3=4, m1=4, m2=4, m3=2, max1=4, max2=4, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L486] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=2, id3=4, m1=4, m2=4, m3=2, max1=4, max2=4, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L488] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=2, id3=4, m1=4, m2=4, m3=2, max1=4, max2=4, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L493] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=2, id3=4, m1=4, m2=4, m3=2, max1=4, max2=4, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L496] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=2, id3=4, m1=4, m2=4, m3=2, max1=4, max2=4, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L498] COND TRUE (int )r1 < 2 [L499] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=2, id3=4, m1=4, m2=4, m3=2, max1=4, max2=4, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L527] return (tmp); [L596] c1 = check() [L608] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=2, id3=4, m1=4, m2=4, m3=2, max1=4, max2=4, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L579] COND TRUE 1 [L121] COND FALSE !(\read(mode1)) [L149] COND TRUE (int )r1 < 2 [L150] COND TRUE \read(ep12) [L151] EXPR max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L151] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L153] COND FALSE !(\read(ep13)) [L157] mode1 = (_Bool)1 [L167] COND FALSE !(\read(mode2)) [L195] COND TRUE (int )r2 < 2 [L196] COND FALSE !(\read(ep21)) [L199] COND TRUE \read(ep23) [L200] EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L200] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L203] mode2 = (_Bool)1 [L213] COND FALSE !(\read(mode3)) [L241] COND TRUE (int )r3 < 2 [L242] COND TRUE \read(ep31) [L243] EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L243] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L245] COND TRUE \read(ep32) [L246] EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L246] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L249] mode3 = (_Bool)1 [L584] p12_old = p12_new [L585] p12_new = nomsg [L586] p13_old = p13_new [L587] p13_new = nomsg [L588] p21_old = p21_new [L589] p21_new = nomsg [L590] p23_old = p23_new [L591] p23_new = nomsg [L592] p31_old = p31_new [L593] p31_new = nomsg [L594] p32_old = p32_new [L595] p32_new = nomsg [L476] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=2, id3=4, m1=4, m2=4, m3=2, max1=4, max2=4, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=4, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L479] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=2, id3=4, m1=4, m2=4, m3=2, max1=4, max2=4, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=4, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L480] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=2, id3=4, m1=4, m2=4, m3=2, max1=4, max2=4, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=4, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L481] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=2, id3=4, m1=4, m2=4, m3=2, max1=4, max2=4, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=4, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L482] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=2, id3=4, m1=4, m2=4, m3=2, max1=4, max2=4, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=4, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L483] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=2, id3=4, m1=4, m2=4, m3=2, max1=4, max2=4, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=4, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L486] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=2, id3=4, m1=4, m2=4, m3=2, max1=4, max2=4, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=4, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L488] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=2, id3=4, m1=4, m2=4, m3=2, max1=4, max2=4, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=4, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L493] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=2, id3=4, m1=4, m2=4, m3=2, max1=4, max2=4, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=4, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L496] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=2, id3=4, m1=4, m2=4, m3=2, max1=4, max2=4, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=4, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L498] COND TRUE (int )r1 < 2 [L499] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=2, id3=4, m1=4, m2=4, m3=2, max1=4, max2=4, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=4, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L527] return (tmp); [L596] c1 = check() [L608] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=2, id3=4, m1=4, m2=4, m3=2, max1=4, max2=4, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=4, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L579] COND TRUE 1 [L121] COND TRUE \read(mode1) [L122] COND FALSE !(r1 == 255) [L125] r1 = r1 + 1 [L126] COND FALSE !(\read(ep21)) [L133] COND TRUE \read(ep31) [L134] m1 = p31_old [L135] p31_old = nomsg [L136] COND FALSE !((int )m1 > (int )max1) [L140] COND TRUE (int )r1 == 2 [L141] COND FALSE !((int )max1 == (int )id1) [L144] st1 = (char)1 [L147] mode1 = (_Bool)0 [L167] COND TRUE \read(mode2) [L168] COND FALSE !(r2 == 255) [L171] r2 = r2 + 1 [L172] COND TRUE \read(ep12) [L173] m2 = p12_old [L174] p12_old = nomsg [L175] COND FALSE !((int )m2 > (int )max2) [L179] COND TRUE \read(ep32) [L180] m2 = p32_old [L181] p32_old = nomsg [L182] COND FALSE !((int )m2 > (int )max2) [L186] COND TRUE (int )r2 == 2 [L187] COND FALSE !((int )max2 == (int )id2) [L190] nl2 = (char)1 [L193] mode2 = (_Bool)0 [L213] COND TRUE \read(mode3) [L214] COND FALSE !(r3 == 255) [L217] r3 = r3 + 1 [L218] COND FALSE !(\read(ep13)) [L225] COND TRUE \read(ep23) [L226] m3 = p23_old [L227] p23_old = nomsg [L228] COND FALSE !((int )m3 > (int )max3) [L232] COND TRUE (int )r3 == 2 [L233] COND TRUE (int )max3 == (int )id3 [L234] st3 = (char)1 [L239] mode3 = (_Bool)0 [L584] p12_old = p12_new [L585] p12_new = nomsg [L586] p13_old = p13_new [L587] p13_new = nomsg [L588] p21_old = p21_new [L589] p21_new = nomsg [L590] p23_old = p23_new [L591] p23_new = nomsg [L592] p31_old = p31_new [L593] p31_new = nomsg [L594] p32_old = p32_new [L595] p32_new = nomsg [L476] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=2, id3=4, m1=4, m2=4, m3=4, max1=4, max2=4, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L479] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L525] tmp = 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=2, id3=4, m1=4, m2=4, m3=4, max1=4, max2=4, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L527] return (tmp); [L596] c1 = check() [L608] COND TRUE ! arg VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=2, id3=4, m1=4, m2=4, m3=4, max1=4, max2=4, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L610] __VERIFIER_error() VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=1, id1=3, id2=2, id3=4, m1=4, m2=4, m3=4, max1=4, max2=4, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 237.00 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -149.1 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.11 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1375.53 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 101.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -97.1 MB). Peak memory consumption was 331.3 MB. Max. memory is 11.5 GB. * CodeCheck took 143402.86 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 10.5 MB). Free memory was 1.2 GB in the beginning and 959.0 MB in the end (delta: 227.4 MB). Peak memory consumption was 237.9 MB. Max. memory is 11.5 GB. * Witness Printer took 84.40 ms. Allocated memory is still 1.2 GB. Free memory was 959.0 MB in the beginning and 932.4 MB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...