./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.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_e4e40b7b-6810-4f24-b31b-ec8c2d294549/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e4e40b7b-6810-4f24-b31b-ec8c2d294549/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e4e40b7b-6810-4f24-b31b-ec8c2d294549/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e4e40b7b-6810-4f24-b31b-ec8c2d294549/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_e4e40b7b-6810-4f24-b31b-ec8c2d294549/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e4e40b7b-6810-4f24-b31b-ec8c2d294549/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 7f647c6008697302f06b1d1dda080bf4ccd77afb ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-02 06:56:16,791 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-02 06:56:16,792 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-02 06:56:16,799 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-02 06:56:16,800 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-02 06:56:16,800 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-02 06:56:16,801 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-02 06:56:16,802 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-02 06:56:16,804 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-02 06:56:16,804 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-02 06:56:16,805 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-02 06:56:16,806 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-02 06:56:16,806 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-02 06:56:16,807 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-02 06:56:16,807 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-02 06:56:16,808 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-02 06:56:16,809 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-02 06:56:16,810 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-02 06:56:16,811 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-02 06:56:16,812 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-02 06:56:16,813 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-02 06:56:16,814 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-02 06:56:16,815 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-02 06:56:16,815 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-02 06:56:16,817 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-02 06:56:16,817 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-02 06:56:16,817 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-02 06:56:16,818 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-02 06:56:16,818 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-02 06:56:16,819 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-02 06:56:16,819 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-02 06:56:16,819 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-02 06:56:16,820 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-02 06:56:16,821 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-02 06:56:16,821 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-02 06:56:16,822 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-02 06:56:16,822 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-02 06:56:16,822 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-02 06:56:16,822 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-02 06:56:16,823 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-02 06:56:16,824 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-02 06:56:16,824 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e4e40b7b-6810-4f24-b31b-ec8c2d294549/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2019-12-02 06:56:16,837 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-02 06:56:16,837 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-02 06:56:16,838 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-02 06:56:16,838 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2019-12-02 06:56:16,838 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-02 06:56:16,839 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-02 06:56:16,839 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-02 06:56:16,839 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-02 06:56:16,839 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-02 06:56:16,839 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-02 06:56:16,840 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-02 06:56:16,840 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-02 06:56:16,840 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-02 06:56:16,840 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-02 06:56:16,840 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-02 06:56:16,841 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-02 06:56:16,841 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-02 06:56:16,841 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-02 06:56:16,841 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-12-02 06:56:16,841 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-12-02 06:56:16,842 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-02 06:56:16,842 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-02 06:56:16,842 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-12-02 06:56:16,842 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-02 06:56:16,842 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-02 06:56:16,842 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-02 06:56:16,843 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2019-12-02 06:56:16,843 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-02 06:56:16,843 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-02 06:56:16,843 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_e4e40b7b-6810-4f24-b31b-ec8c2d294549/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 -> 7f647c6008697302f06b1d1dda080bf4ccd77afb [2019-12-02 06:56:16,942 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-02 06:56:16,950 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-02 06:56:16,952 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-02 06:56:16,953 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-02 06:56:16,953 INFO L275 PluginConnector]: CDTParser initialized [2019-12-02 06:56:16,954 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e4e40b7b-6810-4f24-b31b-ec8c2d294549/bin/ukojak/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-12-02 06:56:16,990 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e4e40b7b-6810-4f24-b31b-ec8c2d294549/bin/ukojak/data/48cec544d/0158c532ed184c9aabac34f99fe71be0/FLAGf090e5e0f [2019-12-02 06:56:17,465 INFO L306 CDTParser]: Found 1 translation units. [2019-12-02 06:56:17,466 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e4e40b7b-6810-4f24-b31b-ec8c2d294549/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-12-02 06:56:17,472 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e4e40b7b-6810-4f24-b31b-ec8c2d294549/bin/ukojak/data/48cec544d/0158c532ed184c9aabac34f99fe71be0/FLAGf090e5e0f [2019-12-02 06:56:17,975 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e4e40b7b-6810-4f24-b31b-ec8c2d294549/bin/ukojak/data/48cec544d/0158c532ed184c9aabac34f99fe71be0 [2019-12-02 06:56:17,977 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-02 06:56:17,978 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-02 06:56:17,979 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-02 06:56:17,979 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-02 06:56:17,982 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-02 06:56:17,982 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:56:17" (1/1) ... [2019-12-02 06:56:17,984 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25877ee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:56:17, skipping insertion in model container [2019-12-02 06:56:17,985 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:56:17" (1/1) ... [2019-12-02 06:56:17,990 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-02 06:56:18,021 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-02 06:56:18,246 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-02 06:56:18,253 INFO L203 MainTranslator]: Completed pre-run [2019-12-02 06:56:18,326 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-02 06:56:18,338 INFO L208 MainTranslator]: Completed translation [2019-12-02 06:56:18,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:56:18 WrapperNode [2019-12-02 06:56:18,339 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-02 06:56:18,339 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-02 06:56:18,339 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-02 06:56:18,339 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-02 06:56:18,345 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:56:18" (1/1) ... [2019-12-02 06:56:18,354 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:56:18" (1/1) ... [2019-12-02 06:56:18,382 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-02 06:56:18,383 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-02 06:56:18,383 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-02 06:56:18,383 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-02 06:56:18,389 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:56:18" (1/1) ... [2019-12-02 06:56:18,389 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:56:18" (1/1) ... [2019-12-02 06:56:18,392 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:56:18" (1/1) ... [2019-12-02 06:56:18,392 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:56:18" (1/1) ... [2019-12-02 06:56:18,400 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:56:18" (1/1) ... [2019-12-02 06:56:18,406 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:56:18" (1/1) ... [2019-12-02 06:56:18,409 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:56:18" (1/1) ... [2019-12-02 06:56:18,412 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-02 06:56:18,412 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-02 06:56:18,412 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-02 06:56:18,412 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-02 06:56:18,413 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:56:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e4e40b7b-6810-4f24-b31b-ec8c2d294549/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-02 06:56:18,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-02 06:56:18,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-02 06:56:19,441 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-02 06:56:19,441 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-02 06:56:19,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:56:19 BoogieIcfgContainer [2019-12-02 06:56:19,442 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-02 06:56:19,443 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-12-02 06:56:19,443 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-12-02 06:56:19,450 INFO L275 PluginConnector]: CodeCheck initialized [2019-12-02 06:56:19,451 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:56:19" (1/1) ... [2019-12-02 06:56:19,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-02 06:56:19,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 06:56:19,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 156 states and 271 transitions. [2019-12-02 06:56:19,486 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 271 transitions. [2019-12-02 06:56:19,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-02 06:56:19,490 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 06:56:19,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 06:56:19,895 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-02 06:56:19,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 06:56:19,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 167 states and 293 transitions. [2019-12-02 06:56:19,982 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 293 transitions. [2019-12-02 06:56:19,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-02 06:56:19,985 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 06:56:20,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 06:56:20,086 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-02 06:56:20,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 06:56:20,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 167 states and 292 transitions. [2019-12-02 06:56:20,516 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 292 transitions. [2019-12-02 06:56:20,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-02 06:56:20,518 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 06:56:20,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 06:56:20,904 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-02 06:56:22,297 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-12-02 06:56:23,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 06:56:23,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 170 states and 297 transitions. [2019-12-02 06:56:23,482 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 297 transitions. [2019-12-02 06:56:23,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-02 06:56:23,485 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 06:56:23,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 06:56:23,788 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-02 06:56:27,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 06:56:27,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 177 states and 310 transitions. [2019-12-02 06:56:27,067 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 310 transitions. [2019-12-02 06:56:27,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-02 06:56:27,068 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 06:56:27,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 06:56:27,242 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-02 06:56:28,579 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-12-02 06:56:33,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 06:56:33,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 188 states and 334 transitions. [2019-12-02 06:56:33,369 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 334 transitions. [2019-12-02 06:56:33,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-02 06:56:33,372 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 06:56:33,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 06:56:33,444 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-02 06:56:34,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 06:56:34,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 194 states and 344 transitions. [2019-12-02 06:56:34,107 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 344 transitions. [2019-12-02 06:56:34,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-02 06:56:34,107 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 06:56:34,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 06:56:35,017 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-02 06:56:46,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 06:56:46,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 207 states and 371 transitions. [2019-12-02 06:56:46,848 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 371 transitions. [2019-12-02 06:56:46,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-02 06:56:46,848 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 06:56:46,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 06:56:47,210 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-02 06:57:01,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 06:57:01,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 214 states and 387 transitions. [2019-12-02 06:57:01,760 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 387 transitions. [2019-12-02 06:57:01,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-02 06:57:01,761 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 06:57:01,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 06:57:02,037 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-02 06:57:03,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 06:57:03,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 221 states and 408 transitions. [2019-12-02 06:57:03,142 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 408 transitions. [2019-12-02 06:57:03,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-02 06:57:03,143 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 06:57:03,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 06:57:03,168 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-02 06:57:03,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 06:57:03,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 222 states and 411 transitions. [2019-12-02 06:57:03,907 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 411 transitions. [2019-12-02 06:57:03,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-02 06:57:03,908 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 06:57:03,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 06:57:04,300 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-02 06:57:05,487 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 79 [2019-12-02 06:57:06,830 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-12-02 06:57:07,303 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-12-02 06:57:07,650 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 81 [2019-12-02 06:57:08,911 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2019-12-02 06:57:09,244 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 83 [2019-12-02 06:57:10,532 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2019-12-02 06:57:10,836 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 84 [2019-12-02 06:57:24,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 06:57:24,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 231 states and 433 transitions. [2019-12-02 06:57:24,963 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 433 transitions. [2019-12-02 06:57:24,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-02 06:57:24,964 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 06:57:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 06:57:24,987 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-02 06:57:27,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 06:57:27,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 233 states and 440 transitions. [2019-12-02 06:57:27,029 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 440 transitions. [2019-12-02 06:57:27,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-02 06:57:27,029 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 06:57:27,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 06:57:27,343 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-02 06:57:30,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 06:57:30,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 229 states and 431 transitions. [2019-12-02 06:57:30,992 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 431 transitions. [2019-12-02 06:57:30,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-02 06:57:30,993 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 06:57:31,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 06:57:31,325 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-02 06:57:38,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 06:57:38,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 237 states and 451 transitions. [2019-12-02 06:57:38,067 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 451 transitions. [2019-12-02 06:57:38,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-02 06:57:38,068 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 06:57:38,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 06:57:38,422 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-02 06:57:45,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 06:57:45,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 244 states and 468 transitions. [2019-12-02 06:57:45,341 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 468 transitions. [2019-12-02 06:57:45,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-02 06:57:45,341 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 06:57:45,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 06:57:45,677 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-02 06:57:51,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 06:57:51,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 247 states and 478 transitions. [2019-12-02 06:57:51,060 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 478 transitions. [2019-12-02 06:57:51,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-02 06:57:51,060 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 06:57:51,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 06:57:51,117 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-02 06:57:54,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 06:57:54,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 245 states and 474 transitions. [2019-12-02 06:57:54,989 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 474 transitions. [2019-12-02 06:57:54,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-02 06:57:54,989 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 06:57:54,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 06:57:55,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 06:57:57,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 06:57:57,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 248 states and 480 transitions. [2019-12-02 06:57:57,927 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 480 transitions. [2019-12-02 06:57:57,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-02 06:57:57,928 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 06:57:57,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 06:57:57,988 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-02 06:58:01,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 06:58:01,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 253 states and 487 transitions. [2019-12-02 06:58:01,305 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 487 transitions. [2019-12-02 06:58:01,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-02 06:58:01,306 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 06:58:01,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 06:58:01,375 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-02 06:58:02,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 06:58:02,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 257 states and 493 transitions. [2019-12-02 06:58:02,503 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 493 transitions. [2019-12-02 06:58:02,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-02 06:58:02,503 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 06:58:02,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 06:58:02,525 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-02 06:58:09,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 06:58:09,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 261 states and 497 transitions. [2019-12-02 06:58:09,374 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 497 transitions. [2019-12-02 06:58:09,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-02 06:58:09,375 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 06:58:09,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 06:58:09,424 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-02 06:58:12,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 06:58:12,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 264 states and 501 transitions. [2019-12-02 06:58:12,256 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 501 transitions. [2019-12-02 06:58:12,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-02 06:58:12,256 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 06:58:12,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 06:58:13,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 06:58:17,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 06:58:17,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 271 states and 517 transitions. [2019-12-02 06:58:17,289 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 517 transitions. [2019-12-02 06:58:17,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-02 06:58:17,290 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 06:58:17,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 06:58:17,338 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-02 06:58:21,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 06:58:21,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 277 states and 526 transitions. [2019-12-02 06:58:21,111 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 526 transitions. [2019-12-02 06:58:21,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-02 06:58:21,111 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 06:58:21,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 06:58:21,435 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-02 06:58:26,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 06:58:26,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 278 states and 528 transitions. [2019-12-02 06:58:26,696 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 528 transitions. [2019-12-02 06:58:26,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-02 06:58:26,697 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 06:58:26,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 06:58:26,728 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-02 06:58:30,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 06:58:30,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 281 states and 532 transitions. [2019-12-02 06:58:30,281 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 532 transitions. [2019-12-02 06:58:30,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-02 06:58:30,282 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 06:58:30,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 06:58:30,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-02 06:58:34,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 06:58:34,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 278 states and 521 transitions. [2019-12-02 06:58:34,328 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 521 transitions. [2019-12-02 06:58:34,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-02 06:58:34,329 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 06:58:34,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 06:58:34,662 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-02 06:58:39,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 06:58:39,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 281 states and 528 transitions. [2019-12-02 06:58:39,451 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 528 transitions. [2019-12-02 06:58:39,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-02 06:58:39,452 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 06:58:39,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 06:58:39,465 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-02 06:58:40,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 06:58:40,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 280 states and 526 transitions. [2019-12-02 06:58:40,847 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 526 transitions. [2019-12-02 06:58:40,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-02 06:58:40,848 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 06:58:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 06:58:40,861 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-02 06:58:43,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 06:58:43,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 282 states and 531 transitions. [2019-12-02 06:58:43,002 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 531 transitions. [2019-12-02 06:58:43,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-02 06:58:43,002 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 06:58:43,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 06:58:43,065 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-02 06:58:49,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 06:58:49,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 288 states and 540 transitions. [2019-12-02 06:58:49,093 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 540 transitions. [2019-12-02 06:58:49,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-02 06:58:49,094 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 06:58:49,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 06:58:50,391 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-02 06:58:50,854 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 77 [2019-12-02 06:58:52,046 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 77 [2019-12-02 06:58:54,568 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 79 [2019-12-02 06:58:55,067 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 79 [2019-12-02 06:58:57,252 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 81 [2019-12-02 06:58:57,796 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 81 [2019-12-02 06:59:00,129 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 82 [2019-12-02 06:59:00,690 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 82 [2019-12-02 06:59:31,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 06:59:31,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 296 states and 555 transitions. [2019-12-02 06:59:31,269 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 555 transitions. [2019-12-02 06:59:31,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-02 06:59:31,269 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 06:59:31,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 06:59:31,297 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-02 06:59:36,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 06:59:36,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 298 states and 558 transitions. [2019-12-02 06:59:36,134 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 558 transitions. [2019-12-02 06:59:36,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-02 06:59:36,134 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 06:59:36,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 06:59:36,155 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-02 06:59:43,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 06:59:43,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 305 states and 571 transitions. [2019-12-02 06:59:43,650 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 571 transitions. [2019-12-02 06:59:43,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-02 06:59:43,651 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 06:59:43,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 06:59:43,679 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-02 06:59:45,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 06:59:45,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 306 states and 573 transitions. [2019-12-02 06:59:45,507 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 573 transitions. [2019-12-02 06:59:45,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-02 06:59:45,508 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 06:59:45,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 06:59:45,532 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-02 06:59:51,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 06:59:51,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 305 states and 568 transitions. [2019-12-02 06:59:51,391 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 568 transitions. [2019-12-02 06:59:51,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-02 06:59:51,391 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 06:59:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 06:59:51,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 07:00:08,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 07:00:08,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 320 states and 600 transitions. [2019-12-02 07:00:08,881 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 600 transitions. [2019-12-02 07:00:08,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-02 07:00:08,881 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 07:00:08,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 07:00:08,895 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-02 07:00:14,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 07:00:14,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 319 states and 596 transitions. [2019-12-02 07:00:14,324 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 596 transitions. [2019-12-02 07:00:14,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-02 07:00:14,325 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 07:00:14,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 07:00:14,338 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-02 07:00:24,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 07:00:24,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 325 states and 607 transitions. [2019-12-02 07:00:24,862 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 607 transitions. [2019-12-02 07:00:24,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-02 07:00:24,863 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 07:00:24,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 07:00:24,883 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-02 07:00:35,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 07:00:35,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 329 states and 614 transitions. [2019-12-02 07:00:35,677 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 614 transitions. [2019-12-02 07:00:35,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-02 07:00:35,677 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 07:00:35,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 07:00:35,692 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-02 07:00:39,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 07:00:39,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 331 states and 619 transitions. [2019-12-02 07:00:39,204 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 619 transitions. [2019-12-02 07:00:39,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-02 07:00:39,205 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 07:00:39,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 07:00:39,229 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-02 07:00:42,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 07:00:42,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 335 states and 626 transitions. [2019-12-02 07:00:42,953 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 626 transitions. [2019-12-02 07:00:42,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-02 07:00:42,953 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 07:00:42,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 07:00:42,967 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-02 07:00:48,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 07:00:48,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 337 states and 632 transitions. [2019-12-02 07:00:48,490 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 632 transitions. [2019-12-02 07:00:48,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-02 07:00:48,491 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 07:00:48,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 07:00:48,513 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-02 07:00:50,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 07:00:50,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 336 states and 630 transitions. [2019-12-02 07:00:50,308 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 630 transitions. [2019-12-02 07:00:50,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-02 07:00:50,309 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 07:00:50,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 07:00:50,323 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-02 07:00:54,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 07:00:54,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 342 states and 640 transitions. [2019-12-02 07:00:54,424 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 640 transitions. [2019-12-02 07:00:54,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-02 07:00:54,424 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 07:00:54,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 07:00:54,438 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-02 07:00:56,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 07:00:56,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 342 states and 639 transitions. [2019-12-02 07:00:56,175 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 639 transitions. [2019-12-02 07:00:56,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-02 07:00:56,175 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 07:00:56,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 07:00:56,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 07:00:59,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 07:00:59,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 344 states and 643 transitions. [2019-12-02 07:00:59,137 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 643 transitions. [2019-12-02 07:00:59,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-02 07:00:59,137 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 07:00:59,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 07:00:59,151 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-02 07:01:01,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 07:01:01,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 344 states and 642 transitions. [2019-12-02 07:01:01,020 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 642 transitions. [2019-12-02 07:01:01,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-02 07:01:01,020 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 07:01:01,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 07:01:01,034 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-02 07:01:08,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 07:01:08,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 350 states and 655 transitions. [2019-12-02 07:01:08,299 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 655 transitions. [2019-12-02 07:01:08,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-02 07:01:08,299 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 07:01:08,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 07:01:08,313 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-02 07:01:12,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 07:01:12,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 335 states and 620 transitions. [2019-12-02 07:01:12,580 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 620 transitions. [2019-12-02 07:01:12,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-02 07:01:12,581 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 07:01:12,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 07:01:12,595 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-02 07:01:14,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 07:01:14,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 339 states and 627 transitions. [2019-12-02 07:01:14,379 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 627 transitions. [2019-12-02 07:01:14,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-02 07:01:14,380 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 07:01:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 07:01:15,340 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-02 07:01:15,941 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2019-12-02 07:01:20,162 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2019-12-02 07:01:20,862 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 79 [2019-12-02 07:01:23,788 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 80 [2019-12-02 07:01:24,453 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 81 [2019-12-02 07:01:27,353 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-02 07:01:27,952 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 82 [2019-12-02 07:01:48,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 07:01:48,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 337 states and 624 transitions. [2019-12-02 07:01:48,845 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 624 transitions. [2019-12-02 07:01:48,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-02 07:01:48,846 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 07:01:48,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 07:01:51,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-02 07:01:53,480 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-12-02 07:01:57,092 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-12-02 07:02:01,000 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2019-12-02 07:02:04,844 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2019-12-02 07:02:09,155 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 74 [2019-12-02 07:02:41,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 07:02:41,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 338 states and 625 transitions. [2019-12-02 07:02:41,292 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 625 transitions. [2019-12-02 07:02:41,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-02 07:02:41,293 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 07:02:41,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 07:02:42,894 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-02 07:02:45,015 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2019-12-02 07:02:48,733 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 78 [2019-12-02 07:02:52,494 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 80 [2019-12-02 07:02:56,386 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 81 [2019-12-02 07:03:23,654 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-12-02 07:03:46,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 07:03:46,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 348 states and 648 transitions. [2019-12-02 07:03:46,733 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 648 transitions. [2019-12-02 07:03:46,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-02 07:03:46,734 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 07:03:46,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-02 07:03:46,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-02 07:03:46,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-02 07:03:46,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-02 07:03:47,020 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 55 iterations. [2019-12-02 07:03:47,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 02.12 07:03:47 ImpRootNode [2019-12-02 07:03:47,177 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2019-12-02 07:03:47,177 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-02 07:03:47,177 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-02 07:03:47,177 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-02 07:03:47,178 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:56:19" (3/4) ... [2019-12-02 07:03:47,179 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-02 07:03:47,285 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e4e40b7b-6810-4f24-b31b-ec8c2d294549/bin/ukojak/witness.graphml [2019-12-02 07:03:47,285 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-02 07:03:47,286 INFO L168 Benchmark]: Toolchain (without parser) took 449307.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 942.4 MB in the beginning and 702.3 MB in the end (delta: 240.2 MB). Peak memory consumption was 369.7 MB. Max. memory is 11.5 GB. [2019-12-02 07:03:47,286 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-02 07:03:47,286 INFO L168 Benchmark]: CACSL2BoogieTranslator took 359.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -146.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-12-02 07:03:47,286 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.46 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-02 07:03:47,287 INFO L168 Benchmark]: Boogie Preprocessor took 29.19 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-02 07:03:47,287 INFO L168 Benchmark]: RCFGBuilder took 1030.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 882.4 MB in the end (delta: 195.4 MB). Peak memory consumption was 195.4 MB. Max. memory is 11.5 GB. [2019-12-02 07:03:47,287 INFO L168 Benchmark]: CodeCheck took 447734.11 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 29.4 MB). Free memory was 882.4 MB in the beginning and 736.9 MB in the end (delta: 145.5 MB). Peak memory consumption was 174.9 MB. Max. memory is 11.5 GB. [2019-12-02 07:03:47,287 INFO L168 Benchmark]: Witness Printer took 107.74 ms. Allocated memory is still 1.2 GB. Free memory was 736.9 MB in the beginning and 702.3 MB in the end (delta: 34.6 MB). Peak memory consumption was 34.6 MB. Max. memory is 11.5 GB. [2019-12-02 07:03:47,289 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, 156 locations, 1 error locations. Result: UNSAFE, OverallTime: 447.5s, OverallIterations: 55, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 498766580 SDtfs, 1875537286 SDslu, 119933546 SDs, 0 SdLazy, 886086868 SolverSat, 616434216 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 64.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35137 GetRequests, 33543 SyntacticMatches, 482 SemanticMatches, 1112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 586387 ImplicationChecksByTransitivity, 441.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 13.4s InterpolantComputationTime, 4326 NumberOfCodeBlocks, 4326 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 4190 ConstructedInterpolants, 0 QuantifiedInterpolants, 1816706 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 54 InterpolantComputations, 54 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: 527]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1] int __return_main; [L11] msg_t nomsg = (msg_t )-1; [L12] port_t p12 = 0; [L13] char p12_old = '\x0'; [L14] char p12_new = '\x0'; [L15] _Bool ep12 = 0; [L16] port_t p13 = 0; [L17] char p13_old = '\x0'; [L18] char p13_new = '\x0'; [L19] _Bool ep13 = 0; [L20] port_t p21 = 0; [L21] char p21_old = '\x0'; [L22] char p21_new = '\x0'; [L23] _Bool ep21 = 0; [L24] port_t p23 = 0; [L25] char p23_old = '\x0'; [L26] char p23_new = '\x0'; [L27] _Bool ep23 = 0; [L28] port_t p31 = 0; [L29] char p31_old = '\x0'; [L30] char p31_new = '\x0'; [L31] _Bool ep31 = 0; [L32] port_t p32 = 0; [L33] char p32_old = '\x0'; [L34] char p32_new = '\x0'; [L35] _Bool ep32 = 0; [L36] char id1 = '\x0'; [L37] char r1 = '\x0'; [L38] char st1 = '\x0'; [L39] char nl1 = '\x0'; [L40] char m1 = '\x0'; [L41] char max1 = '\x0'; [L42] _Bool mode1 = 0; [L43] char id2 = '\x0'; [L44] char r2 = '\x0'; [L45] char st2 = '\x0'; [L46] char nl2 = '\x0'; [L47] char m2 = '\x0'; [L48] char max2 = '\x0'; [L49] _Bool mode2 = 0; [L50] char id3 = '\x0'; [L51] char r3 = '\x0'; [L52] char st3 = '\x0'; [L53] char nl3 = '\x0'; [L54] char m3 = '\x0'; [L55] char max3 = '\x0'; [L56] _Bool mode3 = 0; [L60] void (*nodes[3])() = { &node1, &node2, &node3 }; [L64] int __return_1131; [L65] int __return_1259; [L66] int __return_1378; [L67] int __tmp_1379_0; [L68] int __return_1487; [L69] int __return_1392; [L72] int main__c1; [L73] int main__i2; [L74] main__c1 = 0 [L75] ep12 = __VERIFIER_nondet_bool() [L76] ep13 = __VERIFIER_nondet_bool() [L77] ep21 = __VERIFIER_nondet_bool() [L78] ep23 = __VERIFIER_nondet_bool() [L79] ep31 = __VERIFIER_nondet_bool() [L80] ep32 = __VERIFIER_nondet_bool() [L81] id1 = __VERIFIER_nondet_char() [L82] r1 = __VERIFIER_nondet_char() [L83] st1 = __VERIFIER_nondet_char() [L84] nl1 = __VERIFIER_nondet_char() [L85] m1 = __VERIFIER_nondet_char() [L86] max1 = __VERIFIER_nondet_char() [L87] mode1 = __VERIFIER_nondet_bool() [L88] id2 = __VERIFIER_nondet_char() [L89] r2 = __VERIFIER_nondet_char() [L90] st2 = __VERIFIER_nondet_char() [L91] nl2 = __VERIFIER_nondet_char() [L92] m2 = __VERIFIER_nondet_char() [L93] max2 = __VERIFIER_nondet_char() [L94] mode2 = __VERIFIER_nondet_bool() [L95] id3 = __VERIFIER_nondet_char() [L96] r3 = __VERIFIER_nondet_char() [L97] st3 = __VERIFIER_nondet_char() [L98] nl3 = __VERIFIER_nondet_char() [L99] m3 = __VERIFIER_nondet_char() [L100] max3 = __VERIFIER_nondet_char() [L101] mode3 = __VERIFIER_nondet_bool() [L103] _Bool init__r121; [L104] _Bool init__r131; [L105] _Bool init__r211; [L106] _Bool init__r231; [L107] _Bool init__r311; [L108] _Bool init__r321; [L109] _Bool init__r122; [L110] int init__tmp; [L111] _Bool init__r132; [L112] int init__tmp___0; [L113] _Bool init__r212; [L114] int init__tmp___1; [L115] _Bool init__r232; [L116] int init__tmp___2; [L117] _Bool init__r312; [L118] int init__tmp___3; [L119] _Bool init__r322; [L120] int init__tmp___4; [L121] int init__tmp___5; [L122] init__r121 = ep12 [L123] init__r131 = ep13 [L124] init__r211 = ep21 [L125] init__r231 = ep23 [L126] init__r311 = ep31 [L127] init__r321 = ep32 [L128] COND FALSE !(!(init__r121 == 0)) [L1617] COND TRUE !(init__r131 == 0) [L1619] COND TRUE !(ep32 == 0) [L1621] init__tmp = 1 [L132] init__r122 = (_Bool)init__tmp [L133] COND TRUE !(init__r131 == 0) [L135] init__tmp___0 = 1 [L137] init__r132 = (_Bool)init__tmp___0 [L138] COND TRUE !(init__r211 == 0) [L140] init__tmp___1 = 1 [L142] init__r212 = (_Bool)init__tmp___1 [L143] COND FALSE !(!(init__r231 == 0)) [L1548] COND TRUE !(init__r211 == 0) [L1550] COND TRUE !(ep13 == 0) [L1552] init__tmp___2 = 1 [L147] init__r232 = (_Bool)init__tmp___2 [L148] COND FALSE !(!(init__r311 == 0)) [L1525] COND TRUE !(init__r321 == 0) [L1527] COND TRUE !(ep21 == 0) [L1529] init__tmp___3 = 1 [L152] init__r312 = (_Bool)init__tmp___3 [L153] COND TRUE !(init__r321 == 0) [L155] init__tmp___4 = 1 [L157] init__r322 = (_Bool)init__tmp___4 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, 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] [L158] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, 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] [L160] COND TRUE ((int)id1) != ((int)id3) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, 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] [L162] COND TRUE ((int)id2) != ((int)id3) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, 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] [L164] COND TRUE ((int)id1) >= 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, 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] [L166] COND TRUE ((int)id2) >= 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, 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] [L168] COND TRUE ((int)id3) >= 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, 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] [L170] COND TRUE ((int)r1) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, 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] [L172] COND TRUE ((int)r2) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, 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] [L174] COND TRUE ((int)r3) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, 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] [L176] COND TRUE !(init__r122 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, 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] [L178] COND TRUE !(init__r132 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, 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] [L180] COND TRUE !(init__r212 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, 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] [L182] COND TRUE !(init__r232 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, 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] [L184] COND TRUE !(init__r312 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, 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] [L186] COND TRUE !(init__r322 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, 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] [L188] COND TRUE ((int)max1) == ((int)id1) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, 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] [L190] COND TRUE ((int)max2) == ((int)id2) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, 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] [L192] COND TRUE ((int)max3) == ((int)id3) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, 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] [L194] COND TRUE ((int)st1) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, 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] [L196] COND TRUE ((int)st2) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, 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] [L198] COND TRUE ((int)st3) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, 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] [L200] COND TRUE ((int)nl1) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, 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] [L202] COND TRUE ((int)nl2) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, 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] [L204] COND TRUE ((int)nl3) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, 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] [L206] COND TRUE ((int)mode1) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, 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] [L208] COND TRUE ((int)mode2) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, 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] [L210] COND TRUE ((int)mode3) == 0 [L212] init__tmp___5 = 1 [L213] __return_1131 = init__tmp___5 [L214] main__i2 = __return_1131 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, 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] [L215] COND TRUE main__i2 != 0 [L217] p12_old = nomsg [L218] p12_new = nomsg [L219] p13_old = nomsg [L220] p13_new = nomsg [L221] p21_old = nomsg [L222] p21_new = nomsg [L223] p23_old = nomsg [L224] p23_new = nomsg [L225] p31_old = nomsg [L226] p31_new = nomsg [L227] p32_old = nomsg [L228] p32_new = nomsg [L229] main__i2 = 0 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L230] COND TRUE main__i2 < 6 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L233] COND FALSE !(!(mode1 == 0)) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L239] COND TRUE ((int)r1) < 2 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L241] COND FALSE !(!(ep12 == 0)) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L252] COND TRUE !(ep13 == 0) [L254] int node1____CPAchecker_TMP_1; VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L255] COND TRUE max1 != nomsg VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L257] COND TRUE p13_new == nomsg [L259] node1____CPAchecker_TMP_1 = max1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L261] p13_new = node1____CPAchecker_TMP_1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=2, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L263] mode1 = 1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=0, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=2, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L265] COND FALSE !(!(mode2 == 0)) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=0, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=2, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L271] COND TRUE ((int)r2) < 2 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=0, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=2, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L273] COND TRUE !(ep21 == 0) [L275] int node2____CPAchecker_TMP_0; VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=0, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=2, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L276] COND TRUE max2 != nomsg VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=0, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=2, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L278] COND TRUE p21_new == nomsg [L280] node2____CPAchecker_TMP_0 = max2 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=0, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=2, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L282] p21_new = node2____CPAchecker_TMP_0 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=0, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=2, p13_old=-1, p21=0, p21_new=1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L284] COND FALSE !(!(ep23 == 0)) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=0, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=2, p13_old=-1, p21=0, p21_new=1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L295] mode2 = 1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=2, p13_old=-1, p21=0, p21_new=1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L297] COND FALSE !(!(mode3 == 0)) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=2, p13_old=-1, p21=0, p21_new=1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L303] COND TRUE ((int)r3) < 2 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=2, p13_old=-1, p21=0, p21_new=1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L305] COND FALSE !(!(ep31 == 0)) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=2, p13_old=-1, p21=0, p21_new=1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L316] COND TRUE !(ep32 == 0) [L318] int node3____CPAchecker_TMP_1; VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=2, p13_old=-1, p21=0, p21_new=1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L319] COND TRUE max3 != nomsg VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=2, p13_old=-1, p21=0, p21_new=1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L321] COND TRUE p32_new == nomsg [L323] node3____CPAchecker_TMP_1 = max3 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=2, p13_old=-1, p21=0, p21_new=1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L325] p32_new = node3____CPAchecker_TMP_1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=2, p13_old=-1, p21=0, p21_new=1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=0, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L327] mode3 = 1 [L328] p12_old = p12_new [L329] p12_new = nomsg [L330] p13_old = p13_new [L331] p13_new = nomsg [L332] p21_old = p21_new [L333] p21_new = nomsg [L334] p23_old = p23_new [L335] p23_new = nomsg [L336] p31_old = p31_new [L337] p31_new = nomsg [L338] p32_old = p32_new [L339] p32_new = nomsg [L341] int check__tmp; VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L342] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L344] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L346] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L348] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L350] COND FALSE !(((int)r1) >= 2) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L356] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L358] COND TRUE ((int)r1) < 2 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L360] COND FALSE !(((int)r1) >= 2) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L366] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L368] COND TRUE ((int)r1) < 2 [L370] check__tmp = 1 [L371] __return_1259 = check__tmp [L372] main__c1 = __return_1259 [L374] _Bool __tmp_1; [L375] __tmp_1 = main__c1 [L376] _Bool assert__arg; [L377] assert__arg = __tmp_1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L378] COND FALSE !(assert__arg == 0) [L384] int main____CPAchecker_TMP_0 = main__i2; [L385] main__i2 = main__i2 + 1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L386] COND TRUE main__i2 < 6 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=-128, m2=0, m3=-128, max1=2, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L389] COND TRUE !(mode1 == 0) [L391] r1 = (char)(((int)r1) + 1) [L392] COND TRUE !(ep21 == 0) [L394] m1 = p21_old [L395] p21_old = nomsg [L396] COND FALSE !(((int)m1) > ((int)max1)) [L400] COND FALSE !(!(ep31 == 0)) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=1, m2=0, m3=-128, max1=2, max2=1, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L408] COND TRUE ((int)r1) == 1 [L410] COND TRUE ((int)max1) == ((int)id1) [L412] st1 = 1 [L414] mode1 = 0 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=1, m2=0, m3=-128, max1=2, max2=1, max3=0, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L416] COND TRUE !(mode2 == 0) [L418] r2 = (char)(((int)r2) + 1) [L419] COND FALSE !(!(ep12 == 0)) [L427] COND TRUE !(ep32 == 0) [L429] m2 = p32_old [L430] p32_old = nomsg [L431] COND FALSE !(((int)m2) > ((int)max2)) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=1, m2=0, m3=-128, max1=2, max2=1, max3=0, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L435] COND FALSE !(((int)r2) == 2) [L441] mode2 = 0 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=1, m2=0, m3=-128, max1=2, max2=1, max3=0, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L443] COND TRUE !(mode3 == 0) [L445] r3 = (char)(((int)r3) + 1) [L446] COND TRUE !(ep13 == 0) [L448] m3 = p13_old [L449] p13_old = nomsg [L450] COND TRUE ((int)m3) > ((int)max3) [L452] max3 = m3 [L454] COND FALSE !(!(ep23 == 0)) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=1, m2=0, m3=2, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-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] [L462] COND FALSE !(((int)r3) == 2) [L468] mode3 = 0 [L469] p12_old = p12_new [L470] p12_new = nomsg [L471] p13_old = p13_new [L472] p13_new = nomsg [L473] p21_old = p21_new [L474] p21_new = nomsg [L475] p23_old = p23_new [L476] p23_new = nomsg [L477] p31_old = p31_new [L478] p31_new = nomsg [L479] p32_old = p32_new [L480] p32_new = nomsg [L482] int check__tmp; VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=1, m2=0, m3=2, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L483] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=1, m2=0, m3=2, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L485] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=1, m2=0, m3=2, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L487] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=1, m2=0, m3=2, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L489] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=1, m2=0, m3=2, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L491] COND FALSE !(((int)r1) >= 2) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=1, m2=0, m3=2, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L497] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) == 0) [L1065] check__tmp = 0 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=1, m2=0, m3=2, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L515] __return_1378 = check__tmp [L516] main__c1 = __return_1378 [L517] __tmp_1379_0 = main____CPAchecker_TMP_0 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=1, m2=0, m3=2, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L519] main____CPAchecker_TMP_0 = __tmp_1379_0 [L521] _Bool __tmp_2; [L522] __tmp_2 = main__c1 [L523] _Bool assert__arg; [L524] assert__arg = __tmp_2 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=1, m2=0, m3=2, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L525] COND TRUE assert__arg == 0 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=1, m2=0, m3=2, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L527] __VERIFIER_error() VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=0, m1=1, m2=0, m3=2, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 359.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -146.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.46 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.19 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1030.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 882.4 MB in the end (delta: 195.4 MB). Peak memory consumption was 195.4 MB. Max. memory is 11.5 GB. * CodeCheck took 447734.11 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 29.4 MB). Free memory was 882.4 MB in the beginning and 736.9 MB in the end (delta: 145.5 MB). Peak memory consumption was 174.9 MB. Max. memory is 11.5 GB. * Witness Printer took 107.74 ms. Allocated memory is still 1.2 GB. Free memory was 736.9 MB in the beginning and 702.3 MB in the end (delta: 34.6 MB). Peak memory consumption was 34.6 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...