./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 f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_1034dad3-57b2-4419-957a-aac321cd1f7a/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1034dad3-57b2-4419-957a-aac321cd1f7a/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1034dad3-57b2-4419-957a-aac321cd1f7a/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1034dad3-57b2-4419-957a-aac321cd1f7a/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_1034dad3-57b2-4419-957a-aac321cd1f7a/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1034dad3-57b2-4419-957a-aac321cd1f7a/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.25-f470102 [2019-12-01 14:47:16,716 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-01 14:47:16,717 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-01 14:47:16,725 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-01 14:47:16,725 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-01 14:47:16,726 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-01 14:47:16,727 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-01 14:47:16,728 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-01 14:47:16,729 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-01 14:47:16,730 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-01 14:47:16,730 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-01 14:47:16,731 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-01 14:47:16,731 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-01 14:47:16,732 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-01 14:47:16,733 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-01 14:47:16,733 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-01 14:47:16,734 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-01 14:47:16,735 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-01 14:47:16,736 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-01 14:47:16,737 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-01 14:47:16,738 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-01 14:47:16,739 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-01 14:47:16,740 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-01 14:47:16,740 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-01 14:47:16,742 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-01 14:47:16,742 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-01 14:47:16,742 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-01 14:47:16,743 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-01 14:47:16,743 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-01 14:47:16,743 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-01 14:47:16,744 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-01 14:47:16,744 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-01 14:47:16,744 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-01 14:47:16,745 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-01 14:47:16,745 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-01 14:47:16,746 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-01 14:47:16,746 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-01 14:47:16,746 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-01 14:47:16,746 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-01 14:47:16,747 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-01 14:47:16,747 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-01 14:47:16,748 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1034dad3-57b2-4419-957a-aac321cd1f7a/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2019-12-01 14:47:16,757 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-01 14:47:16,757 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-01 14:47:16,758 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-01 14:47:16,758 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2019-12-01 14:47:16,758 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-01 14:47:16,758 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-01 14:47:16,759 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-01 14:47:16,759 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-01 14:47:16,759 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-01 14:47:16,759 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-01 14:47:16,759 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-01 14:47:16,759 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-01 14:47:16,759 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-01 14:47:16,759 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-01 14:47:16,760 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-01 14:47:16,760 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-01 14:47:16,760 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-01 14:47:16,760 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-01 14:47:16,760 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-12-01 14:47:16,760 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-12-01 14:47:16,760 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-01 14:47:16,760 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-01 14:47:16,761 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-12-01 14:47:16,761 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-01 14:47:16,761 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-01 14:47:16,761 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-01 14:47:16,761 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2019-12-01 14:47:16,761 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-01 14:47:16,761 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-01 14:47:16,761 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_1034dad3-57b2-4419-957a-aac321cd1f7a/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-12-01 14:47:16,866 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-01 14:47:16,874 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-01 14:47:16,876 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-01 14:47:16,877 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-01 14:47:16,877 INFO L275 PluginConnector]: CDTParser initialized [2019-12-01 14:47:16,877 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1034dad3-57b2-4419-957a-aac321cd1f7a/bin/ukojak/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-12-01 14:47:16,915 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1034dad3-57b2-4419-957a-aac321cd1f7a/bin/ukojak/data/af6bac4bd/6e9fc9ad67d7475a94254d8a5d9fceda/FLAG4441c3d46 [2019-12-01 14:47:17,351 INFO L306 CDTParser]: Found 1 translation units. [2019-12-01 14:47:17,352 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1034dad3-57b2-4419-957a-aac321cd1f7a/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-12-01 14:47:17,359 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1034dad3-57b2-4419-957a-aac321cd1f7a/bin/ukojak/data/af6bac4bd/6e9fc9ad67d7475a94254d8a5d9fceda/FLAG4441c3d46 [2019-12-01 14:47:17,368 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1034dad3-57b2-4419-957a-aac321cd1f7a/bin/ukojak/data/af6bac4bd/6e9fc9ad67d7475a94254d8a5d9fceda [2019-12-01 14:47:17,369 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-01 14:47:17,370 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-01 14:47:17,371 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-01 14:47:17,371 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-01 14:47:17,373 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-01 14:47:17,374 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 02:47:17" (1/1) ... [2019-12-01 14:47:17,376 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37586ed5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:47:17, skipping insertion in model container [2019-12-01 14:47:17,376 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 02:47:17" (1/1) ... [2019-12-01 14:47:17,381 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-01 14:47:17,414 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-01 14:47:17,649 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-01 14:47:17,657 INFO L203 MainTranslator]: Completed pre-run [2019-12-01 14:47:17,734 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-01 14:47:17,746 INFO L208 MainTranslator]: Completed translation [2019-12-01 14:47:17,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:47:17 WrapperNode [2019-12-01 14:47:17,747 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-01 14:47:17,747 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-01 14:47:17,747 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-01 14:47:17,747 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-01 14:47:17,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:47:17" (1/1) ... [2019-12-01 14:47:17,763 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:47:17" (1/1) ... [2019-12-01 14:47:17,792 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-01 14:47:17,792 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-01 14:47:17,792 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-01 14:47:17,792 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-01 14:47:17,799 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:47:17" (1/1) ... [2019-12-01 14:47:17,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:47:17" (1/1) ... [2019-12-01 14:47:17,801 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:47:17" (1/1) ... [2019-12-01 14:47:17,802 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:47:17" (1/1) ... [2019-12-01 14:47:17,810 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:47:17" (1/1) ... [2019-12-01 14:47:17,818 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:47:17" (1/1) ... [2019-12-01 14:47:17,821 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:47:17" (1/1) ... [2019-12-01 14:47:17,825 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-01 14:47:17,825 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-01 14:47:17,825 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-01 14:47:17,825 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-01 14:47:17,826 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:47:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1034dad3-57b2-4419-957a-aac321cd1f7a/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-12-01 14:47:17,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-01 14:47:17,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-01 14:47:19,069 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-01 14:47:19,069 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-01 14:47:19,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 02:47:19 BoogieIcfgContainer [2019-12-01 14:47:19,070 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-01 14:47:19,070 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-12-01 14:47:19,070 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-12-01 14:47:19,077 INFO L275 PluginConnector]: CodeCheck initialized [2019-12-01 14:47:19,077 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 02:47:19" (1/1) ... [2019-12-01 14:47:19,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-01 14:47:19,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:47:19,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 173 states and 303 transitions. [2019-12-01 14:47:19,112 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 303 transitions. [2019-12-01 14:47:19,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-01 14:47:19,116 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:47:19,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:47:19,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:47:19,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:47:19,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 179 states and 316 transitions. [2019-12-01 14:47:19,612 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 316 transitions. [2019-12-01 14:47:19,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-01 14:47:19,615 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:47:19,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:47:19,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:47:19,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:47:19,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 181 states and 320 transitions. [2019-12-01 14:47:19,755 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 320 transitions. [2019-12-01 14:47:19,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-01 14:47:19,756 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:47:19,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:47:19,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:47:20,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:47:20,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 188 states and 335 transitions. [2019-12-01 14:47:20,062 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 335 transitions. [2019-12-01 14:47:20,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-01 14:47:20,067 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:47:20,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:47:20,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:47:20,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:47:20,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 189 states and 335 transitions. [2019-12-01 14:47:20,127 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 335 transitions. [2019-12-01 14:47:20,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-01 14:47:20,128 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:47:20,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:47:20,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:47:20,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:47:20,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 189 states and 333 transitions. [2019-12-01 14:47:20,172 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 333 transitions. [2019-12-01 14:47:20,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-01 14:47:20,173 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:47:20,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:47:20,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:47:21,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:47:21,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 192 states and 340 transitions. [2019-12-01 14:47:21,323 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 340 transitions. [2019-12-01 14:47:21,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-01 14:47:21,324 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:47:21,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:47:21,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-12-01 14:47:25,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:47:25,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 206 states and 373 transitions. [2019-12-01 14:47:25,439 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 373 transitions. [2019-12-01 14:47:25,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-01 14:47:25,440 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:47:25,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:47:25,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:47:29,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:47:29,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 214 states and 393 transitions. [2019-12-01 14:47:29,074 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 393 transitions. [2019-12-01 14:47:29,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-01 14:47:29,074 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:47:29,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:47:29,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:47:30,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:47:30,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 227 states and 418 transitions. [2019-12-01 14:47:30,749 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 418 transitions. [2019-12-01 14:47:30,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-01 14:47:30,750 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:47:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:47:31,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:47:39,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:47:39,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 236 states and 437 transitions. [2019-12-01 14:47:39,274 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 437 transitions. [2019-12-01 14:47:39,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-01 14:47:39,275 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:47:39,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:47:39,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:47:39,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:47:39,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 238 states and 439 transitions. [2019-12-01 14:47:39,678 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 439 transitions. [2019-12-01 14:47:39,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-01 14:47:39,678 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:47:39,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:47:39,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:47:39,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:47:39,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 238 states and 438 transitions. [2019-12-01 14:47:39,747 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 438 transitions. [2019-12-01 14:47:39,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-01 14:47:39,748 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:47:39,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:47:39,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:47:39,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:47:39,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 240 states and 445 transitions. [2019-12-01 14:47:39,825 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 445 transitions. [2019-12-01 14:47:39,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-01 14:47:39,826 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:47:39,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:47:39,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:47:43,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:47:43,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 255 states and 482 transitions. [2019-12-01 14:47:43,058 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 482 transitions. [2019-12-01 14:47:43,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-01 14:47:43,059 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:47:43,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:47:43,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:47:44,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:47:44,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 259 states and 490 transitions. [2019-12-01 14:47:44,720 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 490 transitions. [2019-12-01 14:47:44,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-01 14:47:44,721 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:47:44,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:47:44,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:47:47,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:47:47,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 263 states and 498 transitions. [2019-12-01 14:47:47,929 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 498 transitions. [2019-12-01 14:47:47,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-01 14:47:47,929 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:47:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:47:47,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:47:51,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:47:51,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 276 states and 524 transitions. [2019-12-01 14:47:51,287 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 524 transitions. [2019-12-01 14:47:51,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-01 14:47:51,288 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:47:51,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:47:51,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:47:56,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:47:56,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 285 states and 544 transitions. [2019-12-01 14:47:56,768 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 544 transitions. [2019-12-01 14:47:56,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-01 14:47:56,769 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:47:56,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:47:56,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:47:57,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:47:57,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 287 states and 548 transitions. [2019-12-01 14:47:57,038 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 548 transitions. [2019-12-01 14:47:57,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-01 14:47:57,038 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:47:57,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:47:57,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:48:00,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:48:00,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 295 states and 568 transitions. [2019-12-01 14:48:00,555 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 568 transitions. [2019-12-01 14:48:00,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-01 14:48:00,556 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:48:00,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:48:00,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:48:01,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:48:01,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 296 states and 570 transitions. [2019-12-01 14:48:01,497 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 570 transitions. [2019-12-01 14:48:01,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-01 14:48:01,498 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:48:01,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:48:01,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:48:03,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:48:03,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 297 states and 572 transitions. [2019-12-01 14:48:03,203 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 572 transitions. [2019-12-01 14:48:03,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-01 14:48:03,204 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:48:03,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:48:03,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:48:03,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:48:03,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 298 states and 574 transitions. [2019-12-01 14:48:03,673 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 574 transitions. [2019-12-01 14:48:03,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-01 14:48:03,674 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:48:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:48:03,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:48:06,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:48:06,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 300 states and 581 transitions. [2019-12-01 14:48:06,710 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 581 transitions. [2019-12-01 14:48:06,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-01 14:48:06,711 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:48:06,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:48:06,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:48:09,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:48:09,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 285 states and 518 transitions. [2019-12-01 14:48:09,693 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 518 transitions. [2019-12-01 14:48:09,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 14:48:09,693 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:48:09,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:48:10,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:48:31,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:48:31,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 301 states and 558 transitions. [2019-12-01 14:48:31,455 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 558 transitions. [2019-12-01 14:48:31,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 14:48:31,456 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:48:31,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:48:32,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:49:07,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:49:07,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 320 states and 605 transitions. [2019-12-01 14:49:07,353 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 605 transitions. [2019-12-01 14:49:07,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 14:49:07,354 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:49:07,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:49:07,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:49:13,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:49:13,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 333 states and 637 transitions. [2019-12-01 14:49:13,426 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 637 transitions. [2019-12-01 14:49:13,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 14:49:13,426 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:49:13,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:49:13,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:49:21,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:49:21,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 339 states and 646 transitions. [2019-12-01 14:49:21,595 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 646 transitions. [2019-12-01 14:49:21,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 14:49:21,595 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:49:21,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:49:21,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:49:31,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:49:31,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 348 states and 664 transitions. [2019-12-01 14:49:31,578 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 664 transitions. [2019-12-01 14:49:31,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 14:49:31,579 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:49:31,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:49:31,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:49:43,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:49:43,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 361 states and 690 transitions. [2019-12-01 14:49:43,258 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 690 transitions. [2019-12-01 14:49:43,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 14:49:43,259 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:49:43,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:49:43,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:49:44,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:49:44,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 365 states and 697 transitions. [2019-12-01 14:49:44,530 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 697 transitions. [2019-12-01 14:49:44,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 14:49:44,531 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:49:44,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:49:44,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:49:54,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:49:54,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 374 states and 718 transitions. [2019-12-01 14:49:54,338 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 718 transitions. [2019-12-01 14:49:54,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 14:49:54,339 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:49:54,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:49:54,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:50:01,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:50:01,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 378 states and 724 transitions. [2019-12-01 14:50:01,651 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 724 transitions. [2019-12-01 14:50:01,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 14:50:01,651 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:50:01,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:50:01,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:50:05,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:50:05,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 381 states and 730 transitions. [2019-12-01 14:50:05,078 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 730 transitions. [2019-12-01 14:50:05,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 14:50:05,078 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:50:05,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:50:05,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:50:11,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:50:11,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 383 states and 732 transitions. [2019-12-01 14:50:11,956 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 732 transitions. [2019-12-01 14:50:11,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 14:50:11,957 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:50:11,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:50:11,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:50:16,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:50:16,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 380 states and 723 transitions. [2019-12-01 14:50:16,281 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 723 transitions. [2019-12-01 14:50:16,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 14:50:16,282 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:50:16,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:50:16,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-12-01 14:50:23,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:50:23,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 379 states and 720 transitions. [2019-12-01 14:50:23,116 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 720 transitions. [2019-12-01 14:50:23,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 14:50:23,117 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:50:23,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:50:23,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:50:28,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:50:28,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 379 states and 718 transitions. [2019-12-01 14:50:28,325 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 718 transitions. [2019-12-01 14:50:28,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 14:50:28,326 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:50:28,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:50:28,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:50:29,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:50:29,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 377 states and 715 transitions. [2019-12-01 14:50:29,797 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 715 transitions. [2019-12-01 14:50:29,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 14:50:29,797 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:50:29,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:50:29,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:50:31,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:50:31,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 377 states and 714 transitions. [2019-12-01 14:50:31,204 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 714 transitions. [2019-12-01 14:50:31,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 14:50:31,205 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:50:31,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:50:31,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:50:32,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:50:32,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 377 states and 712 transitions. [2019-12-01 14:50:32,659 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 712 transitions. [2019-12-01 14:50:32,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 14:50:32,659 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:50:32,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:50:32,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:50:33,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:50:33,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 377 states and 709 transitions. [2019-12-01 14:50:33,976 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 709 transitions. [2019-12-01 14:50:33,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-01 14:50:33,976 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:50:33,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:50:33,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:50:44,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:50:44,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 386 states and 725 transitions. [2019-12-01 14:50:44,431 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 725 transitions. [2019-12-01 14:50:44,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-01 14:50:44,431 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:50:44,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:50:44,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:50:55,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:50:55,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 397 states and 745 transitions. [2019-12-01 14:50:55,840 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 745 transitions. [2019-12-01 14:50:55,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-01 14:50:55,840 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:50:55,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:50:55,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:50:59,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:50:59,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 403 states and 755 transitions. [2019-12-01 14:50:59,486 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 755 transitions. [2019-12-01 14:50:59,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-01 14:50:59,487 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:50:59,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:50:59,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:51:05,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:51:05,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 407 states and 763 transitions. [2019-12-01 14:51:05,741 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 763 transitions. [2019-12-01 14:51:05,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-01 14:51:05,742 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:51:05,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:51:06,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-12-01 14:51:11,900 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-12-01 14:51:25,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:51:25,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 424 states and 800 transitions. [2019-12-01 14:51:25,107 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 800 transitions. [2019-12-01 14:51:25,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-01 14:51:25,108 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:51:25,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:51:25,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:51:28,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:51:28,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 426 states and 803 transitions. [2019-12-01 14:51:28,179 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 803 transitions. [2019-12-01 14:51:28,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-01 14:51:28,179 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:51:28,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:51:28,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:51:41,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:51:41,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 439 states and 828 transitions. [2019-12-01 14:51:41,646 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 828 transitions. [2019-12-01 14:51:41,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-01 14:51:41,647 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:51:41,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:51:41,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:51:46,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:51:46,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 443 states and 835 transitions. [2019-12-01 14:51:46,589 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 835 transitions. [2019-12-01 14:51:46,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-01 14:51:46,589 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:51:46,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:51:46,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:51:52,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:51:52,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 448 states and 843 transitions. [2019-12-01 14:51:52,600 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 843 transitions. [2019-12-01 14:51:52,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-01 14:51:52,601 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:51:52,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:51:52,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:52:04,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:52:04,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 456 states and 855 transitions. [2019-12-01 14:52:04,970 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 855 transitions. [2019-12-01 14:52:04,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-01 14:52:04,971 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:52:04,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:52:04,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:52:09,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:52:09,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 459 states and 858 transitions. [2019-12-01 14:52:09,288 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 858 transitions. [2019-12-01 14:52:09,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-01 14:52:09,289 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:52:09,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:52:09,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:52:13,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:52:13,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 462 states and 861 transitions. [2019-12-01 14:52:13,551 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 861 transitions. [2019-12-01 14:52:13,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-01 14:52:13,552 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:52:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:52:13,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:52:19,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:52:19,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 461 states and 855 transitions. [2019-12-01 14:52:19,489 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 855 transitions. [2019-12-01 14:52:19,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-01 14:52:19,490 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:52:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:52:19,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:52:26,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:52:26,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 460 states and 850 transitions. [2019-12-01 14:52:26,278 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 850 transitions. [2019-12-01 14:52:26,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-01 14:52:26,278 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:52:26,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:52:26,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:52:31,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:52:31,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 464 states and 857 transitions. [2019-12-01 14:52:31,802 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 857 transitions. [2019-12-01 14:52:31,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-01 14:52:31,803 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:52:31,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:52:31,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:52:33,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:52:33,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 458 states and 846 transitions. [2019-12-01 14:52:33,237 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 846 transitions. [2019-12-01 14:52:33,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-01 14:52:33,237 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:52:33,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:52:33,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:52:44,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:52:44,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 457 states and 838 transitions. [2019-12-01 14:52:44,599 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 838 transitions. [2019-12-01 14:52:44,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-01 14:52:44,600 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:52:44,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:52:44,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:52:47,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:52:47,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 459 states and 840 transitions. [2019-12-01 14:52:47,927 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 840 transitions. [2019-12-01 14:52:47,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-01 14:52:47,928 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:52:47,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:52:47,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:52:49,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:52:49,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 457 states and 836 transitions. [2019-12-01 14:52:49,751 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 836 transitions. [2019-12-01 14:52:49,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-01 14:52:49,751 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:52:49,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:52:49,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:52:51,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:52:51,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 419 states and 743 transitions. [2019-12-01 14:52:51,763 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 743 transitions. [2019-12-01 14:52:51,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-01 14:52:51,764 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:52:51,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:52:51,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:52:53,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:52:53,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 419 states and 742 transitions. [2019-12-01 14:52:53,939 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 742 transitions. [2019-12-01 14:52:53,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-01 14:52:53,939 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:52:53,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:52:53,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:52:55,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:52:55,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 419 states and 741 transitions. [2019-12-01 14:52:55,863 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 741 transitions. [2019-12-01 14:52:55,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-12-01 14:52:55,864 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:52:55,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:52:55,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 14:53:06,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:53:06,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 427 states and 753 transitions. [2019-12-01 14:53:06,736 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 753 transitions. [2019-12-01 14:53:06,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-12-01 14:53:06,736 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:53:06,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 14:53:06,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-12-01 14:53:13,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 14:53:13,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 431 states and 757 transitions. [2019-12-01 14:53:13,466 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 757 transitions. [2019-12-01 14:53:13,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-12-01 14:53:13,466 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 14:53:13,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-01 14:53:13,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-01 14:53:13,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-01 14:53:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-01 14:53:13,775 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 68 iterations. [2019-12-01 14:53:13,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 01.12 02:53:13 ImpRootNode [2019-12-01 14:53:13,923 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2019-12-01 14:53:13,924 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-01 14:53:13,924 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-01 14:53:13,924 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-01 14:53:13,924 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 02:47:19" (3/4) ... [2019-12-01 14:53:13,926 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-01 14:53:14,060 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_1034dad3-57b2-4419-957a-aac321cd1f7a/bin/ukojak/witness.graphml [2019-12-01 14:53:14,060 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-01 14:53:14,061 INFO L168 Benchmark]: Toolchain (without parser) took 356690.63 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 942.0 MB in the beginning and 898.4 MB in the end (delta: 43.6 MB). Peak memory consumption was 437.2 MB. Max. memory is 11.5 GB. [2019-12-01 14:53:14,061 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 959.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-01 14:53:14,061 INFO L168 Benchmark]: CACSL2BoogieTranslator took 375.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 96.5 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -141.0 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2019-12-01 14:53:14,062 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 11.5 GB. [2019-12-01 14:53:14,062 INFO L168 Benchmark]: Boogie Preprocessor took 33.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-12-01 14:53:14,062 INFO L168 Benchmark]: RCFGBuilder took 1244.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -12.8 MB). Peak memory consumption was 252.1 MB. Max. memory is 11.5 GB. [2019-12-01 14:53:14,062 INFO L168 Benchmark]: CodeCheck took 354853.30 ms. Allocated memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.4 MB). Free memory was 1.1 GB in the beginning and 626.0 MB in the end (delta: 461.6 MB). Peak memory consumption was 482.1 MB. Max. memory is 11.5 GB. [2019-12-01 14:53:14,062 INFO L168 Benchmark]: Witness Printer took 136.19 ms. Allocated memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -524.3 kB). Free memory was 626.0 MB in the beginning and 898.4 MB in the end (delta: -272.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 11.5 GB. [2019-12-01 14:53:14,064 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: 354.6s, OverallIterations: 68, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 165808154 SDtfs, -1864649678 SDslu, -1328980954 SDs, 0 SdLazy, -180492488 SolverSat, 565248000 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 79.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 45895 GetRequests, 44352 SyntacticMatches, 391 SemanticMatches, 1152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676406 ImplicationChecksByTransitivity, 348.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 5710 NumberOfCodeBlocks, 5710 NumberOfCodeBlocksAsserted, 68 NumberOfCheckSat, 5554 ConstructedInterpolants, 0 QuantifiedInterpolants, 1982761 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 67 InterpolantComputations, 67 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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=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, 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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=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, 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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=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, 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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=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, 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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=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, 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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=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, 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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=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, 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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=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, 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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=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, 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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=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] [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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=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] [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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=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] [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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=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] [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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=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] [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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=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] [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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=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] [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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=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] [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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=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] [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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=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] [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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=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] [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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=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] [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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=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] [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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=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] [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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=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] [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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=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] [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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=0, 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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=0, 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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=0, 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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=0, 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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=0, 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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=0, 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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=0, 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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=0, 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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=0, 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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=0, 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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=0, 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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=0, 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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=0, 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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=0, 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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=0, 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=3, 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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=0, 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=3, 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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=0, 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=3, 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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=0, 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=3, 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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=0, 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=3, 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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=0, 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=3, 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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=0, 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=3, 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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=0, 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=3, 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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=0, 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=3, p13_old=-1, p21=0, p21_new=2, 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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=0, 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=3, p13_old=-1, p21=0, p21_new=2, 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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=0, 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=3, p13_old=-1, p21=0, p21_new=2, 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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=0, 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=3, p13_old=-1, p21=0, p21_new=2, 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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=0, 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=3, p13_old=-1, p21=0, p21_new=2, 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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=0, 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=3, p13_old=-1, p21=0, p21_new=2, 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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=0, 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=3, p13_old=-1, p21=0, p21_new=2, 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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=0, 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=3, p13_old=-1, p21=0, p21_new=2, 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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=0, 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=3, p13_old=-1, p21=0, p21_new=2, 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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=0, 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=3, p13_old=-1, p21=0, p21_new=2, 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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=0, 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=3, p13_old=-1, p21=0, p21_new=2, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=0, 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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=0, 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=3, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, 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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=0, 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=3, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, 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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=0, 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=3, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, 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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=0, 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=3, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, 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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=0, 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=3, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, 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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=0, 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=3, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, 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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=0, 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=3, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, 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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=0, 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=3, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, 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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=0, 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=3, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, 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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=0, 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=3, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, 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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=0, 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=3, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, 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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=0, 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=3, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, 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=3, id2=2, id3=0, m1=1, m2=1, m3=-128, max1=3, max2=2, max3=0, 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=3, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, 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=3, id2=2, id3=0, m1=2, m2=1, m3=-128, max1=3, max2=2, max3=0, 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=3, 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=0, 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=3, id2=2, id3=0, m1=2, m2=1, m3=-128, max1=3, max2=2, max3=0, 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=3, 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=0, 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=3, id2=2, id3=0, m1=2, m2=1, m3=-128, max1=3, max2=2, max3=0, 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=3, 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=0, 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 FALSE !(((int)m2) > ((int)max2)) [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=3, id2=2, id3=0, m1=2, m2=0, m3=-128, max1=3, max2=2, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=0, 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=3, 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=3, id2=2, id3=0, m1=2, m2=0, m3=-128, max1=3, max2=2, max3=0, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, 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=3, 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=3, id2=2, id3=0, m1=2, m2=0, m3=-128, max1=3, max2=2, max3=0, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, 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=3, 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=3, id2=2, id3=0, m1=2, m2=0, m3=3, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, 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=3, id2=2, id3=0, m1=2, m2=0, m3=3, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=3, id2=2, id3=0, m1=2, m2=0, m3=3, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=3, id2=2, id3=0, m1=2, m2=0, m3=3, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=3, id2=2, id3=0, m1=2, m2=0, m3=3, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=3, id2=2, id3=0, m1=2, m2=0, m3=3, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=3, id2=2, id3=0, m1=2, m2=0, m3=3, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=3, id2=2, id3=0, m1=2, m2=0, m3=3, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=3, id2=2, id3=0, m1=2, m2=0, m3=3, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=3, id2=2, id3=0, m1=2, m2=0, m3=3, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=3, id2=2, id3=0, m1=2, m2=0, m3=3, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=3, id2=2, id3=0, m1=2, m2=0, m3=3, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 959.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 375.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 96.5 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -141.0 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1244.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -12.8 MB). Peak memory consumption was 252.1 MB. Max. memory is 11.5 GB. * CodeCheck took 354853.30 ms. Allocated memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.4 MB). Free memory was 1.1 GB in the beginning and 626.0 MB in the end (delta: 461.6 MB). Peak memory consumption was 482.1 MB. Max. memory is 11.5 GB. * Witness Printer took 136.19 ms. Allocated memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -524.3 kB). Free memory was 626.0 MB in the beginning and 898.4 MB in the end (delta: -272.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...