./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_828e2fa0-441a-4f6a-a1c9-58aec4f4a149/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_828e2fa0-441a-4f6a-a1c9-58aec4f4a149/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_828e2fa0-441a-4f6a-a1c9-58aec4f4a149/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_828e2fa0-441a-4f6a-a1c9-58aec4f4a149/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_828e2fa0-441a-4f6a-a1c9-58aec4f4a149/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_828e2fa0-441a-4f6a-a1c9-58aec4f4a149/bin/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 64424a1c8c8e4b1dfa6f86e97492679716532609 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-02 04:41:29,736 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-02 04:41:29,737 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-02 04:41:29,745 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-02 04:41:29,745 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-02 04:41:29,746 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-02 04:41:29,747 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-02 04:41:29,748 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-02 04:41:29,750 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-02 04:41:29,750 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-02 04:41:29,751 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-02 04:41:29,752 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-02 04:41:29,752 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-02 04:41:29,753 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-02 04:41:29,753 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-02 04:41:29,754 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-02 04:41:29,754 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-02 04:41:29,755 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-02 04:41:29,756 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-02 04:41:29,758 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-02 04:41:29,759 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-02 04:41:29,760 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-02 04:41:29,760 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-02 04:41:29,761 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-02 04:41:29,762 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-02 04:41:29,762 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-02 04:41:29,763 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-02 04:41:29,763 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-02 04:41:29,763 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-02 04:41:29,764 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-02 04:41:29,764 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-02 04:41:29,764 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-02 04:41:29,765 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-02 04:41:29,765 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-02 04:41:29,766 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-02 04:41:29,766 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-02 04:41:29,766 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-02 04:41:29,767 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-02 04:41:29,767 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-02 04:41:29,767 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-02 04:41:29,768 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-02 04:41:29,768 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_828e2fa0-441a-4f6a-a1c9-58aec4f4a149/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2019-12-02 04:41:29,777 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-02 04:41:29,778 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-02 04:41:29,778 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-02 04:41:29,778 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2019-12-02 04:41:29,779 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-02 04:41:29,779 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-02 04:41:29,779 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-02 04:41:29,779 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-02 04:41:29,779 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-02 04:41:29,779 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-02 04:41:29,779 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-02 04:41:29,779 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-02 04:41:29,780 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-02 04:41:29,780 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-02 04:41:29,780 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-02 04:41:29,780 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-02 04:41:29,780 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-02 04:41:29,780 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-02 04:41:29,780 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-12-02 04:41:29,780 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-12-02 04:41:29,781 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-02 04:41:29,781 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-02 04:41:29,781 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-12-02 04:41:29,781 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-02 04:41:29,781 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-02 04:41:29,781 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-02 04:41:29,781 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2019-12-02 04:41:29,781 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-02 04:41:29,782 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-02 04:41:29,782 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_828e2fa0-441a-4f6a-a1c9-58aec4f4a149/bin/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 64424a1c8c8e4b1dfa6f86e97492679716532609 [2019-12-02 04:41:29,881 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-02 04:41:29,889 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-02 04:41:29,891 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-02 04:41:29,892 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-02 04:41:29,892 INFO L275 PluginConnector]: CDTParser initialized [2019-12-02 04:41:29,893 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_828e2fa0-441a-4f6a-a1c9-58aec4f4a149/bin/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c [2019-12-02 04:41:29,930 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_828e2fa0-441a-4f6a-a1c9-58aec4f4a149/bin/ukojak/data/af712572a/868291faa7804b77b915831920fd288c/FLAG4179f349a [2019-12-02 04:41:30,315 INFO L306 CDTParser]: Found 1 translation units. [2019-12-02 04:41:30,315 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_828e2fa0-441a-4f6a-a1c9-58aec4f4a149/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c [2019-12-02 04:41:30,322 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_828e2fa0-441a-4f6a-a1c9-58aec4f4a149/bin/ukojak/data/af712572a/868291faa7804b77b915831920fd288c/FLAG4179f349a [2019-12-02 04:41:30,331 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_828e2fa0-441a-4f6a-a1c9-58aec4f4a149/bin/ukojak/data/af712572a/868291faa7804b77b915831920fd288c [2019-12-02 04:41:30,333 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-02 04:41:30,334 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-02 04:41:30,334 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-02 04:41:30,335 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-02 04:41:30,337 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-02 04:41:30,337 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:41:30" (1/1) ... [2019-12-02 04:41:30,339 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7762f741 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:41:30, skipping insertion in model container [2019-12-02 04:41:30,339 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:41:30" (1/1) ... [2019-12-02 04:41:30,344 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-02 04:41:30,368 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-02 04:41:30,555 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-02 04:41:30,560 INFO L203 MainTranslator]: Completed pre-run [2019-12-02 04:41:30,597 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-02 04:41:30,608 INFO L208 MainTranslator]: Completed translation [2019-12-02 04:41:30,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:41:30 WrapperNode [2019-12-02 04:41:30,608 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-02 04:41:30,609 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-02 04:41:30,609 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-02 04:41:30,609 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-02 04:41:30,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:41:30" (1/1) ... [2019-12-02 04:41:30,621 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:41:30" (1/1) ... [2019-12-02 04:41:30,643 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-02 04:41:30,644 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-02 04:41:30,644 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-02 04:41:30,644 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-02 04:41:30,650 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:41:30" (1/1) ... [2019-12-02 04:41:30,650 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:41:30" (1/1) ... [2019-12-02 04:41:30,653 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:41:30" (1/1) ... [2019-12-02 04:41:30,653 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:41:30" (1/1) ... [2019-12-02 04:41:30,659 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:41:30" (1/1) ... [2019-12-02 04:41:30,665 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:41:30" (1/1) ... [2019-12-02 04:41:30,666 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:41:30" (1/1) ... [2019-12-02 04:41:30,669 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-02 04:41:30,669 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-02 04:41:30,669 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-02 04:41:30,669 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-02 04:41:30,670 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:41:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_828e2fa0-441a-4f6a-a1c9-58aec4f4a149/bin/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-12-02 04:41:30,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-02 04:41:30,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-02 04:41:32,272 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-02 04:41:32,272 INFO L287 CfgBuilder]: Removed 17 assume(true) statements. [2019-12-02 04:41:32,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:41:32 BoogieIcfgContainer [2019-12-02 04:41:32,273 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-02 04:41:32,274 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-12-02 04:41:32,274 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-12-02 04:41:32,282 INFO L275 PluginConnector]: CodeCheck initialized [2019-12-02 04:41:32,282 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:41:32" (1/1) ... [2019-12-02 04:41:32,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-02 04:41:32,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:41:32,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2019-12-02 04:41:32,312 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2019-12-02 04:41:32,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-02 04:41:32,314 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:41:32,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:41:32,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:41:32,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:41:32,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 21 states and 34 transitions. [2019-12-02 04:41:32,705 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2019-12-02 04:41:32,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-02 04:41:32,706 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:41:32,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:41:32,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:41:33,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:41:33,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 24 states and 41 transitions. [2019-12-02 04:41:33,049 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2019-12-02 04:41:33,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-02 04:41:33,050 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:41:33,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:41:33,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:41:33,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:41:33,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 28 states and 50 transitions. [2019-12-02 04:41:33,432 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 50 transitions. [2019-12-02 04:41:33,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-02 04:41:33,434 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:41:33,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:41:33,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:41:33,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:41:33,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 33 states and 61 transitions. [2019-12-02 04:41:33,969 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 61 transitions. [2019-12-02 04:41:33,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-02 04:41:33,970 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:41:34,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:41:34,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:41:34,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:41:34,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 40 states and 74 transitions. [2019-12-02 04:41:34,784 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 74 transitions. [2019-12-02 04:41:34,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-02 04:41:34,784 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:41:34,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:41:34,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:41:35,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:41:35,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 46 states and 86 transitions. [2019-12-02 04:41:35,606 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 86 transitions. [2019-12-02 04:41:35,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-02 04:41:35,606 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:41:35,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:41:35,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:41:35,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:41:35,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 47 states and 86 transitions. [2019-12-02 04:41:35,832 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 86 transitions. [2019-12-02 04:41:35,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-02 04:41:35,832 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:41:35,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:41:35,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:41:35,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:41:35,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 48 states and 87 transitions. [2019-12-02 04:41:35,869 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 87 transitions. [2019-12-02 04:41:35,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-02 04:41:35,869 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:41:35,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:41:36,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:41:38,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:41:38,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 58 states and 104 transitions. [2019-12-02 04:41:38,493 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 104 transitions. [2019-12-02 04:41:38,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-02 04:41:38,494 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:41:38,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:41:38,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:41:38,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:41:38,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 61 states and 109 transitions. [2019-12-02 04:41:38,879 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 109 transitions. [2019-12-02 04:41:38,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-02 04:41:38,880 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:41:38,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:41:39,485 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:41:43,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:41:43,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 77 states and 152 transitions. [2019-12-02 04:41:43,038 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 152 transitions. [2019-12-02 04:41:43,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-02 04:41:43,039 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:41:43,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:41:43,401 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:41:48,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:41:48,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 94 states and 197 transitions. [2019-12-02 04:41:48,791 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 197 transitions. [2019-12-02 04:41:48,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-02 04:41:48,792 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:41:48,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:41:48,966 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:41:49,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:41:49,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 95 states and 198 transitions. [2019-12-02 04:41:49,215 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 198 transitions. [2019-12-02 04:41:49,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-02 04:41:49,216 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:41:49,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:41:49,894 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:41:54,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:41:54,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 108 states and 221 transitions. [2019-12-02 04:41:54,343 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 221 transitions. [2019-12-02 04:41:54,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-02 04:41:54,344 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:41:54,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:41:54,478 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:41:55,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:41:55,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 111 states and 230 transitions. [2019-12-02 04:41:55,912 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 230 transitions. [2019-12-02 04:41:55,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-02 04:41:55,913 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:41:55,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:41:56,025 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:41:56,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:41:56,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 112 states and 232 transitions. [2019-12-02 04:41:56,337 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 232 transitions. [2019-12-02 04:41:56,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-02 04:41:56,337 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:41:56,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:41:57,035 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:42:03,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:42:03,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 126 states and 258 transitions. [2019-12-02 04:42:03,077 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 258 transitions. [2019-12-02 04:42:03,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-02 04:42:03,078 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:42:03,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:42:03,407 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:42:04,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:42:04,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 129 states and 267 transitions. [2019-12-02 04:42:04,372 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 267 transitions. [2019-12-02 04:42:04,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-02 04:42:04,373 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:42:04,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:42:04,676 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:42:05,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:42:05,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 131 states and 272 transitions. [2019-12-02 04:42:05,324 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 272 transitions. [2019-12-02 04:42:05,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-02 04:42:05,325 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:42:05,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:42:06,995 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 31 [2019-12-02 04:42:07,905 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 32 [2019-12-02 04:42:08,566 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 42 [2019-12-02 04:42:08,902 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:42:12,846 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-12-02 04:42:14,625 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-12-02 04:42:21,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:42:21,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 149 states and 301 transitions. [2019-12-02 04:42:21,197 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 301 transitions. [2019-12-02 04:42:21,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-02 04:42:21,199 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:42:21,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:42:21,322 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:42:23,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:42:23,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 154 states and 318 transitions. [2019-12-02 04:42:23,866 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 318 transitions. [2019-12-02 04:42:23,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-02 04:42:23,866 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:42:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:42:23,991 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:42:24,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:42:24,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 156 states and 322 transitions. [2019-12-02 04:42:24,819 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 322 transitions. [2019-12-02 04:42:24,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-02 04:42:24,819 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:42:24,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:42:24,930 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:42:25,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:42:25,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 157 states and 323 transitions. [2019-12-02 04:42:25,381 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 323 transitions. [2019-12-02 04:42:25,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-02 04:42:25,381 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:42:25,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:42:25,503 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:42:26,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:42:26,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 158 states and 324 transitions. [2019-12-02 04:42:26,011 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 324 transitions. [2019-12-02 04:42:26,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-02 04:42:26,012 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:42:26,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:42:26,633 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:42:35,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:42:35,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 177 states and 358 transitions. [2019-12-02 04:42:35,641 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 358 transitions. [2019-12-02 04:42:35,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-02 04:42:35,642 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:42:35,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:42:35,934 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:42:36,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:42:36,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 179 states and 364 transitions. [2019-12-02 04:42:36,456 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 364 transitions. [2019-12-02 04:42:36,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-02 04:42:36,457 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:42:36,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:42:39,330 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:42:42,856 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-12-02 04:42:43,982 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-12-02 04:42:45,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:42:45,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 182 states and 373 transitions. [2019-12-02 04:42:45,147 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 373 transitions. [2019-12-02 04:42:45,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-02 04:42:45,148 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:42:45,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:42:45,329 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:42:48,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:42:48,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 187 states and 386 transitions. [2019-12-02 04:42:48,637 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 386 transitions. [2019-12-02 04:42:48,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-02 04:42:48,638 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:42:48,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:42:50,173 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:43:05,307 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2019-12-02 04:43:07,500 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 32 [2019-12-02 04:43:11,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:43:11,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 216 states and 465 transitions. [2019-12-02 04:43:11,103 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 465 transitions. [2019-12-02 04:43:11,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-02 04:43:11,104 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:43:11,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:43:11,199 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:43:15,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:43:15,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 221 states and 480 transitions. [2019-12-02 04:43:15,394 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 480 transitions. [2019-12-02 04:43:15,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-02 04:43:15,395 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:43:15,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:43:17,824 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:43:26,512 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-12-02 04:43:30,384 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-12-02 04:43:36,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:43:36,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 232 states and 498 transitions. [2019-12-02 04:43:36,085 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 498 transitions. [2019-12-02 04:43:36,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-02 04:43:36,086 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:43:36,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:43:36,240 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:43:36,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:43:36,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 233 states and 505 transitions. [2019-12-02 04:43:36,976 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 505 transitions. [2019-12-02 04:43:36,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-02 04:43:36,977 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:43:37,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:43:37,127 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:43:47,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:43:47,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 244 states and 546 transitions. [2019-12-02 04:43:47,011 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 546 transitions. [2019-12-02 04:43:47,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-02 04:43:47,012 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:43:47,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:43:49,542 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:43:55,057 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-12-02 04:43:59,462 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-12-02 04:44:04,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:44:04,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 254 states and 568 transitions. [2019-12-02 04:44:04,614 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 568 transitions. [2019-12-02 04:44:04,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-02 04:44:04,615 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:44:04,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:44:04,805 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:44:05,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:44:05,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 255 states and 574 transitions. [2019-12-02 04:44:05,559 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 574 transitions. [2019-12-02 04:44:05,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-02 04:44:05,560 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:44:05,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:44:05,731 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:44:07,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:44:07,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 256 states and 575 transitions. [2019-12-02 04:44:07,695 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 575 transitions. [2019-12-02 04:44:07,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-02 04:44:07,696 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:44:07,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:44:07,868 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:44:15,802 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-12-02 04:44:18,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:44:18,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 266 states and 597 transitions. [2019-12-02 04:44:18,105 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 597 transitions. [2019-12-02 04:44:18,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-02 04:44:18,105 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:44:18,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:44:18,290 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:44:25,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:44:25,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 274 states and 616 transitions. [2019-12-02 04:44:25,462 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 616 transitions. [2019-12-02 04:44:25,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-02 04:44:25,462 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:44:25,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:44:25,639 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:44:27,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:44:27,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 275 states and 631 transitions. [2019-12-02 04:44:27,367 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 631 transitions. [2019-12-02 04:44:27,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-02 04:44:27,367 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:44:27,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:44:29,532 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:44:49,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:44:49,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 289 states and 671 transitions. [2019-12-02 04:44:49,659 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 671 transitions. [2019-12-02 04:44:49,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-02 04:44:49,660 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:44:49,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:44:49,810 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:44:57,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:44:57,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 296 states and 696 transitions. [2019-12-02 04:44:57,601 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 696 transitions. [2019-12-02 04:44:57,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-02 04:44:57,602 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:44:57,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:44:57,724 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:45:00,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:45:00,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 297 states and 701 transitions. [2019-12-02 04:45:00,151 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 701 transitions. [2019-12-02 04:45:00,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-02 04:45:00,152 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:45:00,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:45:00,301 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:45:11,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:45:11,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 306 states and 718 transitions. [2019-12-02 04:45:11,589 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 718 transitions. [2019-12-02 04:45:11,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-02 04:45:11,590 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:45:11,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:45:11,717 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:45:21,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:45:21,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 315 states and 735 transitions. [2019-12-02 04:45:21,134 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 735 transitions. [2019-12-02 04:45:21,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-02 04:45:21,134 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:45:21,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:45:21,251 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:45:31,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:45:31,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 323 states and 752 transitions. [2019-12-02 04:45:31,812 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 752 transitions. [2019-12-02 04:45:31,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-02 04:45:31,813 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:45:31,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:45:36,470 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:45:38,776 WARN L192 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-12-02 04:45:40,565 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-12-02 04:45:48,425 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-12-02 04:45:55,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:45:55,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 331 states and 786 transitions. [2019-12-02 04:45:55,747 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 786 transitions. [2019-12-02 04:45:55,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-02 04:45:55,747 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:45:55,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:45:55,940 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:45:56,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:45:56,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 332 states and 790 transitions. [2019-12-02 04:45:56,845 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 790 transitions. [2019-12-02 04:45:56,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-02 04:45:56,845 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:45:56,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:45:57,036 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:45:59,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:45:59,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 334 states and 805 transitions. [2019-12-02 04:45:59,262 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 805 transitions. [2019-12-02 04:45:59,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-02 04:45:59,262 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:45:59,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:45:59,440 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:46:02,157 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-12-02 04:46:02,680 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-12-02 04:46:04,955 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-12-02 04:46:05,458 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-12-02 04:46:11,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:46:11,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 342 states and 817 transitions. [2019-12-02 04:46:11,297 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 817 transitions. [2019-12-02 04:46:11,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-02 04:46:11,297 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:46:11,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:46:11,484 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:46:15,727 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-12-02 04:46:16,229 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-12-02 04:46:20,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:46:20,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 350 states and 828 transitions. [2019-12-02 04:46:20,635 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 828 transitions. [2019-12-02 04:46:20,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-02 04:46:20,635 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:46:20,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:46:20,805 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:46:24,562 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-12-02 04:46:30,202 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-12-02 04:46:32,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:46:32,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 353 states and 833 transitions. [2019-12-02 04:46:32,298 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 833 transitions. [2019-12-02 04:46:32,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-02 04:46:32,299 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:46:32,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:46:32,492 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:46:35,611 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-12-02 04:46:41,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:46:41,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 361 states and 850 transitions. [2019-12-02 04:46:41,723 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 850 transitions. [2019-12-02 04:46:41,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-02 04:46:41,724 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:46:41,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:46:41,905 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:46:43,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:46:43,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 366 states and 857 transitions. [2019-12-02 04:46:43,773 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 857 transitions. [2019-12-02 04:46:43,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-02 04:46:43,774 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:46:43,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:46:44,410 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:46:45,925 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-12-02 04:46:50,441 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-12-02 04:46:53,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:46:53,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 369 states and 871 transitions. [2019-12-02 04:46:53,845 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 871 transitions. [2019-12-02 04:46:53,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-02 04:46:53,846 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:46:53,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:46:53,985 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:46:57,606 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-12-02 04:46:59,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:46:59,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 372 states and 878 transitions. [2019-12-02 04:46:59,668 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 878 transitions. [2019-12-02 04:46:59,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-02 04:46:59,668 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:46:59,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:46:59,809 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:47:05,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:47:05,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 376 states and 893 transitions. [2019-12-02 04:47:05,887 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 893 transitions. [2019-12-02 04:47:05,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-02 04:47:05,887 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:47:06,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:47:06,046 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:47:07,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:47:07,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 377 states and 894 transitions. [2019-12-02 04:47:07,896 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 894 transitions. [2019-12-02 04:47:07,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-02 04:47:07,897 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:47:08,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:47:08,055 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:47:10,450 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-12-02 04:47:12,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:47:12,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 380 states and 900 transitions. [2019-12-02 04:47:12,513 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 900 transitions. [2019-12-02 04:47:12,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-02 04:47:12,514 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:47:12,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:47:12,656 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:47:17,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:47:17,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 383 states and 914 transitions. [2019-12-02 04:47:17,956 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 914 transitions. [2019-12-02 04:47:17,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-02 04:47:17,957 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:47:18,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:47:18,109 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:47:22,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:47:22,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 386 states and 930 transitions. [2019-12-02 04:47:22,034 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 930 transitions. [2019-12-02 04:47:22,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-02 04:47:22,035 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:47:22,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:47:22,174 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:47:24,228 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-12-02 04:47:26,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:47:26,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 388 states and 933 transitions. [2019-12-02 04:47:26,394 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 933 transitions. [2019-12-02 04:47:26,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-02 04:47:26,395 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:47:26,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:47:26,535 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:47:29,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:47:29,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 391 states and 937 transitions. [2019-12-02 04:47:29,701 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 937 transitions. [2019-12-02 04:47:29,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-02 04:47:29,701 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:47:29,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:47:33,532 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:47:40,542 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-12-02 04:47:45,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:47:45,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 397 states and 955 transitions. [2019-12-02 04:47:45,479 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 955 transitions. [2019-12-02 04:47:45,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-02 04:47:45,479 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:47:45,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:47:46,976 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:47:51,145 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-12-02 04:47:52,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:47:52,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 399 states and 961 transitions. [2019-12-02 04:47:52,942 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 961 transitions. [2019-12-02 04:47:52,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-02 04:47:52,942 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:47:52,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:47:54,392 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:47:58,167 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2019-12-02 04:48:09,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:48:09,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 406 states and 983 transitions. [2019-12-02 04:48:09,854 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 983 transitions. [2019-12-02 04:48:09,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-02 04:48:09,854 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:48:09,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:48:11,598 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:48:16,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:48:16,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 408 states and 988 transitions. [2019-12-02 04:48:16,066 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 988 transitions. [2019-12-02 04:48:16,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-02 04:48:16,067 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:48:16,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:48:17,464 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:48:19,425 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 26 [2019-12-02 04:48:23,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:48:23,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 412 states and 1006 transitions. [2019-12-02 04:48:23,537 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 1006 transitions. [2019-12-02 04:48:23,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-02 04:48:23,537 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:48:23,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:48:25,962 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:48:32,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:48:32,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 415 states and 1018 transitions. [2019-12-02 04:48:32,228 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 1018 transitions. [2019-12-02 04:48:32,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-02 04:48:32,228 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:48:32,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 04:48:35,722 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 04:48:36,531 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-12-02 04:48:38,617 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-12-02 04:48:44,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 04:48:44,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 417 states and 1021 transitions. [2019-12-02 04:48:44,012 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 1021 transitions. [2019-12-02 04:48:44,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-02 04:48:44,013 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 04:48:44,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-02 04:48:44,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-02 04:48:44,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-02 04:48:45,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-02 04:48:45,318 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 70 iterations. [2019-12-02 04:48:45,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 02.12 04:48:45 ImpRootNode [2019-12-02 04:48:45,416 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2019-12-02 04:48:45,416 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-02 04:48:45,416 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-02 04:48:45,416 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-02 04:48:45,416 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:41:32" (3/4) ... [2019-12-02 04:48:45,418 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-02 04:48:45,521 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_828e2fa0-441a-4f6a-a1c9-58aec4f4a149/bin/ukojak/witness.graphml [2019-12-02 04:48:45,521 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-02 04:48:45,522 INFO L168 Benchmark]: Toolchain (without parser) took 435188.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 948.9 MB in the beginning and 712.5 MB in the end (delta: 236.4 MB). Peak memory consumption was 395.2 MB. Max. memory is 11.5 GB. [2019-12-02 04:48:45,522 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-02 04:48:45,522 INFO L168 Benchmark]: CACSL2BoogieTranslator took 274.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 948.9 MB in the beginning and 1.1 GB in the end (delta: -181.1 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-12-02 04:48:45,522 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-02 04:48:45,522 INFO L168 Benchmark]: Boogie Preprocessor took 25.42 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-02 04:48:45,523 INFO L168 Benchmark]: RCFGBuilder took 1604.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 88.7 MB). Peak memory consumption was 257.1 MB. Max. memory is 11.5 GB. [2019-12-02 04:48:45,523 INFO L168 Benchmark]: CodeCheck took 433141.63 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 18.4 MB). Free memory was 1.0 GB in the beginning and 732.7 MB in the end (delta: 303.3 MB). Peak memory consumption was 321.6 MB. Max. memory is 11.5 GB. [2019-12-02 04:48:45,523 INFO L168 Benchmark]: Witness Printer took 105.07 ms. Allocated memory is still 1.2 GB. Free memory was 732.7 MB in the beginning and 712.5 MB in the end (delta: 20.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. [2019-12-02 04:48:45,525 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 19 locations, 1 error locations. Result: UNSAFE, OverallTime: 433.0s, OverallIterations: 70, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: -41772456 SDtfs, -17976738 SDslu, -406870404 SDs, 0 SdLazy, -1999625514 SolverSat, 1440848088 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 228.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 24427 GetRequests, 21780 SyntacticMatches, 1245 SemanticMatches, 1402 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1213735 ImplicationChecksByTransitivity, 414.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.2s SsaConstructionTime, 6.0s SatisfiabilityAnalysisTime, 40.5s InterpolantComputationTime, 2164 NumberOfCodeBlocks, 2164 NumberOfCodeBlocksAsserted, 70 NumberOfCheckSat, 2047 ConstructedInterpolants, 0 QuantifiedInterpolants, 735733 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 69 InterpolantComputations, 10 PerfectInterpolantSequences, 252/1390 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: 619]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L69] msg_t nomsg = (msg_t )-1; [L70] port_t p12 ; [L71] char p12_old ; [L72] char p12_new ; [L73] _Bool ep12 ; [L74] port_t p13 ; [L75] char p13_old ; [L76] char p13_new ; [L77] _Bool ep13 ; [L78] port_t p21 ; [L79] char p21_old ; [L80] char p21_new ; [L81] _Bool ep21 ; [L82] port_t p23 ; [L83] char p23_old ; [L84] char p23_new ; [L85] _Bool ep23 ; [L86] port_t p31 ; [L87] char p31_old ; [L88] char p31_new ; [L89] _Bool ep31 ; [L90] port_t p32 ; [L91] char p32_old ; [L92] char p32_new ; [L93] _Bool ep32 ; [L94] char id1 ; [L95] char r1 ; [L96] char st1 ; [L97] char nl1 ; [L98] char m1 ; [L99] char max1 ; [L100] _Bool mode1 ; [L101] _Bool newmax1 ; [L102] char id2 ; [L103] char r2 ; [L104] char st2 ; [L105] char nl2 ; [L106] char m2 ; [L107] char max2 ; [L108] _Bool mode2 ; [L109] _Bool newmax2 ; [L110] char id3 ; [L111] char r3 ; [L112] char st3 ; [L113] char nl3 ; [L114] char m3 ; [L115] char max3 ; [L116] _Bool mode3 ; [L117] _Bool newmax3 ; [L271] void (*nodes[3])(void) = { & node1, & node2, & node3}; [L537] int c1 ; [L538] int i2 ; [L541] c1 = 0 [L542] ep12 = __VERIFIER_nondet_bool() [L543] ep13 = __VERIFIER_nondet_bool() [L544] ep21 = __VERIFIER_nondet_bool() [L545] ep23 = __VERIFIER_nondet_bool() [L546] ep31 = __VERIFIER_nondet_bool() [L547] ep32 = __VERIFIER_nondet_bool() [L548] id1 = __VERIFIER_nondet_char() [L549] r1 = __VERIFIER_nondet_char() [L550] st1 = __VERIFIER_nondet_char() [L551] nl1 = __VERIFIER_nondet_char() [L552] m1 = __VERIFIER_nondet_char() [L553] max1 = __VERIFIER_nondet_char() [L554] mode1 = __VERIFIER_nondet_bool() [L555] newmax1 = __VERIFIER_nondet_bool() [L556] id2 = __VERIFIER_nondet_char() [L557] r2 = __VERIFIER_nondet_char() [L558] st2 = __VERIFIER_nondet_char() [L559] nl2 = __VERIFIER_nondet_char() [L560] m2 = __VERIFIER_nondet_char() [L561] max2 = __VERIFIER_nondet_char() [L562] mode2 = __VERIFIER_nondet_bool() [L563] newmax2 = __VERIFIER_nondet_bool() [L564] id3 = __VERIFIER_nondet_char() [L565] r3 = __VERIFIER_nondet_char() [L566] st3 = __VERIFIER_nondet_char() [L567] nl3 = __VERIFIER_nondet_char() [L568] m3 = __VERIFIER_nondet_char() [L569] max3 = __VERIFIER_nondet_char() [L570] mode3 = __VERIFIER_nondet_bool() [L571] newmax3 = __VERIFIER_nondet_bool() [L274] _Bool r121 ; [L275] _Bool r131 ; [L276] _Bool r211 ; [L277] _Bool r231 ; [L278] _Bool r311 ; [L279] _Bool r321 ; [L280] _Bool r122 ; [L281] int tmp ; [L282] _Bool r132 ; [L283] int tmp___0 ; [L284] _Bool r212 ; [L285] int tmp___1 ; [L286] _Bool r232 ; [L287] int tmp___2 ; [L288] _Bool r312 ; [L289] int tmp___3 ; [L290] _Bool r322 ; [L291] int tmp___4 ; [L292] int tmp___5 ; [L295] r121 = ep12 [L296] r131 = ep13 [L297] r211 = ep21 [L298] r231 = ep23 [L299] r311 = ep31 [L300] r321 = ep32 [L301] COND FALSE !(\read(r121)) [L304] COND FALSE !(\read(r131)) [L311] tmp = 0 [L313] r122 = (_Bool )tmp [L314] COND FALSE !(\read(r131)) [L317] COND FALSE !(\read(r121)) [L324] tmp___0 = 0 [L326] r132 = (_Bool )tmp___0 [L327] COND FALSE !(\read(r211)) [L330] COND FALSE !(\read(r231)) [L337] tmp___1 = 0 [L339] r212 = (_Bool )tmp___1 [L340] COND FALSE !(\read(r231)) [L343] COND FALSE !(\read(r211)) [L350] tmp___2 = 0 [L352] r232 = (_Bool )tmp___2 [L353] COND FALSE !(\read(r311)) [L356] COND TRUE \read(r321) [L357] COND FALSE !(\read(ep21)) [L360] tmp___3 = 0 [L365] r312 = (_Bool )tmp___3 [L366] COND TRUE \read(r321) [L367] tmp___4 = 1 [L378] r322 = (_Bool )tmp___4 [L379] COND TRUE (int )id1 != (int )id2 [L380] COND TRUE (int )id1 != (int )id3 [L381] COND TRUE (int )id2 != (int )id3 [L382] COND TRUE (int )id1 >= 0 [L383] COND TRUE (int )id2 >= 0 [L384] COND TRUE (int )id3 >= 0 [L385] COND TRUE (int )r1 == 0 [L386] COND TRUE (int )r2 == 0 [L387] COND TRUE (int )r3 == 0 [L388] COND TRUE (int )max1 == (int )id1 [L389] COND TRUE (int )max2 == (int )id2 [L390] COND TRUE (int )max3 == (int )id3 [L391] COND TRUE (int )st1 == 0 [L392] COND TRUE (int )st2 == 0 [L393] COND TRUE (int )st3 == 0 [L394] COND TRUE (int )nl1 == 0 [L395] COND TRUE (int )nl2 == 0 [L396] COND TRUE (int )nl3 == 0 [L397] COND TRUE (int )mode1 == 0 [L398] COND TRUE (int )mode2 == 0 [L399] COND TRUE (int )mode3 == 0 [L400] COND TRUE \read(newmax1) [L401] COND TRUE \read(newmax2) [L402] COND TRUE \read(newmax3) [L403] tmp___5 = 1 [L476] return (tmp___5); [L572] i2 = init() [L574] p12_old = nomsg [L575] p12_new = nomsg [L576] p13_old = nomsg [L577] p13_new = nomsg [L578] p21_old = nomsg [L579] p21_new = nomsg [L580] p23_old = nomsg [L581] p23_new = nomsg [L582] p31_old = nomsg [L583] p31_new = nomsg [L584] p32_old = nomsg [L585] p32_new = nomsg [L586] i2 = 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=4, id3=1, m1=4, m2=1, m3=1, max1=3, max2=4, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L587] COND TRUE i2 < 6 [L120] _Bool newmax ; [L123] newmax = (_Bool)0 [L124] COND FALSE !(\read(mode1)) [L152] COND TRUE (int )r1 < 2 [L153] COND FALSE !(\read(ep12)) [L158] COND FALSE !(\read(ep13)) [L164] mode1 = (_Bool)1 [L171] _Bool newmax ; [L174] newmax = (_Bool)0 [L175] COND FALSE !(\read(mode2)) [L203] COND TRUE (int )r2 < 2 [L204] COND FALSE !(\read(ep21)) [L209] COND FALSE !(\read(ep23)) [L215] mode2 = (_Bool)1 [L222] _Bool newmax ; [L225] newmax = (_Bool)0 [L226] COND FALSE !(\read(mode3)) [L254] COND TRUE (int )r3 < 2 [L255] COND FALSE !(\read(ep31)) [L260] COND TRUE \read(ep32) [L261] COND TRUE \read(newmax3) [L262] EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L262] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L266] mode3 = (_Bool)1 [L592] p12_old = p12_new [L593] p12_new = nomsg [L594] p13_old = p13_new [L595] p13_new = nomsg [L596] p21_old = p21_new [L597] p21_new = nomsg [L598] p23_old = p23_new [L599] p23_new = nomsg [L600] p31_old = p31_new [L601] p31_new = nomsg [L602] p32_old = p32_new [L603] p32_new = nomsg [L481] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=4, id3=1, m1=4, m2=1, m3=1, max1=3, max2=4, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-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] [L484] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=4, id3=1, m1=4, m2=1, m3=1, max1=3, max2=4, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-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] [L485] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=4, id3=1, m1=4, m2=1, m3=1, max1=3, max2=4, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-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] [L486] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=4, id3=1, m1=4, m2=1, m3=1, max1=3, max2=4, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-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] [L487] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=4, id3=1, m1=4, m2=1, m3=1, max1=3, max2=4, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-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] [L488] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=4, id3=1, m1=4, m2=1, m3=1, max1=3, max2=4, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-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] [L491] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=4, id3=1, m1=4, m2=1, m3=1, max1=3, max2=4, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-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] [L493] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=4, id3=1, m1=4, m2=1, m3=1, max1=3, max2=4, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-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] [L498] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=4, id3=1, m1=4, m2=1, m3=1, max1=3, max2=4, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-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] [L501] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=4, id3=1, m1=4, m2=1, m3=1, max1=3, max2=4, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-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] [L503] COND TRUE (int )r1 < 2 [L504] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=4, id3=1, m1=4, m2=1, m3=1, max1=3, max2=4, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-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] [L532] return (tmp); [L604] c1 = check() [L617] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=4, id3=1, m1=4, m2=1, m3=1, max1=3, max2=4, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-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] [L606] i2 ++ VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=4, id3=1, m1=4, m2=1, m3=1, max1=3, max2=4, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-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] [L587] COND TRUE i2 < 6 [L120] _Bool newmax ; [L123] newmax = (_Bool)0 [L124] COND TRUE \read(mode1) [L125] r1 = (char )((int )r1 + 1) [L126] COND FALSE !(\read(ep21)) [L134] COND FALSE !(\read(ep31)) [L142] newmax1 = newmax [L143] COND FALSE !((int )r1 == 2) [L150] mode1 = (_Bool)0 [L171] _Bool newmax ; [L174] newmax = (_Bool)0 [L175] COND TRUE \read(mode2) [L176] r2 = (char )((int )r2 + 1) [L177] COND FALSE !(\read(ep12)) [L185] COND TRUE \read(ep32) [L186] m2 = p32_old [L187] p32_old = nomsg [L188] COND FALSE !((int )m2 > (int )max2) [L193] newmax2 = newmax [L194] COND FALSE !((int )r2 == 2) [L201] mode2 = (_Bool)0 [L222] _Bool newmax ; [L225] newmax = (_Bool)0 [L226] COND TRUE \read(mode3) [L227] r3 = (char )((int )r3 + 1) [L228] COND FALSE !(\read(ep13)) [L236] COND FALSE !(\read(ep23)) [L244] newmax3 = newmax [L245] COND FALSE !((int )r3 == 2) [L252] mode3 = (_Bool)0 [L592] p12_old = p12_new [L593] p12_new = nomsg [L594] p13_old = p13_new [L595] p13_new = nomsg [L596] p21_old = p21_new [L597] p21_new = nomsg [L598] p23_old = p23_new [L599] p23_new = nomsg [L600] p31_old = p31_new [L601] p31_new = nomsg [L602] p32_old = p32_new [L603] p32_new = nomsg [L481] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=4, id3=1, m1=4, m2=1, m3=1, max1=3, max2=4, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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] [L484] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=4, id3=1, m1=4, m2=1, m3=1, max1=3, max2=4, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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] [L485] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=4, id3=1, m1=4, m2=1, m3=1, max1=3, max2=4, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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] [L486] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=4, id3=1, m1=4, m2=1, m3=1, max1=3, max2=4, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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] [L487] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=4, id3=1, m1=4, m2=1, m3=1, max1=3, max2=4, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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] [L488] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=4, id3=1, m1=4, m2=1, m3=1, max1=3, max2=4, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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] [L491] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=4, id3=1, m1=4, m2=1, m3=1, max1=3, max2=4, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L493] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=4, id3=1, m1=4, m2=1, m3=1, max1=3, max2=4, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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] [L498] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=4, id3=1, m1=4, m2=1, m3=1, max1=3, max2=4, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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] [L501] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=4, id3=1, m1=4, m2=1, m3=1, max1=3, max2=4, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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] [L503] COND TRUE (int )r1 < 2 [L504] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=4, id3=1, m1=4, m2=1, m3=1, max1=3, max2=4, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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] [L532] return (tmp); [L604] c1 = check() [L617] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=4, id3=1, m1=4, m2=1, m3=1, max1=3, max2=4, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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] [L606] i2 ++ VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=4, id3=1, m1=4, m2=1, m3=1, max1=3, max2=4, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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] [L587] COND TRUE i2 < 6 [L120] _Bool newmax ; [L123] newmax = (_Bool)0 [L124] COND FALSE !(\read(mode1)) [L152] COND TRUE (int )r1 < 2 [L153] COND FALSE !(\read(ep12)) [L158] COND FALSE !(\read(ep13)) [L164] mode1 = (_Bool)1 [L171] _Bool newmax ; [L174] newmax = (_Bool)0 [L175] COND FALSE !(\read(mode2)) [L203] COND TRUE (int )r2 < 2 [L204] COND FALSE !(\read(ep21)) [L209] COND FALSE !(\read(ep23)) [L215] mode2 = (_Bool)1 [L222] _Bool newmax ; [L225] newmax = (_Bool)0 [L226] COND FALSE !(\read(mode3)) [L254] COND TRUE (int )r3 < 2 [L255] COND FALSE !(\read(ep31)) [L260] COND TRUE \read(ep32) [L261] COND FALSE !(\read(newmax3)) [L266] mode3 = (_Bool)1 [L592] p12_old = p12_new [L593] p12_new = nomsg [L594] p13_old = p13_new [L595] p13_new = nomsg [L596] p21_old = p21_new [L597] p21_new = nomsg [L598] p23_old = p23_new [L599] p23_new = nomsg [L600] p31_old = p31_new [L601] p31_new = nomsg [L602] p32_old = p32_new [L603] p32_new = nomsg [L481] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=4, id3=1, m1=4, m2=1, m3=1, max1=3, max2=4, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=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] [L484] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=4, id3=1, m1=4, m2=1, m3=1, max1=3, max2=4, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=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] [L485] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=4, id3=1, m1=4, m2=1, m3=1, max1=3, max2=4, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=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] [L486] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=4, id3=1, m1=4, m2=1, m3=1, max1=3, max2=4, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=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] [L487] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=4, id3=1, m1=4, m2=1, m3=1, max1=3, max2=4, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=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] [L488] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=4, id3=1, m1=4, m2=1, m3=1, max1=3, max2=4, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=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] [L491] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=4, id3=1, m1=4, m2=1, m3=1, max1=3, max2=4, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L493] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=4, id3=1, m1=4, m2=1, m3=1, max1=3, max2=4, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=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] [L498] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=4, id3=1, m1=4, m2=1, m3=1, max1=3, max2=4, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=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] [L501] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=4, id3=1, m1=4, m2=1, m3=1, max1=3, max2=4, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=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] [L503] COND TRUE (int )r1 < 2 [L504] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=4, id3=1, m1=4, m2=1, m3=1, max1=3, max2=4, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=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] [L532] return (tmp); [L604] c1 = check() [L617] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=4, id3=1, m1=4, m2=1, m3=1, max1=3, max2=4, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=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] [L606] i2 ++ VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=4, id3=1, m1=4, m2=1, m3=1, max1=3, max2=4, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=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] [L587] COND TRUE i2 < 6 [L120] _Bool newmax ; [L123] newmax = (_Bool)0 [L124] COND TRUE \read(mode1) [L125] r1 = (char )((int )r1 + 1) [L126] COND FALSE !(\read(ep21)) [L134] COND FALSE !(\read(ep31)) [L142] newmax1 = newmax [L143] COND TRUE (int )r1 == 2 [L144] COND TRUE (int )max1 == (int )id1 [L145] st1 = (char)1 [L150] mode1 = (_Bool)0 [L171] _Bool newmax ; [L174] newmax = (_Bool)0 [L175] COND TRUE \read(mode2) [L176] r2 = (char )((int )r2 + 1) [L177] COND FALSE !(\read(ep12)) [L185] COND TRUE \read(ep32) [L186] m2 = p32_old [L187] p32_old = nomsg [L188] COND FALSE !((int )m2 > (int )max2) [L193] newmax2 = newmax [L194] COND TRUE (int )r2 == 2 [L195] COND TRUE (int )max2 == (int )id2 [L196] st2 = (char)1 [L201] mode2 = (_Bool)0 [L222] _Bool newmax ; [L225] newmax = (_Bool)0 [L226] COND TRUE \read(mode3) [L227] r3 = (char )((int )r3 + 1) [L228] COND FALSE !(\read(ep13)) [L236] COND FALSE !(\read(ep23)) [L244] newmax3 = newmax [L245] COND TRUE (int )r3 == 2 [L246] COND TRUE (int )max3 == (int )id3 [L247] st3 = (char)1 [L252] mode3 = (_Bool)0 [L592] p12_old = p12_new [L593] p12_new = nomsg [L594] p13_old = p13_new [L595] p13_new = nomsg [L596] p21_old = p21_new [L597] p21_new = nomsg [L598] p23_old = p23_new [L599] p23_new = nomsg [L600] p31_old = p31_new [L601] p31_new = nomsg [L602] p32_old = p32_new [L603] p32_new = nomsg [L481] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=4, id3=1, m1=4, m2=-1, m3=1, max1=3, max2=4, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=1] [L484] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L530] tmp = 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=4, id3=1, m1=4, m2=-1, m3=1, max1=3, max2=4, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=1] [L532] return (tmp); [L604] c1 = check() [L617] COND TRUE ! arg VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=4, id3=1, m1=4, m2=-1, m3=1, max1=3, max2=4, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=1] [L619] __VERIFIER_error() VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=4, id3=1, m1=4, m2=-1, m3=1, max1=3, max2=4, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 274.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 948.9 MB in the beginning and 1.1 GB in the end (delta: -181.1 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.42 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1604.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 88.7 MB). Peak memory consumption was 257.1 MB. Max. memory is 11.5 GB. * CodeCheck took 433141.63 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 18.4 MB). Free memory was 1.0 GB in the beginning and 732.7 MB in the end (delta: 303.3 MB). Peak memory consumption was 321.6 MB. Max. memory is 11.5 GB. * Witness Printer took 105.07 ms. Allocated memory is still 1.2 GB. Free memory was 732.7 MB in the beginning and 712.5 MB in the end (delta: 20.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...