./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.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_8c2141ce-3ab9-4cb4-b75d-9a0eacfd901b/bin/ukojak/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_8c2141ce-3ab9-4cb4-b75d-9a0eacfd901b/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8c2141ce-3ab9-4cb4-b75d-9a0eacfd901b/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8c2141ce-3ab9-4cb4-b75d-9a0eacfd901b/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_8c2141ce-3ab9-4cb4-b75d-9a0eacfd901b/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8c2141ce-3ab9-4cb4-b75d-9a0eacfd901b/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 3b6bb83e9069fd445b2fecdf306b1585c7d1cde8 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 16:58:01,569 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-01 16:58:01,575 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-01 16:58:01,653 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-01 16:58:01,654 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-01 16:58:01,656 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-01 16:58:01,659 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-01 16:58:01,663 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-01 16:58:01,666 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-01 16:58:01,668 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-01 16:58:01,670 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-01 16:58:01,672 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-01 16:58:01,673 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-01 16:58:01,675 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-01 16:58:01,677 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-01 16:58:01,679 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-01 16:58:01,681 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-01 16:58:01,683 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-01 16:58:01,686 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-01 16:58:01,689 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-01 16:58:01,692 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-01 16:58:01,694 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-01 16:58:01,696 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-01 16:58:01,698 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-01 16:58:01,702 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-01 16:58:01,703 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-01 16:58:01,704 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-01 16:58:01,706 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-01 16:58:01,707 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-01 16:58:01,708 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-01 16:58:01,709 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-01 16:58:01,711 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-01 16:58:01,712 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-01 16:58:01,714 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-01 16:58:01,715 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-01 16:58:01,716 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-01 16:58:01,718 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-01 16:58:01,718 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-01 16:58:01,719 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-01 16:58:01,721 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-01 16:58:01,722 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-01 16:58:01,723 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8c2141ce-3ab9-4cb4-b75d-9a0eacfd901b/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2020-12-01 16:58:01,755 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-01 16:58:01,756 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-01 16:58:01,757 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-01 16:58:01,757 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2020-12-01 16:58:01,768 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-01 16:58:01,768 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-01 16:58:01,769 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-01 16:58:01,769 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-01 16:58:01,769 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-01 16:58:01,770 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-01 16:58:01,771 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-01 16:58:01,771 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-01 16:58:01,772 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-01 16:58:01,772 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-01 16:58:01,772 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-01 16:58:01,772 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-01 16:58:01,773 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-01 16:58:01,773 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-01 16:58:01,773 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2020-12-01 16:58:01,773 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2020-12-01 16:58:01,774 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-01 16:58:01,774 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-01 16:58:01,774 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2020-12-01 16:58:01,775 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-01 16:58:01,775 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-01 16:58:01,776 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-01 16:58:01,776 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2020-12-01 16:58:01,776 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-01 16:58:01,776 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-01 16:58:01,778 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_8c2141ce-3ab9-4cb4-b75d-9a0eacfd901b/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_8c2141ce-3ab9-4cb4-b75d-9a0eacfd901b/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 -> 3b6bb83e9069fd445b2fecdf306b1585c7d1cde8 [2020-12-01 16:58:02,183 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-01 16:58:02,227 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-01 16:58:02,231 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-01 16:58:02,233 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-01 16:58:02,234 INFO L275 PluginConnector]: CDTParser initialized [2020-12-01 16:58:02,236 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8c2141ce-3ab9-4cb4-b75d-9a0eacfd901b/bin/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c [2020-12-01 16:58:02,346 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8c2141ce-3ab9-4cb4-b75d-9a0eacfd901b/bin/ukojak/data/7118de090/897d0fa445324c2884c4f97b2ed52995/FLAG5cf3eae7d [2020-12-01 16:58:02,975 INFO L306 CDTParser]: Found 1 translation units. [2020-12-01 16:58:02,976 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8c2141ce-3ab9-4cb4-b75d-9a0eacfd901b/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c [2020-12-01 16:58:03,011 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8c2141ce-3ab9-4cb4-b75d-9a0eacfd901b/bin/ukojak/data/7118de090/897d0fa445324c2884c4f97b2ed52995/FLAG5cf3eae7d [2020-12-01 16:58:03,296 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8c2141ce-3ab9-4cb4-b75d-9a0eacfd901b/bin/ukojak/data/7118de090/897d0fa445324c2884c4f97b2ed52995 [2020-12-01 16:58:03,301 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-01 16:58:03,304 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-01 16:58:03,311 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-01 16:58:03,311 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-01 16:58:03,317 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-01 16:58:03,318 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 04:58:03" (1/1) ... [2020-12-01 16:58:03,326 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a0ccb09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:58:03, skipping insertion in model container [2020-12-01 16:58:03,326 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 04:58:03" (1/1) ... [2020-12-01 16:58:03,335 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-01 16:58:03,409 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-01 16:58:03,878 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 16:58:03,902 INFO L203 MainTranslator]: Completed pre-run [2020-12-01 16:58:03,984 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 16:58:04,010 INFO L208 MainTranslator]: Completed translation [2020-12-01 16:58:04,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:58:04 WrapperNode [2020-12-01 16:58:04,012 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-01 16:58:04,014 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-01 16:58:04,014 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-01 16:58:04,014 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-01 16:58:04,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:58:04" (1/1) ... [2020-12-01 16:58:04,038 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:58:04" (1/1) ... [2020-12-01 16:58:04,101 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-01 16:58:04,102 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-01 16:58:04,103 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-01 16:58:04,103 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-01 16:58:04,117 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:58:04" (1/1) ... [2020-12-01 16:58:04,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:58:04" (1/1) ... [2020-12-01 16:58:04,123 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:58:04" (1/1) ... [2020-12-01 16:58:04,123 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:58:04" (1/1) ... [2020-12-01 16:58:04,141 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:58:04" (1/1) ... [2020-12-01 16:58:04,153 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:58:04" (1/1) ... [2020-12-01 16:58:04,157 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:58:04" (1/1) ... [2020-12-01 16:58:04,177 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-01 16:58:04,178 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-01 16:58:04,178 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-01 16:58:04,178 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-01 16:58:04,180 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:58:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c2141ce-3ab9-4cb4-b75d-9a0eacfd901b/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 16:58:04,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-01 16:58:04,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-01 16:58:04,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-01 16:58:04,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-01 16:58:07,933 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-01 16:58:07,933 INFO L298 CfgBuilder]: Removed 19 assume(true) statements. [2020-12-01 16:58:07,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 04:58:07 BoogieIcfgContainer [2020-12-01 16:58:07,937 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-01 16:58:07,938 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2020-12-01 16:58:07,938 INFO L271 PluginConnector]: Initializing CodeCheck... [2020-12-01 16:58:07,952 INFO L275 PluginConnector]: CodeCheck initialized [2020-12-01 16:58:07,952 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 04:58:07" (1/1) ... [2020-12-01 16:58:07,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 16:58:08,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:58:08,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2020-12-01 16:58:08,012 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2020-12-01 16:58:08,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-12-01 16:58:08,016 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:58:08,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:58:08,825 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 16:58:08,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:58:08,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 21 states and 34 transitions. [2020-12-01 16:58:08,943 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2020-12-01 16:58:08,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-01 16:58:08,944 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:58:09,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:58:09,243 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 16:58:09,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:58:09,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 24 states and 42 transitions. [2020-12-01 16:58:09,668 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 42 transitions. [2020-12-01 16:58:09,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-01 16:58:09,671 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:58:09,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:58:10,012 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 16:58:10,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:58:10,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 28 states and 53 transitions. [2020-12-01 16:58:10,950 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 53 transitions. [2020-12-01 16:58:10,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-01 16:58:10,951 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:58:11,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:58:11,215 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 16:58:12,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:58:12,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 33 states and 67 transitions. [2020-12-01 16:58:12,213 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 67 transitions. [2020-12-01 16:58:12,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-01 16:58:12,214 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:58:12,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:58:12,722 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 16:58:13,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:58:13,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 39 states and 81 transitions. [2020-12-01 16:58:13,928 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 81 transitions. [2020-12-01 16:58:13,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-01 16:58:13,929 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:58:13,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:58:14,157 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 16:58:15,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:58:15,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 45 states and 96 transitions. [2020-12-01 16:58:15,801 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 96 transitions. [2020-12-01 16:58:15,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-01 16:58:15,805 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:58:15,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:58:15,944 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 16:58:16,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:58:16,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 46 states and 97 transitions. [2020-12-01 16:58:16,292 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 97 transitions. [2020-12-01 16:58:16,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-01 16:58:16,293 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:58:16,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:58:16,676 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 16:58:18,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:58:18,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 55 states and 111 transitions. [2020-12-01 16:58:18,634 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 111 transitions. [2020-12-01 16:58:18,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-01 16:58:18,636 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:58:18,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:58:18,713 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 16:58:18,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:58:18,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 56 states and 112 transitions. [2020-12-01 16:58:18,894 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 112 transitions. [2020-12-01 16:58:18,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-01 16:58:18,895 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:58:18,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:58:19,180 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 16:58:19,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:58:19,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 59 states and 118 transitions. [2020-12-01 16:58:19,405 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 118 transitions. [2020-12-01 16:58:19,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-01 16:58:19,407 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:58:19,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:58:20,416 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 16:58:25,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:58:25,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 75 states and 157 transitions. [2020-12-01 16:58:25,058 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 157 transitions. [2020-12-01 16:58:25,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-01 16:58:25,060 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:58:25,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:58:25,956 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 16:58:29,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:58:29,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 82 states and 173 transitions. [2020-12-01 16:58:29,491 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 173 transitions. [2020-12-01 16:58:29,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-01 16:58:29,493 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:58:29,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:58:29,630 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 16:58:30,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:58:30,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 83 states and 180 transitions. [2020-12-01 16:58:30,552 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 180 transitions. [2020-12-01 16:58:30,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-01 16:58:30,554 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:58:30,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:58:30,700 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 16:58:31,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:58:31,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 84 states and 181 transitions. [2020-12-01 16:58:31,328 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 181 transitions. [2020-12-01 16:58:31,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-01 16:58:31,330 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:58:31,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:58:32,468 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 16:58:36,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:58:36,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 90 states and 202 transitions. [2020-12-01 16:58:36,435 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 202 transitions. [2020-12-01 16:58:36,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-01 16:58:36,436 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:58:36,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:58:36,878 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 16:58:38,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:58:38,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 93 states and 214 transitions. [2020-12-01 16:58:38,996 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 214 transitions. [2020-12-01 16:58:38,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-01 16:58:38,997 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:58:39,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:58:39,522 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 16:58:40,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:58:40,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 94 states and 216 transitions. [2020-12-01 16:58:40,346 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 216 transitions. [2020-12-01 16:58:40,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-01 16:58:40,347 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:58:40,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:58:41,776 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 16:58:45,930 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2020-12-01 16:58:46,224 WARN L197 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2020-12-01 16:58:50,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:58:50,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 103 states and 244 transitions. [2020-12-01 16:58:50,018 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 244 transitions. [2020-12-01 16:58:50,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-01 16:58:50,019 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:58:50,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:58:50,218 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 16:58:52,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:58:52,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 105 states and 256 transitions. [2020-12-01 16:58:52,252 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 256 transitions. [2020-12-01 16:58:52,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-01 16:58:52,253 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:58:52,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:58:52,460 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 16:58:54,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:58:54,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 107 states and 262 transitions. [2020-12-01 16:58:54,416 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 262 transitions. [2020-12-01 16:58:54,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-01 16:58:54,417 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:58:54,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:58:54,641 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 16:58:55,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:58:55,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 108 states and 268 transitions. [2020-12-01 16:58:55,701 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 268 transitions. [2020-12-01 16:58:55,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-01 16:58:55,702 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:58:55,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:58:55,912 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 16:58:56,273 WARN L197 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2020-12-01 16:58:56,568 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2020-12-01 16:58:57,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:58:57,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 109 states and 272 transitions. [2020-12-01 16:58:57,488 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 272 transitions. [2020-12-01 16:58:57,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-01 16:58:57,490 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:58:57,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:58:59,582 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 16:59:00,329 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2020-12-01 16:59:01,322 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 35 [2020-12-01 16:59:01,928 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2020-12-01 16:59:04,039 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 34 [2020-12-01 16:59:04,338 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2020-12-01 16:59:05,514 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2020-12-01 16:59:06,492 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2020-12-01 16:59:06,795 WARN L197 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2020-12-01 16:59:13,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:59:13,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 129 states and 307 transitions. [2020-12-01 16:59:13,398 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 307 transitions. [2020-12-01 16:59:13,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-01 16:59:13,399 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:59:13,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:59:13,559 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 16:59:14,112 WARN L197 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2020-12-01 16:59:18,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:59:18,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 134 states and 319 transitions. [2020-12-01 16:59:18,920 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 319 transitions. [2020-12-01 16:59:18,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-01 16:59:18,921 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:59:18,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:59:19,077 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 16:59:21,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:59:21,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 136 states and 326 transitions. [2020-12-01 16:59:21,565 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 326 transitions. [2020-12-01 16:59:21,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-01 16:59:21,566 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:59:21,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:59:21,698 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 16:59:25,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:59:25,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 141 states and 338 transitions. [2020-12-01 16:59:25,607 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 338 transitions. [2020-12-01 16:59:25,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-01 16:59:25,608 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:59:25,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:59:25,753 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 16:59:31,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:59:31,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 146 states and 346 transitions. [2020-12-01 16:59:31,450 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 346 transitions. [2020-12-01 16:59:31,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-01 16:59:31,450 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:59:31,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:59:31,594 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 16:59:34,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:59:34,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 148 states and 348 transitions. [2020-12-01 16:59:34,429 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 348 transitions. [2020-12-01 16:59:34,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-01 16:59:34,430 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:59:34,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:59:34,493 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-01 16:59:35,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:59:35,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 148 states and 347 transitions. [2020-12-01 16:59:35,170 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 347 transitions. [2020-12-01 16:59:35,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-01 16:59:35,172 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:59:35,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:59:36,869 WARN L197 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 32 [2020-12-01 16:59:37,856 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 16:59:38,505 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 36 [2020-12-01 16:59:39,222 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 38 [2020-12-01 16:59:40,594 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 39 [2020-12-01 16:59:41,299 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 37 [2020-12-01 16:59:41,546 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 41 [2020-12-01 16:59:42,702 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2020-12-01 16:59:42,998 WARN L197 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2020-12-01 16:59:46,164 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 27 [2020-12-01 16:59:48,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:59:48,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 167 states and 372 transitions. [2020-12-01 16:59:48,773 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 372 transitions. [2020-12-01 16:59:48,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-01 16:59:48,774 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:59:48,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:59:51,734 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:59:52,955 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2020-12-01 16:59:53,706 WARN L197 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2020-12-01 16:59:55,619 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2020-12-01 16:59:56,858 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2020-12-01 17:00:00,721 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2020-12-01 17:00:02,624 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2020-12-01 17:00:06,406 WARN L197 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2020-12-01 17:00:06,794 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2020-12-01 17:00:08,177 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2020-12-01 17:00:09,703 WARN L197 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2020-12-01 17:00:10,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:00:10,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 182 states and 431 transitions. [2020-12-01 17:00:10,806 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 431 transitions. [2020-12-01 17:00:10,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-01 17:00:10,808 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:00:10,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:00:11,012 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:00:11,312 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2020-12-01 17:00:11,616 WARN L197 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2020-12-01 17:00:12,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:00:12,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 187 states and 437 transitions. [2020-12-01 17:00:12,806 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 437 transitions. [2020-12-01 17:00:12,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-01 17:00:12,807 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:00:12,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:00:14,576 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 27 [2020-12-01 17:00:17,930 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:00:20,496 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 26 [2020-12-01 17:00:22,264 WARN L197 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2020-12-01 17:00:23,252 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2020-12-01 17:00:23,667 WARN L197 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2020-12-01 17:00:25,151 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2020-12-01 17:00:25,572 WARN L197 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2020-12-01 17:00:27,116 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2020-12-01 17:00:27,518 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 39 [2020-12-01 17:00:29,091 WARN L197 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2020-12-01 17:00:29,521 WARN L197 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2020-12-01 17:00:33,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:00:33,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 193 states and 455 transitions. [2020-12-01 17:00:33,390 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 455 transitions. [2020-12-01 17:00:33,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-01 17:00:33,391 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:00:33,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:00:35,793 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 26 [2020-12-01 17:00:36,750 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 29 [2020-12-01 17:00:37,644 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 24 [2020-12-01 17:00:38,603 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 26 [2020-12-01 17:00:39,525 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2020-12-01 17:00:39,593 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:00:46,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:00:46,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 194 states and 457 transitions. [2020-12-01 17:00:46,616 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 457 transitions. [2020-12-01 17:00:46,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-01 17:00:46,617 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:00:46,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:00:49,461 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:00:53,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:00:53,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 195 states and 459 transitions. [2020-12-01 17:00:53,900 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 459 transitions. [2020-12-01 17:00:53,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-01 17:00:53,901 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:00:53,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:00:58,574 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:01:00,316 WARN L197 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 30 [2020-12-01 17:01:01,474 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 32 [2020-12-01 17:01:03,255 WARN L197 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2020-12-01 17:01:04,576 WARN L197 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2020-12-01 17:01:08,383 WARN L197 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2020-12-01 17:01:08,727 WARN L197 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2020-12-01 17:01:10,560 WARN L197 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2020-12-01 17:01:10,944 WARN L197 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2020-12-01 17:01:12,880 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2020-12-01 17:01:13,251 WARN L197 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2020-12-01 17:01:15,429 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2020-12-01 17:01:17,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:01:17,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 209 states and 483 transitions. [2020-12-01 17:01:17,090 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 483 transitions. [2020-12-01 17:01:17,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-01 17:01:17,091 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:01:17,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:01:17,420 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:01:17,961 WARN L197 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2020-12-01 17:01:18,483 WARN L197 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2020-12-01 17:01:20,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:01:20,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 214 states and 488 transitions. [2020-12-01 17:01:20,273 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 488 transitions. [2020-12-01 17:01:20,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-01 17:01:20,278 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:01:20,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:01:23,649 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:01:27,403 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 28 [2020-12-01 17:01:29,105 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2020-12-01 17:01:29,395 WARN L197 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 31 [2020-12-01 17:01:30,186 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2020-12-01 17:01:31,265 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 24 [2020-12-01 17:01:32,130 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2020-12-01 17:01:33,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:01:33,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 217 states and 496 transitions. [2020-12-01 17:01:33,906 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 496 transitions. [2020-12-01 17:01:33,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-12-01 17:01:33,908 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:01:34,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 17:01:34,666 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 17:01:36,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 17:01:36,151 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 17:01:37,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 17:01:37,865 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 17:01:40,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 17:01:40,294 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 17:02:02,124 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 39 iterations. [2020-12-01 17:02:02,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 01.12 05:02:02 ImpRootNode [2020-12-01 17:02:02,429 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2020-12-01 17:02:02,430 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-01 17:02:02,431 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-01 17:02:02,431 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-01 17:02:02,432 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 04:58:07" (3/4) ... [2020-12-01 17:02:02,443 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-01 17:02:02,712 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8c2141ce-3ab9-4cb4-b75d-9a0eacfd901b/bin/ukojak/witness.graphml [2020-12-01 17:02:02,712 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-01 17:02:02,713 INFO L168 Benchmark]: Toolchain (without parser) took 239409.14 ms. Allocated memory was 90.2 MB in the beginning and 736.1 MB in the end (delta: 645.9 MB). Free memory was 54.0 MB in the beginning and 389.1 MB in the end (delta: -335.0 MB). Peak memory consumption was 309.6 MB. Max. memory is 16.1 GB. [2020-12-01 17:02:02,714 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 90.2 MB. Free memory is still 70.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-01 17:02:02,714 INFO L168 Benchmark]: CACSL2BoogieTranslator took 701.91 ms. Allocated memory is still 90.2 MB. Free memory was 53.8 MB in the beginning and 61.5 MB in the end (delta: -7.6 MB). Peak memory consumption was 7.7 MB. Max. memory is 16.1 GB. [2020-12-01 17:02:02,714 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.77 ms. Allocated memory is still 90.2 MB. Free memory was 61.5 MB in the beginning and 58.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-01 17:02:02,715 INFO L168 Benchmark]: Boogie Preprocessor took 74.48 ms. Allocated memory is still 90.2 MB. Free memory was 58.6 MB in the beginning and 56.3 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-01 17:02:02,716 INFO L168 Benchmark]: RCFGBuilder took 3758.83 ms. Allocated memory was 90.2 MB in the beginning and 144.7 MB in the end (delta: 54.5 MB). Free memory was 56.2 MB in the beginning and 57.2 MB in the end (delta: -1.1 MB). Peak memory consumption was 66.6 MB. Max. memory is 16.1 GB. [2020-12-01 17:02:02,716 INFO L168 Benchmark]: CodeCheck took 234492.07 ms. Allocated memory was 144.7 MB in the beginning and 736.1 MB in the end (delta: 591.4 MB). Free memory was 57.2 MB in the beginning and 411.1 MB in the end (delta: -353.8 MB). Peak memory consumption was 237.6 MB. Max. memory is 16.1 GB. [2020-12-01 17:02:02,717 INFO L168 Benchmark]: Witness Printer took 281.67 ms. Allocated memory is still 736.1 MB. Free memory was 411.1 MB in the beginning and 389.1 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:02:02,724 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, 19 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 234.1s, OverallIterations: 39, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1533478532 SDtfs, 1397246440 SDslu, -317842182 SDs, 0 SdLazy, 1912209332 SolverSat, -894677954 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 87.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9023 GetRequests, 7904 SyntacticMatches, 463 SemanticMatches, 656 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255711 ImplicationChecksByTransitivity, 190.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.2s SsaConstructionTime, 5.0s SatisfiabilityAnalysisTime, 37.2s InterpolantComputationTime, 923 NumberOfCodeBlocks, 923 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 837 ConstructedInterpolants, 0 QuantifiedInterpolants, 338554 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 11 PerfectInterpolantSequences, 87/366 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: [L24] msg_t nomsg = (msg_t )-1; [L25] port_t p12 ; [L26] char p12_old ; [L27] char p12_new ; [L28] _Bool ep12 ; [L29] port_t p13 ; [L30] char p13_old ; [L31] char p13_new ; [L32] _Bool ep13 ; [L33] port_t p21 ; [L34] char p21_old ; [L35] char p21_new ; [L36] _Bool ep21 ; [L37] port_t p23 ; [L38] char p23_old ; [L39] char p23_new ; [L40] _Bool ep23 ; [L41] port_t p31 ; [L42] char p31_old ; [L43] char p31_new ; [L44] _Bool ep31 ; [L45] port_t p32 ; [L46] char p32_old ; [L47] char p32_new ; [L48] _Bool ep32 ; [L49] char id1 ; [L50] char r1 ; [L51] char st1 ; [L52] char nl1 ; [L53] char m1 ; [L54] char max1 ; [L55] _Bool mode1 ; [L56] char id2 ; [L57] char r2 ; [L58] char st2 ; [L59] char nl2 ; [L60] char m2 ; [L61] char max2 ; [L62] _Bool mode2 ; [L63] char id3 ; [L64] char r3 ; [L65] char st3 ; [L66] char nl3 ; [L67] char m3 ; [L68] char max3 ; [L69] _Bool mode3 ; [L476] int c1 ; [L477] int i2 ; [L480] c1 = 0 [L481] ep12 = __VERIFIER_nondet_bool() [L482] ep13 = __VERIFIER_nondet_bool() [L483] ep21 = __VERIFIER_nondet_bool() [L484] ep23 = __VERIFIER_nondet_bool() [L485] ep31 = __VERIFIER_nondet_bool() [L486] ep32 = __VERIFIER_nondet_bool() [L487] id1 = __VERIFIER_nondet_char() [L488] r1 = __VERIFIER_nondet_char() [L489] st1 = __VERIFIER_nondet_char() [L490] nl1 = __VERIFIER_nondet_char() [L491] m1 = __VERIFIER_nondet_char() [L492] max1 = __VERIFIER_nondet_char() [L493] mode1 = __VERIFIER_nondet_bool() [L494] id2 = __VERIFIER_nondet_char() [L495] r2 = __VERIFIER_nondet_char() [L496] st2 = __VERIFIER_nondet_char() [L497] nl2 = __VERIFIER_nondet_char() [L498] m2 = __VERIFIER_nondet_char() [L499] max2 = __VERIFIER_nondet_char() [L500] mode2 = __VERIFIER_nondet_bool() [L501] id3 = __VERIFIER_nondet_char() [L502] r3 = __VERIFIER_nondet_char() [L503] st3 = __VERIFIER_nondet_char() [L504] nl3 = __VERIFIER_nondet_char() [L505] m3 = __VERIFIER_nondet_char() [L506] max3 = __VERIFIER_nondet_char() [L507] mode3 = __VERIFIER_nondet_bool() [L201] _Bool r121 ; [L202] _Bool r131 ; [L203] _Bool r211 ; [L204] _Bool r231 ; [L205] _Bool r311 ; [L206] _Bool r321 ; [L207] _Bool r122 ; [L208] int tmp ; [L209] _Bool r132 ; [L210] int tmp___0 ; [L211] _Bool r212 ; [L212] int tmp___1 ; [L213] _Bool r232 ; [L214] int tmp___2 ; [L215] _Bool r312 ; [L216] int tmp___3 ; [L217] _Bool r322 ; [L218] int tmp___4 ; [L219] int tmp___5 ; [L222] r121 = ep12 [L223] r131 = ep13 [L224] r211 = ep21 [L225] r231 = ep23 [L226] r311 = ep31 [L227] r321 = ep32 [L228] COND TRUE \read(r121) [L229] tmp = 1 [L240] r122 = (_Bool )tmp [L241] COND FALSE !(\read(r131)) [L244] COND TRUE \read(r121) [L245] COND TRUE \read(ep23) [L246] tmp___0 = 1 [L253] r132 = (_Bool )tmp___0 [L254] COND TRUE \read(r211) [L255] tmp___1 = 1 [L266] r212 = (_Bool )tmp___1 [L267] COND TRUE \read(r231) [L268] tmp___2 = 1 [L279] r232 = (_Bool )tmp___2 [L280] COND TRUE \read(r311) [L281] tmp___3 = 1 [L292] r312 = (_Bool )tmp___3 [L293] COND FALSE !(\read(r321)) [L296] COND TRUE \read(r311) [L297] COND TRUE \read(ep12) [L298] tmp___4 = 1 [L305] r322 = (_Bool )tmp___4 [L306] COND TRUE (int )id1 != (int )id2 [L307] COND TRUE (int )id1 != (int )id3 [L308] COND TRUE (int )id2 != (int )id3 [L309] COND TRUE (int )id1 >= 0 [L310] COND TRUE (int )id2 >= 0 [L311] COND TRUE (int )id3 >= 0 [L312] COND TRUE (int )r1 == 0 [L313] COND TRUE (int )r2 == 0 [L314] COND TRUE (int )r3 == 0 [L315] COND TRUE \read(r122) [L316] COND TRUE \read(r132) [L317] COND TRUE \read(r212) [L318] COND TRUE \read(r232) [L319] COND TRUE \read(r312) [L320] COND TRUE \read(r322) [L321] COND TRUE (int )max1 == (int )id1 [L322] COND TRUE (int )max2 == (int )id2 [L323] COND TRUE (int )max3 == (int )id3 [L324] COND TRUE (int )st1 == 0 [L325] COND TRUE (int )st2 == 0 [L326] COND TRUE (int )st3 == 0 [L327] COND TRUE (int )nl1 == 0 [L328] COND TRUE (int )nl2 == 0 [L329] COND TRUE (int )nl3 == 0 [L330] COND TRUE (int )mode1 == 0 [L331] COND TRUE (int )mode2 == 0 [L332] COND TRUE (int )mode3 == 0 [L333] tmp___5 = 1 [L415] return (tmp___5); [L508] i2 = init() [L509] COND FALSE !(!(i2)) [L510] p12_old = nomsg [L511] p12_new = nomsg [L512] p13_old = nomsg [L513] p13_new = nomsg [L514] p21_old = nomsg [L515] p21_new = nomsg [L516] p23_old = nomsg [L517] p23_new = nomsg [L518] p31_old = nomsg [L519] p31_new = nomsg [L520] p32_old = nomsg [L521] p32_new = nomsg [L522] i2 = 0 VAL [ep12=255, ep13=0, ep21=255, ep23=1, ep31=1, ep32=0, id1=121, id2=122, id3=124, m1=123, m2=-2, m3=125, max1=121, max2=122, max3=124, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L523] COND TRUE i2 < 6 [L75] COND FALSE !(\read(mode1)) [L100] COND TRUE (int )r1 < 1 [L101] COND TRUE \read(ep12) [L102] EXPR max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L102] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L104] COND FALSE !(\read(ep13)) [L108] mode1 = (_Bool)1 [L118] COND FALSE !(\read(mode2)) [L143] COND TRUE (int )r2 < 2 [L144] COND TRUE \read(ep21) [L145] EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L145] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L147] COND TRUE \read(ep23) [L148] EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L148] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L151] mode2 = (_Bool)1 [L161] COND FALSE !(\read(mode3)) [L186] COND TRUE (int )r3 < 2 [L187] COND TRUE \read(ep31) [L188] EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L188] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L190] COND FALSE !(\read(ep32)) [L194] mode3 = (_Bool)1 [L528] p12_old = p12_new [L529] p12_new = nomsg [L530] p13_old = p13_new [L531] p13_new = nomsg [L532] p21_old = p21_new [L533] p21_new = nomsg [L534] p23_old = p23_new [L535] p23_new = nomsg [L536] p31_old = p31_new [L537] p31_new = nomsg [L538] p32_old = p32_new [L539] p32_new = nomsg [L420] int tmp ; VAL [ep12=255, ep13=0, ep21=255, ep23=1, ep31=1, ep32=0, id1=121, id2=122, id3=124, m1=123, m2=-2, m3=125, max1=121, max2=122, max3=124, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=121, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=122, p23=0, p23_new=-1, p23_old=122, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L423] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=255, ep13=0, ep21=255, ep23=1, ep31=1, ep32=0, id1=121, id2=122, id3=124, m1=123, m2=-2, m3=125, max1=121, max2=122, max3=124, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=121, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=122, p23=0, p23_new=-1, p23_old=122, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L424] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=255, ep13=0, ep21=255, ep23=1, ep31=1, ep32=0, id1=121, id2=122, id3=124, m1=123, m2=-2, m3=125, max1=121, max2=122, max3=124, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=121, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=122, p23=0, p23_new=-1, p23_old=122, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L425] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=255, ep13=0, ep21=255, ep23=1, ep31=1, ep32=0, id1=121, id2=122, id3=124, m1=123, m2=-2, m3=125, max1=121, max2=122, max3=124, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=121, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=122, p23=0, p23_new=-1, p23_old=122, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L426] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=255, ep13=0, ep21=255, ep23=1, ep31=1, ep32=0, id1=121, id2=122, id3=124, m1=123, m2=-2, m3=125, max1=121, max2=122, max3=124, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=121, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=122, p23=0, p23_new=-1, p23_old=122, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L427] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=0, ep21=255, ep23=1, ep31=1, ep32=0, id1=121, id2=122, id3=124, m1=123, m2=-2, m3=125, max1=121, max2=122, max3=124, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=121, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=122, p23=0, p23_new=-1, p23_old=122, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L430] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=255, ep13=0, ep21=255, ep23=1, ep31=1, ep32=0, id1=121, id2=122, id3=124, m1=123, m2=-2, m3=125, max1=121, max2=122, max3=124, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=121, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=122, p23=0, p23_new=-1, p23_old=122, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L432] COND TRUE (int )r1 < 2 VAL [ep12=255, ep13=0, ep21=255, ep23=1, ep31=1, ep32=0, id1=121, id2=122, id3=124, m1=123, m2=-2, m3=125, max1=121, max2=122, max3=124, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=121, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=122, p23=0, p23_new=-1, p23_old=122, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L437] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=0, ep21=255, ep23=1, ep31=1, ep32=0, id1=121, id2=122, id3=124, m1=123, m2=-2, m3=125, max1=121, max2=122, max3=124, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=121, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=122, p23=0, p23_new=-1, p23_old=122, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L440] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=255, ep13=0, ep21=255, ep23=1, ep31=1, ep32=0, id1=121, id2=122, id3=124, m1=123, m2=-2, m3=125, max1=121, max2=122, max3=124, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=121, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=122, p23=0, p23_new=-1, p23_old=122, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L442] COND TRUE (int )r1 < 2 [L443] tmp = 1 VAL [ep12=255, ep13=0, ep21=255, ep23=1, ep31=1, ep32=0, id1=121, id2=122, id3=124, m1=123, m2=-2, m3=125, max1=121, max2=122, max3=124, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=121, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=122, p23=0, p23_new=-1, p23_old=122, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L471] return (tmp); [L540] c1 = check() [L553] COND FALSE !(! arg) VAL [ep12=255, ep13=0, ep21=255, ep23=1, ep31=1, ep32=0, id1=121, id2=122, id3=124, m1=123, m2=-2, m3=125, max1=121, max2=122, max3=124, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=121, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=122, p23=0, p23_new=-1, p23_old=122, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L542] i2 ++ VAL [ep12=255, ep13=0, ep21=255, ep23=1, ep31=1, ep32=0, id1=121, id2=122, id3=124, m1=123, m2=-2, m3=125, max1=121, max2=122, max3=124, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=121, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=122, p23=0, p23_new=-1, p23_old=122, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L523] COND TRUE i2 < 6 [L75] COND TRUE \read(mode1) [L76] r1 = (char )((int )r1 + 1) [L77] COND TRUE \read(ep21) [L78] m1 = p21_old [L79] p21_old = nomsg [L80] COND TRUE (int )m1 > (int )max1 [L81] max1 = m1 [L84] COND TRUE \read(ep31) [L85] m1 = p31_old [L86] p31_old = nomsg [L87] COND TRUE (int )m1 > (int )max1 [L88] max1 = m1 [L91] COND FALSE !((int )r1 == 2) [L98] mode1 = (_Bool)0 [L118] COND TRUE \read(mode2) [L119] r2 = (char )((int )r2 + 1) [L120] COND TRUE \read(ep12) [L121] m2 = p12_old [L122] p12_old = nomsg [L123] COND FALSE !((int )m2 > (int )max2) [L127] COND FALSE !(\read(ep32)) [L134] COND FALSE !((int )r2 == 2) [L141] mode2 = (_Bool)0 [L161] COND TRUE \read(mode3) [L162] r3 = (char )((int )r3 + 1) [L163] COND FALSE !(\read(ep13)) [L170] COND TRUE \read(ep23) [L171] m3 = p23_old [L172] p23_old = nomsg [L173] COND FALSE !((int )m3 > (int )max3) [L177] COND FALSE !((int )r3 == 2) [L184] mode3 = (_Bool)0 [L528] p12_old = p12_new [L529] p12_new = nomsg [L530] p13_old = p13_new [L531] p13_new = nomsg [L532] p21_old = p21_new [L533] p21_new = nomsg [L534] p23_old = p23_new [L535] p23_new = nomsg [L536] p31_old = p31_new [L537] p31_new = nomsg [L538] p32_old = p32_new [L539] p32_new = nomsg [L420] int tmp ; VAL [ep12=255, ep13=0, ep21=255, ep23=1, ep31=1, ep32=0, id1=121, id2=122, id3=124, m1=124, m2=121, m3=122, max1=124, max2=122, max3=124, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L423] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=255, ep13=0, ep21=255, ep23=1, ep31=1, ep32=0, id1=121, id2=122, id3=124, m1=124, m2=121, m3=122, max1=124, max2=122, max3=124, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L424] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=255, ep13=0, ep21=255, ep23=1, ep31=1, ep32=0, id1=121, id2=122, id3=124, m1=124, m2=121, m3=122, max1=124, max2=122, max3=124, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L425] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=255, ep13=0, ep21=255, ep23=1, ep31=1, ep32=0, id1=121, id2=122, id3=124, m1=124, m2=121, m3=122, max1=124, max2=122, max3=124, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L426] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=255, ep13=0, ep21=255, ep23=1, ep31=1, ep32=0, id1=121, id2=122, id3=124, m1=124, m2=121, m3=122, max1=124, max2=122, max3=124, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L427] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=0, ep21=255, ep23=1, ep31=1, ep32=0, id1=121, id2=122, id3=124, m1=124, m2=121, m3=122, max1=124, max2=122, max3=124, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L430] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=255, ep13=0, ep21=255, ep23=1, ep31=1, ep32=0, id1=121, id2=122, id3=124, m1=124, m2=121, m3=122, max1=124, max2=122, max3=124, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L432] COND TRUE (int )r1 < 2 VAL [ep12=255, ep13=0, ep21=255, ep23=1, ep31=1, ep32=0, id1=121, id2=122, id3=124, m1=124, m2=121, m3=122, max1=124, max2=122, max3=124, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L437] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=0, ep21=255, ep23=1, ep31=1, ep32=0, id1=121, id2=122, id3=124, m1=124, m2=121, m3=122, max1=124, max2=122, max3=124, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L440] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=255, ep13=0, ep21=255, ep23=1, ep31=1, ep32=0, id1=121, id2=122, id3=124, m1=124, m2=121, m3=122, max1=124, max2=122, max3=124, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L442] COND TRUE (int )r1 < 2 [L443] tmp = 1 VAL [ep12=255, ep13=0, ep21=255, ep23=1, ep31=1, ep32=0, id1=121, id2=122, id3=124, m1=124, m2=121, m3=122, max1=124, max2=122, max3=124, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L471] return (tmp); [L540] c1 = check() [L553] COND FALSE !(! arg) VAL [ep12=255, ep13=0, ep21=255, ep23=1, ep31=1, ep32=0, id1=121, id2=122, id3=124, m1=124, m2=121, m3=122, max1=124, max2=122, max3=124, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L542] i2 ++ VAL [ep12=255, ep13=0, ep21=255, ep23=1, ep31=1, ep32=0, id1=121, id2=122, id3=124, m1=124, m2=121, m3=122, max1=124, max2=122, max3=124, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L523] COND TRUE i2 < 6 [L75] COND FALSE !(\read(mode1)) [L100] COND FALSE !((int )r1 < 1) [L108] mode1 = (_Bool)1 [L118] COND FALSE !(\read(mode2)) [L143] COND TRUE (int )r2 < 2 [L144] COND TRUE \read(ep21) [L145] EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L145] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L147] COND TRUE \read(ep23) [L148] EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L148] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L151] mode2 = (_Bool)1 [L161] COND FALSE !(\read(mode3)) [L186] COND TRUE (int )r3 < 2 [L187] COND TRUE \read(ep31) [L188] EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L188] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L190] COND FALSE !(\read(ep32)) [L194] mode3 = (_Bool)1 [L528] p12_old = p12_new [L529] p12_new = nomsg [L530] p13_old = p13_new [L531] p13_new = nomsg [L532] p21_old = p21_new [L533] p21_new = nomsg [L534] p23_old = p23_new [L535] p23_new = nomsg [L536] p31_old = p31_new [L537] p31_new = nomsg [L538] p32_old = p32_new [L539] p32_new = nomsg [L420] int tmp ; VAL [ep12=255, ep13=0, ep21=255, ep23=1, ep31=1, ep32=0, id1=121, id2=122, id3=124, m1=124, m2=121, m3=122, max1=124, max2=122, max3=124, mode1=1, mode2=1, mode3=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=122, p23=0, p23_new=-1, p23_old=122, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L423] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=255, ep13=0, ep21=255, ep23=1, ep31=1, ep32=0, id1=121, id2=122, id3=124, m1=124, m2=121, m3=122, max1=124, max2=122, max3=124, mode1=1, mode2=1, mode3=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=122, p23=0, p23_new=-1, p23_old=122, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L424] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=255, ep13=0, ep21=255, ep23=1, ep31=1, ep32=0, id1=121, id2=122, id3=124, m1=124, m2=121, m3=122, max1=124, max2=122, max3=124, mode1=1, mode2=1, mode3=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=122, p23=0, p23_new=-1, p23_old=122, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L425] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=255, ep13=0, ep21=255, ep23=1, ep31=1, ep32=0, id1=121, id2=122, id3=124, m1=124, m2=121, m3=122, max1=124, max2=122, max3=124, mode1=1, mode2=1, mode3=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=122, p23=0, p23_new=-1, p23_old=122, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L426] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=255, ep13=0, ep21=255, ep23=1, ep31=1, ep32=0, id1=121, id2=122, id3=124, m1=124, m2=121, m3=122, max1=124, max2=122, max3=124, mode1=1, mode2=1, mode3=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=122, p23=0, p23_new=-1, p23_old=122, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L427] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=0, ep21=255, ep23=1, ep31=1, ep32=0, id1=121, id2=122, id3=124, m1=124, m2=121, m3=122, max1=124, max2=122, max3=124, mode1=1, mode2=1, mode3=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=122, p23=0, p23_new=-1, p23_old=122, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L430] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=255, ep13=0, ep21=255, ep23=1, ep31=1, ep32=0, id1=121, id2=122, id3=124, m1=124, m2=121, m3=122, max1=124, max2=122, max3=124, mode1=1, mode2=1, mode3=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=122, p23=0, p23_new=-1, p23_old=122, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L432] COND TRUE (int )r1 < 2 VAL [ep12=255, ep13=0, ep21=255, ep23=1, ep31=1, ep32=0, id1=121, id2=122, id3=124, m1=124, m2=121, m3=122, max1=124, max2=122, max3=124, mode1=1, mode2=1, mode3=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=122, p23=0, p23_new=-1, p23_old=122, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L437] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=0, ep21=255, ep23=1, ep31=1, ep32=0, id1=121, id2=122, id3=124, m1=124, m2=121, m3=122, max1=124, max2=122, max3=124, mode1=1, mode2=1, mode3=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=122, p23=0, p23_new=-1, p23_old=122, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L440] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=255, ep13=0, ep21=255, ep23=1, ep31=1, ep32=0, id1=121, id2=122, id3=124, m1=124, m2=121, m3=122, max1=124, max2=122, max3=124, mode1=1, mode2=1, mode3=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=122, p23=0, p23_new=-1, p23_old=122, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L442] COND TRUE (int )r1 < 2 [L443] tmp = 1 VAL [ep12=255, ep13=0, ep21=255, ep23=1, ep31=1, ep32=0, id1=121, id2=122, id3=124, m1=124, m2=121, m3=122, max1=124, max2=122, max3=124, mode1=1, mode2=1, mode3=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=122, p23=0, p23_new=-1, p23_old=122, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L471] return (tmp); [L540] c1 = check() [L553] COND FALSE !(! arg) VAL [ep12=255, ep13=0, ep21=255, ep23=1, ep31=1, ep32=0, id1=121, id2=122, id3=124, m1=124, m2=121, m3=122, max1=124, max2=122, max3=124, mode1=1, mode2=1, mode3=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=122, p23=0, p23_new=-1, p23_old=122, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L542] i2 ++ VAL [ep12=255, ep13=0, ep21=255, ep23=1, ep31=1, ep32=0, id1=121, id2=122, id3=124, m1=124, m2=121, m3=122, max1=124, max2=122, max3=124, mode1=1, mode2=1, mode3=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=122, p23=0, p23_new=-1, p23_old=122, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L523] COND TRUE i2 < 6 [L75] COND TRUE \read(mode1) [L76] r1 = (char )((int )r1 + 1) [L77] COND TRUE \read(ep21) [L78] m1 = p21_old [L79] p21_old = nomsg [L80] COND FALSE !((int )m1 > (int )max1) [L84] COND TRUE \read(ep31) [L85] m1 = p31_old [L86] p31_old = nomsg [L87] COND FALSE !((int )m1 > (int )max1) [L91] COND TRUE (int )r1 == 2 [L92] COND FALSE !((int )max1 == (int )id1) [L95] nl1 = (char)1 [L98] mode1 = (_Bool)0 [L118] COND TRUE \read(mode2) [L119] r2 = (char )((int )r2 + 1) [L120] COND TRUE \read(ep12) [L121] m2 = p12_old [L122] p12_old = nomsg [L123] COND FALSE !((int )m2 > (int )max2) [L127] COND FALSE !(\read(ep32)) [L134] COND TRUE (int )r2 == 2 [L135] COND TRUE (int )max2 == (int )id2 [L136] st2 = (char)1 [L141] mode2 = (_Bool)0 [L161] COND TRUE \read(mode3) [L162] r3 = (char )((int )r3 + 1) [L163] COND FALSE !(\read(ep13)) [L170] COND TRUE \read(ep23) [L171] m3 = p23_old [L172] p23_old = nomsg [L173] COND FALSE !((int )m3 > (int )max3) [L177] COND TRUE (int )r3 == 2 [L178] COND TRUE (int )max3 == (int )id3 [L179] st3 = (char)1 [L184] mode3 = (_Bool)0 [L528] p12_old = p12_new [L529] p12_new = nomsg [L530] p13_old = p13_new [L531] p13_new = nomsg [L532] p21_old = p21_new [L533] p21_new = nomsg [L534] p23_old = p23_new [L535] p23_new = nomsg [L536] p31_old = p31_new [L537] p31_new = nomsg [L538] p32_old = p32_new [L539] p32_new = nomsg [L420] int tmp ; VAL [ep12=255, ep13=0, ep21=255, ep23=1, ep31=1, ep32=0, id1=121, id2=122, id3=124, m1=124, m2=-1, m3=122, max1=124, max2=122, max3=124, mode1=0, mode2=0, mode3=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] [L423] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L469] tmp = 0 VAL [ep12=255, ep13=0, ep21=255, ep23=1, ep31=1, ep32=0, id1=121, id2=122, id3=124, m1=124, m2=-1, m3=122, max1=124, max2=122, max3=124, mode1=0, mode2=0, mode3=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] [L471] return (tmp); [L540] c1 = check() [L553] COND TRUE ! arg VAL [ep12=255, ep13=0, ep21=255, ep23=1, ep31=1, ep32=0, id1=121, id2=122, id3=124, m1=124, m2=-1, m3=122, max1=124, max2=122, max3=124, mode1=0, mode2=0, mode3=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_floodmax.3.4.ufo.BOUNDED-6.pals.c", 3, "reach_error") VAL [ep12=255, ep13=0, ep21=255, ep23=1, ep31=1, ep32=0, id1=121, id2=122, id3=124, m1=124, m2=-1, m3=122, max1=124, max2=122, max3=124, mode1=0, mode2=0, mode3=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 90.2 MB. Free memory is still 70.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 701.91 ms. Allocated memory is still 90.2 MB. Free memory was 53.8 MB in the beginning and 61.5 MB in the end (delta: -7.6 MB). Peak memory consumption was 7.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 87.77 ms. Allocated memory is still 90.2 MB. Free memory was 61.5 MB in the beginning and 58.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 74.48 ms. Allocated memory is still 90.2 MB. Free memory was 58.6 MB in the beginning and 56.3 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3758.83 ms. Allocated memory was 90.2 MB in the beginning and 144.7 MB in the end (delta: 54.5 MB). Free memory was 56.2 MB in the beginning and 57.2 MB in the end (delta: -1.1 MB). Peak memory consumption was 66.6 MB. Max. memory is 16.1 GB. * CodeCheck took 234492.07 ms. Allocated memory was 144.7 MB in the beginning and 736.1 MB in the end (delta: 591.4 MB). Free memory was 57.2 MB in the beginning and 411.1 MB in the end (delta: -353.8 MB). Peak memory consumption was 237.6 MB. Max. memory is 16.1 GB. * Witness Printer took 281.67 ms. Allocated memory is still 736.1 MB. Free memory was 411.1 MB in the beginning and 389.1 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...