./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 69874e26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_3e9894f0-7cff-45d4-8af5-ffe49959a4f4/bin/ukojak/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_3e9894f0-7cff-45d4-8af5-ffe49959a4f4/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3e9894f0-7cff-45d4-8af5-ffe49959a4f4/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3e9894f0-7cff-45d4-8af5-ffe49959a4f4/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_3e9894f0-7cff-45d4-8af5-ffe49959a4f4/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3e9894f0-7cff-45d4-8af5-ffe49959a4f4/bin/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ee84ff7221e42645e810b19069b40c6d613a4382 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-69874e2 [2020-12-01 17:59:55,645 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-01 17:59:55,650 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-01 17:59:55,693 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-01 17:59:55,694 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-01 17:59:55,696 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-01 17:59:55,699 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-01 17:59:55,702 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-01 17:59:55,705 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-01 17:59:55,707 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-01 17:59:55,708 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-01 17:59:55,710 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-01 17:59:55,711 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-01 17:59:55,713 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-01 17:59:55,715 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-01 17:59:55,717 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-01 17:59:55,718 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-01 17:59:55,720 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-01 17:59:55,722 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-01 17:59:55,725 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-01 17:59:55,728 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-01 17:59:55,730 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-01 17:59:55,732 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-01 17:59:55,734 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-01 17:59:55,738 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-01 17:59:55,745 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-01 17:59:55,746 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-01 17:59:55,748 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-01 17:59:55,750 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-01 17:59:55,752 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-01 17:59:55,756 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-01 17:59:55,758 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-01 17:59:55,760 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-01 17:59:55,762 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-01 17:59:55,764 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-01 17:59:55,766 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-01 17:59:55,767 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-01 17:59:55,768 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-01 17:59:55,768 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-01 17:59:55,769 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-01 17:59:55,770 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-01 17:59:55,773 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3e9894f0-7cff-45d4-8af5-ffe49959a4f4/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2020-12-01 17:59:55,821 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-01 17:59:55,826 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-01 17:59:55,827 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-01 17:59:55,828 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2020-12-01 17:59:55,829 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-01 17:59:55,829 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-01 17:59:55,829 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-01 17:59:55,829 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-01 17:59:55,830 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-01 17:59:55,830 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-01 17:59:55,831 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-01 17:59:55,832 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-01 17:59:55,832 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-01 17:59:55,832 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-01 17:59:55,833 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-01 17:59:55,833 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-01 17:59:55,833 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-01 17:59:55,833 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-01 17:59:55,834 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2020-12-01 17:59:55,834 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2020-12-01 17:59:55,834 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-01 17:59:55,835 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-01 17:59:55,835 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2020-12-01 17:59:55,835 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-01 17:59:55,836 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-01 17:59:55,836 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-01 17:59:55,836 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2020-12-01 17:59:55,836 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-01 17:59:55,837 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-01 17:59:55,839 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_3e9894f0-7cff-45d4-8af5-ffe49959a4f4/bin/ukojak/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_3e9894f0-7cff-45d4-8af5-ffe49959a4f4/bin/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ee84ff7221e42645e810b19069b40c6d613a4382 [2020-12-01 17:59:56,243 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-01 17:59:56,289 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-01 17:59:56,293 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-01 17:59:56,295 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-01 17:59:56,296 INFO L275 PluginConnector]: CDTParser initialized [2020-12-01 17:59:56,298 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3e9894f0-7cff-45d4-8af5-ffe49959a4f4/bin/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c [2020-12-01 17:59:56,389 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3e9894f0-7cff-45d4-8af5-ffe49959a4f4/bin/ukojak/data/4ea5f9ce8/2cbade42b910492bb3dc8dab4ffcf793/FLAGea57a46ac [2020-12-01 17:59:57,179 INFO L306 CDTParser]: Found 1 translation units. [2020-12-01 17:59:57,180 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3e9894f0-7cff-45d4-8af5-ffe49959a4f4/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c [2020-12-01 17:59:57,194 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3e9894f0-7cff-45d4-8af5-ffe49959a4f4/bin/ukojak/data/4ea5f9ce8/2cbade42b910492bb3dc8dab4ffcf793/FLAGea57a46ac [2020-12-01 17:59:57,482 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3e9894f0-7cff-45d4-8af5-ffe49959a4f4/bin/ukojak/data/4ea5f9ce8/2cbade42b910492bb3dc8dab4ffcf793 [2020-12-01 17:59:57,485 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-01 17:59:57,489 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-01 17:59:57,494 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-01 17:59:57,494 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-01 17:59:57,498 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-01 17:59:57,500 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 05:59:57" (1/1) ... [2020-12-01 17:59:57,503 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3623b80f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:59:57, skipping insertion in model container [2020-12-01 17:59:57,503 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 05:59:57" (1/1) ... [2020-12-01 17:59:57,512 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-01 17:59:57,587 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-01 17:59:57,854 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 17:59:57,867 INFO L203 MainTranslator]: Completed pre-run [2020-12-01 17:59:57,960 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 17:59:57,983 INFO L208 MainTranslator]: Completed translation [2020-12-01 17:59:57,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:59:57 WrapperNode [2020-12-01 17:59:57,984 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-01 17:59:57,985 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-01 17:59:57,985 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-01 17:59:57,988 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-01 17:59:58,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:59:57" (1/1) ... [2020-12-01 17:59:58,038 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:59:57" (1/1) ... [2020-12-01 17:59:58,116 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-01 17:59:58,117 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-01 17:59:58,117 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-01 17:59:58,117 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-01 17:59:58,139 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:59:57" (1/1) ... [2020-12-01 17:59:58,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:59:57" (1/1) ... [2020-12-01 17:59:58,145 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:59:57" (1/1) ... [2020-12-01 17:59:58,145 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:59:57" (1/1) ... [2020-12-01 17:59:58,157 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:59:57" (1/1) ... [2020-12-01 17:59:58,168 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:59:57" (1/1) ... [2020-12-01 17:59:58,172 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:59:57" (1/1) ... [2020-12-01 17:59:58,179 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-01 17:59:58,181 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-01 17:59:58,181 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-01 17:59:58,181 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-01 17:59:58,204 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:59:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3e9894f0-7cff-45d4-8af5-ffe49959a4f4/bin/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2020-12-01 17:59:58,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-01 17:59:58,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-01 17:59:58,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-01 17:59:58,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-01 18:00:01,641 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-01 18:00:01,642 INFO L298 CfgBuilder]: Removed 21 assume(true) statements. [2020-12-01 18:00:01,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 06:00:01 BoogieIcfgContainer [2020-12-01 18:00:01,645 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-01 18:00:01,648 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2020-12-01 18:00:01,651 INFO L271 PluginConnector]: Initializing CodeCheck... [2020-12-01 18:00:01,664 INFO L275 PluginConnector]: CodeCheck initialized [2020-12-01 18:00:01,665 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 06:00:01" (1/1) ... [2020-12-01 18:00:01,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 18:00:01,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:00:01,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 18 states and 29 transitions. [2020-12-01 18:00:01,734 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 29 transitions. [2020-12-01 18:00:01,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-12-01 18:00:01,737 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:00:02,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:00:02,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:00:02,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:00:02,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 19 states and 31 transitions. [2020-12-01 18:00:02,865 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 31 transitions. [2020-12-01 18:00:02,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-01 18:00:02,866 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:00:03,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:00:03,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:00:03,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:00:03,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 22 states and 38 transitions. [2020-12-01 18:00:03,723 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 38 transitions. [2020-12-01 18:00:03,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-01 18:00:03,727 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:00:03,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:00:04,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:00:04,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:00:04,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 26 states and 47 transitions. [2020-12-01 18:00:04,782 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 47 transitions. [2020-12-01 18:00:04,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-01 18:00:04,783 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:00:04,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:00:05,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:00:06,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:00:06,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 31 states and 59 transitions. [2020-12-01 18:00:06,425 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 59 transitions. [2020-12-01 18:00:06,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-01 18:00:06,426 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:00:06,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:00:06,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:00:08,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:00:08,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 38 states and 73 transitions. [2020-12-01 18:00:08,463 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 73 transitions. [2020-12-01 18:00:08,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-01 18:00:08,464 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:00:08,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:00:08,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:00:10,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:00:10,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 44 states and 86 transitions. [2020-12-01 18:00:10,976 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 86 transitions. [2020-12-01 18:00:10,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-01 18:00:10,977 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:00:11,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:00:11,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:00:11,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:00:11,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 45 states and 86 transitions. [2020-12-01 18:00:11,488 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 86 transitions. [2020-12-01 18:00:11,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-01 18:00:11,490 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:00:11,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:00:11,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:00:14,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:00:14,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 54 states and 102 transitions. [2020-12-01 18:00:14,807 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 102 transitions. [2020-12-01 18:00:14,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-01 18:00:14,809 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:00:14,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:00:14,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:00:15,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:00:15,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 55 states and 103 transitions. [2020-12-01 18:00:15,075 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 103 transitions. [2020-12-01 18:00:15,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-01 18:00:15,077 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:00:15,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:00:15,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:00:15,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:00:15,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 58 states and 115 transitions. [2020-12-01 18:00:15,669 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 115 transitions. [2020-12-01 18:00:15,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-01 18:00:15,671 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:00:16,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:00:16,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:00:17,159 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 42 [2020-12-01 18:00:24,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:00:24,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 73 states and 149 transitions. [2020-12-01 18:00:24,318 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 149 transitions. [2020-12-01 18:00:24,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-01 18:00:24,320 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:00:24,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:00:25,248 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:00:26,388 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2020-12-01 18:00:32,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:00:32,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 88 states and 177 transitions. [2020-12-01 18:00:32,316 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 177 transitions. [2020-12-01 18:00:32,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-01 18:00:32,318 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:00:32,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:00:32,571 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:00:33,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:00:33,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 89 states and 180 transitions. [2020-12-01 18:00:33,092 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 180 transitions. [2020-12-01 18:00:33,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-01 18:00:33,094 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:00:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:00:34,399 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:00:40,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:00:40,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 96 states and 200 transitions. [2020-12-01 18:00:40,116 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 200 transitions. [2020-12-01 18:00:40,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-01 18:00:40,119 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:00:40,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:00:40,446 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:00:41,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:00:41,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 98 states and 206 transitions. [2020-12-01 18:00:41,617 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 206 transitions. [2020-12-01 18:00:41,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-01 18:00:41,618 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:00:41,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:00:41,994 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:00:42,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:00:42,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 99 states and 211 transitions. [2020-12-01 18:00:42,844 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 211 transitions. [2020-12-01 18:00:42,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-01 18:00:42,845 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:00:42,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:00:44,112 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:00:45,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:00:45,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 100 states and 214 transitions. [2020-12-01 18:00:45,823 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 214 transitions. [2020-12-01 18:00:45,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-01 18:00:45,824 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:00:45,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:00:46,138 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:00:48,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:00:48,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 103 states and 232 transitions. [2020-12-01 18:00:48,654 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 232 transitions. [2020-12-01 18:00:48,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-01 18:00:48,655 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:00:48,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:00:48,911 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:00:50,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:00:50,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 105 states and 240 transitions. [2020-12-01 18:00:50,894 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 240 transitions. [2020-12-01 18:00:50,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-01 18:00:50,895 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:00:51,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:00:51,160 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:00:52,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:00:52,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 106 states and 244 transitions. [2020-12-01 18:00:52,208 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 244 transitions. [2020-12-01 18:00:52,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-01 18:00:52,209 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:00:52,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:00:53,862 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:00:55,656 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2020-12-01 18:00:57,122 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2020-12-01 18:00:58,143 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2020-12-01 18:00:59,245 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2020-12-01 18:01:00,364 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2020-12-01 18:01:01,650 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2020-12-01 18:01:07,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:01:07,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 119 states and 278 transitions. [2020-12-01 18:01:07,623 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 278 transitions. [2020-12-01 18:01:07,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-01 18:01:07,624 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:01:07,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:01:07,962 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:01:08,299 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2020-12-01 18:01:08,571 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2020-12-01 18:01:11,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:01:11,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 122 states and 289 transitions. [2020-12-01 18:01:11,948 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 289 transitions. [2020-12-01 18:01:11,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-01 18:01:11,950 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:01:12,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:01:12,357 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:01:14,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:01:14,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 124 states and 295 transitions. [2020-12-01 18:01:14,840 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 295 transitions. [2020-12-01 18:01:14,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-01 18:01:14,841 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:01:15,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:01:15,225 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:01:16,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:01:16,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 125 states and 296 transitions. [2020-12-01 18:01:16,623 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 296 transitions. [2020-12-01 18:01:16,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-01 18:01:16,623 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:01:16,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:01:17,268 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:01:18,047 WARN L197 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2020-12-01 18:01:19,002 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2020-12-01 18:01:19,241 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2020-12-01 18:01:20,652 WARN L197 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2020-12-01 18:01:22,007 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2020-12-01 18:01:23,195 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2020-12-01 18:01:29,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:01:29,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 138 states and 320 transitions. [2020-12-01 18:01:29,714 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 320 transitions. [2020-12-01 18:01:29,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-01 18:01:29,715 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:01:29,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:01:30,047 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:01:34,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:01:34,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 141 states and 332 transitions. [2020-12-01 18:01:34,101 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 332 transitions. [2020-12-01 18:01:34,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-01 18:01:34,102 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:01:34,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:01:36,182 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:01:37,188 WARN L197 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2020-12-01 18:01:37,970 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2020-12-01 18:01:38,268 WARN L197 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2020-12-01 18:01:39,473 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2020-12-01 18:01:39,782 WARN L197 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2020-12-01 18:01:41,358 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 34 [2020-12-01 18:01:42,316 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2020-12-01 18:01:43,856 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2020-12-01 18:01:44,188 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2020-12-01 18:01:45,591 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 27 [2020-12-01 18:01:53,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:01:53,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 152 states and 352 transitions. [2020-12-01 18:01:53,024 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 352 transitions. [2020-12-01 18:01:53,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-01 18:01:53,026 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:01:53,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:01:53,410 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:01:53,783 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 28 [2020-12-01 18:01:55,668 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2020-12-01 18:01:56,004 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2020-12-01 18:01:57,850 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2020-12-01 18:02:02,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:02:02,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 157 states and 362 transitions. [2020-12-01 18:02:02,636 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 362 transitions. [2020-12-01 18:02:02,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-01 18:02:02,637 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:02:02,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:02:02,710 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-01 18:02:03,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:02:03,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 158 states and 363 transitions. [2020-12-01 18:02:03,553 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 363 transitions. [2020-12-01 18:02:03,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-01 18:02:03,554 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:02:03,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:02:03,627 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-01 18:02:03,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:02:03,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 158 states and 362 transitions. [2020-12-01 18:02:03,670 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 362 transitions. [2020-12-01 18:02:03,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-12-01 18:02:03,672 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:02:04,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:02:06,405 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:02:25,550 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2020-12-01 18:02:28,446 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2020-12-01 18:02:29,878 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2020-12-01 18:02:30,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:02:30,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 171 states and 416 transitions. [2020-12-01 18:02:30,681 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 416 transitions. [2020-12-01 18:02:30,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-12-01 18:02:30,683 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:02:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:02:31,022 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:02:31,378 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 30 [2020-12-01 18:02:31,765 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2020-12-01 18:02:33,614 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2020-12-01 18:02:34,860 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2020-12-01 18:02:34,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:02:34,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 175 states and 420 transitions. [2020-12-01 18:02:34,936 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 420 transitions. [2020-12-01 18:02:34,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-01 18:02:34,937 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:02:35,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:02:37,594 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:02:40,377 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2020-12-01 18:02:42,294 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2020-12-01 18:02:45,809 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2020-12-01 18:02:47,640 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2020-12-01 18:02:54,833 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2020-12-01 18:02:57,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:02:57,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 185 states and 455 transitions. [2020-12-01 18:02:57,050 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 455 transitions. [2020-12-01 18:02:57,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-01 18:02:57,051 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:02:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:02:57,406 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:02:58,212 WARN L197 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2020-12-01 18:03:00,621 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2020-12-01 18:03:02,824 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2020-12-01 18:03:04,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:03:04,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 190 states and 460 transitions. [2020-12-01 18:03:04,716 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 460 transitions. [2020-12-01 18:03:04,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-01 18:03:04,717 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:03:04,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:03:07,725 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:03:10,842 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2020-12-01 18:03:13,119 WARN L197 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2020-12-01 18:03:15,335 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-12-01 18:03:15,807 WARN L197 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2020-12-01 18:03:16,804 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2020-12-01 18:03:17,802 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2020-12-01 18:03:18,745 WARN L197 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2020-12-01 18:03:24,812 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2020-12-01 18:03:26,612 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2020-12-01 18:03:27,130 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2020-12-01 18:03:29,086 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2020-12-01 18:03:29,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:03:29,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 198 states and 479 transitions. [2020-12-01 18:03:29,277 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 479 transitions. [2020-12-01 18:03:29,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-01 18:03:29,279 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:03:29,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:03:29,665 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:03:30,468 WARN L197 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2020-12-01 18:03:32,759 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2020-12-01 18:03:35,164 WARN L197 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2020-12-01 18:03:37,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:03:37,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 203 states and 484 transitions. [2020-12-01 18:03:37,495 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 484 transitions. [2020-12-01 18:03:37,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-01 18:03:37,496 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:03:37,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:03:37,898 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:03:38,424 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 26 [2020-12-01 18:03:40,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:03:40,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 204 states and 500 transitions. [2020-12-01 18:03:40,712 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 500 transitions. [2020-12-01 18:03:40,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-01 18:03:40,713 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:03:40,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:03:43,774 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:03:46,937 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2020-12-01 18:03:48,552 WARN L197 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2020-12-01 18:03:50,933 WARN L197 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2020-12-01 18:03:53,371 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2020-12-01 18:03:55,727 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2020-12-01 18:03:58,185 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2020-12-01 18:04:00,509 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2020-12-01 18:04:02,655 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2020-12-01 18:04:11,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:04:11,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 215 states and 543 transitions. [2020-12-01 18:04:11,805 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 543 transitions. [2020-12-01 18:04:11,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-01 18:04:11,806 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:04:11,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:04:11,918 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:04:12,668 WARN L197 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2020-12-01 18:04:15,210 WARN L197 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2020-12-01 18:04:17,221 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2020-12-01 18:04:21,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:04:21,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 221 states and 563 transitions. [2020-12-01 18:04:21,731 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 563 transitions. [2020-12-01 18:04:21,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-01 18:04:21,732 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:04:21,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:04:21,858 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:04:28,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:04:28,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 223 states and 573 transitions. [2020-12-01 18:04:28,014 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 573 transitions. [2020-12-01 18:04:28,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-01 18:04:28,015 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:04:28,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:04:28,149 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:04:28,741 WARN L197 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2020-12-01 18:04:29,249 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2020-12-01 18:04:31,394 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2020-12-01 18:04:31,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:04:31,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 224 states and 579 transitions. [2020-12-01 18:04:31,600 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 579 transitions. [2020-12-01 18:04:31,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-01 18:04:31,602 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:04:31,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:04:31,740 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:04:32,868 WARN L197 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2020-12-01 18:04:35,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:04:35,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 225 states and 580 transitions. [2020-12-01 18:04:35,683 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 580 transitions. [2020-12-01 18:04:35,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-01 18:04:35,685 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:04:36,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:04:40,641 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:04:45,097 WARN L197 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2020-12-01 18:04:47,699 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2020-12-01 18:04:50,861 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2020-12-01 18:04:53,384 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2020-12-01 18:04:55,909 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2020-12-01 18:04:59,644 WARN L197 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2020-12-01 18:05:00,492 WARN L197 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2020-12-01 18:05:01,942 WARN L197 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2020-12-01 18:05:03,311 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-12-01 18:05:04,326 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2020-12-01 18:05:04,973 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-12-01 18:05:06,376 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-12-01 18:05:07,733 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2020-12-01 18:05:10,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:05:10,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 232 states and 611 transitions. [2020-12-01 18:05:10,721 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 611 transitions. [2020-12-01 18:05:10,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-01 18:05:10,722 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:05:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:05:11,118 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:05:11,794 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2020-12-01 18:05:13,585 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2020-12-01 18:05:14,006 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2020-12-01 18:05:15,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:05:15,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 232 states and 613 transitions. [2020-12-01 18:05:15,704 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 613 transitions. [2020-12-01 18:05:15,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-01 18:05:15,705 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:05:15,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:05:16,035 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:05:16,570 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2020-12-01 18:05:17,009 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2020-12-01 18:05:19,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:05:19,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 233 states and 619 transitions. [2020-12-01 18:05:19,009 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 619 transitions. [2020-12-01 18:05:19,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-01 18:05:19,010 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:05:19,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:05:19,497 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:05:20,021 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2020-12-01 18:05:20,525 WARN L197 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2020-12-01 18:05:22,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:05:22,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 234 states and 629 transitions. [2020-12-01 18:05:22,704 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 629 transitions. [2020-12-01 18:05:22,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-01 18:05:22,706 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:05:22,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:05:23,031 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:05:23,468 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2020-12-01 18:05:23,908 WARN L197 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2020-12-01 18:05:25,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:05:25,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 235 states and 635 transitions. [2020-12-01 18:05:25,705 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 635 transitions. [2020-12-01 18:05:25,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-01 18:05:25,706 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:05:25,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:05:26,078 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:05:26,886 WARN L197 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2020-12-01 18:05:27,484 WARN L197 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2020-12-01 18:05:32,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:05:32,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 237 states and 645 transitions. [2020-12-01 18:05:32,498 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 645 transitions. [2020-12-01 18:05:32,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-01 18:05:32,499 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:05:32,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:05:37,467 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2020-12-01 18:05:41,830 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:05:46,987 WARN L197 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2020-12-01 18:05:48,520 WARN L197 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2020-12-01 18:05:51,113 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2020-12-01 18:05:51,503 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2020-12-01 18:05:54,384 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2020-12-01 18:05:57,177 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2020-12-01 18:06:00,304 WARN L197 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2020-12-01 18:06:03,560 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 27 [2020-12-01 18:06:06,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:06:06,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 246 states and 676 transitions. [2020-12-01 18:06:06,089 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 676 transitions. [2020-12-01 18:06:06,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-01 18:06:06,091 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:06:06,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:06:06,967 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:06:07,600 WARN L197 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2020-12-01 18:06:08,073 WARN L197 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2020-12-01 18:06:10,738 WARN L197 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 34 [2020-12-01 18:06:11,160 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2020-12-01 18:06:13,281 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2020-12-01 18:06:13,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:06:13,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 251 states and 682 transitions. [2020-12-01 18:06:13,427 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 682 transitions. [2020-12-01 18:06:13,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-01 18:06:13,428 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:06:13,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:06:14,231 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:06:15,013 WARN L197 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2020-12-01 18:06:15,492 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2020-12-01 18:06:17,725 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2020-12-01 18:06:17,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:06:17,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 252 states and 685 transitions. [2020-12-01 18:06:17,867 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 685 transitions. [2020-12-01 18:06:17,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-01 18:06:17,868 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:06:18,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:06:18,631 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:06:19,391 WARN L197 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2020-12-01 18:06:19,965 WARN L197 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2020-12-01 18:06:23,751 WARN L197 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 29 [2020-12-01 18:06:25,592 WARN L197 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2020-12-01 18:06:26,316 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 25 [2020-12-01 18:06:28,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:06:28,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 255 states and 699 transitions. [2020-12-01 18:06:28,794 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 699 transitions. [2020-12-01 18:06:28,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-01 18:06:28,794 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:06:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:06:29,524 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:06:30,307 WARN L197 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2020-12-01 18:06:30,732 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2020-12-01 18:06:31,892 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-12-01 18:06:32,996 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2020-12-01 18:06:33,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:06:33,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 256 states and 702 transitions. [2020-12-01 18:06:33,181 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 702 transitions. [2020-12-01 18:06:33,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-01 18:06:33,184 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:06:33,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:06:34,027 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:06:35,644 WARN L197 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2020-12-01 18:06:38,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:06:38,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 257 states and 709 transitions. [2020-12-01 18:06:38,630 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 709 transitions. [2020-12-01 18:06:38,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-01 18:06:38,631 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:06:38,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:06:39,383 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:06:39,998 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2020-12-01 18:06:45,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:06:45,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 259 states and 717 transitions. [2020-12-01 18:06:45,113 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 717 transitions. [2020-12-01 18:06:45,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-01 18:06:45,113 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:06:45,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:06:45,899 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:06:46,590 WARN L197 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2020-12-01 18:06:47,141 WARN L197 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2020-12-01 18:06:51,039 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 26 [2020-12-01 18:06:52,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:06:52,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 261 states and 725 transitions. [2020-12-01 18:06:52,273 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 725 transitions. [2020-12-01 18:06:52,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-01 18:06:52,274 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:06:52,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:06:53,832 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:06:56,198 WARN L197 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2020-12-01 18:06:58,992 WARN L197 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 39 [2020-12-01 18:07:01,655 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2020-12-01 18:07:03,013 WARN L197 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2020-12-01 18:07:05,761 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2020-12-01 18:07:06,372 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2020-12-01 18:07:07,127 WARN L197 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2020-12-01 18:07:08,440 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2020-12-01 18:07:09,704 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2020-12-01 18:07:09,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:07:09,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 263 states and 731 transitions. [2020-12-01 18:07:09,799 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 731 transitions. [2020-12-01 18:07:09,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-01 18:07:09,800 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:07:10,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:07:10,144 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:07:10,956 WARN L197 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2020-12-01 18:07:11,779 WARN L197 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2020-12-01 18:07:13,179 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2020-12-01 18:07:14,612 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2020-12-01 18:07:16,013 WARN L197 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2020-12-01 18:07:16,840 WARN L197 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2020-12-01 18:07:19,715 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2020-12-01 18:07:19,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:07:19,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 266 states and 747 transitions. [2020-12-01 18:07:19,799 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 747 transitions. [2020-12-01 18:07:19,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-01 18:07:19,800 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:07:19,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:07:20,059 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:07:20,746 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2020-12-01 18:07:21,540 WARN L197 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2020-12-01 18:07:22,909 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2020-12-01 18:07:24,494 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2020-12-01 18:07:25,223 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2020-12-01 18:07:25,887 WARN L197 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2020-12-01 18:07:29,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:07:29,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 268 states and 759 transitions. [2020-12-01 18:07:29,084 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 759 transitions. [2020-12-01 18:07:29,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-01 18:07:29,085 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:07:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:07:29,292 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:07:30,016 WARN L197 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2020-12-01 18:07:30,705 WARN L197 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2020-12-01 18:07:33,480 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-12-01 18:07:33,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:07:33,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 270 states and 768 transitions. [2020-12-01 18:07:33,860 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 768 transitions. [2020-12-01 18:07:33,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-01 18:07:33,860 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:07:34,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:07:34,073 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:07:34,766 WARN L197 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2020-12-01 18:07:35,529 WARN L197 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2020-12-01 18:07:38,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:07:38,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 272 states and 777 transitions. [2020-12-01 18:07:38,462 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 777 transitions. [2020-12-01 18:07:38,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-01 18:07:38,463 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:07:38,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 18:07:38,667 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 18:07:39,342 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2020-12-01 18:07:40,196 WARN L197 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2020-12-01 18:07:41,721 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2020-12-01 18:07:43,252 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2020-12-01 18:07:43,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 18:07:43,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 273 states and 778 transitions. [2020-12-01 18:07:43,687 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 778 transitions. [2020-12-01 18:07:43,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-12-01 18:07:43,689 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 18:07:44,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 18:07:44,529 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 18:07:46,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 18:07:46,411 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 18:07:46,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 18:07:46,792 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 18:07:47,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 18:07:47,267 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 18:08:18,413 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 63 iterations. [2020-12-01 18:08:18,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 01.12 06:08:18 ImpRootNode [2020-12-01 18:08:18,708 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2020-12-01 18:08:18,709 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-01 18:08:18,709 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-01 18:08:18,709 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-01 18:08:18,710 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 06:00:01" (3/4) ... [2020-12-01 18:08:18,712 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-01 18:08:18,966 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_3e9894f0-7cff-45d4-8af5-ffe49959a4f4/bin/ukojak/witness.graphml [2020-12-01 18:08:18,966 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-01 18:08:18,971 INFO L168 Benchmark]: Toolchain (without parser) took 501478.41 ms. Allocated memory was 102.8 MB in the beginning and 1.1 GB in the end (delta: 1.0 GB). Free memory was 62.4 MB in the beginning and 338.3 MB in the end (delta: -275.9 MB). Peak memory consumption was 747.6 MB. Max. memory is 16.1 GB. [2020-12-01 18:08:18,972 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 102.8 MB. Free memory is still 79.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-01 18:08:18,972 INFO L168 Benchmark]: CACSL2BoogieTranslator took 490.21 ms. Allocated memory is still 102.8 MB. Free memory was 62.2 MB in the beginning and 72.7 MB in the end (delta: -10.5 MB). Peak memory consumption was 9.3 MB. Max. memory is 16.1 GB. [2020-12-01 18:08:18,972 INFO L168 Benchmark]: Boogie Procedure Inliner took 131.24 ms. Allocated memory is still 102.8 MB. Free memory was 72.7 MB in the beginning and 69.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-01 18:08:18,973 INFO L168 Benchmark]: Boogie Preprocessor took 62.55 ms. Allocated memory is still 102.8 MB. Free memory was 69.7 MB in the beginning and 67.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-01 18:08:18,973 INFO L168 Benchmark]: RCFGBuilder took 3465.00 ms. Allocated memory was 102.8 MB in the beginning and 159.4 MB in the end (delta: 56.6 MB). Free memory was 67.6 MB in the beginning and 59.0 MB in the end (delta: 8.6 MB). Peak memory consumption was 65.5 MB. Max. memory is 16.1 GB. [2020-12-01 18:08:18,974 INFO L168 Benchmark]: CodeCheck took 497060.49 ms. Allocated memory was 159.4 MB in the beginning and 1.1 GB in the end (delta: 966.8 MB). Free memory was 59.0 MB in the beginning and 358.2 MB in the end (delta: -299.3 MB). Peak memory consumption was 667.5 MB. Max. memory is 16.1 GB. [2020-12-01 18:08:18,974 INFO L168 Benchmark]: Witness Printer took 257.41 ms. Allocated memory is still 1.1 GB. Free memory was 358.2 MB in the beginning and 338.3 MB in the end (delta: 19.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2020-12-01 18:08:18,986 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 496.7s, OverallIterations: 63, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 SDtfs, 841192156 SDslu, 0 SDs, 0 SdLazy, 286190120 SolverSat, 545964272 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 424.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 19725 GetRequests, 17785 SyntacticMatches, 982 SemanticMatches, 958 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539094 ImplicationChecksByTransitivity, 417.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.4s SsaConstructionTime, 13.7s SatisfiabilityAnalysisTime, 40.2s InterpolantComputationTime, 1792 NumberOfCodeBlocks, 1792 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 1685 ConstructedInterpolants, 0 QuantifiedInterpolants, 609323 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 62 InterpolantComputations, 12 PerfectInterpolantSequences, 239/1117 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L28] msg_t nomsg = (msg_t )-1; [L29] port_t p12 ; [L30] char p12_old ; [L31] char p12_new ; [L32] _Bool ep12 ; [L33] port_t p13 ; [L34] char p13_old ; [L35] char p13_new ; [L36] _Bool ep13 ; [L37] port_t p21 ; [L38] char p21_old ; [L39] char p21_new ; [L40] _Bool ep21 ; [L41] port_t p23 ; [L42] char p23_old ; [L43] char p23_new ; [L44] _Bool ep23 ; [L45] port_t p31 ; [L46] char p31_old ; [L47] char p31_new ; [L48] _Bool ep31 ; [L49] port_t p32 ; [L50] char p32_old ; [L51] char p32_new ; [L52] _Bool ep32 ; [L53] char id1 ; [L54] unsigned char r1 ; [L55] char st1 ; [L56] char nl1 ; [L57] char m1 ; [L58] char max1 ; [L59] _Bool mode1 ; [L60] char id2 ; [L61] unsigned char r2 ; [L62] char st2 ; [L63] char nl2 ; [L64] char m2 ; [L65] char max2 ; [L66] _Bool mode2 ; [L67] char id3 ; [L68] unsigned char r3 ; [L69] char st3 ; [L70] char nl3 ; [L71] char m3 ; [L72] char max3 ; [L73] _Bool mode3 ; [L465] int c1 ; [L466] int i2 ; [L469] c1 = 0 [L470] ep12 = __VERIFIER_nondet_bool() [L471] ep13 = __VERIFIER_nondet_bool() [L472] ep21 = __VERIFIER_nondet_bool() [L473] ep23 = __VERIFIER_nondet_bool() [L474] ep31 = __VERIFIER_nondet_bool() [L475] ep32 = __VERIFIER_nondet_bool() [L476] id1 = __VERIFIER_nondet_char() [L477] r1 = __VERIFIER_nondet_uchar() [L478] st1 = __VERIFIER_nondet_char() [L479] nl1 = __VERIFIER_nondet_char() [L480] m1 = __VERIFIER_nondet_char() [L481] max1 = __VERIFIER_nondet_char() [L482] mode1 = __VERIFIER_nondet_bool() [L483] id2 = __VERIFIER_nondet_char() [L484] r2 = __VERIFIER_nondet_uchar() [L485] st2 = __VERIFIER_nondet_char() [L486] nl2 = __VERIFIER_nondet_char() [L487] m2 = __VERIFIER_nondet_char() [L488] max2 = __VERIFIER_nondet_char() [L489] mode2 = __VERIFIER_nondet_bool() [L490] id3 = __VERIFIER_nondet_char() [L491] r3 = __VERIFIER_nondet_uchar() [L492] st3 = __VERIFIER_nondet_char() [L493] nl3 = __VERIFIER_nondet_char() [L494] m3 = __VERIFIER_nondet_char() [L495] max3 = __VERIFIER_nondet_char() [L496] mode3 = __VERIFIER_nondet_bool() [L214] _Bool r121 ; [L215] _Bool r131 ; [L216] _Bool r211 ; [L217] _Bool r231 ; [L218] _Bool r311 ; [L219] _Bool r321 ; [L220] _Bool r122 ; [L221] int tmp ; [L222] _Bool r132 ; [L223] int tmp___0 ; [L224] _Bool r212 ; [L225] int tmp___1 ; [L226] _Bool r232 ; [L227] int tmp___2 ; [L228] _Bool r312 ; [L229] int tmp___3 ; [L230] _Bool r322 ; [L231] int tmp___4 ; [L232] int tmp___5 ; [L235] r121 = ep12 [L236] r131 = ep13 [L237] r211 = ep21 [L238] r231 = ep23 [L239] r311 = ep31 [L240] r321 = ep32 [L241] COND TRUE \read(r121) [L242] tmp = 1 [L253] r122 = (_Bool )tmp [L254] COND FALSE !(\read(r131)) [L257] COND TRUE \read(r121) [L258] COND FALSE !(\read(ep23)) [L261] tmp___0 = 0 [L266] r132 = (_Bool )tmp___0 [L267] COND FALSE !(\read(r211)) [L270] COND FALSE !(\read(r231)) [L277] tmp___1 = 0 [L279] r212 = (_Bool )tmp___1 [L280] COND FALSE !(\read(r231)) [L283] COND FALSE !(\read(r211)) [L290] tmp___2 = 0 [L292] r232 = (_Bool )tmp___2 [L293] COND FALSE !(\read(r311)) [L296] COND TRUE \read(r321) [L297] COND FALSE !(\read(ep21)) [L300] tmp___3 = 0 [L305] r312 = (_Bool )tmp___3 [L306] COND TRUE \read(r321) [L307] tmp___4 = 1 [L318] r322 = (_Bool )tmp___4 [L319] COND TRUE (int )id1 != (int )id2 [L320] COND TRUE (int )id1 != (int )id3 [L321] COND TRUE (int )id2 != (int )id3 [L322] COND TRUE (int )id1 >= 0 [L323] COND TRUE (int )id2 >= 0 [L324] COND TRUE (int )id3 >= 0 [L325] COND TRUE (int )r1 == 0 [L326] COND TRUE (int )r2 == 0 [L327] COND TRUE (int )r3 == 0 [L328] COND TRUE (int )max1 == (int )id1 [L329] COND TRUE (int )max2 == (int )id2 [L330] COND TRUE (int )max3 == (int )id3 [L331] COND TRUE (int )st1 == 0 [L332] COND TRUE (int )st2 == 0 [L333] COND TRUE (int )st3 == 0 [L334] COND TRUE (int )nl1 == 0 [L335] COND TRUE (int )nl2 == 0 [L336] COND TRUE (int )nl3 == 0 [L337] COND TRUE (int )mode1 == 0 [L338] COND TRUE (int )mode2 == 0 [L339] COND TRUE (int )mode3 == 0 [L340] tmp___5 = 1 [L404] return (tmp___5); [L497] i2 = init() [L22] COND FALSE !(!cond) [L499] p12_old = nomsg [L500] p12_new = nomsg [L501] p13_old = nomsg [L502] p13_new = nomsg [L503] p21_old = nomsg [L504] p21_new = nomsg [L505] p23_old = nomsg [L506] p23_new = nomsg [L507] p31_old = nomsg [L508] p31_new = nomsg [L509] p32_old = nomsg [L510] p32_new = nomsg [L511] i2 = 0 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=2, m1=2, m2=0, m3=3, max1=1, max2=0, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L512] COND TRUE 1 [L79] COND FALSE !(\read(mode1)) [L107] COND TRUE (int )r1 < 2 [L108] COND TRUE \read(ep12) [L109] EXPR max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L109] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L111] COND FALSE !(\read(ep13)) [L115] mode1 = (_Bool)1 [L125] COND FALSE !(\read(mode2)) [L153] COND TRUE (int )r2 < 2 [L154] COND FALSE !(\read(ep21)) [L157] COND FALSE !(\read(ep23)) [L161] mode2 = (_Bool)1 [L171] COND FALSE !(\read(mode3)) [L199] COND TRUE (int )r3 < 2 [L200] COND FALSE !(\read(ep31)) [L203] COND TRUE \read(ep32) [L204] EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L204] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L207] mode3 = (_Bool)1 [L517] p12_old = p12_new [L518] p12_new = nomsg [L519] p13_old = p13_new [L520] p13_new = nomsg [L521] p21_old = p21_new [L522] p21_new = nomsg [L523] p23_old = p23_new [L524] p23_new = nomsg [L525] p31_old = p31_new [L526] p31_new = nomsg [L527] p32_old = p32_new [L528] p32_new = nomsg [L409] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=2, m1=2, m2=0, m3=3, max1=1, max2=0, max3=2, 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=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L412] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=2, m1=2, m2=0, m3=3, max1=1, max2=0, max3=2, 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=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L413] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=2, m1=2, m2=0, m3=3, max1=1, max2=0, max3=2, 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=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L414] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=2, m1=2, m2=0, m3=3, max1=1, max2=0, max3=2, 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=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L415] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=2, m1=2, m2=0, m3=3, max1=1, max2=0, max3=2, 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=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L416] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=2, m1=2, m2=0, m3=3, max1=1, max2=0, max3=2, 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=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L419] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=2, m1=2, m2=0, m3=3, max1=1, max2=0, max3=2, 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=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L421] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=2, m1=2, m2=0, m3=3, max1=1, max2=0, max3=2, 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=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L426] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=2, m1=2, m2=0, m3=3, max1=1, max2=0, max3=2, 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=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L429] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=2, m1=2, m2=0, m3=3, max1=1, max2=0, max3=2, 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=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L431] COND TRUE (int )r1 < 2 [L432] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=2, m1=2, m2=0, m3=3, max1=1, max2=0, max3=2, 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=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L460] return (tmp); [L529] c1 = check() [L541] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=2, m1=2, m2=0, m3=3, max1=1, max2=0, max3=2, 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=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L512] COND TRUE 1 [L79] COND TRUE \read(mode1) [L80] COND FALSE !(r1 == 255) [L83] r1 = r1 + 1 [L84] COND FALSE !(\read(ep21)) [L91] COND FALSE !(\read(ep31)) [L98] COND FALSE !((int )r1 == 2) [L105] mode1 = (_Bool)0 [L125] COND TRUE \read(mode2) [L126] COND FALSE !(r2 == 255) [L129] r2 = r2 + 1 [L130] COND TRUE \read(ep12) [L131] m2 = p12_old [L132] p12_old = nomsg [L133] COND TRUE (int )m2 > (int )max2 [L134] max2 = m2 [L137] COND TRUE \read(ep32) [L138] m2 = p32_old [L139] p32_old = nomsg [L140] COND TRUE (int )m2 > (int )max2 [L141] max2 = m2 [L144] COND FALSE !((int )r2 == 2) [L151] mode2 = (_Bool)0 [L171] COND TRUE \read(mode3) [L172] COND FALSE !(r3 == 255) [L175] r3 = r3 + 1 [L176] COND FALSE !(\read(ep13)) [L183] COND FALSE !(\read(ep23)) [L190] COND FALSE !((int )r3 == 2) [L197] mode3 = (_Bool)0 [L517] p12_old = p12_new [L518] p12_new = nomsg [L519] p13_old = p13_new [L520] p13_new = nomsg [L521] p21_old = p21_new [L522] p21_new = nomsg [L523] p23_old = p23_new [L524] p23_new = nomsg [L525] p31_old = p31_new [L526] p31_new = nomsg [L527] p32_old = p32_new [L528] p32_new = nomsg [L409] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=2, m1=2, m2=2, m3=3, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L412] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=2, m1=2, m2=2, m3=3, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L413] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=2, m1=2, m2=2, m3=3, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L414] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=2, m1=2, m2=2, m3=3, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L415] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=2, m1=2, m2=2, m3=3, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L416] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=2, m1=2, m2=2, m3=3, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L419] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=2, m1=2, m2=2, m3=3, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L421] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=2, m1=2, m2=2, m3=3, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L426] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=2, m1=2, m2=2, m3=3, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L429] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=2, m1=2, m2=2, m3=3, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L431] COND TRUE (int )r1 < 2 [L432] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=2, m1=2, m2=2, m3=3, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L460] return (tmp); [L529] c1 = check() [L541] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=2, m1=2, m2=2, m3=3, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L512] COND TRUE 1 [L79] COND FALSE !(\read(mode1)) [L107] COND TRUE (int )r1 < 2 [L108] COND TRUE \read(ep12) [L109] EXPR max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L109] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L111] COND FALSE !(\read(ep13)) [L115] mode1 = (_Bool)1 [L125] COND FALSE !(\read(mode2)) [L153] COND TRUE (int )r2 < 2 [L154] COND FALSE !(\read(ep21)) [L157] COND FALSE !(\read(ep23)) [L161] mode2 = (_Bool)1 [L171] COND FALSE !(\read(mode3)) [L199] COND TRUE (int )r3 < 2 [L200] COND FALSE !(\read(ep31)) [L203] COND TRUE \read(ep32) [L204] EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L204] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L207] mode3 = (_Bool)1 [L517] p12_old = p12_new [L518] p12_new = nomsg [L519] p13_old = p13_new [L520] p13_new = nomsg [L521] p21_old = p21_new [L522] p21_new = nomsg [L523] p23_old = p23_new [L524] p23_new = nomsg [L525] p31_old = p31_new [L526] p31_new = nomsg [L527] p32_old = p32_new [L528] p32_new = nomsg [L409] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=2, m1=2, m2=2, m3=3, max1=1, max2=2, max3=2, 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=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L412] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=2, m1=2, m2=2, m3=3, max1=1, max2=2, max3=2, 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=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L413] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=2, m1=2, m2=2, m3=3, max1=1, max2=2, max3=2, 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=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L414] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=2, m1=2, m2=2, m3=3, max1=1, max2=2, max3=2, 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=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L415] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=2, m1=2, m2=2, m3=3, max1=1, max2=2, max3=2, 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=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L416] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=2, m1=2, m2=2, m3=3, max1=1, max2=2, max3=2, 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=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L419] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=2, m1=2, m2=2, m3=3, max1=1, max2=2, max3=2, 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=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L421] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=2, m1=2, m2=2, m3=3, max1=1, max2=2, max3=2, 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=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L426] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=2, m1=2, m2=2, m3=3, max1=1, max2=2, max3=2, 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=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L429] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=2, m1=2, m2=2, m3=3, max1=1, max2=2, max3=2, 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=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L431] COND TRUE (int )r1 < 2 [L432] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=2, m1=2, m2=2, m3=3, max1=1, max2=2, max3=2, 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=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L460] return (tmp); [L529] c1 = check() [L541] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=2, m1=2, m2=2, m3=3, max1=1, max2=2, max3=2, 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=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L512] COND TRUE 1 [L79] COND TRUE \read(mode1) [L80] COND FALSE !(r1 == 255) [L83] r1 = r1 + 1 [L84] COND FALSE !(\read(ep21)) [L91] COND FALSE !(\read(ep31)) [L98] COND TRUE (int )r1 == 2 [L99] COND TRUE (int )max1 == (int )id1 [L100] st1 = (char)1 [L105] mode1 = (_Bool)0 [L125] COND TRUE \read(mode2) [L126] COND FALSE !(r2 == 255) [L129] r2 = r2 + 1 [L130] COND TRUE \read(ep12) [L131] m2 = p12_old [L132] p12_old = nomsg [L133] COND FALSE !((int )m2 > (int )max2) [L137] COND TRUE \read(ep32) [L138] m2 = p32_old [L139] p32_old = nomsg [L140] COND FALSE !((int )m2 > (int )max2) [L144] COND TRUE (int )r2 == 2 [L145] COND FALSE !((int )max2 == (int )id2) [L148] nl2 = (char)1 [L151] mode2 = (_Bool)0 [L171] COND TRUE \read(mode3) [L172] COND FALSE !(r3 == 255) [L175] r3 = r3 + 1 [L176] COND FALSE !(\read(ep13)) [L183] COND FALSE !(\read(ep23)) [L190] COND TRUE (int )r3 == 2 [L191] COND TRUE (int )max3 == (int )id3 [L192] st3 = (char)1 [L197] mode3 = (_Bool)0 [L517] p12_old = p12_new [L518] p12_new = nomsg [L519] p13_old = p13_new [L520] p13_new = nomsg [L521] p21_old = p21_new [L522] p21_new = nomsg [L523] p23_old = p23_new [L524] p23_new = nomsg [L525] p31_old = p31_new [L526] p31_new = nomsg [L527] p32_old = p32_new [L528] p32_new = nomsg [L409] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=2, m1=2, m2=2, m3=3, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, 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=0, st3=1] [L412] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L458] tmp = 0 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=2, m1=2, m2=2, m3=3, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, 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=0, st3=1] [L460] return (tmp); [L529] c1 = check() [L541] COND TRUE ! arg VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=2, m1=2, m2=2, m3=3, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, 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=0, st3=1] [L3] __assert_fail("0", "pals_floodmax.3.1.ufo.UNBOUNDED.pals.c", 3, "reach_error") VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=2, m1=2, m2=2, m3=3, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, 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=0, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 102.8 MB. Free memory is still 79.5 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 490.21 ms. Allocated memory is still 102.8 MB. Free memory was 62.2 MB in the beginning and 72.7 MB in the end (delta: -10.5 MB). Peak memory consumption was 9.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 131.24 ms. Allocated memory is still 102.8 MB. Free memory was 72.7 MB in the beginning and 69.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 62.55 ms. Allocated memory is still 102.8 MB. Free memory was 69.7 MB in the beginning and 67.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3465.00 ms. Allocated memory was 102.8 MB in the beginning and 159.4 MB in the end (delta: 56.6 MB). Free memory was 67.6 MB in the beginning and 59.0 MB in the end (delta: 8.6 MB). Peak memory consumption was 65.5 MB. Max. memory is 16.1 GB. * CodeCheck took 497060.49 ms. Allocated memory was 159.4 MB in the beginning and 1.1 GB in the end (delta: 966.8 MB). Free memory was 59.0 MB in the beginning and 358.2 MB in the end (delta: -299.3 MB). Peak memory consumption was 667.5 MB. Max. memory is 16.1 GB. * Witness Printer took 257.41 ms. Allocated memory is still 1.1 GB. Free memory was 358.2 MB in the beginning and 338.3 MB in the end (delta: 19.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...