./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.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_e49c1fda-7f15-4a1c-bec2-07cdf2210ef5/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e49c1fda-7f15-4a1c-bec2-07cdf2210ef5/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e49c1fda-7f15-4a1c-bec2-07cdf2210ef5/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e49c1fda-7f15-4a1c-bec2-07cdf2210ef5/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_e49c1fda-7f15-4a1c-bec2-07cdf2210ef5/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e49c1fda-7f15-4a1c-bec2-07cdf2210ef5/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 3381374679dc4a7458d725215e8a6e295cc6e6a1 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-01 08:01:48,031 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-01 08:01:48,032 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-01 08:01:48,039 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-01 08:01:48,040 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-01 08:01:48,040 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-01 08:01:48,041 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-01 08:01:48,042 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-01 08:01:48,044 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-01 08:01:48,044 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-01 08:01:48,045 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-01 08:01:48,046 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-01 08:01:48,046 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-01 08:01:48,047 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-01 08:01:48,047 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-01 08:01:48,048 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-01 08:01:48,048 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-01 08:01:48,049 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-01 08:01:48,050 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-01 08:01:48,052 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-01 08:01:48,053 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-01 08:01:48,054 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-01 08:01:48,054 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-01 08:01:48,055 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-01 08:01:48,057 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-01 08:01:48,057 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-01 08:01:48,057 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-01 08:01:48,057 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-01 08:01:48,058 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-01 08:01:48,058 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-01 08:01:48,058 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-01 08:01:48,059 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-01 08:01:48,059 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-01 08:01:48,060 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-01 08:01:48,060 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-01 08:01:48,060 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-01 08:01:48,061 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-01 08:01:48,061 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-01 08:01:48,061 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-01 08:01:48,062 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-01 08:01:48,062 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-01 08:01:48,062 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e49c1fda-7f15-4a1c-bec2-07cdf2210ef5/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2019-12-01 08:01:48,071 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-01 08:01:48,071 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-01 08:01:48,072 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-01 08:01:48,072 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2019-12-01 08:01:48,072 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-01 08:01:48,073 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-01 08:01:48,073 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-01 08:01:48,073 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-01 08:01:48,073 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-01 08:01:48,073 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-01 08:01:48,073 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-01 08:01:48,073 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-01 08:01:48,073 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-01 08:01:48,073 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-01 08:01:48,073 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-01 08:01:48,074 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-01 08:01:48,074 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-01 08:01:48,074 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-01 08:01:48,074 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-12-01 08:01:48,074 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-12-01 08:01:48,074 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-01 08:01:48,074 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-01 08:01:48,074 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-12-01 08:01:48,075 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-01 08:01:48,075 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-01 08:01:48,075 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-01 08:01:48,075 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2019-12-01 08:01:48,075 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-01 08:01:48,075 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-01 08:01:48,075 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_e49c1fda-7f15-4a1c-bec2-07cdf2210ef5/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 -> 3381374679dc4a7458d725215e8a6e295cc6e6a1 [2019-12-01 08:01:48,174 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-01 08:01:48,181 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-01 08:01:48,184 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-01 08:01:48,185 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-01 08:01:48,186 INFO L275 PluginConnector]: CDTParser initialized [2019-12-01 08:01:48,186 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e49c1fda-7f15-4a1c-bec2-07cdf2210ef5/bin/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c [2019-12-01 08:01:48,232 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e49c1fda-7f15-4a1c-bec2-07cdf2210ef5/bin/ukojak/data/b0af01c3c/9fc4944bb5cb47efaa1968783bc13ee3/FLAG66c4b2fef [2019-12-01 08:01:48,669 INFO L306 CDTParser]: Found 1 translation units. [2019-12-01 08:01:48,669 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e49c1fda-7f15-4a1c-bec2-07cdf2210ef5/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c [2019-12-01 08:01:48,676 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e49c1fda-7f15-4a1c-bec2-07cdf2210ef5/bin/ukojak/data/b0af01c3c/9fc4944bb5cb47efaa1968783bc13ee3/FLAG66c4b2fef [2019-12-01 08:01:48,685 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e49c1fda-7f15-4a1c-bec2-07cdf2210ef5/bin/ukojak/data/b0af01c3c/9fc4944bb5cb47efaa1968783bc13ee3 [2019-12-01 08:01:48,687 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-01 08:01:48,688 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-01 08:01:48,688 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-01 08:01:48,689 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-01 08:01:48,691 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-01 08:01:48,691 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 08:01:48" (1/1) ... [2019-12-01 08:01:48,693 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b211215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:01:48, skipping insertion in model container [2019-12-01 08:01:48,693 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 08:01:48" (1/1) ... [2019-12-01 08:01:48,698 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-01 08:01:48,722 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-01 08:01:48,905 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-01 08:01:48,911 INFO L203 MainTranslator]: Completed pre-run [2019-12-01 08:01:48,946 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-01 08:01:48,957 INFO L208 MainTranslator]: Completed translation [2019-12-01 08:01:48,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:01:48 WrapperNode [2019-12-01 08:01:48,957 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-01 08:01:48,958 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-01 08:01:48,958 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-01 08:01:48,958 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-01 08:01:48,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:01:48" (1/1) ... [2019-12-01 08:01:48,970 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:01:48" (1/1) ... [2019-12-01 08:01:48,992 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-01 08:01:48,992 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-01 08:01:48,992 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-01 08:01:48,992 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-01 08:01:48,999 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:01:48" (1/1) ... [2019-12-01 08:01:48,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:01:48" (1/1) ... [2019-12-01 08:01:49,002 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:01:48" (1/1) ... [2019-12-01 08:01:49,002 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:01:48" (1/1) ... [2019-12-01 08:01:49,008 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:01:48" (1/1) ... [2019-12-01 08:01:49,013 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:01:48" (1/1) ... [2019-12-01 08:01:49,015 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:01:48" (1/1) ... [2019-12-01 08:01:49,018 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-01 08:01:49,018 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-01 08:01:49,018 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-01 08:01:49,018 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-01 08:01:49,019 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:01:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e49c1fda-7f15-4a1c-bec2-07cdf2210ef5/bin/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-12-01 08:01:49,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-01 08:01:49,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-01 08:01:50,424 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-01 08:01:50,424 INFO L287 CfgBuilder]: Removed 17 assume(true) statements. [2019-12-01 08:01:50,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 08:01:50 BoogieIcfgContainer [2019-12-01 08:01:50,425 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-01 08:01:50,425 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-12-01 08:01:50,426 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-12-01 08:01:50,432 INFO L275 PluginConnector]: CodeCheck initialized [2019-12-01 08:01:50,433 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 08:01:50" (1/1) ... [2019-12-01 08:01:50,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-01 08:01:50,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:01:50,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2019-12-01 08:01:50,463 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2019-12-01 08:01:50,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-01 08:01:50,465 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:01:50,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:01:50,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:01:50,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:01:50,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 21 states and 34 transitions. [2019-12-01 08:01:50,856 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2019-12-01 08:01:50,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-01 08:01:50,857 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:01:50,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:01:50,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:01:51,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:01:51,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 24 states and 41 transitions. [2019-12-01 08:01:51,178 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2019-12-01 08:01:51,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-01 08:01:51,181 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:01:51,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:01:51,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:01:51,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:01:51,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 28 states and 50 transitions. [2019-12-01 08:01:51,642 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 50 transitions. [2019-12-01 08:01:51,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-01 08:01:51,642 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:01:51,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:01:51,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:01:52,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:01:52,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 33 states and 61 transitions. [2019-12-01 08:01:52,231 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 61 transitions. [2019-12-01 08:01:52,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-01 08:01:52,231 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:01:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:01:52,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:01:53,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:01:53,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 40 states and 74 transitions. [2019-12-01 08:01:53,027 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 74 transitions. [2019-12-01 08:01:53,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-01 08:01:53,027 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:01:53,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:01:53,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:01:53,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:01:53,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 46 states and 86 transitions. [2019-12-01 08:01:53,883 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 86 transitions. [2019-12-01 08:01:53,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-01 08:01:53,883 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:01:53,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:01:53,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:01:54,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:01:54,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 47 states and 86 transitions. [2019-12-01 08:01:54,100 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 86 transitions. [2019-12-01 08:01:54,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-01 08:01:54,101 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:01:54,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:01:54,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:01:54,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:01:54,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 48 states and 87 transitions. [2019-12-01 08:01:54,144 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 87 transitions. [2019-12-01 08:01:54,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-01 08:01:54,145 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:01:54,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:01:54,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:01:55,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:01:55,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 58 states and 104 transitions. [2019-12-01 08:01:55,607 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 104 transitions. [2019-12-01 08:01:55,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-01 08:01:55,607 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:01:55,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:01:55,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:01:55,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:01:55,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 61 states and 109 transitions. [2019-12-01 08:01:55,910 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 109 transitions. [2019-12-01 08:01:55,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-01 08:01:55,911 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:01:55,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:01:56,708 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:02:00,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:02:00,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 77 states and 143 transitions. [2019-12-01 08:02:00,777 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 143 transitions. [2019-12-01 08:02:00,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-01 08:02:00,778 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:02:00,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:02:01,220 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:02:04,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:02:04,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 90 states and 164 transitions. [2019-12-01 08:02:04,688 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 164 transitions. [2019-12-01 08:02:04,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-01 08:02:04,690 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:02:04,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:02:04,782 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:02:05,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:02:05,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 91 states and 166 transitions. [2019-12-01 08:02:05,049 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 166 transitions. [2019-12-01 08:02:05,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-01 08:02:05,050 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:02:05,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:02:05,812 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:02:08,294 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-12-01 08:02:08,673 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-12-01 08:02:10,345 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2019-12-01 08:02:13,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:02:13,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 109 states and 204 transitions. [2019-12-01 08:02:13,960 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 204 transitions. [2019-12-01 08:02:13,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-01 08:02:13,963 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:02:14,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:02:14,071 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:02:14,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:02:14,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 111 states and 209 transitions. [2019-12-01 08:02:14,656 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 209 transitions. [2019-12-01 08:02:14,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-01 08:02:14,657 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:02:14,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:02:14,770 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:02:15,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:02:15,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 112 states and 211 transitions. [2019-12-01 08:02:15,066 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 211 transitions. [2019-12-01 08:02:15,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-01 08:02:15,067 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:02:15,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:02:15,684 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:02:22,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:02:22,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 131 states and 252 transitions. [2019-12-01 08:02:22,158 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 252 transitions. [2019-12-01 08:02:22,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-01 08:02:22,159 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:02:22,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:02:22,240 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:02:23,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:02:23,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 134 states and 259 transitions. [2019-12-01 08:02:23,778 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 259 transitions. [2019-12-01 08:02:23,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-01 08:02:23,778 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:02:23,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:02:23,864 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:02:25,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:02:25,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 136 states and 264 transitions. [2019-12-01 08:02:25,343 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 264 transitions. [2019-12-01 08:02:25,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-01 08:02:25,345 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:02:25,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:02:27,142 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:02:36,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:02:36,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 156 states and 304 transitions. [2019-12-01 08:02:36,615 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 304 transitions. [2019-12-01 08:02:36,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-01 08:02:36,616 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:02:36,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:02:36,738 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:02:37,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:02:37,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 158 states and 313 transitions. [2019-12-01 08:02:37,818 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 313 transitions. [2019-12-01 08:02:37,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-01 08:02:37,819 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:02:37,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:02:37,949 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:02:39,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:02:39,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 160 states and 316 transitions. [2019-12-01 08:02:39,957 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 316 transitions. [2019-12-01 08:02:39,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-01 08:02:39,958 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:02:40,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:02:40,083 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:02:40,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:02:40,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 161 states and 317 transitions. [2019-12-01 08:02:40,515 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 317 transitions. [2019-12-01 08:02:40,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-01 08:02:40,515 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:02:40,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:02:40,630 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:02:41,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:02:41,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 163 states and 324 transitions. [2019-12-01 08:02:41,597 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 324 transitions. [2019-12-01 08:02:41,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-01 08:02:41,598 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:02:41,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:02:42,232 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:02:45,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:02:45,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 165 states and 330 transitions. [2019-12-01 08:02:45,359 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 330 transitions. [2019-12-01 08:02:45,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-01 08:02:45,360 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:02:45,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:02:45,545 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:02:45,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:02:45,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 166 states and 333 transitions. [2019-12-01 08:02:45,963 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 333 transitions. [2019-12-01 08:02:45,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-01 08:02:45,964 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:02:46,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:02:46,128 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:02:46,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:02:46,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 167 states and 335 transitions. [2019-12-01 08:02:46,649 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 335 transitions. [2019-12-01 08:02:46,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-01 08:02:46,650 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:02:46,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:02:46,828 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:02:47,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:02:47,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 168 states and 336 transitions. [2019-12-01 08:02:47,053 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 336 transitions. [2019-12-01 08:02:47,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-01 08:02:47,054 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:02:47,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:02:47,230 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:02:48,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:02:48,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 169 states and 337 transitions. [2019-12-01 08:02:48,029 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 337 transitions. [2019-12-01 08:02:48,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-01 08:02:48,030 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:02:48,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:02:48,212 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:02:49,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:02:49,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 172 states and 341 transitions. [2019-12-01 08:02:49,002 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 341 transitions. [2019-12-01 08:02:49,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-01 08:02:49,003 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:02:49,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:02:49,167 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:02:50,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:02:50,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 175 states and 345 transitions. [2019-12-01 08:02:50,481 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 345 transitions. [2019-12-01 08:02:50,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-01 08:02:50,482 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:02:50,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:02:53,391 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:02:55,047 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-12-01 08:02:58,189 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-12-01 08:03:04,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:03:04,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 189 states and 369 transitions. [2019-12-01 08:03:04,748 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 369 transitions. [2019-12-01 08:03:04,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-01 08:03:04,748 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:03:04,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:03:04,881 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:03:06,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:03:06,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 193 states and 381 transitions. [2019-12-01 08:03:06,806 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 381 transitions. [2019-12-01 08:03:06,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-01 08:03:06,807 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:03:06,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:03:06,935 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:03:07,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:03:07,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 194 states and 382 transitions. [2019-12-01 08:03:07,483 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 382 transitions. [2019-12-01 08:03:07,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-01 08:03:07,483 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:03:07,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:03:07,619 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:03:09,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:03:09,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 198 states and 393 transitions. [2019-12-01 08:03:09,229 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 393 transitions. [2019-12-01 08:03:09,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-01 08:03:09,229 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:03:09,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:03:09,364 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:03:10,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:03:10,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 200 states and 401 transitions. [2019-12-01 08:03:10,129 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 401 transitions. [2019-12-01 08:03:10,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-01 08:03:10,130 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:03:10,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:03:10,260 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:03:10,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:03:10,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 201 states and 402 transitions. [2019-12-01 08:03:10,833 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 402 transitions. [2019-12-01 08:03:10,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-01 08:03:10,833 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:03:10,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:03:13,149 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:03:24,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:03:24,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 217 states and 446 transitions. [2019-12-01 08:03:24,826 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 446 transitions. [2019-12-01 08:03:24,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-01 08:03:24,826 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:03:24,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:03:25,304 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:03:27,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:03:27,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 222 states and 460 transitions. [2019-12-01 08:03:27,856 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 460 transitions. [2019-12-01 08:03:27,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-01 08:03:27,857 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:03:27,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:03:28,335 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:03:29,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:03:29,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 224 states and 463 transitions. [2019-12-01 08:03:29,681 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 463 transitions. [2019-12-01 08:03:29,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-01 08:03:29,681 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:03:29,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:03:30,218 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:03:30,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:03:30,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 225 states and 464 transitions. [2019-12-01 08:03:30,821 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 464 transitions. [2019-12-01 08:03:30,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-01 08:03:30,821 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:03:30,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:03:31,365 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:03:32,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:03:32,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 227 states and 470 transitions. [2019-12-01 08:03:32,043 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 470 transitions. [2019-12-01 08:03:32,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-01 08:03:32,044 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:03:32,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:03:32,541 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:03:33,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:03:33,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 229 states and 476 transitions. [2019-12-01 08:03:33,722 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 476 transitions. [2019-12-01 08:03:33,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-01 08:03:33,723 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:03:33,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:03:36,836 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:03:58,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:03:58,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 257 states and 535 transitions. [2019-12-01 08:03:58,099 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 535 transitions. [2019-12-01 08:03:58,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-01 08:03:58,100 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:03:58,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:03:58,231 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:04:01,149 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2019-12-01 08:04:01,618 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2019-12-01 08:04:03,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:04:03,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 262 states and 547 transitions. [2019-12-01 08:04:03,279 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 547 transitions. [2019-12-01 08:04:03,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-01 08:04:03,280 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:04:03,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:04:03,405 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:04:06,116 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2019-12-01 08:04:06,491 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2019-12-01 08:04:07,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:04:07,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 266 states and 557 transitions. [2019-12-01 08:04:07,935 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 557 transitions. [2019-12-01 08:04:07,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-01 08:04:07,936 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:04:08,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:04:10,523 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:04:19,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:04:19,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 276 states and 575 transitions. [2019-12-01 08:04:19,961 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 575 transitions. [2019-12-01 08:04:19,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-01 08:04:19,961 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:04:20,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:04:20,069 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:04:20,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:04:20,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 277 states and 576 transitions. [2019-12-01 08:04:20,702 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 576 transitions. [2019-12-01 08:04:20,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-01 08:04:20,703 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:04:20,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:04:20,809 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:04:21,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:04:21,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 276 states and 574 transitions. [2019-12-01 08:04:21,838 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 574 transitions. [2019-12-01 08:04:21,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-01 08:04:21,840 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:04:21,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:04:21,958 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:04:23,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:04:23,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 270 states and 567 transitions. [2019-12-01 08:04:23,794 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 567 transitions. [2019-12-01 08:04:23,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-01 08:04:23,795 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:04:23,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:04:27,190 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:04:32,513 WARN L192 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-12-01 08:04:39,331 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 31 [2019-12-01 08:04:50,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:04:50,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 294 states and 609 transitions. [2019-12-01 08:04:50,599 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 609 transitions. [2019-12-01 08:04:50,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-01 08:04:50,599 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:04:50,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:04:50,732 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:04:52,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:04:52,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 295 states and 616 transitions. [2019-12-01 08:04:52,986 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 616 transitions. [2019-12-01 08:04:52,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-01 08:04:52,986 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:04:53,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:04:53,120 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:04:53,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:04:53,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 290 states and 610 transitions. [2019-12-01 08:04:53,979 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 610 transitions. [2019-12-01 08:04:53,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-01 08:04:53,979 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:04:54,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:04:56,149 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:04:59,387 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2019-12-01 08:04:59,869 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 26 [2019-12-01 08:05:01,483 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 26 [2019-12-01 08:05:07,155 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 32 [2019-12-01 08:05:11,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:05:11,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 296 states and 627 transitions. [2019-12-01 08:05:11,134 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 627 transitions. [2019-12-01 08:05:11,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-01 08:05:11,134 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:05:11,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:05:12,044 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:05:13,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:05:13,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 297 states and 632 transitions. [2019-12-01 08:05:13,057 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 632 transitions. [2019-12-01 08:05:13,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-01 08:05:13,058 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:05:13,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:05:15,594 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:05:22,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:05:22,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 301 states and 641 transitions. [2019-12-01 08:05:22,833 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 641 transitions. [2019-12-01 08:05:22,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-01 08:05:22,834 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:05:22,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:05:22,984 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:05:23,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:05:23,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 302 states and 646 transitions. [2019-12-01 08:05:23,849 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 646 transitions. [2019-12-01 08:05:23,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-01 08:05:23,850 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:05:23,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:05:24,007 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:05:26,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:05:26,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 305 states and 654 transitions. [2019-12-01 08:05:26,061 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 654 transitions. [2019-12-01 08:05:26,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-01 08:05:26,061 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:05:26,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:05:30,152 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:05:39,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:05:39,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 308 states and 662 transitions. [2019-12-01 08:05:39,226 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 662 transitions. [2019-12-01 08:05:39,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-01 08:05:39,227 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:05:39,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:05:39,816 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:05:40,208 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-12-01 08:05:40,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:05:40,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 309 states and 665 transitions. [2019-12-01 08:05:40,704 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 665 transitions. [2019-12-01 08:05:40,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-01 08:05:40,705 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:05:40,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 08:05:41,657 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 08:05:43,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 08:05:43,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 312 states and 674 transitions. [2019-12-01 08:05:43,901 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 674 transitions. [2019-12-01 08:05:43,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-01 08:05:43,901 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 08:05:44,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-01 08:05:44,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-01 08:05:44,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-01 08:05:44,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-01 08:05:45,089 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 62 iterations. [2019-12-01 08:05:45,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 01.12 08:05:45 ImpRootNode [2019-12-01 08:05:45,201 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2019-12-01 08:05:45,202 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-01 08:05:45,202 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-01 08:05:45,202 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-01 08:05:45,202 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 08:01:50" (3/4) ... [2019-12-01 08:05:45,204 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-01 08:05:45,289 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e49c1fda-7f15-4a1c-bec2-07cdf2210ef5/bin/ukojak/witness.graphml [2019-12-01 08:05:45,289 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-01 08:05:45,290 INFO L168 Benchmark]: Toolchain (without parser) took 236601.96 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 940.9 MB in the beginning and 745.9 MB in the end (delta: 195.0 MB). Peak memory consumption was 305.7 MB. Max. memory is 11.5 GB. [2019-12-01 08:05:45,290 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 956.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-01 08:05:45,290 INFO L168 Benchmark]: CACSL2BoogieTranslator took 268.99 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -146.7 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-12-01 08:05:45,290 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.36 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-01 08:05:45,290 INFO L168 Benchmark]: Boogie Preprocessor took 25.83 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-01 08:05:45,290 INFO L168 Benchmark]: RCFGBuilder took 1406.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 37.8 MB). Peak memory consumption was 257.0 MB. Max. memory is 11.5 GB. [2019-12-01 08:05:45,291 INFO L168 Benchmark]: CodeCheck took 234775.90 ms. Allocated memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.6 MB). Free memory was 1.0 GB in the beginning and 771.2 MB in the end (delta: 273.2 MB). Peak memory consumption was 285.8 MB. Max. memory is 11.5 GB. [2019-12-01 08:05:45,291 INFO L168 Benchmark]: Witness Printer took 87.14 ms. Allocated memory is still 1.1 GB. Free memory was 771.2 MB in the beginning and 745.9 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. [2019-12-01 08:05:45,292 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, 19 locations, 1 error locations. Result: UNSAFE, OverallTime: 234.6s, OverallIterations: 62, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: -2112803844 SDtfs, 2092053858 SDslu, 461201692 SDs, 0 SdLazy, -803347058 SolverSat, 1910939304 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 131.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 17948 GetRequests, 15811 SyntacticMatches, 1085 SemanticMatches, 1052 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 709876 ImplicationChecksByTransitivity, 220.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.2s SsaConstructionTime, 4.6s SatisfiabilityAnalysisTime, 33.5s InterpolantComputationTime, 1717 NumberOfCodeBlocks, 1717 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 1608 ConstructedInterpolants, 0 QuantifiedInterpolants, 751628 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 61 InterpolantComputations, 10 PerfectInterpolantSequences, 176/899 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: 577]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L69] msg_t nomsg = (msg_t )-1; [L70] port_t p12 ; [L71] char p12_old ; [L72] char p12_new ; [L73] _Bool ep12 ; [L74] port_t p13 ; [L75] char p13_old ; [L76] char p13_new ; [L77] _Bool ep13 ; [L78] port_t p21 ; [L79] char p21_old ; [L80] char p21_new ; [L81] _Bool ep21 ; [L82] port_t p23 ; [L83] char p23_old ; [L84] char p23_new ; [L85] _Bool ep23 ; [L86] port_t p31 ; [L87] char p31_old ; [L88] char p31_new ; [L89] _Bool ep31 ; [L90] port_t p32 ; [L91] char p32_old ; [L92] char p32_new ; [L93] _Bool ep32 ; [L94] char id1 ; [L95] char r1 ; [L96] char st1 ; [L97] char nl1 ; [L98] char m1 ; [L99] char max1 ; [L100] _Bool mode1 ; [L101] char id2 ; [L102] char r2 ; [L103] char st2 ; [L104] char nl2 ; [L105] char m2 ; [L106] char max2 ; [L107] _Bool mode2 ; [L108] char id3 ; [L109] char r3 ; [L110] char st3 ; [L111] char nl3 ; [L112] char m3 ; [L113] char max3 ; [L114] _Bool mode3 ; [L244] void (*nodes[3])(void) = { & node1, & node2, & node3}; [L498] int c1 ; [L499] int i2 ; [L502] c1 = 0 [L503] ep12 = __VERIFIER_nondet_bool() [L504] ep13 = __VERIFIER_nondet_bool() [L505] ep21 = __VERIFIER_nondet_bool() [L506] ep23 = __VERIFIER_nondet_bool() [L507] ep31 = __VERIFIER_nondet_bool() [L508] ep32 = __VERIFIER_nondet_bool() [L509] id1 = __VERIFIER_nondet_char() [L510] r1 = __VERIFIER_nondet_char() [L511] st1 = __VERIFIER_nondet_char() [L512] nl1 = __VERIFIER_nondet_char() [L513] m1 = __VERIFIER_nondet_char() [L514] max1 = __VERIFIER_nondet_char() [L515] mode1 = __VERIFIER_nondet_bool() [L516] id2 = __VERIFIER_nondet_char() [L517] r2 = __VERIFIER_nondet_char() [L518] st2 = __VERIFIER_nondet_char() [L519] nl2 = __VERIFIER_nondet_char() [L520] m2 = __VERIFIER_nondet_char() [L521] max2 = __VERIFIER_nondet_char() [L522] mode2 = __VERIFIER_nondet_bool() [L523] id3 = __VERIFIER_nondet_char() [L524] r3 = __VERIFIER_nondet_char() [L525] st3 = __VERIFIER_nondet_char() [L526] nl3 = __VERIFIER_nondet_char() [L527] m3 = __VERIFIER_nondet_char() [L528] max3 = __VERIFIER_nondet_char() [L529] mode3 = __VERIFIER_nondet_bool() [L247] _Bool r121 ; [L248] _Bool r131 ; [L249] _Bool r211 ; [L250] _Bool r231 ; [L251] _Bool r311 ; [L252] _Bool r321 ; [L253] _Bool r122 ; [L254] int tmp ; [L255] _Bool r132 ; [L256] int tmp___0 ; [L257] _Bool r212 ; [L258] int tmp___1 ; [L259] _Bool r232 ; [L260] int tmp___2 ; [L261] _Bool r312 ; [L262] int tmp___3 ; [L263] _Bool r322 ; [L264] int tmp___4 ; [L265] int tmp___5 ; [L268] r121 = ep12 [L269] r131 = ep13 [L270] r211 = ep21 [L271] r231 = ep23 [L272] r311 = ep31 [L273] r321 = ep32 [L274] COND FALSE !(\read(r121)) [L277] COND FALSE !(\read(r131)) [L284] tmp = 0 [L286] r122 = (_Bool )tmp [L287] COND FALSE !(\read(r131)) [L290] COND FALSE !(\read(r121)) [L297] tmp___0 = 0 [L299] r132 = (_Bool )tmp___0 [L300] COND TRUE \read(r211) [L301] tmp___1 = 1 [L312] r212 = (_Bool )tmp___1 [L313] COND FALSE !(\read(r231)) [L316] COND TRUE \read(r211) [L317] COND FALSE !(\read(ep13)) [L320] tmp___2 = 0 [L325] r232 = (_Bool )tmp___2 [L326] COND FALSE !(\read(r311)) [L329] COND FALSE !(\read(r321)) [L336] tmp___3 = 0 [L338] r312 = (_Bool )tmp___3 [L339] COND FALSE !(\read(r321)) [L342] COND FALSE !(\read(r311)) [L349] tmp___4 = 0 [L351] r322 = (_Bool )tmp___4 [L352] COND TRUE (int )id1 != (int )id2 [L353] COND TRUE (int )id1 != (int )id3 [L354] COND TRUE (int )id2 != (int )id3 [L355] COND TRUE (int )id1 >= 0 [L356] COND TRUE (int )id2 >= 0 [L357] COND TRUE (int )id3 >= 0 [L358] COND TRUE (int )r1 == 0 [L359] COND TRUE (int )r2 == 0 [L360] COND TRUE (int )r3 == 0 [L361] COND TRUE (int )max1 == (int )id1 [L362] COND TRUE (int )max2 == (int )id2 [L363] COND TRUE (int )max3 == (int )id3 [L364] COND TRUE (int )st1 == 0 [L365] COND TRUE (int )st2 == 0 [L366] COND TRUE (int )st3 == 0 [L367] COND TRUE (int )nl1 == 0 [L368] COND TRUE (int )nl2 == 0 [L369] COND TRUE (int )nl3 == 0 [L370] COND TRUE (int )mode1 == 0 [L371] COND TRUE (int )mode2 == 0 [L372] COND TRUE (int )mode3 == 0 [L373] tmp___5 = 1 [L437] return (tmp___5); [L530] i2 = init() [L532] p12_old = nomsg [L533] p12_new = nomsg [L534] p13_old = nomsg [L535] p13_new = nomsg [L536] p21_old = nomsg [L537] p21_new = nomsg [L538] p23_old = nomsg [L539] p23_new = nomsg [L540] p31_old = nomsg [L541] p31_new = nomsg [L542] p32_old = nomsg [L543] p32_new = nomsg [L544] i2 = 0 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=6, id2=2, id3=5, m1=7, m2=127, m3=6, max1=6, max2=2, max3=5, 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] [L545] COND TRUE i2 < 6 [L120] COND FALSE !(\read(mode1)) [L145] COND TRUE (int )r1 < 2 [L146] COND FALSE !(\read(ep12)) [L149] COND FALSE !(\read(ep13)) [L153] mode1 = (_Bool)1 [L163] COND FALSE !(\read(mode2)) [L188] COND TRUE (int )r2 < 2 [L189] COND TRUE \read(ep21) [L190] EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L190] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L192] COND FALSE !(\read(ep23)) [L196] mode2 = (_Bool)1 [L206] COND FALSE !(\read(mode3)) [L231] COND TRUE (int )r3 < 2 [L232] COND FALSE !(\read(ep31)) [L235] COND FALSE !(\read(ep32)) [L239] mode3 = (_Bool)1 [L550] p12_old = p12_new [L551] p12_new = nomsg [L552] p13_old = p13_new [L553] p13_new = nomsg [L554] p21_old = p21_new [L555] p21_new = nomsg [L556] p23_old = p23_new [L557] p23_new = nomsg [L558] p31_old = p31_new [L559] p31_new = nomsg [L560] p32_old = p32_new [L561] p32_new = nomsg [L442] int tmp ; VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=6, id2=2, id3=5, m1=7, m2=127, m3=6, max1=6, max2=2, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, 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] [L445] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=6, id2=2, id3=5, m1=7, m2=127, m3=6, max1=6, max2=2, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, 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] [L446] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=6, id2=2, id3=5, m1=7, m2=127, m3=6, max1=6, max2=2, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, 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] [L447] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=6, id2=2, id3=5, m1=7, m2=127, m3=6, max1=6, max2=2, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, 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] [L448] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=6, id2=2, id3=5, m1=7, m2=127, m3=6, max1=6, max2=2, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, 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] [L449] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=6, id2=2, id3=5, m1=7, m2=127, m3=6, max1=6, max2=2, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, 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] [L452] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=6, id2=2, id3=5, m1=7, m2=127, m3=6, max1=6, max2=2, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, 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] [L454] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=6, id2=2, id3=5, m1=7, m2=127, m3=6, max1=6, max2=2, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, 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] [L459] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=6, id2=2, id3=5, m1=7, m2=127, m3=6, max1=6, max2=2, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, 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] [L462] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=6, id2=2, id3=5, m1=7, m2=127, m3=6, max1=6, max2=2, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, 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] [L464] COND TRUE (int )r1 < 2 [L465] tmp = 1 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=6, id2=2, id3=5, m1=7, m2=127, m3=6, max1=6, max2=2, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, 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] [L493] return (tmp); [L562] c1 = check() [L575] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=6, id2=2, id3=5, m1=7, m2=127, m3=6, max1=6, max2=2, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, 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] [L564] i2 ++ VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=6, id2=2, id3=5, m1=7, m2=127, m3=6, max1=6, max2=2, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, 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] [L545] COND TRUE i2 < 6 [L120] COND TRUE \read(mode1) [L121] r1 = (char )((int )r1 + 1) [L122] COND TRUE \read(ep21) [L123] m1 = p21_old [L124] p21_old = nomsg [L125] COND FALSE !((int )m1 > (int )max1) [L129] COND FALSE !(\read(ep31)) [L136] COND FALSE !((int )r1 == 2) [L143] mode1 = (_Bool)0 [L163] COND TRUE \read(mode2) [L164] r2 = (char )((int )r2 + 1) [L165] COND FALSE !(\read(ep12)) [L172] COND FALSE !(\read(ep32)) [L179] COND FALSE !((int )r2 == 2) [L186] mode2 = (_Bool)0 [L206] COND TRUE \read(mode3) [L207] r3 = (char )((int )r3 + 1) [L208] COND FALSE !(\read(ep13)) [L215] COND FALSE !(\read(ep23)) [L222] COND FALSE !((int )r3 == 2) [L229] mode3 = (_Bool)0 [L550] p12_old = p12_new [L551] p12_new = nomsg [L552] p13_old = p13_new [L553] p13_new = nomsg [L554] p21_old = p21_new [L555] p21_new = nomsg [L556] p23_old = p23_new [L557] p23_new = nomsg [L558] p31_old = p31_new [L559] p31_new = nomsg [L560] p32_old = p32_new [L561] p32_new = nomsg [L442] int tmp ; VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=6, id2=2, id3=5, m1=2, m2=127, m3=6, max1=6, max2=2, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L445] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=6, id2=2, id3=5, m1=2, m2=127, m3=6, max1=6, max2=2, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L446] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=6, id2=2, id3=5, m1=2, m2=127, m3=6, max1=6, max2=2, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L447] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=6, id2=2, id3=5, m1=2, m2=127, m3=6, max1=6, max2=2, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L448] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=6, id2=2, id3=5, m1=2, m2=127, m3=6, max1=6, max2=2, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L449] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=6, id2=2, id3=5, m1=2, m2=127, m3=6, max1=6, max2=2, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L452] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=6, id2=2, id3=5, m1=2, m2=127, m3=6, max1=6, max2=2, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L454] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=6, id2=2, id3=5, m1=2, m2=127, m3=6, max1=6, max2=2, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L459] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=6, id2=2, id3=5, m1=2, m2=127, m3=6, max1=6, max2=2, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L462] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=6, id2=2, id3=5, m1=2, m2=127, m3=6, max1=6, max2=2, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L464] COND TRUE (int )r1 < 2 [L465] tmp = 1 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=6, id2=2, id3=5, m1=2, m2=127, m3=6, max1=6, max2=2, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L493] return (tmp); [L562] c1 = check() [L575] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=6, id2=2, id3=5, m1=2, m2=127, m3=6, max1=6, max2=2, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L564] i2 ++ VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=6, id2=2, id3=5, m1=2, m2=127, m3=6, max1=6, max2=2, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L545] COND TRUE i2 < 6 [L120] COND FALSE !(\read(mode1)) [L145] COND TRUE (int )r1 < 2 [L146] COND FALSE !(\read(ep12)) [L149] COND FALSE !(\read(ep13)) [L153] mode1 = (_Bool)1 [L163] COND FALSE !(\read(mode2)) [L188] COND TRUE (int )r2 < 2 [L189] COND TRUE \read(ep21) [L190] EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L190] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L192] COND FALSE !(\read(ep23)) [L196] mode2 = (_Bool)1 [L206] COND FALSE !(\read(mode3)) [L231] COND TRUE (int )r3 < 2 [L232] COND FALSE !(\read(ep31)) [L235] COND FALSE !(\read(ep32)) [L239] mode3 = (_Bool)1 [L550] p12_old = p12_new [L551] p12_new = nomsg [L552] p13_old = p13_new [L553] p13_new = nomsg [L554] p21_old = p21_new [L555] p21_new = nomsg [L556] p23_old = p23_new [L557] p23_new = nomsg [L558] p31_old = p31_new [L559] p31_new = nomsg [L560] p32_old = p32_new [L561] p32_new = nomsg [L442] int tmp ; VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=6, id2=2, id3=5, m1=2, m2=127, m3=6, max1=6, max2=2, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L445] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=6, id2=2, id3=5, m1=2, m2=127, m3=6, max1=6, max2=2, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L446] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=6, id2=2, id3=5, m1=2, m2=127, m3=6, max1=6, max2=2, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L447] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=6, id2=2, id3=5, m1=2, m2=127, m3=6, max1=6, max2=2, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L448] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=6, id2=2, id3=5, m1=2, m2=127, m3=6, max1=6, max2=2, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L449] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=6, id2=2, id3=5, m1=2, m2=127, m3=6, max1=6, max2=2, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L452] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=6, id2=2, id3=5, m1=2, m2=127, m3=6, max1=6, max2=2, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L454] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=6, id2=2, id3=5, m1=2, m2=127, m3=6, max1=6, max2=2, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L459] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=6, id2=2, id3=5, m1=2, m2=127, m3=6, max1=6, max2=2, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L462] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=6, id2=2, id3=5, m1=2, m2=127, m3=6, max1=6, max2=2, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L464] COND TRUE (int )r1 < 2 [L465] tmp = 1 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=6, id2=2, id3=5, m1=2, m2=127, m3=6, max1=6, max2=2, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L493] return (tmp); [L562] c1 = check() [L575] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=6, id2=2, id3=5, m1=2, m2=127, m3=6, max1=6, max2=2, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L564] i2 ++ VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=6, id2=2, id3=5, m1=2, m2=127, m3=6, max1=6, max2=2, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L545] COND TRUE i2 < 6 [L120] COND TRUE \read(mode1) [L121] r1 = (char )((int )r1 + 1) [L122] COND TRUE \read(ep21) [L123] m1 = p21_old [L124] p21_old = nomsg [L125] COND FALSE !((int )m1 > (int )max1) [L129] COND FALSE !(\read(ep31)) [L136] COND TRUE (int )r1 == 2 [L137] COND TRUE (int )max1 == (int )id1 [L138] st1 = (char)1 [L143] mode1 = (_Bool)0 [L163] COND TRUE \read(mode2) [L164] r2 = (char )((int )r2 + 1) [L165] COND FALSE !(\read(ep12)) [L172] COND FALSE !(\read(ep32)) [L179] COND TRUE (int )r2 == 2 [L180] COND TRUE (int )max2 == (int )id2 [L181] st2 = (char)1 [L186] mode2 = (_Bool)0 [L206] COND TRUE \read(mode3) [L207] r3 = (char )((int )r3 + 1) [L208] COND FALSE !(\read(ep13)) [L215] COND FALSE !(\read(ep23)) [L222] COND TRUE (int )r3 == 2 [L223] COND TRUE (int )max3 == (int )id3 [L224] st3 = (char)1 [L229] mode3 = (_Bool)0 [L550] p12_old = p12_new [L551] p12_new = nomsg [L552] p13_old = p13_new [L553] p13_new = nomsg [L554] p21_old = p21_new [L555] p21_new = nomsg [L556] p23_old = p23_new [L557] p23_new = nomsg [L558] p31_old = p31_new [L559] p31_new = nomsg [L560] p32_old = p32_new [L561] p32_new = nomsg [L442] int tmp ; VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=6, id2=2, id3=5, m1=2, m2=127, m3=6, max1=6, max2=2, max3=5, 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=2, r2=2, r3=2, st1=1, st2=1, st3=1] [L445] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L491] tmp = 0 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=6, id2=2, id3=5, m1=2, m2=127, m3=6, max1=6, max2=2, max3=5, 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=2, r2=2, r3=2, st1=1, st2=1, st3=1] [L493] return (tmp); [L562] c1 = check() [L575] COND TRUE ! arg VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=6, id2=2, id3=5, m1=2, m2=127, m3=6, max1=6, max2=2, max3=5, 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=2, r2=2, r3=2, st1=1, st2=1, st3=1] [L577] __VERIFIER_error() VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=6, id2=2, id3=5, m1=2, m2=127, m3=6, max1=6, max2=2, max3=5, 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=2, r2=2, r3=2, st1=1, st2=1, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 956.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 268.99 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -146.7 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.36 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 25.83 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 1406.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 37.8 MB). Peak memory consumption was 257.0 MB. Max. memory is 11.5 GB. * CodeCheck took 234775.90 ms. Allocated memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.6 MB). Free memory was 1.0 GB in the beginning and 771.2 MB in the end (delta: 273.2 MB). Peak memory consumption was 285.8 MB. Max. memory is 11.5 GB. * Witness Printer took 87.14 ms. Allocated memory is still 1.1 GB. Free memory was 771.2 MB in the beginning and 745.9 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...