./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 69874e26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_48c829a1-91b4-4547-83ba-e659a4d4c594/bin/ukojak/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_48c829a1-91b4-4547-83ba-e659a4d4c594/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_48c829a1-91b4-4547-83ba-e659a4d4c594/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_48c829a1-91b4-4547-83ba-e659a4d4c594/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_48c829a1-91b4-4547-83ba-e659a4d4c594/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_48c829a1-91b4-4547-83ba-e659a4d4c594/bin/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f2b44b000848d54b4778081ac49fa3ba215d43b4 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-69874e2 [2020-12-01 17:08:47,627 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-01 17:08:47,631 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-01 17:08:47,724 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-01 17:08:47,725 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-01 17:08:47,732 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-01 17:08:47,737 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-01 17:08:47,746 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-01 17:08:47,750 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-01 17:08:47,752 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-01 17:08:47,754 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-01 17:08:47,758 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-01 17:08:47,759 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-01 17:08:47,769 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-01 17:08:47,772 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-01 17:08:47,774 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-01 17:08:47,776 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-01 17:08:47,780 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-01 17:08:47,787 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-01 17:08:47,797 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-01 17:08:47,800 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-01 17:08:47,802 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-01 17:08:47,805 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-01 17:08:47,807 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-01 17:08:47,819 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-01 17:08:47,819 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-01 17:08:47,820 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-01 17:08:47,823 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-01 17:08:47,824 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-01 17:08:47,826 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-01 17:08:47,826 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-01 17:08:47,828 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-01 17:08:47,831 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-01 17:08:47,833 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-01 17:08:47,835 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-01 17:08:47,836 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-01 17:08:47,837 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-01 17:08:47,837 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-01 17:08:47,838 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-01 17:08:47,839 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-01 17:08:47,841 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-01 17:08:47,845 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_48c829a1-91b4-4547-83ba-e659a4d4c594/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2020-12-01 17:08:47,900 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-01 17:08:47,900 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-01 17:08:47,902 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-01 17:08:47,903 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2020-12-01 17:08:47,904 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-01 17:08:47,904 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-01 17:08:47,905 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-01 17:08:47,905 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-01 17:08:47,905 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-01 17:08:47,906 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-01 17:08:47,907 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-01 17:08:47,907 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-01 17:08:47,908 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-01 17:08:47,908 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-01 17:08:47,908 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-01 17:08:47,909 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-01 17:08:47,909 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-01 17:08:47,909 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-01 17:08:47,910 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2020-12-01 17:08:47,910 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2020-12-01 17:08:47,910 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-01 17:08:47,910 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-01 17:08:47,911 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2020-12-01 17:08:47,911 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-01 17:08:47,911 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-01 17:08:47,912 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-01 17:08:47,912 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2020-12-01 17:08:47,912 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-01 17:08:47,913 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-01 17:08:47,915 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_48c829a1-91b4-4547-83ba-e659a4d4c594/bin/ukojak/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_48c829a1-91b4-4547-83ba-e659a4d4c594/bin/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f2b44b000848d54b4778081ac49fa3ba215d43b4 [2020-12-01 17:08:48,315 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-01 17:08:48,365 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-01 17:08:48,368 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-01 17:08:48,371 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-01 17:08:48,372 INFO L275 PluginConnector]: CDTParser initialized [2020-12-01 17:08:48,373 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_48c829a1-91b4-4547-83ba-e659a4d4c594/bin/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c [2020-12-01 17:08:48,495 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_48c829a1-91b4-4547-83ba-e659a4d4c594/bin/ukojak/data/a331ab05f/18cc5920588546538aacca406ab5e644/FLAG1b5576849 [2020-12-01 17:08:49,219 INFO L306 CDTParser]: Found 1 translation units. [2020-12-01 17:08:49,220 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_48c829a1-91b4-4547-83ba-e659a4d4c594/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c [2020-12-01 17:08:49,235 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_48c829a1-91b4-4547-83ba-e659a4d4c594/bin/ukojak/data/a331ab05f/18cc5920588546538aacca406ab5e644/FLAG1b5576849 [2020-12-01 17:08:49,503 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_48c829a1-91b4-4547-83ba-e659a4d4c594/bin/ukojak/data/a331ab05f/18cc5920588546538aacca406ab5e644 [2020-12-01 17:08:49,506 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-01 17:08:49,508 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-01 17:08:49,512 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-01 17:08:49,513 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-01 17:08:49,517 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-01 17:08:49,520 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 05:08:49" (1/1) ... [2020-12-01 17:08:49,522 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2243f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:08:49, skipping insertion in model container [2020-12-01 17:08:49,523 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 05:08:49" (1/1) ... [2020-12-01 17:08:49,533 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-01 17:08:49,609 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-01 17:08:49,967 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 17:08:49,982 INFO L203 MainTranslator]: Completed pre-run [2020-12-01 17:08:50,059 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 17:08:50,108 INFO L208 MainTranslator]: Completed translation [2020-12-01 17:08:50,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:08:50 WrapperNode [2020-12-01 17:08:50,111 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-01 17:08:50,112 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-01 17:08:50,113 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-01 17:08:50,113 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-01 17:08:50,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:08:50" (1/1) ... [2020-12-01 17:08:50,154 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:08:50" (1/1) ... [2020-12-01 17:08:50,211 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-01 17:08:50,221 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-01 17:08:50,221 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-01 17:08:50,222 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-01 17:08:50,232 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:08:50" (1/1) ... [2020-12-01 17:08:50,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:08:50" (1/1) ... [2020-12-01 17:08:50,255 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:08:50" (1/1) ... [2020-12-01 17:08:50,262 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:08:50" (1/1) ... [2020-12-01 17:08:50,289 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:08:50" (1/1) ... [2020-12-01 17:08:50,299 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:08:50" (1/1) ... [2020-12-01 17:08:50,312 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:08:50" (1/1) ... [2020-12-01 17:08:50,317 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-01 17:08:50,318 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-01 17:08:50,320 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-01 17:08:50,320 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-01 17:08:50,321 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:08:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_48c829a1-91b4-4547-83ba-e659a4d4c594/bin/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2020-12-01 17:08:50,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-01 17:08:50,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-01 17:08:50,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-01 17:08:50,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-01 17:08:54,325 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-01 17:08:54,326 INFO L298 CfgBuilder]: Removed 21 assume(true) statements. [2020-12-01 17:08:54,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:08:54 BoogieIcfgContainer [2020-12-01 17:08:54,329 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-01 17:08:54,331 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2020-12-01 17:08:54,332 INFO L271 PluginConnector]: Initializing CodeCheck... [2020-12-01 17:08:54,344 INFO L275 PluginConnector]: CodeCheck initialized [2020-12-01 17:08:54,345 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:08:54" (1/1) ... [2020-12-01 17:08:54,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:08:54,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:08:54,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 18 states and 29 transitions. [2020-12-01 17:08:54,448 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 29 transitions. [2020-12-01 17:08:54,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-12-01 17:08:54,452 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:08:54,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:08:55,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:08:55,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:08:55,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 19 states and 31 transitions. [2020-12-01 17:08:55,357 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 31 transitions. [2020-12-01 17:08:55,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-01 17:08:55,358 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:08:55,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:08:55,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:08:56,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:08:56,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 22 states and 37 transitions. [2020-12-01 17:08:56,018 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 37 transitions. [2020-12-01 17:08:56,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-01 17:08:56,030 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:08:56,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:08:56,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:08:56,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:08:56,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 26 states and 45 transitions. [2020-12-01 17:08:56,977 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 45 transitions. [2020-12-01 17:08:56,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-01 17:08:56,979 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:08:57,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:08:57,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:08:58,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:08:58,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 31 states and 55 transitions. [2020-12-01 17:08:58,311 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 55 transitions. [2020-12-01 17:08:58,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-01 17:08:58,312 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:08:58,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:08:58,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:08:59,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:08:59,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 38 states and 67 transitions. [2020-12-01 17:08:59,999 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 67 transitions. [2020-12-01 17:09:00,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-01 17:09:00,000 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:09:00,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:09:00,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:09:01,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:09:01,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 44 states and 78 transitions. [2020-12-01 17:09:01,961 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 78 transitions. [2020-12-01 17:09:01,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-01 17:09:01,962 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:09:01,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:09:02,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:09:02,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:09:02,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 45 states and 78 transitions. [2020-12-01 17:09:02,506 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 78 transitions. [2020-12-01 17:09:02,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-01 17:09:02,509 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:09:02,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:09:02,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:09:02,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:09:02,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 46 states and 79 transitions. [2020-12-01 17:09:02,622 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 79 transitions. [2020-12-01 17:09:02,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-01 17:09:02,623 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:09:02,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:09:02,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:09:03,334 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2020-12-01 17:09:05,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:09:05,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 56 states and 96 transitions. [2020-12-01 17:09:05,997 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 96 transitions. [2020-12-01 17:09:05,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-01 17:09:05,998 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:09:06,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:09:06,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:09:06,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:09:06,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 59 states and 108 transitions. [2020-12-01 17:09:06,831 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 108 transitions. [2020-12-01 17:09:06,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-01 17:09:06,832 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:09:07,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:09:08,110 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:09:08,269 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2020-12-01 17:09:08,651 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2020-12-01 17:09:15,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:09:15,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 74 states and 143 transitions. [2020-12-01 17:09:15,759 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 143 transitions. [2020-12-01 17:09:15,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-01 17:09:15,761 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:09:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:09:16,376 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:09:17,664 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2020-12-01 17:09:24,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:09:24,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 90 states and 178 transitions. [2020-12-01 17:09:24,930 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 178 transitions. [2020-12-01 17:09:24,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-01 17:09:24,932 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:09:25,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:09:25,110 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:09:25,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:09:25,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 91 states and 179 transitions. [2020-12-01 17:09:25,701 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 179 transitions. [2020-12-01 17:09:25,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-01 17:09:25,711 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:09:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:09:26,220 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:09:26,487 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2020-12-01 17:09:33,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:09:33,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 104 states and 206 transitions. [2020-12-01 17:09:33,400 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 206 transitions. [2020-12-01 17:09:33,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-01 17:09:33,401 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:09:33,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:09:33,577 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:09:34,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:09:34,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 105 states and 208 transitions. [2020-12-01 17:09:34,447 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 208 transitions. [2020-12-01 17:09:34,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-01 17:09:34,448 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:09:34,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:09:34,589 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:09:35,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:09:35,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 106 states and 212 transitions. [2020-12-01 17:09:35,520 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 212 transitions. [2020-12-01 17:09:35,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-01 17:09:35,521 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:09:35,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:09:36,339 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:09:45,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:09:45,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 119 states and 240 transitions. [2020-12-01 17:09:45,553 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 240 transitions. [2020-12-01 17:09:45,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-01 17:09:45,554 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:09:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:09:45,672 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:09:47,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:09:47,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 121 states and 248 transitions. [2020-12-01 17:09:47,601 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 248 transitions. [2020-12-01 17:09:47,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-01 17:09:47,602 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:09:47,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:09:47,697 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:09:48,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:09:48,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 122 states and 249 transitions. [2020-12-01 17:09:48,687 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 249 transitions. [2020-12-01 17:09:48,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-01 17:09:48,688 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:09:48,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:09:48,786 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:09:49,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:09:49,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 123 states and 251 transitions. [2020-12-01 17:09:49,849 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 251 transitions. [2020-12-01 17:09:49,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-01 17:09:49,850 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:09:50,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:09:51,454 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:09:52,578 WARN L197 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2020-12-01 17:09:53,691 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2020-12-01 17:09:54,721 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2020-12-01 17:09:55,697 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2020-12-01 17:09:56,781 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2020-12-01 17:09:57,882 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2020-12-01 17:09:58,989 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2020-12-01 17:10:00,206 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2020-12-01 17:10:00,847 WARN L197 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2020-12-01 17:10:05,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:10:05,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 136 states and 278 transitions. [2020-12-01 17:10:05,765 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 278 transitions. [2020-12-01 17:10:05,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-01 17:10:05,766 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:10:06,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:10:06,211 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:10:06,513 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2020-12-01 17:10:06,741 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2020-12-01 17:10:11,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:10:11,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 140 states and 288 transitions. [2020-12-01 17:10:11,282 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 288 transitions. [2020-12-01 17:10:11,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-01 17:10:11,283 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:10:11,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:10:11,753 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:10:13,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:10:13,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 141 states and 289 transitions. [2020-12-01 17:10:13,644 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 289 transitions. [2020-12-01 17:10:13,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-01 17:10:13,645 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:10:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:10:14,088 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:10:15,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:10:15,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 142 states and 291 transitions. [2020-12-01 17:10:15,553 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 291 transitions. [2020-12-01 17:10:15,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-01 17:10:15,554 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:10:15,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:10:15,997 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:10:17,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:10:17,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 143 states and 293 transitions. [2020-12-01 17:10:17,716 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 293 transitions. [2020-12-01 17:10:17,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-01 17:10:17,717 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:10:17,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:10:19,194 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:10:20,027 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2020-12-01 17:10:21,009 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2020-12-01 17:10:21,217 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2020-12-01 17:10:22,503 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2020-12-01 17:10:23,822 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2020-12-01 17:10:24,985 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2020-12-01 17:10:30,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:10:30,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 156 states and 315 transitions. [2020-12-01 17:10:30,312 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 315 transitions. [2020-12-01 17:10:30,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-01 17:10:30,313 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:10:30,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:10:32,701 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:10:34,247 WARN L197 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2020-12-01 17:10:34,975 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2020-12-01 17:10:35,236 WARN L197 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2020-12-01 17:10:36,499 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2020-12-01 17:10:36,780 WARN L197 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2020-12-01 17:10:39,205 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2020-12-01 17:10:40,750 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2020-12-01 17:10:41,096 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 30 [2020-12-01 17:10:42,841 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2020-12-01 17:10:45,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:10:45,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 162 states and 328 transitions. [2020-12-01 17:10:45,905 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 328 transitions. [2020-12-01 17:10:45,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-12-01 17:10:45,906 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:10:46,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:10:50,310 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:10:51,878 WARN L197 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 33 [2020-12-01 17:10:52,929 WARN L197 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 35 [2020-12-01 17:10:54,615 WARN L197 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 35 [2020-12-01 17:10:54,986 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 37 [2020-12-01 17:10:56,884 WARN L197 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 36 [2020-12-01 17:10:57,891 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 33 [2020-12-01 17:10:58,309 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 34 [2020-12-01 17:10:59,910 WARN L197 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 31 [2020-12-01 17:11:00,899 WARN L197 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2020-12-01 17:11:02,414 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 30 [2020-12-01 17:11:03,484 WARN L197 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2020-12-01 17:11:11,507 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2020-12-01 17:11:12,813 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2020-12-01 17:11:15,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:11:15,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 176 states and 390 transitions. [2020-12-01 17:11:15,078 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 390 transitions. [2020-12-01 17:11:15,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-01 17:11:15,079 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:11:15,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:11:17,211 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:11:18,833 WARN L197 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2020-12-01 17:11:19,844 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2020-12-01 17:11:20,201 WARN L197 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2020-12-01 17:11:32,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:11:32,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 187 states and 419 transitions. [2020-12-01 17:11:32,047 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 419 transitions. [2020-12-01 17:11:32,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-01 17:11:32,048 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:11:32,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:11:33,077 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:11:34,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:11:34,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 188 states and 421 transitions. [2020-12-01 17:11:34,832 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 421 transitions. [2020-12-01 17:11:34,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-01 17:11:34,833 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:11:34,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:11:38,086 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:11:41,396 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2020-12-01 17:11:43,438 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 27 [2020-12-01 17:11:47,305 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2020-12-01 17:11:49,481 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 27 [2020-12-01 17:11:56,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:11:56,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 195 states and 441 transitions. [2020-12-01 17:11:56,712 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 441 transitions. [2020-12-01 17:11:56,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-01 17:11:56,713 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:11:56,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:11:56,844 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:12:00,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:12:00,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 197 states and 447 transitions. [2020-12-01 17:12:00,553 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 447 transitions. [2020-12-01 17:12:00,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-01 17:12:00,554 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:12:00,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:12:00,676 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:12:01,041 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2020-12-01 17:12:02,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:12:02,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 198 states and 451 transitions. [2020-12-01 17:12:02,920 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 451 transitions. [2020-12-01 17:12:02,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-01 17:12:02,921 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:12:02,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:12:05,824 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:12:23,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:12:23,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 211 states and 481 transitions. [2020-12-01 17:12:23,398 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 481 transitions. [2020-12-01 17:12:23,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-01 17:12:23,399 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:12:23,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:12:23,505 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:12:25,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:12:25,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 212 states and 485 transitions. [2020-12-01 17:12:25,868 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 485 transitions. [2020-12-01 17:12:25,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-01 17:12:25,868 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:12:25,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:12:26,018 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:12:26,442 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2020-12-01 17:12:34,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:12:34,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 216 states and 502 transitions. [2020-12-01 17:12:34,953 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 502 transitions. [2020-12-01 17:12:34,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-01 17:12:34,954 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:12:35,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:12:38,150 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:12:41,692 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2020-12-01 17:12:43,331 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2020-12-01 17:12:45,102 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2020-12-01 17:12:45,474 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2020-12-01 17:12:47,371 WARN L197 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2020-12-01 17:12:47,740 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2020-12-01 17:12:49,966 WARN L197 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 33 [2020-12-01 17:12:51,950 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2020-12-01 17:12:52,288 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2020-12-01 17:12:54,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:12:54,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 221 states and 519 transitions. [2020-12-01 17:12:54,084 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 519 transitions. [2020-12-01 17:12:54,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-01 17:12:54,084 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:12:54,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:12:54,302 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:12:55,173 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2020-12-01 17:12:57,448 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2020-12-01 17:12:57,934 WARN L197 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2020-12-01 17:12:59,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:12:59,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 223 states and 532 transitions. [2020-12-01 17:12:59,917 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 532 transitions. [2020-12-01 17:12:59,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-01 17:12:59,918 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:12:59,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:13:00,038 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:13:05,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:13:05,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 225 states and 537 transitions. [2020-12-01 17:13:05,075 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 537 transitions. [2020-12-01 17:13:05,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-01 17:13:05,076 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:13:05,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:13:08,935 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:13:12,483 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2020-12-01 17:13:14,720 WARN L197 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2020-12-01 17:13:16,869 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2020-12-01 17:13:28,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:13:28,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 232 states and 559 transitions. [2020-12-01 17:13:28,761 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 559 transitions. [2020-12-01 17:13:28,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-01 17:13:28,762 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:13:28,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:13:29,031 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:13:29,465 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2020-12-01 17:13:30,838 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2020-12-01 17:13:32,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:13:32,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 233 states and 565 transitions. [2020-12-01 17:13:32,023 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 565 transitions. [2020-12-01 17:13:32,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-01 17:13:32,024 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:13:32,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:13:32,301 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:13:32,924 WARN L197 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2020-12-01 17:13:33,358 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2020-12-01 17:13:36,028 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2020-12-01 17:13:36,477 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 27 [2020-12-01 17:13:39,573 WARN L197 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2020-12-01 17:13:40,236 WARN L197 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 28 [2020-12-01 17:13:41,505 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2020-12-01 17:13:43,456 WARN L197 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2020-12-01 17:13:44,198 WARN L197 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 24 [2020-12-01 17:13:45,451 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2020-12-01 17:13:46,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:13:46,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 237 states and 581 transitions. [2020-12-01 17:13:46,700 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 581 transitions. [2020-12-01 17:13:46,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-01 17:13:46,701 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:13:46,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:13:46,972 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:13:47,614 WARN L197 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2020-12-01 17:13:50,807 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2020-12-01 17:13:53,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:13:53,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 239 states and 583 transitions. [2020-12-01 17:13:53,380 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 583 transitions. [2020-12-01 17:13:53,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-01 17:13:53,381 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:13:53,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:13:57,202 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:13:59,385 WARN L197 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2020-12-01 17:14:01,715 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2020-12-01 17:14:02,680 WARN L197 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2020-12-01 17:14:05,076 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2020-12-01 17:14:06,072 WARN L197 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 42 [2020-12-01 17:14:08,379 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2020-12-01 17:14:08,810 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2020-12-01 17:14:09,344 WARN L197 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2020-12-01 17:14:11,473 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2020-12-01 17:14:13,747 WARN L197 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2020-12-01 17:14:14,505 WARN L197 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 28 [2020-12-01 17:14:17,779 WARN L197 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 27 [2020-12-01 17:14:18,589 WARN L197 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 26 [2020-12-01 17:14:22,031 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2020-12-01 17:14:24,138 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2020-12-01 17:14:32,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:14:32,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 246 states and 595 transitions. [2020-12-01 17:14:32,337 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 595 transitions. [2020-12-01 17:14:32,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-01 17:14:32,338 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:14:32,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:14:32,489 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:14:33,501 WARN L197 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2020-12-01 17:14:35,770 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-12-01 17:14:36,315 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2020-12-01 17:14:36,972 WARN L197 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2020-12-01 17:14:40,358 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2020-12-01 17:14:41,060 WARN L197 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2020-12-01 17:14:44,257 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2020-12-01 17:14:45,005 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2020-12-01 17:14:47,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:14:47,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 251 states and 614 transitions. [2020-12-01 17:14:47,776 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 614 transitions. [2020-12-01 17:14:47,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-01 17:14:47,776 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:14:47,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:14:47,919 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:14:48,592 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-12-01 17:14:49,324 WARN L197 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 39 [2020-12-01 17:14:50,581 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2020-12-01 17:14:51,850 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2020-12-01 17:14:52,636 WARN L197 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 34 [2020-12-01 17:14:53,418 WARN L197 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2020-12-01 17:14:56,340 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2020-12-01 17:14:57,781 WARN L197 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2020-12-01 17:14:58,878 WARN L197 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2020-12-01 17:15:00,450 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-12-01 17:15:02,169 WARN L197 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2020-12-01 17:15:03,187 WARN L197 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2020-12-01 17:15:04,282 WARN L197 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2020-12-01 17:15:05,847 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-12-01 17:15:07,482 WARN L197 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-12-01 17:15:08,246 WARN L197 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 25 [2020-12-01 17:15:09,085 WARN L197 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2020-12-01 17:15:12,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:15:12,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 256 states and 632 transitions. [2020-12-01 17:15:12,074 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 632 transitions. [2020-12-01 17:15:12,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-01 17:15:12,075 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:15:12,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:15:12,195 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:15:12,970 WARN L197 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 34 [2020-12-01 17:15:13,719 WARN L197 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2020-12-01 17:15:16,538 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2020-12-01 17:15:17,391 WARN L197 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2020-12-01 17:15:18,159 WARN L197 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2020-12-01 17:15:21,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:15:21,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 258 states and 635 transitions. [2020-12-01 17:15:21,176 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 635 transitions. [2020-12-01 17:15:21,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-01 17:15:21,179 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:15:21,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:15:21,336 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:15:22,124 WARN L197 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 27 [2020-12-01 17:15:22,972 WARN L197 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 26 [2020-12-01 17:15:26,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:15:26,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 259 states and 635 transitions. [2020-12-01 17:15:26,163 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 635 transitions. [2020-12-01 17:15:26,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-01 17:15:26,165 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:15:26,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:15:26,271 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-12-01 17:15:28,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:15:28,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 259 states and 634 transitions. [2020-12-01 17:15:28,314 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 634 transitions. [2020-12-01 17:15:28,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-12-01 17:15:28,316 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:15:28,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 17:15:28,912 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 17:15:30,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 17:15:30,321 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 17:15:30,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 17:15:30,911 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 17:15:31,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 17:15:31,314 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 17:16:01,176 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 50 iterations. [2020-12-01 17:16:01,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 01.12 05:16:01 ImpRootNode [2020-12-01 17:16:01,465 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2020-12-01 17:16:01,466 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-01 17:16:01,466 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-01 17:16:01,466 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-01 17:16:01,467 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:08:54" (3/4) ... [2020-12-01 17:16:01,469 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-01 17:16:01,741 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_48c829a1-91b4-4547-83ba-e659a4d4c594/bin/ukojak/witness.graphml [2020-12-01 17:16:01,741 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-01 17:16:01,743 INFO L168 Benchmark]: Toolchain (without parser) took 432234.66 ms. Allocated memory was 107.0 MB in the beginning and 1.0 GB in the end (delta: 916.5 MB). Free memory was 76.9 MB in the beginning and 772.0 MB in the end (delta: -695.0 MB). Peak memory consumption was 219.8 MB. Max. memory is 16.1 GB. [2020-12-01 17:16:01,743 INFO L168 Benchmark]: CDTParser took 0.40 ms. Allocated memory is still 81.8 MB. Free memory was 39.9 MB in the beginning and 39.9 MB in the end (delta: 43.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-01 17:16:01,744 INFO L168 Benchmark]: CACSL2BoogieTranslator took 599.02 ms. Allocated memory is still 107.0 MB. Free memory was 76.9 MB in the beginning and 78.6 MB in the end (delta: -1.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-12-01 17:16:01,744 INFO L168 Benchmark]: Boogie Procedure Inliner took 99.40 ms. Allocated memory is still 107.0 MB. Free memory was 78.6 MB in the beginning and 75.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-01 17:16:01,745 INFO L168 Benchmark]: Boogie Preprocessor took 96.09 ms. Allocated memory is still 107.0 MB. Free memory was 75.8 MB in the beginning and 73.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-01 17:16:01,745 INFO L168 Benchmark]: RCFGBuilder took 4011.15 ms. Allocated memory was 107.0 MB in the beginning and 130.0 MB in the end (delta: 23.1 MB). Free memory was 73.7 MB in the beginning and 39.9 MB in the end (delta: 33.8 MB). Peak memory consumption was 66.4 MB. Max. memory is 16.1 GB. [2020-12-01 17:16:01,746 INFO L168 Benchmark]: CodeCheck took 427133.90 ms. Allocated memory was 130.0 MB in the beginning and 1.0 GB in the end (delta: 893.4 MB). Free memory was 39.9 MB in the beginning and 794.0 MB in the end (delta: -754.1 MB). Peak memory consumption was 138.3 MB. Max. memory is 16.1 GB. [2020-12-01 17:16:01,746 INFO L168 Benchmark]: Witness Printer took 275.80 ms. Allocated memory is still 1.0 GB. Free memory was 794.0 MB in the beginning and 772.0 MB in the end (delta: 22.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2020-12-01 17:16:01,749 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 426.7s, OverallIterations: 50, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 SDtfs, -939854000 SDslu, 128 SDs, 0 SdLazy, -30974944 SolverSat, 1772878624 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 213.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13530 GetRequests, 12013 SyntacticMatches, 613 SemanticMatches, 904 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472565 ImplicationChecksByTransitivity, 369.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.3s SsaConstructionTime, 6.1s SatisfiabilityAnalysisTime, 34.8s InterpolantComputationTime, 1345 NumberOfCodeBlocks, 1345 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 1251 ConstructedInterpolants, 0 QuantifiedInterpolants, 380619 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 49 InterpolantComputations, 11 PerfectInterpolantSequences, 184/790 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L28] msg_t nomsg = (msg_t )-1; [L29] port_t p12 ; [L30] char p12_old ; [L31] char p12_new ; [L32] _Bool ep12 ; [L33] port_t p13 ; [L34] char p13_old ; [L35] char p13_new ; [L36] _Bool ep13 ; [L37] port_t p21 ; [L38] char p21_old ; [L39] char p21_new ; [L40] _Bool ep21 ; [L41] port_t p23 ; [L42] char p23_old ; [L43] char p23_new ; [L44] _Bool ep23 ; [L45] port_t p31 ; [L46] char p31_old ; [L47] char p31_new ; [L48] _Bool ep31 ; [L49] port_t p32 ; [L50] char p32_old ; [L51] char p32_new ; [L52] _Bool ep32 ; [L53] char id1 ; [L54] unsigned char r1 ; [L55] char st1 ; [L56] char nl1 ; [L57] char m1 ; [L58] char max1 ; [L59] _Bool mode1 ; [L60] _Bool newmax1 ; [L61] char id2 ; [L62] unsigned char r2 ; [L63] char st2 ; [L64] char nl2 ; [L65] char m2 ; [L66] char max2 ; [L67] _Bool mode2 ; [L68] _Bool newmax2 ; [L69] char id3 ; [L70] unsigned char r3 ; [L71] char st3 ; [L72] char nl3 ; [L73] char m3 ; [L74] char max3 ; [L75] _Bool mode3 ; [L76] _Bool newmax3 ; [L504] int c1 ; [L505] int i2 ; [L508] c1 = 0 [L509] ep12 = __VERIFIER_nondet_bool() [L510] ep13 = __VERIFIER_nondet_bool() [L511] ep21 = __VERIFIER_nondet_bool() [L512] ep23 = __VERIFIER_nondet_bool() [L513] ep31 = __VERIFIER_nondet_bool() [L514] ep32 = __VERIFIER_nondet_bool() [L515] id1 = __VERIFIER_nondet_char() [L516] r1 = __VERIFIER_nondet_uchar() [L517] st1 = __VERIFIER_nondet_char() [L518] nl1 = __VERIFIER_nondet_char() [L519] m1 = __VERIFIER_nondet_char() [L520] max1 = __VERIFIER_nondet_char() [L521] mode1 = __VERIFIER_nondet_bool() [L522] newmax1 = __VERIFIER_nondet_bool() [L523] id2 = __VERIFIER_nondet_char() [L524] r2 = __VERIFIER_nondet_uchar() [L525] st2 = __VERIFIER_nondet_char() [L526] nl2 = __VERIFIER_nondet_char() [L527] m2 = __VERIFIER_nondet_char() [L528] max2 = __VERIFIER_nondet_char() [L529] mode2 = __VERIFIER_nondet_bool() [L530] newmax2 = __VERIFIER_nondet_bool() [L531] id3 = __VERIFIER_nondet_char() [L532] r3 = __VERIFIER_nondet_uchar() [L533] st3 = __VERIFIER_nondet_char() [L534] nl3 = __VERIFIER_nondet_char() [L535] m3 = __VERIFIER_nondet_char() [L536] max3 = __VERIFIER_nondet_char() [L537] mode3 = __VERIFIER_nondet_bool() [L538] newmax3 = __VERIFIER_nondet_bool() [L241] _Bool r121 ; [L242] _Bool r131 ; [L243] _Bool r211 ; [L244] _Bool r231 ; [L245] _Bool r311 ; [L246] _Bool r321 ; [L247] _Bool r122 ; [L248] int tmp ; [L249] _Bool r132 ; [L250] int tmp___0 ; [L251] _Bool r212 ; [L252] int tmp___1 ; [L253] _Bool r232 ; [L254] int tmp___2 ; [L255] _Bool r312 ; [L256] int tmp___3 ; [L257] _Bool r322 ; [L258] int tmp___4 ; [L259] int tmp___5 ; [L262] r121 = ep12 [L263] r131 = ep13 [L264] r211 = ep21 [L265] r231 = ep23 [L266] r311 = ep31 [L267] r321 = ep32 [L268] COND TRUE \read(r121) [L269] tmp = 1 [L280] r122 = (_Bool )tmp [L281] COND FALSE !(\read(r131)) [L284] COND TRUE \read(r121) [L285] COND FALSE !(\read(ep23)) [L288] tmp___0 = 0 [L293] r132 = (_Bool )tmp___0 [L294] COND FALSE !(\read(r211)) [L297] COND FALSE !(\read(r231)) [L304] tmp___1 = 0 [L306] r212 = (_Bool )tmp___1 [L307] COND FALSE !(\read(r231)) [L310] COND FALSE !(\read(r211)) [L317] tmp___2 = 0 [L319] r232 = (_Bool )tmp___2 [L320] COND FALSE !(\read(r311)) [L323] COND TRUE \read(r321) [L324] COND FALSE !(\read(ep21)) [L327] tmp___3 = 0 [L332] r312 = (_Bool )tmp___3 [L333] COND TRUE \read(r321) [L334] tmp___4 = 1 [L345] r322 = (_Bool )tmp___4 [L346] COND TRUE (int )id1 != (int )id2 [L347] COND TRUE (int )id1 != (int )id3 [L348] COND TRUE (int )id2 != (int )id3 [L349] COND TRUE (int )id1 >= 0 [L350] COND TRUE (int )id2 >= 0 [L351] COND TRUE (int )id3 >= 0 [L352] COND TRUE (int )r1 == 0 [L353] COND TRUE (int )r2 == 0 [L354] COND TRUE (int )r3 == 0 [L355] COND TRUE (int )max1 == (int )id1 [L356] COND TRUE (int )max2 == (int )id2 [L357] COND TRUE (int )max3 == (int )id3 [L358] COND TRUE (int )st1 == 0 [L359] COND TRUE (int )st2 == 0 [L360] COND TRUE (int )st3 == 0 [L361] COND TRUE (int )nl1 == 0 [L362] COND TRUE (int )nl2 == 0 [L363] COND TRUE (int )nl3 == 0 [L364] COND TRUE (int )mode1 == 0 [L365] COND TRUE (int )mode2 == 0 [L366] COND TRUE (int )mode3 == 0 [L367] COND TRUE \read(newmax1) [L368] COND TRUE \read(newmax2) [L369] COND TRUE \read(newmax3) [L370] tmp___5 = 1 [L443] return (tmp___5); [L539] i2 = init() [L22] COND FALSE !(!cond) [L541] p12_old = nomsg [L542] p12_new = nomsg [L543] p13_old = nomsg [L544] p13_new = nomsg [L545] p21_old = nomsg [L546] p21_new = nomsg [L547] p23_old = nomsg [L548] p23_new = nomsg [L549] p31_old = nomsg [L550] p31_new = nomsg [L551] p32_old = nomsg [L552] p32_new = nomsg [L553] i2 = 0 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=0, id2=1, id3=2, m1=1, m2=3, m3=3, max1=0, max2=1, max3=2, mode1=0, mode2=0, mode3=0, newmax1=255, newmax2=255, newmax3=255, 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] [L554] COND TRUE 1 [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND FALSE !(\read(mode1)) [L114] COND TRUE (int )r1 < 2 [L115] COND TRUE \read(ep12) [L116] COND TRUE \read(newmax1) [L117] EXPR max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L117] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L120] COND FALSE !(\read(ep13)) [L126] mode1 = (_Bool)1 [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND FALSE !(\read(mode2)) [L168] COND TRUE (int )r2 < 2 [L169] COND FALSE !(\read(ep21)) [L174] COND FALSE !(\read(ep23)) [L180] mode2 = (_Bool)1 [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND FALSE !(\read(mode3)) [L222] COND TRUE (int )r3 < 2 [L223] COND FALSE !(\read(ep31)) [L228] COND TRUE \read(ep32) [L229] COND TRUE \read(newmax3) [L230] EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L230] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L234] mode3 = (_Bool)1 [L559] p12_old = p12_new [L560] p12_new = nomsg [L561] p13_old = p13_new [L562] p13_new = nomsg [L563] p21_old = p21_new [L564] p21_new = nomsg [L565] p23_old = p23_new [L566] p23_new = nomsg [L567] p31_old = p31_new [L568] p31_new = nomsg [L569] p32_old = p32_new [L570] p32_new = nomsg [L448] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=0, id2=1, id3=2, m1=1, m2=3, m3=3, max1=0, max2=1, max3=2, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L451] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=0, id2=1, id3=2, m1=1, m2=3, m3=3, max1=0, max2=1, max3=2, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L452] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=0, id2=1, id3=2, m1=1, m2=3, m3=3, max1=0, max2=1, max3=2, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L453] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=0, id2=1, id3=2, m1=1, m2=3, m3=3, max1=0, max2=1, max3=2, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L454] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=0, id2=1, id3=2, m1=1, m2=3, m3=3, max1=0, max2=1, max3=2, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L455] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=0, id2=1, id3=2, m1=1, m2=3, m3=3, max1=0, max2=1, max3=2, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L458] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=0, id2=1, id3=2, m1=1, m2=3, m3=3, max1=0, max2=1, max3=2, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L460] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=0, id2=1, id3=2, m1=1, m2=3, m3=3, max1=0, max2=1, max3=2, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L465] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=0, id2=1, id3=2, m1=1, m2=3, m3=3, max1=0, max2=1, max3=2, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L468] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=0, id2=1, id3=2, m1=1, m2=3, m3=3, max1=0, max2=1, max3=2, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L470] COND TRUE (int )r1 < 2 [L471] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=0, id2=1, id3=2, m1=1, m2=3, m3=3, max1=0, max2=1, max3=2, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L499] return (tmp); [L571] c1 = check() [L583] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=0, id2=1, id3=2, m1=1, m2=3, m3=3, max1=0, max2=1, max3=2, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L554] COND TRUE 1 [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND TRUE \read(mode1) [L84] COND FALSE !(r1 == 255) [L87] r1 = r1 + 1 [L88] COND FALSE !(\read(ep21)) [L96] COND FALSE !(\read(ep31)) [L104] newmax1 = newmax [L105] COND FALSE !((int )r1 == 2) [L112] mode1 = (_Bool)0 [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND TRUE \read(mode2) [L138] COND FALSE !(r2 == 255) [L141] r2 = r2 + 1 [L142] COND TRUE \read(ep12) [L143] m2 = p12_old [L144] p12_old = nomsg [L145] COND FALSE !((int )m2 > (int )max2) [L150] COND TRUE \read(ep32) [L151] m2 = p32_old [L152] p32_old = nomsg [L153] COND TRUE (int )m2 > (int )max2 [L154] max2 = m2 [L155] newmax = (_Bool)1 [L158] newmax2 = newmax [L159] COND FALSE !((int )r2 == 2) [L166] mode2 = (_Bool)0 [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND TRUE \read(mode3) [L192] COND FALSE !(r3 == 255) [L195] r3 = r3 + 1 [L196] COND FALSE !(\read(ep13)) [L204] COND FALSE !(\read(ep23)) [L212] newmax3 = newmax [L213] COND FALSE !((int )r3 == 2) [L220] mode3 = (_Bool)0 [L559] p12_old = p12_new [L560] p12_new = nomsg [L561] p13_old = p13_new [L562] p13_new = nomsg [L563] p21_old = p21_new [L564] p21_new = nomsg [L565] p23_old = p23_new [L566] p23_new = nomsg [L567] p31_old = p31_new [L568] p31_new = nomsg [L569] p32_old = p32_new [L570] p32_new = nomsg [L448] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=0, id2=1, id3=2, m1=1, m2=2, m3=3, max1=0, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, 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] [L451] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=0, id2=1, id3=2, m1=1, m2=2, m3=3, max1=0, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, 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] [L452] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=0, id2=1, id3=2, m1=1, m2=2, m3=3, max1=0, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, 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] [L453] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=0, id2=1, id3=2, m1=1, m2=2, m3=3, max1=0, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, 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] [L454] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=0, id2=1, id3=2, m1=1, m2=2, m3=3, max1=0, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, 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] [L455] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=0, id2=1, id3=2, m1=1, m2=2, m3=3, max1=0, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, 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] [L458] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=0, id2=1, id3=2, m1=1, m2=2, m3=3, max1=0, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, 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] [L460] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=0, id2=1, id3=2, m1=1, m2=2, m3=3, max1=0, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, 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] [L465] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=0, id2=1, id3=2, m1=1, m2=2, m3=3, max1=0, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, 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] [L468] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=0, id2=1, id3=2, m1=1, m2=2, m3=3, max1=0, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, 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] [L470] COND TRUE (int )r1 < 2 [L471] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=0, id2=1, id3=2, m1=1, m2=2, m3=3, max1=0, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, 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] [L499] return (tmp); [L571] c1 = check() [L583] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=0, id2=1, id3=2, m1=1, m2=2, m3=3, max1=0, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, 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] [L554] COND TRUE 1 [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND FALSE !(\read(mode1)) [L114] COND TRUE (int )r1 < 2 [L115] COND TRUE \read(ep12) [L116] COND FALSE !(\read(newmax1)) [L120] COND FALSE !(\read(ep13)) [L126] mode1 = (_Bool)1 [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND FALSE !(\read(mode2)) [L168] COND TRUE (int )r2 < 2 [L169] COND FALSE !(\read(ep21)) [L174] COND FALSE !(\read(ep23)) [L180] mode2 = (_Bool)1 [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND FALSE !(\read(mode3)) [L222] COND TRUE (int )r3 < 2 [L223] COND FALSE !(\read(ep31)) [L228] COND TRUE \read(ep32) [L229] COND FALSE !(\read(newmax3)) [L234] mode3 = (_Bool)1 [L559] p12_old = p12_new [L560] p12_new = nomsg [L561] p13_old = p13_new [L562] p13_new = nomsg [L563] p21_old = p21_new [L564] p21_new = nomsg [L565] p23_old = p23_new [L566] p23_new = nomsg [L567] p31_old = p31_new [L568] p31_new = nomsg [L569] p32_old = p32_new [L570] p32_new = nomsg [L448] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=0, id2=1, id3=2, m1=1, m2=2, m3=3, max1=0, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, 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] [L451] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=0, id2=1, id3=2, m1=1, m2=2, m3=3, max1=0, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, 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] [L452] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=0, id2=1, id3=2, m1=1, m2=2, m3=3, max1=0, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, 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] [L453] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=0, id2=1, id3=2, m1=1, m2=2, m3=3, max1=0, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, 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] [L454] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=0, id2=1, id3=2, m1=1, m2=2, m3=3, max1=0, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, 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] [L455] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=0, id2=1, id3=2, m1=1, m2=2, m3=3, max1=0, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, 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] [L458] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=0, id2=1, id3=2, m1=1, m2=2, m3=3, max1=0, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, 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] [L460] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=0, id2=1, id3=2, m1=1, m2=2, m3=3, max1=0, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, 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] [L465] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=0, id2=1, id3=2, m1=1, m2=2, m3=3, max1=0, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, 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] [L468] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=0, id2=1, id3=2, m1=1, m2=2, m3=3, max1=0, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, 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] [L470] COND TRUE (int )r1 < 2 [L471] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=0, id2=1, id3=2, m1=1, m2=2, m3=3, max1=0, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, 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] [L499] return (tmp); [L571] c1 = check() [L583] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=0, id2=1, id3=2, m1=1, m2=2, m3=3, max1=0, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, 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] [L554] COND TRUE 1 [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND TRUE \read(mode1) [L84] COND FALSE !(r1 == 255) [L87] r1 = r1 + 1 [L88] COND FALSE !(\read(ep21)) [L96] COND FALSE !(\read(ep31)) [L104] newmax1 = newmax [L105] COND TRUE (int )r1 == 2 [L106] COND TRUE (int )max1 == (int )id1 [L107] st1 = (char)1 [L112] mode1 = (_Bool)0 [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND TRUE \read(mode2) [L138] COND FALSE !(r2 == 255) [L141] r2 = r2 + 1 [L142] COND TRUE \read(ep12) [L143] m2 = p12_old [L144] p12_old = nomsg [L145] COND FALSE !((int )m2 > (int )max2) [L150] COND TRUE \read(ep32) [L151] m2 = p32_old [L152] p32_old = nomsg [L153] COND FALSE !((int )m2 > (int )max2) [L158] newmax2 = newmax [L159] COND TRUE (int )r2 == 2 [L160] COND FALSE !((int )max2 == (int )id2) [L163] nl2 = (char)1 [L166] mode2 = (_Bool)0 [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND TRUE \read(mode3) [L192] COND FALSE !(r3 == 255) [L195] r3 = r3 + 1 [L196] COND FALSE !(\read(ep13)) [L204] COND FALSE !(\read(ep23)) [L212] newmax3 = newmax [L213] COND TRUE (int )r3 == 2 [L214] COND TRUE (int )max3 == (int )id3 [L215] st3 = (char)1 [L220] mode3 = (_Bool)0 [L559] p12_old = p12_new [L560] p12_new = nomsg [L561] p13_old = p13_new [L562] p13_new = nomsg [L563] p21_old = p21_new [L564] p21_new = nomsg [L565] p23_old = p23_new [L566] p23_new = nomsg [L567] p31_old = p31_new [L568] p31_new = nomsg [L569] p32_old = p32_new [L570] p32_new = nomsg [L448] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=0, id2=1, id3=2, m1=1, m2=-1, m3=3, max1=0, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L451] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L497] tmp = 0 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=0, id2=1, id3=2, m1=1, m2=-1, m3=3, max1=0, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L499] return (tmp); [L571] c1 = check() [L583] COND TRUE ! arg VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=0, id2=1, id3=2, m1=1, m2=-1, m3=3, max1=0, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L3] __assert_fail("0", "pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c", 3, "reach_error") VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=0, id2=1, id3=2, m1=1, m2=-1, m3=3, max1=0, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.40 ms. Allocated memory is still 81.8 MB. Free memory was 39.9 MB in the beginning and 39.9 MB in the end (delta: 43.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 599.02 ms. Allocated memory is still 107.0 MB. Free memory was 76.9 MB in the beginning and 78.6 MB in the end (delta: -1.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 99.40 ms. Allocated memory is still 107.0 MB. Free memory was 78.6 MB in the beginning and 75.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 96.09 ms. Allocated memory is still 107.0 MB. Free memory was 75.8 MB in the beginning and 73.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 4011.15 ms. Allocated memory was 107.0 MB in the beginning and 130.0 MB in the end (delta: 23.1 MB). Free memory was 73.7 MB in the beginning and 39.9 MB in the end (delta: 33.8 MB). Peak memory consumption was 66.4 MB. Max. memory is 16.1 GB. * CodeCheck took 427133.90 ms. Allocated memory was 130.0 MB in the beginning and 1.0 GB in the end (delta: 893.4 MB). Free memory was 39.9 MB in the beginning and 794.0 MB in the end (delta: -754.1 MB). Peak memory consumption was 138.3 MB. Max. memory is 16.1 GB. * Witness Printer took 275.80 ms. Allocated memory is still 1.0 GB. Free memory was 794.0 MB in the beginning and 772.0 MB in the end (delta: 22.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...