./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 69874e26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_53c687de-088c-4180-917c-35ed7f2770c2/bin/ukojak/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_53c687de-088c-4180-917c-35ed7f2770c2/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_53c687de-088c-4180-917c-35ed7f2770c2/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_53c687de-088c-4180-917c-35ed7f2770c2/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_53c687de-088c-4180-917c-35ed7f2770c2/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_53c687de-088c-4180-917c-35ed7f2770c2/bin/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fc172d70141fb3471f6a62b11f9e652d18a2857c ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.2.0-69874e2 [2020-12-01 17:15:33,054 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-01 17:15:33,057 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-01 17:15:33,131 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-01 17:15:33,132 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-01 17:15:33,139 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-01 17:15:33,142 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-01 17:15:33,153 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-01 17:15:33,157 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-01 17:15:33,167 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-01 17:15:33,168 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-01 17:15:33,170 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-01 17:15:33,172 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-01 17:15:33,175 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-01 17:15:33,177 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-01 17:15:33,179 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-01 17:15:33,182 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-01 17:15:33,188 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-01 17:15:33,190 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-01 17:15:33,195 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-01 17:15:33,202 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-01 17:15:33,204 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-01 17:15:33,206 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-01 17:15:33,208 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-01 17:15:33,216 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-01 17:15:33,217 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-01 17:15:33,218 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-01 17:15:33,220 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-01 17:15:33,221 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-01 17:15:33,222 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-01 17:15:33,223 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-01 17:15:33,225 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-01 17:15:33,227 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-01 17:15:33,229 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-01 17:15:33,231 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-01 17:15:33,232 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-01 17:15:33,233 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-01 17:15:33,233 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-01 17:15:33,234 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-01 17:15:33,235 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-01 17:15:33,237 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-01 17:15:33,241 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_53c687de-088c-4180-917c-35ed7f2770c2/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2020-12-01 17:15:33,297 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-01 17:15:33,297 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-01 17:15:33,299 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-01 17:15:33,299 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2020-12-01 17:15:33,301 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-01 17:15:33,301 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-01 17:15:33,302 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-01 17:15:33,302 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-01 17:15:33,302 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-01 17:15:33,303 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-01 17:15:33,304 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-01 17:15:33,304 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-01 17:15:33,305 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-01 17:15:33,305 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-01 17:15:33,305 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-01 17:15:33,305 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-01 17:15:33,306 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-01 17:15:33,306 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-01 17:15:33,306 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2020-12-01 17:15:33,306 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2020-12-01 17:15:33,307 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-01 17:15:33,307 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-01 17:15:33,307 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2020-12-01 17:15:33,308 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-01 17:15:33,308 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-01 17:15:33,308 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-01 17:15:33,308 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2020-12-01 17:15:33,309 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-01 17:15:33,309 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-01 17:15:33,311 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_53c687de-088c-4180-917c-35ed7f2770c2/bin/ukojak/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_53c687de-088c-4180-917c-35ed7f2770c2/bin/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(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fc172d70141fb3471f6a62b11f9e652d18a2857c [2020-12-01 17:15:33,620 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-01 17:15:33,651 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-01 17:15:33,654 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-01 17:15:33,656 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-01 17:15:33,657 INFO L275 PluginConnector]: CDTParser initialized [2020-12-01 17:15:33,658 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_53c687de-088c-4180-917c-35ed7f2770c2/bin/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c [2020-12-01 17:15:33,761 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_53c687de-088c-4180-917c-35ed7f2770c2/bin/ukojak/data/ee9fedd49/d549dd96d1f246c285bc2abafa113d5b/FLAG2ad4e57fc [2020-12-01 17:15:34,412 INFO L306 CDTParser]: Found 1 translation units. [2020-12-01 17:15:34,412 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_53c687de-088c-4180-917c-35ed7f2770c2/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c [2020-12-01 17:15:34,433 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_53c687de-088c-4180-917c-35ed7f2770c2/bin/ukojak/data/ee9fedd49/d549dd96d1f246c285bc2abafa113d5b/FLAG2ad4e57fc [2020-12-01 17:15:34,678 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_53c687de-088c-4180-917c-35ed7f2770c2/bin/ukojak/data/ee9fedd49/d549dd96d1f246c285bc2abafa113d5b [2020-12-01 17:15:34,684 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-01 17:15:34,685 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-01 17:15:34,690 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-01 17:15:34,690 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-01 17:15:34,694 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-01 17:15:34,695 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 05:15:34" (1/1) ... [2020-12-01 17:15:34,698 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41630ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:15:34, skipping insertion in model container [2020-12-01 17:15:34,698 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 05:15:34" (1/1) ... [2020-12-01 17:15:34,707 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-01 17:15:34,752 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-01 17:15:35,059 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 17:15:35,071 INFO L203 MainTranslator]: Completed pre-run [2020-12-01 17:15:35,225 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 17:15:35,247 INFO L208 MainTranslator]: Completed translation [2020-12-01 17:15:35,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:15:35 WrapperNode [2020-12-01 17:15:35,248 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-01 17:15:35,250 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-01 17:15:35,250 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-01 17:15:35,250 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-01 17:15:35,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:15:35" (1/1) ... [2020-12-01 17:15:35,279 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:15:35" (1/1) ... [2020-12-01 17:15:35,334 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-01 17:15:35,335 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-01 17:15:35,335 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-01 17:15:35,335 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-01 17:15:35,346 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:15:35" (1/1) ... [2020-12-01 17:15:35,346 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:15:35" (1/1) ... [2020-12-01 17:15:35,353 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:15:35" (1/1) ... [2020-12-01 17:15:35,353 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:15:35" (1/1) ... [2020-12-01 17:15:35,364 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:15:35" (1/1) ... [2020-12-01 17:15:35,374 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:15:35" (1/1) ... [2020-12-01 17:15:35,379 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:15:35" (1/1) ... [2020-12-01 17:15:35,385 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-01 17:15:35,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-01 17:15:35,386 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-01 17:15:35,387 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-01 17:15:35,388 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:15:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53c687de-088c-4180-917c-35ed7f2770c2/bin/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 [2020-12-01 17:15:35,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-01 17:15:35,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-01 17:15:35,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-01 17:15:35,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-01 17:15:39,135 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-01 17:15:39,135 INFO L298 CfgBuilder]: Removed 21 assume(true) statements. [2020-12-01 17:15:39,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:15:39 BoogieIcfgContainer [2020-12-01 17:15:39,139 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-01 17:15:39,140 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2020-12-01 17:15:39,141 INFO L271 PluginConnector]: Initializing CodeCheck... [2020-12-01 17:15:39,154 INFO L275 PluginConnector]: CodeCheck initialized [2020-12-01 17:15:39,155 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:15:39" (1/1) ... [2020-12-01 17:15:39,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:15:39,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:15:39,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 18 states and 29 transitions. [2020-12-01 17:15:39,220 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 29 transitions. [2020-12-01 17:15:39,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-12-01 17:15:39,224 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:15:39,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:15:39,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:15:40,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:15:40,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 19 states and 31 transitions. [2020-12-01 17:15:40,065 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 31 transitions. [2020-12-01 17:15:40,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-01 17:15:40,066 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:15:40,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:15:40,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:15:40,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:15:40,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 22 states and 37 transitions. [2020-12-01 17:15:40,641 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 37 transitions. [2020-12-01 17:15:40,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-01 17:15:40,644 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:15:40,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:15:40,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:15:41,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:15:41,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 26 states and 45 transitions. [2020-12-01 17:15:41,435 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 45 transitions. [2020-12-01 17:15:41,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-01 17:15:41,436 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:15:41,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:15:41,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:15:42,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:15:42,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 31 states and 55 transitions. [2020-12-01 17:15:42,445 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 55 transitions. [2020-12-01 17:15:42,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-01 17:15:42,446 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:15:42,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:15:42,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:15:43,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:15:43,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 38 states and 67 transitions. [2020-12-01 17:15:43,679 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 67 transitions. [2020-12-01 17:15:43,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-01 17:15:43,681 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:15:43,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:15:44,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:15:45,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:15:45,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 44 states and 78 transitions. [2020-12-01 17:15:45,405 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 78 transitions. [2020-12-01 17:15:45,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-01 17:15:45,406 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:15:45,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:15:45,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:15:45,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:15:45,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 45 states and 78 transitions. [2020-12-01 17:15:45,776 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 78 transitions. [2020-12-01 17:15:45,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-01 17:15:45,777 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:15:45,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:15:45,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:15:45,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:15:45,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 46 states and 79 transitions. [2020-12-01 17:15:45,856 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 79 transitions. [2020-12-01 17:15:45,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-01 17:15:45,857 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:15:45,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:15:46,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:15:48,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:15:48,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 56 states and 95 transitions. [2020-12-01 17:15:48,200 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 95 transitions. [2020-12-01 17:15:48,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-01 17:15:48,201 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:15:48,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:15:48,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:15:48,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:15:48,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 59 states and 106 transitions. [2020-12-01 17:15:48,839 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 106 transitions. [2020-12-01 17:15:48,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-01 17:15:48,840 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:15:49,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:15:49,898 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:15:55,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:15:55,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 74 states and 133 transitions. [2020-12-01 17:15:55,214 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 133 transitions. [2020-12-01 17:15:55,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-01 17:15:55,216 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:15:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:15:55,783 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:16:01,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:16:01,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 90 states and 162 transitions. [2020-12-01 17:16:01,278 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 162 transitions. [2020-12-01 17:16:01,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-01 17:16:01,279 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:16:01,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:16:01,418 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:16:01,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:16:01,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 91 states and 164 transitions. [2020-12-01 17:16:01,898 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 164 transitions. [2020-12-01 17:16:01,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-01 17:16:01,900 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:16:01,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:16:02,589 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:16:08,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:16:08,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 104 states and 187 transitions. [2020-12-01 17:16:08,116 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 187 transitions. [2020-12-01 17:16:08,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-01 17:16:08,118 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:16:08,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:16:08,247 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:16:08,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:16:08,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 105 states and 191 transitions. [2020-12-01 17:16:08,961 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 191 transitions. [2020-12-01 17:16:08,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-01 17:16:08,966 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:16:09,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:16:09,118 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:16:09,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:16:09,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 106 states and 192 transitions. [2020-12-01 17:16:09,633 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 192 transitions. [2020-12-01 17:16:09,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-01 17:16:09,634 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:16:09,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:16:10,294 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:16:16,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:16:16,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 119 states and 216 transitions. [2020-12-01 17:16:16,717 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 216 transitions. [2020-12-01 17:16:16,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-01 17:16:16,718 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:16:16,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:16:16,849 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:16:19,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:16:19,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 122 states and 225 transitions. [2020-12-01 17:16:19,404 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 225 transitions. [2020-12-01 17:16:19,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-01 17:16:19,405 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:16:19,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:16:19,545 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:16:20,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:16:20,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 123 states and 229 transitions. [2020-12-01 17:16:20,308 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 229 transitions. [2020-12-01 17:16:20,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-01 17:16:20,308 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:16:20,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:16:20,418 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:16:21,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:16:21,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 124 states and 230 transitions. [2020-12-01 17:16:21,166 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 230 transitions. [2020-12-01 17:16:21,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-01 17:16:21,167 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:16:21,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:16:22,720 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:16:23,338 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2020-12-01 17:16:25,634 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2020-12-01 17:16:27,513 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2020-12-01 17:16:28,612 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2020-12-01 17:16:34,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:16:34,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 143 states and 262 transitions. [2020-12-01 17:16:34,423 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 262 transitions. [2020-12-01 17:16:34,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-01 17:16:34,424 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:16:34,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:16:35,132 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:16:38,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:16:38,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 148 states and 271 transitions. [2020-12-01 17:16:38,677 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 271 transitions. [2020-12-01 17:16:38,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-01 17:16:38,677 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:16:38,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:16:39,649 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2020-12-01 17:16:40,297 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:16:41,435 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2020-12-01 17:16:42,199 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2020-12-01 17:16:43,200 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2020-12-01 17:16:43,412 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2020-12-01 17:16:48,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:16:48,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 154 states and 285 transitions. [2020-12-01 17:16:48,953 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 285 transitions. [2020-12-01 17:16:48,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-12-01 17:16:48,954 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:16:49,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:16:51,263 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:16:52,484 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2020-12-01 17:16:53,699 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2020-12-01 17:16:53,910 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2020-12-01 17:16:55,055 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2020-12-01 17:16:55,280 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2020-12-01 17:16:56,549 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2020-12-01 17:16:57,179 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2020-12-01 17:16:58,757 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2020-12-01 17:17:00,098 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2020-12-01 17:17:11,938 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2020-12-01 17:17:13,189 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2020-12-01 17:17:13,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:17:13,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 168 states and 334 transitions. [2020-12-01 17:17:13,828 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 334 transitions. [2020-12-01 17:17:13,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-01 17:17:13,829 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:17:13,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:17:15,370 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:17:16,812 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 34 [2020-12-01 17:17:18,389 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2020-12-01 17:17:19,177 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2020-12-01 17:17:19,480 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2020-12-01 17:17:21,107 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2020-12-01 17:17:30,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:17:30,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 180 states and 358 transitions. [2020-12-01 17:17:30,370 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 358 transitions. [2020-12-01 17:17:30,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-01 17:17:30,371 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:17:30,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:17:32,697 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:17:35,234 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2020-12-01 17:17:36,585 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-12-01 17:17:36,827 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2020-12-01 17:17:38,331 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2020-12-01 17:17:39,850 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2020-12-01 17:17:47,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:17:47,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 189 states and 375 transitions. [2020-12-01 17:17:47,598 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 375 transitions. [2020-12-01 17:17:47,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-01 17:17:47,599 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:17:47,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:17:52,613 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:17:54,348 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2020-12-01 17:17:55,492 WARN L197 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2020-12-01 17:17:57,507 WARN L197 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2020-12-01 17:17:57,931 WARN L197 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2020-12-01 17:17:59,411 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2020-12-01 17:18:00,864 WARN L197 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2020-12-01 17:18:01,924 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2020-12-01 17:18:03,110 WARN L197 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2020-12-01 17:18:04,786 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2020-12-01 17:18:05,857 WARN L197 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2020-12-01 17:18:14,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:18:14,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 202 states and 400 transitions. [2020-12-01 17:18:14,287 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 400 transitions. [2020-12-01 17:18:14,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-01 17:18:14,287 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:18:14,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:18:16,807 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:18:19,650 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2020-12-01 17:18:21,302 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2020-12-01 17:18:22,995 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2020-12-01 17:18:24,672 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2020-12-01 17:18:31,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:18:31,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 207 states and 409 transitions. [2020-12-01 17:18:31,855 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 409 transitions. [2020-12-01 17:18:31,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-01 17:18:31,857 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:18:31,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:18:32,025 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:18:32,461 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2020-12-01 17:18:32,903 WARN L197 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 33 [2020-12-01 17:18:36,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:18:36,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 209 states and 414 transitions. [2020-12-01 17:18:36,625 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 414 transitions. [2020-12-01 17:18:36,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-01 17:18:36,626 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:18:36,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:18:39,628 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:18:42,609 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2020-12-01 17:18:44,509 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2020-12-01 17:18:48,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:18:48,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 210 states and 419 transitions. [2020-12-01 17:18:48,218 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 419 transitions. [2020-12-01 17:18:48,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-01 17:18:48,219 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:18:48,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:18:48,584 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:18:48,976 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2020-12-01 17:18:58,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:18:58,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 215 states and 433 transitions. [2020-12-01 17:18:58,986 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 433 transitions. [2020-12-01 17:18:58,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-01 17:18:58,987 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:18:59,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:19:00,363 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:19:01,946 WARN L197 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2020-12-01 17:19:03,582 WARN L197 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2020-12-01 17:19:05,950 WARN L197 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2020-12-01 17:19:08,384 WARN L197 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2020-12-01 17:19:10,478 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2020-12-01 17:19:13,478 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2020-12-01 17:19:15,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:19:15,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 219 states and 449 transitions. [2020-12-01 17:19:15,801 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 449 transitions. [2020-12-01 17:19:15,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-01 17:19:15,802 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:19:16,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:19:16,312 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:19:16,792 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2020-12-01 17:19:17,391 WARN L197 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2020-12-01 17:19:19,185 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2020-12-01 17:19:19,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:19:19,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 220 states and 453 transitions. [2020-12-01 17:19:19,290 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 453 transitions. [2020-12-01 17:19:19,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-01 17:19:19,290 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:19:19,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:19:19,791 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:19:22,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:19:22,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 221 states and 454 transitions. [2020-12-01 17:19:22,481 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 454 transitions. [2020-12-01 17:19:22,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-12-01 17:19:22,482 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:19:23,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 17:19:23,712 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 17:19:25,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 17:19:25,120 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 17:19:26,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 17:19:26,230 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 17:19:27,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 17:19:27,346 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 17:19:52,409 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 35 iterations. [2020-12-01 17:19:52,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 01.12 05:19:52 ImpRootNode [2020-12-01 17:19:52,661 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2020-12-01 17:19:52,661 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-01 17:19:52,662 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-01 17:19:52,662 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-01 17:19:52,663 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:15:39" (3/4) ... [2020-12-01 17:19:52,666 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-01 17:19:52,850 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_53c687de-088c-4180-917c-35ed7f2770c2/bin/ukojak/witness.graphml [2020-12-01 17:19:52,850 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-01 17:19:52,851 INFO L168 Benchmark]: Toolchain (without parser) took 258165.68 ms. Allocated memory was 115.3 MB in the beginning and 880.8 MB in the end (delta: 765.5 MB). Free memory was 83.3 MB in the beginning and 325.2 MB in the end (delta: -241.9 MB). Peak memory consumption was 523.0 MB. Max. memory is 16.1 GB. [2020-12-01 17:19:52,852 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 77.6 MB. Free memory was 37.6 MB in the beginning and 37.5 MB in the end (delta: 63.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-01 17:19:52,852 INFO L168 Benchmark]: CACSL2BoogieTranslator took 558.87 ms. Allocated memory is still 115.3 MB. Free memory was 83.0 MB in the beginning and 86.1 MB in the end (delta: -3.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-12-01 17:19:52,853 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.35 ms. Allocated memory is still 115.3 MB. Free memory was 86.1 MB in the beginning and 83.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-01 17:19:52,853 INFO L168 Benchmark]: Boogie Preprocessor took 50.81 ms. Allocated memory is still 115.3 MB. Free memory was 83.4 MB in the beginning and 80.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-01 17:19:52,854 INFO L168 Benchmark]: RCFGBuilder took 3753.14 ms. Allocated memory was 115.3 MB in the beginning and 209.7 MB in the end (delta: 94.4 MB). Free memory was 80.5 MB in the beginning and 146.0 MB in the end (delta: -65.5 MB). Peak memory consumption was 81.9 MB. Max. memory is 16.1 GB. [2020-12-01 17:19:52,855 INFO L168 Benchmark]: CodeCheck took 253520.55 ms. Allocated memory was 209.7 MB in the beginning and 880.8 MB in the end (delta: 671.1 MB). Free memory was 146.0 MB in the beginning and 347.2 MB in the end (delta: -201.2 MB). Peak memory consumption was 470.9 MB. Max. memory is 16.1 GB. [2020-12-01 17:19:52,855 INFO L168 Benchmark]: Witness Printer took 189.03 ms. Allocated memory is still 880.8 MB. Free memory was 347.2 MB in the beginning and 325.2 MB in the end (delta: 22.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2020-12-01 17:19:52,858 INFO L339 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, 18 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 253.2s, OverallIterations: 35, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1744830464 SDtfs, 1962983920 SDslu, 1610612736 SDs, 0 SdLazy, 1863419880 SolverSat, 1589266244 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 112.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8233 GetRequests, 7129 SyntacticMatches, 370 SemanticMatches, 734 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315191 ImplicationChecksByTransitivity, 205.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.2s SsaConstructionTime, 5.2s SatisfiabilityAnalysisTime, 25.0s InterpolantComputationTime, 844 NumberOfCodeBlocks, 844 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 765 ConstructedInterpolants, 0 QuantifiedInterpolants, 216118 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 10 PerfectInterpolantSequences, 84/421 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L28] msg_t nomsg = (msg_t )-1; [L29] port_t p12 ; [L30] char p12_old ; [L31] char p12_new ; [L32] _Bool ep12 ; [L33] port_t p13 ; [L34] char p13_old ; [L35] char p13_new ; [L36] _Bool ep13 ; [L37] port_t p21 ; [L38] char p21_old ; [L39] char p21_new ; [L40] _Bool ep21 ; [L41] port_t p23 ; [L42] char p23_old ; [L43] char p23_new ; [L44] _Bool ep23 ; [L45] port_t p31 ; [L46] char p31_old ; [L47] char p31_new ; [L48] _Bool ep31 ; [L49] port_t p32 ; [L50] char p32_old ; [L51] char p32_new ; [L52] _Bool ep32 ; [L53] char id1 ; [L54] unsigned char r1 ; [L55] char st1 ; [L56] char nl1 ; [L57] char m1 ; [L58] char max1 ; [L59] _Bool mode1 ; [L60] _Bool newmax1 ; [L61] char id2 ; [L62] unsigned char r2 ; [L63] char st2 ; [L64] char nl2 ; [L65] char m2 ; [L66] char max2 ; [L67] _Bool mode2 ; [L68] _Bool newmax2 ; [L69] char id3 ; [L70] unsigned char r3 ; [L71] char st3 ; [L72] char nl3 ; [L73] char m3 ; [L74] char max3 ; [L75] _Bool mode3 ; [L76] _Bool newmax3 ; [L528] int c1 ; [L529] int i2 ; [L532] c1 = 0 [L533] ep12 = __VERIFIER_nondet_bool() [L534] ep13 = __VERIFIER_nondet_bool() [L535] ep21 = __VERIFIER_nondet_bool() [L536] ep23 = __VERIFIER_nondet_bool() [L537] ep31 = __VERIFIER_nondet_bool() [L538] ep32 = __VERIFIER_nondet_bool() [L539] id1 = __VERIFIER_nondet_char() [L540] r1 = __VERIFIER_nondet_uchar() [L541] st1 = __VERIFIER_nondet_char() [L542] nl1 = __VERIFIER_nondet_char() [L543] m1 = __VERIFIER_nondet_char() [L544] max1 = __VERIFIER_nondet_char() [L545] mode1 = __VERIFIER_nondet_bool() [L546] newmax1 = __VERIFIER_nondet_bool() [L547] id2 = __VERIFIER_nondet_char() [L548] r2 = __VERIFIER_nondet_uchar() [L549] st2 = __VERIFIER_nondet_char() [L550] nl2 = __VERIFIER_nondet_char() [L551] m2 = __VERIFIER_nondet_char() [L552] max2 = __VERIFIER_nondet_char() [L553] mode2 = __VERIFIER_nondet_bool() [L554] newmax2 = __VERIFIER_nondet_bool() [L555] id3 = __VERIFIER_nondet_char() [L556] r3 = __VERIFIER_nondet_uchar() [L557] st3 = __VERIFIER_nondet_char() [L558] nl3 = __VERIFIER_nondet_char() [L559] m3 = __VERIFIER_nondet_char() [L560] max3 = __VERIFIER_nondet_char() [L561] mode3 = __VERIFIER_nondet_bool() [L562] newmax3 = __VERIFIER_nondet_bool() [L241] _Bool r121 ; [L242] _Bool r131 ; [L243] _Bool r211 ; [L244] _Bool r231 ; [L245] _Bool r311 ; [L246] _Bool r321 ; [L247] _Bool r122 ; [L248] int tmp ; [L249] _Bool r132 ; [L250] int tmp___0 ; [L251] _Bool r212 ; [L252] int tmp___1 ; [L253] _Bool r232 ; [L254] int tmp___2 ; [L255] _Bool r312 ; [L256] int tmp___3 ; [L257] _Bool r322 ; [L258] int tmp___4 ; [L259] int tmp___5 ; [L262] r121 = ep12 [L263] r131 = ep13 [L264] r211 = ep21 [L265] r231 = ep23 [L266] r311 = ep31 [L267] r321 = ep32 [L268] COND FALSE !(\read(r121)) [L271] COND TRUE \read(r131) [L272] COND TRUE \read(ep32) [L273] tmp = 1 [L280] r122 = (_Bool )tmp [L281] COND TRUE \read(r131) [L282] tmp___0 = 1 [L293] r132 = (_Bool )tmp___0 [L294] COND TRUE \read(r211) [L295] tmp___1 = 1 [L306] r212 = (_Bool )tmp___1 [L307] COND FALSE !(\read(r231)) [L310] COND TRUE \read(r211) [L311] COND TRUE \read(ep13) [L312] tmp___2 = 1 [L319] r232 = (_Bool )tmp___2 [L320] COND FALSE !(\read(r311)) [L323] COND TRUE \read(r321) [L324] COND TRUE \read(ep21) [L325] tmp___3 = 1 [L332] r312 = (_Bool )tmp___3 [L333] COND TRUE \read(r321) [L334] tmp___4 = 1 [L345] r322 = (_Bool )tmp___4 [L346] COND TRUE (int )id1 != (int )id2 [L347] COND TRUE (int )id1 != (int )id3 [L348] COND TRUE (int )id2 != (int )id3 [L349] COND TRUE (int )id1 >= 0 [L350] COND TRUE (int )id2 >= 0 [L351] COND TRUE (int )id3 >= 0 [L352] COND TRUE (int )r1 == 0 [L353] COND TRUE (int )r2 == 0 [L354] COND TRUE (int )r3 == 0 [L355] COND TRUE \read(r122) [L356] COND TRUE \read(r132) [L357] COND TRUE \read(r212) [L358] COND TRUE \read(r232) [L359] COND TRUE \read(r312) [L360] COND TRUE \read(r322) [L361] COND TRUE (int )max1 == (int )id1 [L362] COND TRUE (int )max2 == (int )id2 [L363] COND TRUE (int )max3 == (int )id3 [L364] COND TRUE (int )st1 == 0 [L365] COND TRUE (int )st2 == 0 [L366] COND TRUE (int )st3 == 0 [L367] COND TRUE (int )nl1 == 0 [L368] COND TRUE (int )nl2 == 0 [L369] COND TRUE (int )nl3 == 0 [L370] COND TRUE (int )mode1 == 0 [L371] COND TRUE (int )mode2 == 0 [L372] COND TRUE (int )mode3 == 0 [L373] COND TRUE \read(newmax1) [L374] COND TRUE \read(newmax2) [L375] COND TRUE \read(newmax3) [L376] tmp___5 = 1 [L467] return (tmp___5); [L563] i2 = init() [L22] COND FALSE !(!cond) [L565] p12_old = nomsg [L566] p12_new = nomsg [L567] p13_old = nomsg [L568] p13_new = nomsg [L569] p21_old = nomsg [L570] p21_new = nomsg [L571] p23_old = nomsg [L572] p23_new = nomsg [L573] p31_old = nomsg [L574] p31_new = nomsg [L575] p32_old = nomsg [L576] p32_new = nomsg [L577] i2 = 0 VAL [ep12=0, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=1, id2=3, id3=2, m1=2, m2=4, m3=0, max1=1, max2=3, max3=2, mode1=0, mode2=0, mode3=0, newmax1=255, newmax2=255, newmax3=1, 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] [L578] COND TRUE 1 [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND FALSE !(\read(mode1)) [L114] COND TRUE (int )r1 < 1 [L115] COND FALSE !(\read(ep12)) [L120] COND TRUE \read(ep13) [L121] COND TRUE \read(newmax1) [L122] EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L122] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L126] mode1 = (_Bool)1 [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND FALSE !(\read(mode2)) [L168] COND TRUE (int )r2 < 2 [L169] COND TRUE \read(ep21) [L170] COND TRUE \read(newmax2) [L171] EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L171] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L174] COND FALSE !(\read(ep23)) [L180] mode2 = (_Bool)1 [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND FALSE !(\read(mode3)) [L222] COND TRUE (int )r3 < 2 [L223] COND FALSE !(\read(ep31)) [L228] COND TRUE \read(ep32) [L229] COND TRUE \read(newmax3) [L230] EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L230] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L234] mode3 = (_Bool)1 [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L472] int tmp ; VAL [ep12=0, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=1, id2=3, id3=2, m1=2, m2=4, m3=0, max1=1, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=1, 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=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=1, id2=3, id3=2, m1=2, m2=4, m3=0, max1=1, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=1, 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=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=1, id2=3, id3=2, m1=2, m2=4, m3=0, max1=1, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=1, 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=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=1, id2=3, id3=2, m1=2, m2=4, m3=0, max1=1, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=1, 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=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=1, id2=3, id3=2, m1=2, m2=4, m3=0, max1=1, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=1, 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=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=1, id2=3, id3=2, m1=2, m2=4, m3=0, max1=1, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=1, 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=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=1, id2=3, id3=2, m1=2, m2=4, m3=0, max1=1, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=1, 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=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=1, id2=3, id3=2, m1=2, m2=4, m3=0, max1=1, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=1, 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=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L489] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=1, id2=3, id3=2, m1=2, m2=4, m3=0, max1=1, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=1, 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=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L492] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=1, id2=3, id3=2, m1=2, m2=4, m3=0, max1=1, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=1, 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=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L494] COND TRUE (int )r1 < 2 [L495] tmp = 1 VAL [ep12=0, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=1, id2=3, id3=2, m1=2, m2=4, m3=0, max1=1, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=1, 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=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L523] return (tmp); [L595] c1 = check() [L607] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=1, id2=3, id3=2, m1=2, m2=4, m3=0, max1=1, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=1, 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=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L578] COND TRUE 1 [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND TRUE \read(mode1) [L84] COND FALSE !(r1 == 255) [L87] r1 = r1 + 1 [L88] COND TRUE \read(ep21) [L89] m1 = p21_old [L90] p21_old = nomsg [L91] COND TRUE (int )m1 > (int )max1 [L92] max1 = m1 [L93] newmax = (_Bool)1 [L96] COND FALSE !(\read(ep31)) [L104] newmax1 = newmax [L105] COND FALSE !((int )r1 == 2) [L112] mode1 = (_Bool)0 [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND TRUE \read(mode2) [L138] COND FALSE !(r2 == 255) [L141] r2 = r2 + 1 [L142] COND FALSE !(\read(ep12)) [L150] COND TRUE \read(ep32) [L151] m2 = p32_old [L152] p32_old = nomsg [L153] COND FALSE !((int )m2 > (int )max2) [L158] newmax2 = newmax [L159] COND FALSE !((int )r2 == 2) [L166] mode2 = (_Bool)0 [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND TRUE \read(mode3) [L192] COND FALSE !(r3 == 255) [L195] r3 = r3 + 1 [L196] COND TRUE \read(ep13) [L197] m3 = p13_old [L198] p13_old = nomsg [L199] COND FALSE !((int )m3 > (int )max3) [L204] COND FALSE !(\read(ep23)) [L212] newmax3 = newmax [L213] COND FALSE !((int )r3 == 2) [L220] mode3 = (_Bool)0 [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L472] int tmp ; VAL [ep12=0, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=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] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=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] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=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] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=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] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=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 FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=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 )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=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] [L484] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=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] [L489] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=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] [L492] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=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] [L494] COND TRUE (int )r1 < 2 [L495] tmp = 1 VAL [ep12=0, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=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] [L523] return (tmp); [L595] c1 = check() [L607] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=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] [L578] COND TRUE 1 [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND FALSE !(\read(mode1)) [L114] COND FALSE !((int )r1 < 1) [L126] mode1 = (_Bool)1 [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND FALSE !(\read(mode2)) [L168] COND TRUE (int )r2 < 2 [L169] COND TRUE \read(ep21) [L170] COND FALSE !(\read(newmax2)) [L174] COND FALSE !(\read(ep23)) [L180] mode2 = (_Bool)1 [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND FALSE !(\read(mode3)) [L222] COND TRUE (int )r3 < 2 [L223] COND FALSE !(\read(ep31)) [L228] COND TRUE \read(ep32) [L229] COND FALSE !(\read(newmax3)) [L234] mode3 = (_Bool)1 [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L472] int tmp ; VAL [ep12=0, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=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] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=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] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=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] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=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] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=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 FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=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 )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=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] [L484] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=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] [L489] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=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] [L492] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=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] [L494] COND TRUE (int )r1 < 2 [L495] tmp = 1 VAL [ep12=0, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=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] [L523] return (tmp); [L595] c1 = check() [L607] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=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] [L578] COND TRUE 1 [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND TRUE \read(mode1) [L84] COND FALSE !(r1 == 255) [L87] r1 = r1 + 1 [L88] COND TRUE \read(ep21) [L89] m1 = p21_old [L90] p21_old = nomsg [L91] COND FALSE !((int )m1 > (int )max1) [L96] COND FALSE !(\read(ep31)) [L104] newmax1 = newmax [L105] COND TRUE (int )r1 == 2 [L106] COND FALSE !((int )max1 == (int )id1) [L109] nl1 = (char)1 [L112] mode1 = (_Bool)0 [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND TRUE \read(mode2) [L138] COND FALSE !(r2 == 255) [L141] r2 = r2 + 1 [L142] COND FALSE !(\read(ep12)) [L150] COND TRUE \read(ep32) [L151] m2 = p32_old [L152] p32_old = nomsg [L153] COND FALSE !((int )m2 > (int )max2) [L158] newmax2 = newmax [L159] COND TRUE (int )r2 == 2 [L160] COND TRUE (int )max2 == (int )id2 [L161] st2 = (char)1 [L166] mode2 = (_Bool)0 [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND TRUE \read(mode3) [L192] COND FALSE !(r3 == 255) [L195] r3 = r3 + 1 [L196] COND TRUE \read(ep13) [L197] m3 = p13_old [L198] p13_old = nomsg [L199] COND FALSE !((int )m3 > (int )max3) [L204] COND FALSE !(\read(ep23)) [L212] newmax3 = newmax [L213] COND TRUE (int )r3 == 2 [L214] COND TRUE (int )max3 == (int )id3 [L215] st3 = (char)1 [L220] mode3 = (_Bool)0 [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L472] int tmp ; VAL [ep12=0, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=1, id2=3, id3=2, m1=-1, m2=-1, m3=-1, max1=3, max2=3, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, 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=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L475] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L521] tmp = 0 VAL [ep12=0, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=1, id2=3, id3=2, m1=-1, m2=-1, m3=-1, max1=3, max2=3, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, 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=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L523] return (tmp); [L595] c1 = check() [L607] COND TRUE ! arg VAL [ep12=0, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=1, id2=3, id3=2, m1=-1, m2=-1, m3=-1, max1=3, max2=3, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, 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=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L3] __assert_fail("0", "pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c", 3, "reach_error") VAL [ep12=0, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=1, id2=3, id3=2, m1=-1, m2=-1, m3=-1, max1=3, max2=3, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, 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=2, r2=2, r3=2, st1=0, st2=1, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33 ms. Allocated memory is still 77.6 MB. Free memory was 37.6 MB in the beginning and 37.5 MB in the end (delta: 63.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 558.87 ms. Allocated memory is still 115.3 MB. Free memory was 83.0 MB in the beginning and 86.1 MB in the end (delta: -3.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 84.35 ms. Allocated memory is still 115.3 MB. Free memory was 86.1 MB in the beginning and 83.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 50.81 ms. Allocated memory is still 115.3 MB. Free memory was 83.4 MB in the beginning and 80.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3753.14 ms. Allocated memory was 115.3 MB in the beginning and 209.7 MB in the end (delta: 94.4 MB). Free memory was 80.5 MB in the beginning and 146.0 MB in the end (delta: -65.5 MB). Peak memory consumption was 81.9 MB. Max. memory is 16.1 GB. * CodeCheck took 253520.55 ms. Allocated memory was 209.7 MB in the beginning and 880.8 MB in the end (delta: 671.1 MB). Free memory was 146.0 MB in the beginning and 347.2 MB in the end (delta: -201.2 MB). Peak memory consumption was 470.9 MB. Max. memory is 16.1 GB. * Witness Printer took 189.03 ms. Allocated memory is still 880.8 MB. Free memory was 347.2 MB in the beginning and 325.2 MB in the end (delta: 22.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...