./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_b332ac64-aadc-4342-afd0-e0ef3ec9e1ff/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b332ac64-aadc-4342-afd0-e0ef3ec9e1ff/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b332ac64-aadc-4342-afd0-e0ef3ec9e1ff/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b332ac64-aadc-4342-afd0-e0ef3ec9e1ff/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_b332ac64-aadc-4342-afd0-e0ef3ec9e1ff/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b332ac64-aadc-4342-afd0-e0ef3ec9e1ff/bin/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4fc1e09d0a185b5e28aca558590d685af7160ef3 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 05:15:12,708 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 05:15:12,710 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 05:15:12,726 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 05:15:12,726 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 05:15:12,728 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 05:15:12,730 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 05:15:12,739 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 05:15:12,744 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 05:15:12,748 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 05:15:12,749 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 05:15:12,750 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 05:15:12,751 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 05:15:12,753 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 05:15:12,754 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 05:15:12,755 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 05:15:12,756 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 05:15:12,757 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 05:15:12,759 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 05:15:12,762 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 05:15:12,766 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 05:15:12,768 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 05:15:12,770 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 05:15:12,771 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 05:15:12,774 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 05:15:12,775 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 05:15:12,775 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 05:15:12,776 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 05:15:12,777 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 05:15:12,778 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 05:15:12,778 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 05:15:12,779 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 05:15:12,780 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 05:15:12,780 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 05:15:12,781 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 05:15:12,781 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 05:15:12,782 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 05:15:12,782 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 05:15:12,782 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 05:15:12,783 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 05:15:12,784 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 05:15:12,785 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b332ac64-aadc-4342-afd0-e0ef3ec9e1ff/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2019-11-20 05:15:12,809 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 05:15:12,819 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 05:15:12,819 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-20 05:15:12,820 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2019-11-20 05:15:12,820 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 05:15:12,821 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 05:15:12,821 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 05:15:12,821 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 05:15:12,821 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 05:15:12,821 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 05:15:12,822 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 05:15:12,822 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 05:15:12,822 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 05:15:12,822 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 05:15:12,822 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 05:15:12,823 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 05:15:12,823 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 05:15:12,823 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 05:15:12,823 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-11-20 05:15:12,824 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-11-20 05:15:12,824 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 05:15:12,824 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 05:15:12,824 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-11-20 05:15:12,824 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 05:15:12,825 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 05:15:12,825 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 05:15:12,825 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2019-11-20 05:15:12,825 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 05:15:12,825 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 05:15:12,826 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_b332ac64-aadc-4342-afd0-e0ef3ec9e1ff/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(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4fc1e09d0a185b5e28aca558590d685af7160ef3 [2019-11-20 05:15:13,001 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 05:15:13,008 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 05:15:13,011 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 05:15:13,018 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 05:15:13,019 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 05:15:13,019 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b332ac64-aadc-4342-afd0-e0ef3ec9e1ff/bin/ukojak/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-11-20 05:15:13,075 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b332ac64-aadc-4342-afd0-e0ef3ec9e1ff/bin/ukojak/data/a8ce80912/623becfc2cfa4afb9d3a8fbd36baac8a/FLAG2034dc710 [2019-11-20 05:15:13,527 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 05:15:13,527 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b332ac64-aadc-4342-afd0-e0ef3ec9e1ff/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-11-20 05:15:13,545 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b332ac64-aadc-4342-afd0-e0ef3ec9e1ff/bin/ukojak/data/a8ce80912/623becfc2cfa4afb9d3a8fbd36baac8a/FLAG2034dc710 [2019-11-20 05:15:14,040 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b332ac64-aadc-4342-afd0-e0ef3ec9e1ff/bin/ukojak/data/a8ce80912/623becfc2cfa4afb9d3a8fbd36baac8a [2019-11-20 05:15:14,043 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 05:15:14,044 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 05:15:14,045 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 05:15:14,045 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 05:15:14,048 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 05:15:14,049 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:15:14" (1/1) ... [2019-11-20 05:15:14,051 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57bd5c29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:15:14, skipping insertion in model container [2019-11-20 05:15:14,052 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:15:14" (1/1) ... [2019-11-20 05:15:14,059 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 05:15:14,128 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 05:15:14,545 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 05:15:14,556 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 05:15:14,676 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 05:15:14,706 INFO L192 MainTranslator]: Completed translation [2019-11-20 05:15:14,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:15:14 WrapperNode [2019-11-20 05:15:14,707 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 05:15:14,707 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 05:15:14,707 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 05:15:14,708 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 05:15:14,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:15:14" (1/1) ... [2019-11-20 05:15:14,728 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:15:14" (1/1) ... [2019-11-20 05:15:14,774 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 05:15:14,774 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 05:15:14,775 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 05:15:14,775 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 05:15:14,783 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:15:14" (1/1) ... [2019-11-20 05:15:14,783 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:15:14" (1/1) ... [2019-11-20 05:15:14,787 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:15:14" (1/1) ... [2019-11-20 05:15:14,787 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:15:14" (1/1) ... [2019-11-20 05:15:14,800 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:15:14" (1/1) ... [2019-11-20 05:15:14,824 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:15:14" (1/1) ... [2019-11-20 05:15:14,828 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:15:14" (1/1) ... [2019-11-20 05:15:14,833 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 05:15:14,833 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 05:15:14,833 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 05:15:14,833 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 05:15:14,838 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:15:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b332ac64-aadc-4342-afd0-e0ef3ec9e1ff/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 [2019-11-20 05:15:14,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 05:15:14,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 05:15:16,915 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 05:15:16,916 INFO L285 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-20 05:15:16,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:15:16 BoogieIcfgContainer [2019-11-20 05:15:16,919 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 05:15:16,919 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-11-20 05:15:16,919 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-11-20 05:15:16,930 INFO L275 PluginConnector]: CodeCheck initialized [2019-11-20 05:15:16,932 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:15:16" (1/1) ... [2019-11-20 05:15:16,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:15:16,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:15:16,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 173 states and 303 transitions. [2019-11-20 05:15:16,981 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 303 transitions. [2019-11-20 05:15:16,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-20 05:15:16,989 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:15:17,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:15:17,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:15:17,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:15:17,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 179 states and 316 transitions. [2019-11-20 05:15:17,917 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 316 transitions. [2019-11-20 05:15:17,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-20 05:15:17,920 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:15:17,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:15:18,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:15:18,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:15:18,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 181 states and 320 transitions. [2019-11-20 05:15:18,166 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 320 transitions. [2019-11-20 05:15:18,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-20 05:15:18,169 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:15:18,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:15:18,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:15:18,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:15:18,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 188 states and 335 transitions. [2019-11-20 05:15:18,640 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 335 transitions. [2019-11-20 05:15:18,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-20 05:15:18,643 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:15:18,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:15:18,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:15:18,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:15:18,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 189 states and 335 transitions. [2019-11-20 05:15:18,728 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 335 transitions. [2019-11-20 05:15:18,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-20 05:15:18,730 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:15:18,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:15:18,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:15:18,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:15:18,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 189 states and 333 transitions. [2019-11-20 05:15:18,793 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 333 transitions. [2019-11-20 05:15:18,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-20 05:15:18,795 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:15:18,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:15:18,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:15:20,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:15:20,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 192 states and 340 transitions. [2019-11-20 05:15:20,385 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 340 transitions. [2019-11-20 05:15:20,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-20 05:15:20,386 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:15:20,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:15:20,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:15:23,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:15:23,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 206 states and 373 transitions. [2019-11-20 05:15:23,636 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 373 transitions. [2019-11-20 05:15:23,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-20 05:15:23,637 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:15:23,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:15:23,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:15:28,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:15:28,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 214 states and 393 transitions. [2019-11-20 05:15:28,532 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 393 transitions. [2019-11-20 05:15:28,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-20 05:15:28,533 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:15:28,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:15:28,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:15:30,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:15:30,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 227 states and 418 transitions. [2019-11-20 05:15:30,752 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 418 transitions. [2019-11-20 05:15:30,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-20 05:15:30,753 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:15:30,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:15:31,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:15:36,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:15:36,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 236 states and 437 transitions. [2019-11-20 05:15:36,924 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 437 transitions. [2019-11-20 05:15:36,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-20 05:15:36,925 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:15:36,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:15:36,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:15:37,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:15:37,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 238 states and 439 transitions. [2019-11-20 05:15:37,433 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 439 transitions. [2019-11-20 05:15:37,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-20 05:15:37,434 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:15:37,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:15:37,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:15:37,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:15:37,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 238 states and 438 transitions. [2019-11-20 05:15:37,545 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 438 transitions. [2019-11-20 05:15:37,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-20 05:15:37,546 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:15:37,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:15:37,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:15:37,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:15:37,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 240 states and 445 transitions. [2019-11-20 05:15:37,724 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 445 transitions. [2019-11-20 05:15:37,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-20 05:15:37,725 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:15:37,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:15:37,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:15:39,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:15:39,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 244 states and 453 transitions. [2019-11-20 05:15:39,324 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 453 transitions. [2019-11-20 05:15:39,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-20 05:15:39,327 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:15:39,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:15:39,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:15:42,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:15:42,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 259 states and 489 transitions. [2019-11-20 05:15:42,856 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 489 transitions. [2019-11-20 05:15:42,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-20 05:15:42,857 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:15:42,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:15:43,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:15:45,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:15:45,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 263 states and 497 transitions. [2019-11-20 05:15:45,670 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 497 transitions. [2019-11-20 05:15:45,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-20 05:15:45,671 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:15:45,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:15:45,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:15:49,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:15:49,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 276 states and 523 transitions. [2019-11-20 05:15:49,366 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 523 transitions. [2019-11-20 05:15:49,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-20 05:15:49,367 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:15:49,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:15:49,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:15:53,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:15:53,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 285 states and 543 transitions. [2019-11-20 05:15:53,469 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 543 transitions. [2019-11-20 05:15:53,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-20 05:15:53,470 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:15:53,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:15:53,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:15:53,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:15:53,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 287 states and 547 transitions. [2019-11-20 05:15:53,889 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 547 transitions. [2019-11-20 05:15:53,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-20 05:15:53,890 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:15:53,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:15:54,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:15:57,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:15:57,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 295 states and 567 transitions. [2019-11-20 05:15:57,179 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 567 transitions. [2019-11-20 05:15:57,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-20 05:15:57,183 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:15:57,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:15:57,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:15:58,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:15:58,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 297 states and 571 transitions. [2019-11-20 05:15:58,683 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 571 transitions. [2019-11-20 05:15:58,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-20 05:15:58,684 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:15:58,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:15:58,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:16:00,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:16:00,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 299 states and 579 transitions. [2019-11-20 05:16:00,826 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 579 transitions. [2019-11-20 05:16:00,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-20 05:16:00,827 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:16:00,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:16:00,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:16:02,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:16:02,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 300 states and 581 transitions. [2019-11-20 05:16:02,082 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 581 transitions. [2019-11-20 05:16:02,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-20 05:16:02,083 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:16:02,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:16:02,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:16:04,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:16:04,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 285 states and 518 transitions. [2019-11-20 05:16:04,934 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 518 transitions. [2019-11-20 05:16:04,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 05:16:04,935 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:16:04,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:16:05,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:16:29,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:16:29,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 304 states and 570 transitions. [2019-11-20 05:16:29,410 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 570 transitions. [2019-11-20 05:16:29,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 05:16:29,411 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:16:29,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:16:30,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:16:55,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:16:55,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 320 states and 612 transitions. [2019-11-20 05:16:55,953 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 612 transitions. [2019-11-20 05:16:55,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 05:16:55,954 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:16:55,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:16:56,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:17:00,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:17:00,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 324 states and 619 transitions. [2019-11-20 05:17:00,708 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 619 transitions. [2019-11-20 05:17:00,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 05:17:00,709 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:17:00,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:17:00,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:17:03,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:17:03,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 326 states and 621 transitions. [2019-11-20 05:17:03,064 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 621 transitions. [2019-11-20 05:17:03,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 05:17:03,064 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:17:03,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:17:03,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:17:07,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:17:07,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 339 states and 646 transitions. [2019-11-20 05:17:07,244 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 646 transitions. [2019-11-20 05:17:07,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 05:17:07,244 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:17:07,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:17:07,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:17:14,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:17:14,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 348 states and 666 transitions. [2019-11-20 05:17:14,086 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 666 transitions. [2019-11-20 05:17:14,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 05:17:14,087 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:17:14,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:17:14,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:17:22,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:17:22,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 361 states and 692 transitions. [2019-11-20 05:17:22,300 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 692 transitions. [2019-11-20 05:17:22,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 05:17:22,301 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:17:22,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:17:22,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:17:23,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:17:23,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 365 states and 699 transitions. [2019-11-20 05:17:23,783 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 699 transitions. [2019-11-20 05:17:23,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 05:17:23,784 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:17:23,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:17:24,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:17:28,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:17:28,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 369 states and 704 transitions. [2019-11-20 05:17:28,587 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 704 transitions. [2019-11-20 05:17:28,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 05:17:28,588 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:17:28,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:17:28,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:17:35,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:17:35,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 378 states and 725 transitions. [2019-11-20 05:17:35,681 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 725 transitions. [2019-11-20 05:17:35,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 05:17:35,682 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:17:35,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:17:35,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:17:38,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:17:38,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 381 states and 731 transitions. [2019-11-20 05:17:38,841 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 731 transitions. [2019-11-20 05:17:38,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 05:17:38,842 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:17:38,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:17:39,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:17:44,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:17:44,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 383 states and 733 transitions. [2019-11-20 05:17:44,750 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 733 transitions. [2019-11-20 05:17:44,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 05:17:44,751 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:17:44,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:17:44,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:17:49,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:17:49,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 382 states and 730 transitions. [2019-11-20 05:17:49,252 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 730 transitions. [2019-11-20 05:17:49,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 05:17:49,252 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:17:49,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:17:49,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:17:52,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:17:52,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 385 states and 734 transitions. [2019-11-20 05:17:52,548 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 734 transitions. [2019-11-20 05:17:52,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 05:17:52,549 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:17:52,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:17:52,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:17:53,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:17:53,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 385 states and 731 transitions. [2019-11-20 05:17:53,943 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 731 transitions. [2019-11-20 05:17:53,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 05:17:53,944 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:17:53,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:17:55,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:18:00,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:18:00,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 392 states and 743 transitions. [2019-11-20 05:18:00,525 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 743 transitions. [2019-11-20 05:18:00,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 05:18:00,526 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:18:00,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:18:00,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:18:02,355 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-20 05:18:04,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:18:04,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 389 states and 734 transitions. [2019-11-20 05:18:04,939 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 734 transitions. [2019-11-20 05:18:04,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 05:18:04,940 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:18:04,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:18:04,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:18:06,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:18:06,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 387 states and 731 transitions. [2019-11-20 05:18:06,283 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 731 transitions. [2019-11-20 05:18:06,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 05:18:06,284 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:18:06,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:18:06,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:18:07,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:18:07,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 384 states and 724 transitions. [2019-11-20 05:18:07,546 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 724 transitions. [2019-11-20 05:18:07,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 05:18:07,546 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:18:07,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:18:07,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:18:08,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:18:09,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 384 states and 722 transitions. [2019-11-20 05:18:09,000 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 722 transitions. [2019-11-20 05:18:09,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 05:18:09,001 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:18:09,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:18:09,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:18:10,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:18:10,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 384 states and 721 transitions. [2019-11-20 05:18:10,456 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 721 transitions. [2019-11-20 05:18:10,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 05:18:10,457 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:18:10,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:18:10,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:18:26,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:18:26,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 401 states and 760 transitions. [2019-11-20 05:18:26,512 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 760 transitions. [2019-11-20 05:18:26,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 05:18:26,513 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:18:26,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:18:26,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:18:29,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:18:29,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 405 states and 766 transitions. [2019-11-20 05:18:29,565 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 766 transitions. [2019-11-20 05:18:29,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 05:18:29,565 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:18:29,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:18:29,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:18:37,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:18:37,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 409 states and 774 transitions. [2019-11-20 05:18:37,273 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 774 transitions. [2019-11-20 05:18:37,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 05:18:37,274 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:18:37,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:18:37,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:18:42,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:18:42,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 417 states and 787 transitions. [2019-11-20 05:18:42,365 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 787 transitions. [2019-11-20 05:18:42,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 05:18:42,365 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:18:42,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:18:42,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:18:53,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:18:53,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 428 states and 807 transitions. [2019-11-20 05:18:53,544 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 807 transitions. [2019-11-20 05:18:53,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 05:18:53,545 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:18:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:18:53,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:18:54,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:18:54,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 429 states and 810 transitions. [2019-11-20 05:18:54,999 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 810 transitions. [2019-11-20 05:18:55,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 05:18:55,000 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:18:55,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:18:55,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:18:56,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:18:56,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 433 states and 817 transitions. [2019-11-20 05:18:56,251 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 817 transitions. [2019-11-20 05:18:56,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 05:18:56,252 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:18:56,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:18:56,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:19:05,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:05,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 446 states and 842 transitions. [2019-11-20 05:19:05,939 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 842 transitions. [2019-11-20 05:19:05,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 05:19:05,939 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:05,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:05,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:19:13,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:13,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 453 states and 857 transitions. [2019-11-20 05:19:13,518 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 857 transitions. [2019-11-20 05:19:13,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 05:19:13,519 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:13,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:13,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:19:21,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:21,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 462 states and 874 transitions. [2019-11-20 05:19:21,347 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 874 transitions. [2019-11-20 05:19:21,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 05:19:21,347 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:21,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:21,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:19:26,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:26,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 466 states and 879 transitions. [2019-11-20 05:19:26,601 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 879 transitions. [2019-11-20 05:19:26,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 05:19:26,602 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:26,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:26,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:19:30,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:30,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 469 states and 882 transitions. [2019-11-20 05:19:30,701 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 882 transitions. [2019-11-20 05:19:30,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 05:19:30,702 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:30,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:30,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:19:40,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:40,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 468 states and 875 transitions. [2019-11-20 05:19:40,295 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 875 transitions. [2019-11-20 05:19:40,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 05:19:40,295 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:40,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:40,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:19:46,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:46,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 470 states and 879 transitions. [2019-11-20 05:19:46,155 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 879 transitions. [2019-11-20 05:19:46,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 05:19:46,155 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:46,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:46,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:19:51,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:51,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 469 states and 873 transitions. [2019-11-20 05:19:51,422 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 873 transitions. [2019-11-20 05:19:51,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 05:19:51,423 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:51,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:51,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:19:56,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:19:56,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 468 states and 867 transitions. [2019-11-20 05:19:56,897 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 867 transitions. [2019-11-20 05:19:56,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 05:19:56,898 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:19:56,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:19:56,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:20:01,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:20:01,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 465 states and 859 transitions. [2019-11-20 05:20:01,141 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 859 transitions. [2019-11-20 05:20:01,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 05:20:01,142 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:20:01,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:20:01,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:20:04,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:20:04,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 464 states and 856 transitions. [2019-11-20 05:20:04,162 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 856 transitions. [2019-11-20 05:20:04,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 05:20:04,163 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:20:04,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:20:04,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:20:06,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:20:06,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 422 states and 752 transitions. [2019-11-20 05:20:06,081 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 752 transitions. [2019-11-20 05:20:06,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 05:20:06,082 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:20:06,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:20:06,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:20:07,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:20:07,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 422 states and 751 transitions. [2019-11-20 05:20:07,869 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 751 transitions. [2019-11-20 05:20:07,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 05:20:07,869 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:20:07,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:20:07,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:20:09,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:20:09,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 422 states and 750 transitions. [2019-11-20 05:20:09,631 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 750 transitions. [2019-11-20 05:20:09,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-20 05:20:09,632 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:20:09,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:20:09,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:20:15,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:20:15,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 426 states and 754 transitions. [2019-11-20 05:20:15,923 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 754 transitions. [2019-11-20 05:20:15,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-20 05:20:15,923 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:20:15,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:20:15,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:20:23,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:20:23,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 434 states and 766 transitions. [2019-11-20 05:20:23,793 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 766 transitions. [2019-11-20 05:20:23,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-20 05:20:23,793 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:20:23,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:20:23,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:20:25,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:20:25,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 435 states and 767 transitions. [2019-11-20 05:20:25,454 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 767 transitions. [2019-11-20 05:20:25,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-20 05:20:25,455 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:20:25,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 05:20:25,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 05:20:25,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 05:20:25,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 05:20:26,021 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 70 iterations. [2019-11-20 05:20:26,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 20.11 05:20:26 ImpRootNode [2019-11-20 05:20:26,201 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2019-11-20 05:20:26,201 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 05:20:26,202 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 05:20:26,202 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 05:20:26,202 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:15:16" (3/4) ... [2019-11-20 05:20:26,204 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-20 05:20:26,437 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_b332ac64-aadc-4342-afd0-e0ef3ec9e1ff/bin/ukojak/witness.graphml [2019-11-20 05:20:26,438 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 05:20:26,439 INFO L168 Benchmark]: Toolchain (without parser) took 312395.30 ms. Allocated memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: 2.0 GB). Free memory was 944.7 MB in the beginning and 1.3 GB in the end (delta: -385.0 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-11-20 05:20:26,439 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 05:20:26,440 INFO L168 Benchmark]: CACSL2BoogieTranslator took 662.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -175.8 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-11-20 05:20:26,440 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 05:20:26,441 INFO L168 Benchmark]: Boogie Preprocessor took 58.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 05:20:26,441 INFO L168 Benchmark]: RCFGBuilder took 2085.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 881.4 MB in the end (delta: 228.4 MB). Peak memory consumption was 228.4 MB. Max. memory is 11.5 GB. [2019-11-20 05:20:26,441 INFO L168 Benchmark]: CodeCheck took 309282.02 ms. Allocated memory was 1.2 GB in the beginning and 3.1 GB in the end (delta: 1.9 GB). Free memory was 881.4 MB in the beginning and 1.4 GB in the end (delta: -502.5 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-11-20 05:20:26,443 INFO L168 Benchmark]: Witness Printer took 236.41 ms. Allocated memory is still 3.1 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 54.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 11.5 GB. [2019-11-20 05:20:26,445 INFO L335 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, 173 locations, 1 error locations. Result: UNSAFE, OverallTime: 309.0s, OverallIterations: 70, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 220270648 SDtfs, 153006982 SDslu, -502009448 SDs, 0 SdLazy, 364392834 SolverSat, -1876918272 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 86.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 47389 GetRequests, 45666 SyntacticMatches, 543 SemanticMatches, 1180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 712910 ImplicationChecksByTransitivity, 300.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 5886 NumberOfCodeBlocks, 5886 NumberOfCodeBlocksAsserted, 70 NumberOfCheckSat, 5728 ConstructedInterpolants, 0 QuantifiedInterpolants, 2190971 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 69 InterpolantComputations, 69 PerfectInterpolantSequences, 0/0 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: 581]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1] int __return_main; [L12] msg_t nomsg = (msg_t )-1; [L13] port_t p12 = 0; [L14] char p12_old = '\x0'; [L15] char p12_new = '\x0'; [L16] _Bool ep12 = 0; [L17] port_t p13 = 0; [L18] char p13_old = '\x0'; [L19] char p13_new = '\x0'; [L20] _Bool ep13 = 0; [L21] port_t p21 = 0; [L22] char p21_old = '\x0'; [L23] char p21_new = '\x0'; [L24] _Bool ep21 = 0; [L25] port_t p23 = 0; [L26] char p23_old = '\x0'; [L27] char p23_new = '\x0'; [L28] _Bool ep23 = 0; [L29] port_t p31 = 0; [L30] char p31_old = '\x0'; [L31] char p31_new = '\x0'; [L32] _Bool ep31 = 0; [L33] port_t p32 = 0; [L34] char p32_old = '\x0'; [L35] char p32_new = '\x0'; [L36] _Bool ep32 = 0; [L37] char id1 = '\x0'; [L38] unsigned char r1 = '\x0'; [L39] char st1 = '\x0'; [L40] char nl1 = '\x0'; [L41] char m1 = '\x0'; [L42] char max1 = '\x0'; [L43] _Bool mode1 = 0; [L44] _Bool newmax1 = 0; [L45] char id2 = '\x0'; [L46] unsigned char r2 = '\x0'; [L47] char st2 = '\x0'; [L48] char nl2 = '\x0'; [L49] char m2 = '\x0'; [L50] char max2 = '\x0'; [L51] _Bool mode2 = 0; [L52] _Bool newmax2 = 0; [L53] char id3 = '\x0'; [L54] unsigned char r3 = '\x0'; [L55] char st3 = '\x0'; [L56] char nl3 = '\x0'; [L57] char m3 = '\x0'; [L58] char max3 = '\x0'; [L59] _Bool mode3 = 0; [L60] _Bool newmax3 = 0; [L64] void (*nodes[3])() = { &node1, &node2, &node3 }; [L68] int __return_1248; [L69] int __return_1394; [L70] int __return_1528; [L71] int __return_1653; [L74] int main__c1; [L75] int main__i2; [L76] main__c1 = 0 [L77] ep12 = __VERIFIER_nondet_bool() [L78] ep13 = __VERIFIER_nondet_bool() [L79] ep21 = __VERIFIER_nondet_bool() [L80] ep23 = __VERIFIER_nondet_bool() [L81] ep31 = __VERIFIER_nondet_bool() [L82] ep32 = __VERIFIER_nondet_bool() [L83] id1 = __VERIFIER_nondet_char() [L84] r1 = __VERIFIER_nondet_uchar() [L85] st1 = __VERIFIER_nondet_char() [L86] nl1 = __VERIFIER_nondet_char() [L87] m1 = __VERIFIER_nondet_char() [L88] max1 = __VERIFIER_nondet_char() [L89] mode1 = __VERIFIER_nondet_bool() [L90] newmax1 = __VERIFIER_nondet_bool() [L91] id2 = __VERIFIER_nondet_char() [L92] r2 = __VERIFIER_nondet_uchar() [L93] st2 = __VERIFIER_nondet_char() [L94] nl2 = __VERIFIER_nondet_char() [L95] m2 = __VERIFIER_nondet_char() [L96] max2 = __VERIFIER_nondet_char() [L97] mode2 = __VERIFIER_nondet_bool() [L98] newmax2 = __VERIFIER_nondet_bool() [L99] id3 = __VERIFIER_nondet_char() [L100] r3 = __VERIFIER_nondet_uchar() [L101] st3 = __VERIFIER_nondet_char() [L102] nl3 = __VERIFIER_nondet_char() [L103] m3 = __VERIFIER_nondet_char() [L104] max3 = __VERIFIER_nondet_char() [L105] mode3 = __VERIFIER_nondet_bool() [L106] newmax3 = __VERIFIER_nondet_bool() [L108] _Bool init__r121; [L109] _Bool init__r131; [L110] _Bool init__r211; [L111] _Bool init__r231; [L112] _Bool init__r311; [L113] _Bool init__r321; [L114] _Bool init__r122; [L115] int init__tmp; [L116] _Bool init__r132; [L117] int init__tmp___0; [L118] _Bool init__r212; [L119] int init__tmp___1; [L120] _Bool init__r232; [L121] int init__tmp___2; [L122] _Bool init__r312; [L123] int init__tmp___3; [L124] _Bool init__r322; [L125] int init__tmp___4; [L126] int init__tmp___5; [L127] init__r121 = ep12 [L128] init__r131 = ep13 [L129] init__r211 = ep21 [L130] init__r231 = ep23 [L131] init__r311 = ep31 [L132] init__r321 = ep32 [L133] COND FALSE !(!(init__r121 == 0)) [L1782] COND TRUE !(init__r131 == 0) [L1784] COND TRUE !(ep32 == 0) [L1786] init__tmp = 1 [L137] init__r122 = (_Bool)init__tmp [L138] COND TRUE !(init__r131 == 0) [L140] init__tmp___0 = 1 [L142] init__r132 = (_Bool)init__tmp___0 [L143] COND TRUE !(init__r211 == 0) [L145] init__tmp___1 = 1 [L147] init__r212 = (_Bool)init__tmp___1 [L148] COND FALSE !(!(init__r231 == 0)) [L1713] COND TRUE !(init__r211 == 0) [L1715] COND TRUE !(ep13 == 0) [L1717] init__tmp___2 = 1 [L152] init__r232 = (_Bool)init__tmp___2 [L153] COND FALSE !(!(init__r311 == 0)) [L1690] COND TRUE !(init__r321 == 0) [L1692] COND TRUE !(ep21 == 0) [L1694] init__tmp___3 = 1 [L157] init__r312 = (_Bool)init__tmp___3 [L158] COND TRUE !(init__r321 == 0) [L160] init__tmp___4 = 1 [L162] init__r322 = (_Bool)init__tmp___4 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L163] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L165] COND TRUE ((int)id1) != ((int)id3) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L167] COND TRUE ((int)id2) != ((int)id3) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L169] COND TRUE ((int)id1) >= 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L171] COND TRUE ((int)id2) >= 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L173] COND TRUE ((int)id3) >= 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L175] COND TRUE ((int)r1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, st1=0, st2=0, st3=0] [L177] COND TRUE ((int)r2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, st1=0, st2=0, st3=0] [L179] COND TRUE ((int)r3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L181] COND TRUE !(init__r122 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L183] COND TRUE !(init__r132 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L185] COND TRUE !(init__r212 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L187] COND TRUE !(init__r232 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L189] COND TRUE !(init__r312 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L191] COND TRUE !(init__r322 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L193] COND TRUE ((int)max1) == ((int)id1) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L195] COND TRUE ((int)max2) == ((int)id2) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L197] COND TRUE ((int)max3) == ((int)id3) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L199] COND TRUE ((int)st1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L201] COND TRUE ((int)st2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L203] COND TRUE ((int)st3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L205] COND TRUE ((int)nl1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L207] COND TRUE ((int)nl2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L209] COND TRUE ((int)nl3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L211] COND TRUE ((int)mode1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, mode1=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L213] COND TRUE ((int)mode2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, mode1=0, mode2=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L215] COND TRUE ((int)mode3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L217] COND TRUE !(newmax1 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L219] COND TRUE !(newmax2 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L221] COND TRUE !(newmax3 == 0) [L223] init__tmp___5 = 1 [L224] __return_1248 = init__tmp___5 [L225] main__i2 = __return_1248 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L226] COND TRUE main__i2 != 0 [L228] p12_old = nomsg [L229] p12_new = nomsg [L230] p13_old = nomsg [L231] p13_new = nomsg [L232] p21_old = nomsg [L233] p21_new = nomsg [L234] p23_old = nomsg [L235] p23_new = nomsg [L236] p31_old = nomsg [L237] p31_new = nomsg [L238] p32_old = nomsg [L239] p32_new = nomsg [L240] main__i2 = 0 [L242] _Bool node1__newmax; [L243] node1__newmax = 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L244] COND FALSE !(!(mode1 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L250] COND TRUE ((int)r1) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L252] COND FALSE !(!(ep12 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L265] COND TRUE !(ep13 == 0) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L267] COND TRUE !(newmax1 == 0) [L269] int node1____CPAchecker_TMP_1; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L270] COND TRUE max1 != nomsg VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L272] COND TRUE p13_new == nomsg [L274] node1____CPAchecker_TMP_1 = max1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L276] p13_new = node1____CPAchecker_TMP_1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=2, 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] [L278] mode1 = 1 [L280] _Bool node2__newmax; [L281] node2__newmax = 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=2, 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] [L282] COND FALSE !(!(mode2 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=2, 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] [L288] COND TRUE ((int)r2) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=2, 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] [L290] COND TRUE !(ep21 == 0) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=2, 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] [L292] COND TRUE !(newmax2 == 0) [L294] int node2____CPAchecker_TMP_0; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=2, 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] [L295] COND TRUE max2 != nomsg VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=2, 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] [L297] COND TRUE p21_new == nomsg [L299] node2____CPAchecker_TMP_0 = max2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=2, 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] [L301] p21_new = node2____CPAchecker_TMP_0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=2, p13_old=-1, p21=0, p21_new=0, 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] [L303] COND FALSE !(!(ep23 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=2, p13_old=-1, p21=0, p21_new=0, 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] [L316] mode2 = 1 [L318] _Bool node3__newmax; [L319] node3__newmax = 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=2, p13_old=-1, p21=0, p21_new=0, 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] [L320] COND FALSE !(!(mode3 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=2, p13_old=-1, p21=0, p21_new=0, 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] [L326] COND TRUE ((int)r3) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=2, p13_old=-1, p21=0, p21_new=0, 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] [L328] COND FALSE !(!(ep31 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=2, p13_old=-1, p21=0, p21_new=0, 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] [L341] COND TRUE !(ep32 == 0) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=2, p13_old=-1, p21=0, p21_new=0, 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] [L343] COND TRUE !(newmax3 == 0) [L345] int node3____CPAchecker_TMP_1; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=2, p13_old=-1, p21=0, p21_new=0, 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] [L346] COND TRUE max3 != nomsg VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=2, p13_old=-1, p21=0, p21_new=0, 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] [L348] COND TRUE p32_new == nomsg [L350] node3____CPAchecker_TMP_1 = max3 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=2, p13_old=-1, p21=0, p21_new=0, 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] [L352] p32_new = node3____CPAchecker_TMP_1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=2, p13_old=-1, p21=0, p21_new=0, 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] [L354] mode3 = 1 [L355] p12_old = p12_new [L356] p12_new = nomsg [L357] p13_old = p13_new [L358] p13_new = nomsg [L359] p21_old = p21_new [L360] p21_new = nomsg [L361] p23_old = p23_new [L362] p23_new = nomsg [L363] p31_old = p31_new [L364] p31_new = nomsg [L365] p32_old = p32_new [L366] p32_new = nomsg [L368] int check__tmp; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=0, 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] [L369] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=0, 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] [L371] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=0, 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] [L373] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=0, 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] [L375] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=0, 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] [L377] COND FALSE !(((int)r1) >= 2) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=0, 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] [L383] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=0, 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] [L385] COND TRUE ((int)r1) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=0, 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] [L387] COND FALSE !(((int)r1) >= 2) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=0, 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] [L393] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=0, 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] [L395] COND TRUE ((int)r1) < 2 [L397] check__tmp = 1 [L398] __return_1394 = check__tmp [L399] main__c1 = __return_1394 [L401] _Bool __tmp_1; [L402] __tmp_1 = main__c1 [L403] _Bool assert__arg; [L404] assert__arg = __tmp_1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=0, 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] [L405] COND FALSE !(assert__arg == 0) [L412] _Bool node1__newmax; [L413] node1__newmax = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=0, 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] [L414] COND TRUE !(mode1 == 0) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=-1, m2=0, m3=1, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=0, 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] [L416] COND FALSE !(r1 == 255) [L422] r1 = r1 + 1 [L423] COND TRUE !(ep21 == 0) [L425] m1 = p21_old [L426] p21_old = nomsg [L427] COND FALSE !(((int)m1) > ((int)max1)) [L432] COND FALSE !(!(ep31 == 0)) [L441] newmax1 = node1__newmax VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=0, m2=0, m3=1, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, 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=0, r3=0, st1=0, st2=0, st3=0] [L442] COND TRUE ((int)r1) == 1 [L444] COND TRUE ((int)max1) == ((int)id1) [L446] st1 = 1 [L448] mode1 = 0 [L450] _Bool node2__newmax; [L451] node2__newmax = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=0, m2=0, m3=1, max1=2, max2=0, max3=1, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, 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=0, r3=0, st1=1, st2=0, st3=0] [L452] COND TRUE !(mode2 == 0) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=0, m2=0, m3=1, max1=2, max2=0, max3=1, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, 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=0, r3=0, st1=1, st2=0, st3=0] [L454] COND FALSE !(r2 == 255) [L460] r2 = r2 + 1 [L461] COND FALSE !(!(ep12 == 0)) [L470] COND TRUE !(ep32 == 0) [L472] m2 = p32_old [L473] p32_old = nomsg [L474] COND TRUE ((int)m2) > ((int)max2) [L476] max2 = m2 [L477] node2__newmax = 1 [L479] newmax2 = node2__newmax VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=0, m2=1, m3=1, max1=2, max2=1, max3=1, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, 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=0, st1=1, st2=0, st3=0] [L480] COND FALSE !(((int)r2) == 2) [L486] mode2 = 0 [L488] _Bool node3__newmax; [L489] node3__newmax = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=0, m2=1, m3=1, max1=2, max2=1, max3=1, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, 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=0, st1=1, st2=0, st3=0] [L490] COND TRUE !(mode3 == 0) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=0, m2=1, m3=1, max1=2, max2=1, max3=1, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, 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=0, st1=1, st2=0, st3=0] [L492] COND FALSE !(r3 == 255) [L498] r3 = r3 + 1 [L499] COND TRUE !(ep13 == 0) [L501] m3 = p13_old [L502] p13_old = nomsg [L503] COND TRUE ((int)m3) > ((int)max3) [L505] max3 = m3 [L506] node3__newmax = 1 [L508] COND FALSE !(!(ep23 == 0)) [L517] newmax3 = node3__newmax VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=0, m2=1, m3=2, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L518] COND FALSE !(((int)r3) == 2) [L524] mode3 = 0 [L525] p12_old = p12_new [L526] p12_new = nomsg [L527] p13_old = p13_new [L528] p13_new = nomsg [L529] p21_old = p21_new [L530] p21_new = nomsg [L531] p23_old = p23_new [L532] p23_new = nomsg [L533] p31_old = p31_new [L534] p31_new = nomsg [L535] p32_old = p32_new [L536] p32_new = nomsg [L538] int check__tmp; VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=0, m2=1, m3=2, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L539] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=0, m2=1, m3=2, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L541] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=0, m2=1, m3=2, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L543] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=0, m2=1, m3=2, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L545] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=0, m2=1, m3=2, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L547] COND FALSE !(((int)r1) >= 2) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=0, m2=1, m3=2, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L553] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) == 0) [L1192] check__tmp = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=0, m2=1, m3=2, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L571] __return_1528 = check__tmp [L572] main__c1 = __return_1528 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=0, m2=1, m3=2, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L575] _Bool __tmp_2; [L576] __tmp_2 = main__c1 [L577] _Bool assert__arg; [L578] assert__arg = __tmp_2 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=0, m2=1, m3=2, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L579] COND TRUE assert__arg == 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=0, m2=1, m3=2, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L581] __VERIFIER_error() VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=0, id3=1, m1=0, m2=1, m3=2, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 662.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -175.8 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2085.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 881.4 MB in the end (delta: 228.4 MB). Peak memory consumption was 228.4 MB. Max. memory is 11.5 GB. * CodeCheck took 309282.02 ms. Allocated memory was 1.2 GB in the beginning and 3.1 GB in the end (delta: 1.9 GB). Free memory was 881.4 MB in the beginning and 1.4 GB in the end (delta: -502.5 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 236.41 ms. Allocated memory is still 3.1 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 54.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...