./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aef121e0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f176942-6e78-42ef-a146-2145c95b0989/bin/ukojak-LBtLqBUTdQ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f176942-6e78-42ef-a146-2145c95b0989/bin/ukojak-LBtLqBUTdQ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f176942-6e78-42ef-a146-2145c95b0989/bin/ukojak-LBtLqBUTdQ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f176942-6e78-42ef-a146-2145c95b0989/bin/ukojak-LBtLqBUTdQ/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f176942-6e78-42ef-a146-2145c95b0989/bin/ukojak-LBtLqBUTdQ/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f176942-6e78-42ef-a146-2145c95b0989/bin/ukojak-LBtLqBUTdQ --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 588484d75150429774731f7aacf4daf77752c68fdc38fffa31465a5f910e2823 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-23 00:37:15,651 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 00:37:15,654 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 00:37:15,701 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 00:37:15,701 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 00:37:15,703 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 00:37:15,704 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 00:37:15,707 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 00:37:15,709 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 00:37:15,710 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 00:37:15,712 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 00:37:15,713 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 00:37:15,714 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 00:37:15,715 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 00:37:15,717 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 00:37:15,718 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 00:37:15,720 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 00:37:15,721 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 00:37:15,723 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 00:37:15,726 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 00:37:15,728 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 00:37:15,730 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 00:37:15,732 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 00:37:15,733 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 00:37:15,737 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 00:37:15,737 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 00:37:15,738 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 00:37:15,739 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 00:37:15,739 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 00:37:15,741 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 00:37:15,741 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 00:37:15,742 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 00:37:15,743 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 00:37:15,744 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 00:37:15,745 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 00:37:15,745 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 00:37:15,746 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 00:37:15,747 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 00:37:15,747 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 00:37:15,748 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 00:37:15,749 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 00:37:15,750 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f176942-6e78-42ef-a146-2145c95b0989/bin/ukojak-LBtLqBUTdQ/config/svcomp-Reach-32bit-Kojak_Default.epf [2021-11-23 00:37:15,773 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 00:37:15,773 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 00:37:15,774 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-23 00:37:15,774 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2021-11-23 00:37:15,775 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-23 00:37:15,775 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-23 00:37:15,776 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 00:37:15,776 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 00:37:15,776 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 00:37:15,777 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 00:37:15,777 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 00:37:15,777 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-23 00:37:15,778 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 00:37:15,778 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-23 00:37:15,778 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 00:37:15,778 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-23 00:37:15,779 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 00:37:15,779 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-23 00:37:15,779 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2021-11-23 00:37:15,779 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2021-11-23 00:37:15,780 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 00:37:15,780 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-11-23 00:37:15,780 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 00:37:15,781 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 00:37:15,781 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-23 00:37:15,781 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2021-11-23 00:37:15,782 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 00:37:15,782 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-23 00:37:15,782 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_worker_vcloud-master_on_vcloud-master/run_dir_2f176942-6e78-42ef-a146-2145c95b0989/bin/ukojak-LBtLqBUTdQ/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_worker_vcloud-master_on_vcloud-master/run_dir_2f176942-6e78-42ef-a146-2145c95b0989/bin/ukojak-LBtLqBUTdQ 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 -> 588484d75150429774731f7aacf4daf77752c68fdc38fffa31465a5f910e2823 [2021-11-23 00:37:16,068 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 00:37:16,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 00:37:16,099 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 00:37:16,100 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 00:37:16,102 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 00:37:16,104 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f176942-6e78-42ef-a146-2145c95b0989/bin/ukojak-LBtLqBUTdQ/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c [2021-11-23 00:37:16,193 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f176942-6e78-42ef-a146-2145c95b0989/bin/ukojak-LBtLqBUTdQ/data/d930017fa/e147068ba19645c2b2a240b5d773272d/FLAG740f4ced1 [2021-11-23 00:37:16,686 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 00:37:16,687 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f176942-6e78-42ef-a146-2145c95b0989/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c [2021-11-23 00:37:16,697 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f176942-6e78-42ef-a146-2145c95b0989/bin/ukojak-LBtLqBUTdQ/data/d930017fa/e147068ba19645c2b2a240b5d773272d/FLAG740f4ced1 [2021-11-23 00:37:17,149 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f176942-6e78-42ef-a146-2145c95b0989/bin/ukojak-LBtLqBUTdQ/data/d930017fa/e147068ba19645c2b2a240b5d773272d [2021-11-23 00:37:17,152 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 00:37:17,154 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 00:37:17,158 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 00:37:17,158 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 00:37:17,162 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 00:37:17,163 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:37:17" (1/1) ... [2021-11-23 00:37:17,164 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32f3e88e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:37:17, skipping insertion in model container [2021-11-23 00:37:17,165 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:37:17" (1/1) ... [2021-11-23 00:37:17,173 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 00:37:17,211 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 00:37:17,453 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f176942-6e78-42ef-a146-2145c95b0989/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c[14511,14524] [2021-11-23 00:37:17,455 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 00:37:17,471 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 00:37:17,588 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f176942-6e78-42ef-a146-2145c95b0989/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c[14511,14524] [2021-11-23 00:37:17,597 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 00:37:17,616 INFO L208 MainTranslator]: Completed translation [2021-11-23 00:37:17,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:37:17 WrapperNode [2021-11-23 00:37:17,618 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 00:37:17,619 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 00:37:17,620 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 00:37:17,621 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 00:37:17,628 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:37:17" (1/1) ... [2021-11-23 00:37:17,656 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:37:17" (1/1) ... [2021-11-23 00:37:17,711 INFO L137 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 479 [2021-11-23 00:37:17,712 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 00:37:17,712 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 00:37:17,713 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 00:37:17,713 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 00:37:17,721 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:37:17" (1/1) ... [2021-11-23 00:37:17,721 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:37:17" (1/1) ... [2021-11-23 00:37:17,730 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:37:17" (1/1) ... [2021-11-23 00:37:17,730 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:37:17" (1/1) ... [2021-11-23 00:37:17,747 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:37:17" (1/1) ... [2021-11-23 00:37:17,764 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:37:17" (1/1) ... [2021-11-23 00:37:17,780 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:37:17" (1/1) ... [2021-11-23 00:37:17,784 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 00:37:17,785 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 00:37:17,785 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 00:37:17,786 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 00:37:17,787 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:37:17" (1/1) ... [2021-11-23 00:37:17,799 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-11-23 00:37:17,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f176942-6e78-42ef-a146-2145c95b0989/bin/ukojak-LBtLqBUTdQ/z3 [2021-11-23 00:37:17,821 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f176942-6e78-42ef-a146-2145c95b0989/bin/ukojak-LBtLqBUTdQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2021-11-23 00:37:17,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f176942-6e78-42ef-a146-2145c95b0989/bin/ukojak-LBtLqBUTdQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2021-11-23 00:37:17,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 00:37:17,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-23 00:37:17,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 00:37:17,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 00:37:17,953 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 00:37:17,954 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 00:37:18,620 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 00:37:19,344 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 00:37:19,344 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-23 00:37:19,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:37:19 BoogieIcfgContainer [2021-11-23 00:37:19,347 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 00:37:19,348 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2021-11-23 00:37:19,348 INFO L271 PluginConnector]: Initializing CodeCheck... [2021-11-23 00:37:19,358 INFO L275 PluginConnector]: CodeCheck initialized [2021-11-23 00:37:19,358 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:37:19" (1/1) ... [2021-11-23 00:37:19,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 00:37:19,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:37:19,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2021-11-23 00:37:19,450 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2021-11-23 00:37:19,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-23 00:37:19,452 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:37:19,453 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:37:19,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:37:19,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:37:20,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:37:20,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 20 states and 32 transitions. [2021-11-23 00:37:20,093 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 32 transitions. [2021-11-23 00:37:20,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-23 00:37:20,093 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:37:20,094 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:37:20,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:37:20,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:37:20,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:37:20,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 23 states and 38 transitions. [2021-11-23 00:37:20,635 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2021-11-23 00:37:20,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-23 00:37:20,635 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:37:20,635 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:37:20,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:37:20,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:37:21,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:37:21,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 27 states and 46 transitions. [2021-11-23 00:37:21,254 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 46 transitions. [2021-11-23 00:37:21,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-23 00:37:21,257 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:37:21,257 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:37:21,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:37:21,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:37:22,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:37:22,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 32 states and 56 transitions. [2021-11-23 00:37:22,021 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 56 transitions. [2021-11-23 00:37:22,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-23 00:37:22,021 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:37:22,022 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:37:22,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:37:22,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:37:23,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:37:23,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 39 states and 68 transitions. [2021-11-23 00:37:23,079 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 68 transitions. [2021-11-23 00:37:23,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-23 00:37:23,080 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:37:23,080 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:37:23,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:37:23,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:37:24,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:37:24,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 45 states and 79 transitions. [2021-11-23 00:37:24,256 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 79 transitions. [2021-11-23 00:37:24,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-23 00:37:24,257 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:37:24,258 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:37:24,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:37:24,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:37:24,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:37:24,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 46 states and 79 transitions. [2021-11-23 00:37:24,553 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 79 transitions. [2021-11-23 00:37:24,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-23 00:37:24,554 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:37:24,554 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:37:24,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:37:24,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:37:24,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:37:24,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 47 states and 80 transitions. [2021-11-23 00:37:24,626 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 80 transitions. [2021-11-23 00:37:24,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-23 00:37:24,627 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:37:24,627 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:37:24,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:37:24,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:37:26,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:37:26,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 57 states and 97 transitions. [2021-11-23 00:37:26,519 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 97 transitions. [2021-11-23 00:37:26,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-23 00:37:26,519 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:37:26,520 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:37:26,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:37:26,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:37:27,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:37:27,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 60 states and 103 transitions. [2021-11-23 00:37:27,021 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 103 transitions. [2021-11-23 00:37:27,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-23 00:37:27,022 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:37:27,022 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:37:27,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:37:27,893 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:37:32,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:37:32,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 76 states and 133 transitions. [2021-11-23 00:37:32,698 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 133 transitions. [2021-11-23 00:37:32,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-23 00:37:32,699 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:37:32,699 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:37:32,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:37:32,898 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:37:37,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:37:37,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 90 states and 156 transitions. [2021-11-23 00:37:37,187 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 156 transitions. [2021-11-23 00:37:37,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-23 00:37:37,188 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:37:37,189 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:37:37,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:37:37,304 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:37:37,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:37:37,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 91 states and 159 transitions. [2021-11-23 00:37:37,676 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 159 transitions. [2021-11-23 00:37:37,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-23 00:37:37,678 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:37:37,678 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:37:37,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:37:38,017 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:37:43,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:37:43,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 109 states and 192 transitions. [2021-11-23 00:37:43,463 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 192 transitions. [2021-11-23 00:37:43,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-23 00:37:43,464 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:37:43,465 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:37:43,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:37:43,556 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:37:43,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:37:43,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 110 states and 196 transitions. [2021-11-23 00:37:43,921 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 196 transitions. [2021-11-23 00:37:43,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-23 00:37:43,925 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:37:43,925 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:37:43,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:37:44,063 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:37:44,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:37:44,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 111 states and 197 transitions. [2021-11-23 00:37:44,427 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 197 transitions. [2021-11-23 00:37:44,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-23 00:37:44,429 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:37:44,429 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:37:44,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:37:44,859 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:37:49,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:37:49,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 125 states and 224 transitions. [2021-11-23 00:37:49,920 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 224 transitions. [2021-11-23 00:37:49,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-23 00:37:49,921 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:37:49,921 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:37:49,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:37:50,021 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:37:50,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:37:50,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 127 states and 231 transitions. [2021-11-23 00:37:50,649 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 231 transitions. [2021-11-23 00:37:50,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-23 00:37:50,650 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:37:50,650 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:37:50,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:37:50,747 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:37:51,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:37:51,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 128 states and 232 transitions. [2021-11-23 00:37:51,101 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 232 transitions. [2021-11-23 00:37:51,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-23 00:37:51,102 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:37:51,102 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:37:51,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:37:51,255 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:37:51,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:37:51,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 129 states and 233 transitions. [2021-11-23 00:37:51,688 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 233 transitions. [2021-11-23 00:37:51,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-23 00:37:51,689 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:37:51,690 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:37:51,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:37:52,759 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:37:58,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:37:58,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 137 states and 252 transitions. [2021-11-23 00:37:58,336 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 252 transitions. [2021-11-23 00:37:58,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-23 00:37:58,336 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:37:58,337 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:37:58,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:37:58,736 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:37:59,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:37:59,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 139 states and 257 transitions. [2021-11-23 00:37:59,877 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 257 transitions. [2021-11-23 00:37:59,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-23 00:37:59,878 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:37:59,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:38:00,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:38:00,242 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:38:01,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:38:01,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 141 states and 260 transitions. [2021-11-23 00:38:01,342 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 260 transitions. [2021-11-23 00:38:01,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-23 00:38:01,342 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:38:01,342 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:38:01,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:38:01,716 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:38:02,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:38:02,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 142 states and 261 transitions. [2021-11-23 00:38:02,368 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 261 transitions. [2021-11-23 00:38:02,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-23 00:38:02,369 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:38:02,369 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:38:02,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:38:02,724 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:38:03,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:38:03,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 143 states and 262 transitions. [2021-11-23 00:38:03,354 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 262 transitions. [2021-11-23 00:38:03,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-23 00:38:03,355 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:38:03,355 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:38:03,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:38:03,716 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:38:04,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:38:04,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 144 states and 263 transitions. [2021-11-23 00:38:04,338 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 263 transitions. [2021-11-23 00:38:04,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-23 00:38:04,339 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:38:04,339 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:38:04,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:38:04,860 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:38:09,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:38:09,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 158 states and 284 transitions. [2021-11-23 00:38:09,848 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 284 transitions. [2021-11-23 00:38:09,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-23 00:38:09,849 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:38:09,849 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:38:09,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:38:10,999 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:38:15,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:38:15,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 166 states and 299 transitions. [2021-11-23 00:38:15,946 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 299 transitions. [2021-11-23 00:38:15,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-23 00:38:15,947 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:38:15,947 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:38:16,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:38:16,959 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:38:24,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:38:24,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 180 states and 346 transitions. [2021-11-23 00:38:24,358 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 346 transitions. [2021-11-23 00:38:24,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-23 00:38:24,359 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:38:24,359 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:38:24,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:38:25,078 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:38:28,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:38:28,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 184 states and 353 transitions. [2021-11-23 00:38:28,148 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 353 transitions. [2021-11-23 00:38:28,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-23 00:38:28,149 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:38:28,149 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:38:28,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:38:28,279 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:38:29,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:38:29,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 185 states and 357 transitions. [2021-11-23 00:38:29,179 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 357 transitions. [2021-11-23 00:38:29,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-23 00:38:29,180 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:38:29,180 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:38:29,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:38:30,040 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:38:36,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:38:36,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 196 states and 378 transitions. [2021-11-23 00:38:36,051 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 378 transitions. [2021-11-23 00:38:36,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-23 00:38:36,052 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:38:36,052 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:38:36,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:38:36,159 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:38:36,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:38:36,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 197 states and 378 transitions. [2021-11-23 00:38:36,863 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 378 transitions. [2021-11-23 00:38:36,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-23 00:38:36,864 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:38:36,864 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:38:36,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:38:37,819 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:38:44,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:38:44,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 212 states and 411 transitions. [2021-11-23 00:38:44,950 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 411 transitions. [2021-11-23 00:38:44,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-23 00:38:44,951 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:38:44,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:38:45,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:38:45,058 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:38:46,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:38:46,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 214 states and 418 transitions. [2021-11-23 00:38:46,414 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 418 transitions. [2021-11-23 00:38:46,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-23 00:38:46,414 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:38:46,415 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:38:46,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:38:47,524 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:38:52,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:38:52,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 219 states and 433 transitions. [2021-11-23 00:38:52,842 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 433 transitions. [2021-11-23 00:38:52,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-23 00:38:52,843 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:38:52,844 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:38:52,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:38:52,996 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:38:54,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:38:54,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 221 states and 441 transitions. [2021-11-23 00:38:54,632 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 441 transitions. [2021-11-23 00:38:54,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-23 00:38:54,632 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:38:54,708 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:38:55,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:38:55,492 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:38:59,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:38:59,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 230 states and 457 transitions. [2021-11-23 00:38:59,804 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 457 transitions. [2021-11-23 00:38:59,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-23 00:38:59,804 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:38:59,805 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:00,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:00,259 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:39:03,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:03,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 235 states and 470 transitions. [2021-11-23 00:39:03,844 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 470 transitions. [2021-11-23 00:39:03,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-23 00:39:03,844 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:03,845 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:04,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:04,280 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:39:07,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:07,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 239 states and 482 transitions. [2021-11-23 00:39:07,007 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 482 transitions. [2021-11-23 00:39:07,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-23 00:39:07,008 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:07,008 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:07,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:08,155 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:39:16,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:16,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 249 states and 501 transitions. [2021-11-23 00:39:16,239 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 501 transitions. [2021-11-23 00:39:16,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-23 00:39:16,239 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:16,240 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:16,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:16,389 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:39:20,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:20,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 254 states and 516 transitions. [2021-11-23 00:39:20,032 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 516 transitions. [2021-11-23 00:39:20,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-23 00:39:20,033 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:20,033 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:20,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:20,187 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:39:23,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:23,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 259 states and 529 transitions. [2021-11-23 00:39:23,673 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 529 transitions. [2021-11-23 00:39:23,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-23 00:39:23,674 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:23,674 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:23,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:23,829 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:39:24,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:24,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 260 states and 530 transitions. [2021-11-23 00:39:24,978 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 530 transitions. [2021-11-23 00:39:24,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-23 00:39:24,979 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:24,979 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:25,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:25,061 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-23 00:39:25,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:25,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 260 states and 529 transitions. [2021-11-23 00:39:25,405 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 529 transitions. [2021-11-23 00:39:25,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-23 00:39:25,406 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:25,406 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:26,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 00:39:26,385 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 00:39:27,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 00:39:28,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 00:39:28,722 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 00:39:28,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 00:39:29,139 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 46 iterations. [2021-11-23 00:39:29,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 12:39:29 ImpRootNode [2021-11-23 00:39:29,430 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2021-11-23 00:39:29,431 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-23 00:39:29,431 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-23 00:39:29,432 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-23 00:39:29,432 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:37:19" (3/4) ... [2021-11-23 00:39:29,434 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-23 00:39:29,622 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f176942-6e78-42ef-a146-2145c95b0989/bin/ukojak-LBtLqBUTdQ/witness.graphml [2021-11-23 00:39:29,622 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-23 00:39:29,623 INFO L158 Benchmark]: Toolchain (without parser) took 132468.99ms. Allocated memory was 104.9MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 62.3MB in the beginning and 660.1MB in the end (delta: -597.8MB). Peak memory consumption was 429.5MB. Max. memory is 16.1GB. [2021-11-23 00:39:29,623 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 104.9MB. Free memory is still 79.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 00:39:29,623 INFO L158 Benchmark]: CACSL2BoogieTranslator took 460.12ms. Allocated memory is still 104.9MB. Free memory was 62.0MB in the beginning and 72.7MB in the end (delta: -10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-23 00:39:29,624 INFO L158 Benchmark]: Boogie Procedure Inliner took 93.03ms. Allocated memory is still 104.9MB. Free memory was 72.7MB in the beginning and 69.6MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-23 00:39:29,624 INFO L158 Benchmark]: Boogie Preprocessor took 71.96ms. Allocated memory is still 104.9MB. Free memory was 69.6MB in the beginning and 67.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-23 00:39:29,624 INFO L158 Benchmark]: RCFGBuilder took 1562.26ms. Allocated memory was 104.9MB in the beginning and 134.2MB in the end (delta: 29.4MB). Free memory was 67.2MB in the beginning and 72.8MB in the end (delta: -5.6MB). Peak memory consumption was 50.6MB. Max. memory is 16.1GB. [2021-11-23 00:39:29,625 INFO L158 Benchmark]: CodeCheck took 130082.61ms. Allocated memory was 134.2MB in the beginning and 1.1GB in the end (delta: 998.2MB). Free memory was 72.8MB in the beginning and 682.1MB in the end (delta: -609.3MB). Peak memory consumption was 391.8MB. Max. memory is 16.1GB. [2021-11-23 00:39:29,625 INFO L158 Benchmark]: Witness Printer took 190.74ms. Allocated memory is still 1.1GB. Free memory was 682.1MB in the beginning and 660.1MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2021-11-23 00:39:29,627 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, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 129.7s, OverallIterations: 46, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14169 SdHoareTripleChecker+Valid, 112.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12661 mSDsluCounter, 4197 SdHoareTripleChecker+Invalid, 99.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3470 mSDsCounter, 4626 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36517 IncrementalHoareTripleChecker+Invalid, 41143 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4626 mSolverCounterUnsat, 727 mSDtfsCounter, 36517 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11656 GetRequests, 10111 SyntacticMatches, 685 SemanticMatches, 860 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428468 ImplicationChecksByTransitivity, 110.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 5.2s SatisfiabilityAnalysisTime, 13.0s InterpolantComputationTime, 1240 NumberOfCodeBlocks, 1240 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 1147 ConstructedInterpolants, 0 QuantifiedInterpolants, 16347 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 45 InterpolantComputations, 11 PerfectInterpolantSequences, 159/665 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: 609]: a call to reach_error is reachable a call to reach_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 ; [L528] int c1 ; [L529] int i2 ; [L532] c1 = 0 [L533] ep12 = __VERIFIER_nondet_bool() [L534] ep13 = __VERIFIER_nondet_bool() [L535] ep21 = __VERIFIER_nondet_bool() [L536] ep23 = __VERIFIER_nondet_bool() [L537] ep31 = __VERIFIER_nondet_bool() [L538] ep32 = __VERIFIER_nondet_bool() [L539] id1 = __VERIFIER_nondet_char() [L540] r1 = __VERIFIER_nondet_uchar() [L541] st1 = __VERIFIER_nondet_char() [L542] nl1 = __VERIFIER_nondet_char() [L543] m1 = __VERIFIER_nondet_char() [L544] max1 = __VERIFIER_nondet_char() [L545] mode1 = __VERIFIER_nondet_bool() [L546] newmax1 = __VERIFIER_nondet_bool() [L547] id2 = __VERIFIER_nondet_char() [L548] r2 = __VERIFIER_nondet_uchar() [L549] st2 = __VERIFIER_nondet_char() [L550] nl2 = __VERIFIER_nondet_char() [L551] m2 = __VERIFIER_nondet_char() [L552] max2 = __VERIFIER_nondet_char() [L553] mode2 = __VERIFIER_nondet_bool() [L554] newmax2 = __VERIFIER_nondet_bool() [L555] id3 = __VERIFIER_nondet_char() [L556] r3 = __VERIFIER_nondet_uchar() [L557] st3 = __VERIFIER_nondet_char() [L558] nl3 = __VERIFIER_nondet_char() [L559] m3 = __VERIFIER_nondet_char() [L560] max3 = __VERIFIER_nondet_char() [L561] mode3 = __VERIFIER_nondet_bool() [L562] newmax3 = __VERIFIER_nondet_bool() [L563] CALL, EXPR init() [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 FALSE !(\read(r121)) [L271] COND TRUE \read(r131) [L272] COND TRUE \read(ep32) [L273] tmp = 1 [L280] r122 = (_Bool )tmp [L281] COND TRUE \read(r131) [L282] tmp___0 = 1 [L293] r132 = (_Bool )tmp___0 [L294] COND TRUE \read(r211) [L295] tmp___1 = 1 [L306] r212 = (_Bool )tmp___1 [L307] COND FALSE !(\read(r231)) [L310] COND TRUE \read(r211) [L311] COND TRUE \read(ep13) [L312] tmp___2 = 1 [L319] r232 = (_Bool )tmp___2 [L320] COND FALSE !(\read(r311)) [L323] COND TRUE \read(r321) [L324] COND TRUE \read(ep21) [L325] tmp___3 = 1 [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 \read(r122) [L356] COND TRUE \read(r132) [L357] COND TRUE \read(r212) [L358] COND TRUE \read(r232) [L359] COND TRUE \read(r312) [L360] COND TRUE \read(r322) [L361] COND TRUE (int )max1 == (int )id1 [L362] COND TRUE (int )max2 == (int )id2 [L363] COND TRUE (int )max3 == (int )id3 [L364] COND TRUE (int )st1 == 0 [L365] COND TRUE (int )st2 == 0 [L366] COND TRUE (int )st3 == 0 [L367] COND TRUE (int )nl1 == 0 [L368] COND TRUE (int )nl2 == 0 [L369] COND TRUE (int )nl3 == 0 [L370] COND TRUE (int )mode1 == 0 [L371] COND TRUE (int )mode2 == 0 [L372] COND TRUE (int )mode3 == 0 [L373] COND TRUE \read(newmax1) [L374] COND TRUE \read(newmax2) [L375] COND TRUE \read(newmax3) [L376] tmp___5 = 1 [L467] return (tmp___5); [L563] RET, EXPR init() [L563] i2 = init() [L564] CALL assume_abort_if_not(i2) [L22] COND FALSE !(!cond) [L564] RET assume_abort_if_not(i2) [L565] p12_old = nomsg [L566] p12_new = nomsg [L567] p13_old = nomsg [L568] p13_new = nomsg [L569] p21_old = nomsg [L570] p21_new = nomsg [L571] p23_old = nomsg [L572] p23_new = nomsg [L573] p31_old = nomsg [L574] p31_new = nomsg [L575] p32_old = nomsg [L576] p32_new = nomsg [L577] i2 = 0 VAL [c1=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, i2=0, id1=126, id2=125, id3=127, m1=0, m2=126, m3=-2, max1=126, max2=125, max3=127, mode1=0, mode2=0, mode3=0, newmax1=255, newmax2=255, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L578] COND TRUE 1 [L580] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND FALSE !(\read(mode1)) [L114] COND TRUE (int )r1 < 2 [L115] COND FALSE !(\read(ep12)) [L120] COND TRUE \read(ep13) [L121] COND TRUE \read(newmax1) [L122] EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L122] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L126] mode1 = (_Bool)1 [L580] RET node1() [L581] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND FALSE !(\read(mode2)) [L168] COND TRUE (int )r2 < 2 [L169] COND TRUE \read(ep21) [L170] COND TRUE \read(newmax2) [L171] EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L171] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L174] COND FALSE !(\read(ep23)) [L180] mode2 = (_Bool)1 [L581] RET node2() [L582] CALL node3() [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 [L582] RET node3() [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L595] CALL, EXPR check() [L472] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=0, m2=126, m3=-2, max1=126, max2=125, max3=127, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=0, m2=126, m3=-2, max1=126, max2=125, max3=127, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=0, m2=126, m3=-2, max1=126, max2=125, max3=127, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=0, m2=126, m3=-2, max1=126, max2=125, max3=127, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=0, m2=126, m3=-2, max1=126, max2=125, max3=127, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=0, m2=126, m3=-2, max1=126, max2=125, max3=127, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=0, m2=126, m3=-2, max1=126, max2=125, max3=127, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=0, m2=126, m3=-2, max1=126, max2=125, max3=127, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L489] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=0, m2=126, m3=-2, max1=126, max2=125, max3=127, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L492] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=0, m2=126, m3=-2, max1=126, max2=125, max3=127, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L494] COND TRUE (int )r1 < 2 [L495] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=0, m2=126, m3=-2, max1=126, max2=125, max3=127, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0, tmp=1] [L523] return (tmp); [L595] RET, EXPR check() [L595] c1 = check() [L596] CALL assert(c1) [L607] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=0, m2=126, m3=-2, max1=126, max2=125, max3=127, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L596] RET assert(c1) [L578] COND TRUE 1 [L580] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND TRUE \read(mode1) [L84] COND FALSE !(r1 == 255) [L87] r1 = r1 + 1 [L88] COND TRUE \read(ep21) [L89] m1 = p21_old [L90] p21_old = nomsg [L91] COND FALSE !((int )m1 > (int )max1) [L96] COND FALSE !(\read(ep31)) [L104] newmax1 = newmax [L105] COND FALSE !((int )r1 == 2) [L112] mode1 = (_Bool)0 [L580] RET node1() [L581] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND TRUE \read(mode2) [L138] COND FALSE !(r2 == 255) [L141] r2 = r2 + 1 [L142] COND FALSE !(\read(ep12)) [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 [L581] RET node2() [L582] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND TRUE \read(mode3) [L192] COND FALSE !(r3 == 255) [L195] r3 = r3 + 1 [L196] COND TRUE \read(ep13) [L197] m3 = p13_old [L198] p13_old = nomsg [L199] COND FALSE !((int )m3 > (int )max3) [L204] COND FALSE !(\read(ep23)) [L212] newmax3 = newmax [L213] COND FALSE !((int )r3 == 2) [L220] mode3 = (_Bool)0 [L582] RET node3() [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L595] CALL, EXPR check() [L472] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=125, m2=127, m3=126, max1=126, max2=127, max3=127, 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] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=125, m2=127, m3=126, max1=126, max2=127, max3=127, 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] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=125, m2=127, m3=126, max1=126, max2=127, max3=127, 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] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=125, m2=127, m3=126, max1=126, max2=127, max3=127, 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] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=125, m2=127, m3=126, max1=126, max2=127, max3=127, 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] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=125, m2=127, m3=126, max1=126, max2=127, max3=127, 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] [L482] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=125, m2=127, m3=126, max1=126, max2=127, max3=127, 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] [L484] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=125, m2=127, m3=126, max1=126, max2=127, max3=127, 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] [L489] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=125, m2=127, m3=126, max1=126, max2=127, max3=127, 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] [L492] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=125, m2=127, m3=126, max1=126, max2=127, max3=127, 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] [L494] COND TRUE (int )r1 < 2 [L495] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=125, m2=127, m3=126, max1=126, max2=127, max3=127, 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, tmp=1] [L523] return (tmp); [L595] RET, EXPR check() [L595] c1 = check() [L596] CALL assert(c1) [L607] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=125, m2=127, m3=126, max1=126, max2=127, max3=127, 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] [L596] RET assert(c1) [L578] COND TRUE 1 [L580] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND FALSE !(\read(mode1)) [L114] COND TRUE (int )r1 < 2 [L115] COND FALSE !(\read(ep12)) [L120] COND TRUE \read(ep13) [L121] COND FALSE !(\read(newmax1)) [L126] mode1 = (_Bool)1 [L580] RET node1() [L581] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND FALSE !(\read(mode2)) [L168] COND TRUE (int )r2 < 2 [L169] COND TRUE \read(ep21) [L170] COND TRUE \read(newmax2) [L171] EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L171] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L174] COND FALSE !(\read(ep23)) [L180] mode2 = (_Bool)1 [L581] RET node2() [L582] CALL node3() [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 [L582] RET node3() [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L595] CALL, EXPR check() [L472] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=125, m2=127, m3=126, max1=126, max2=127, max3=127, 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=127, 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] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=125, m2=127, m3=126, max1=126, max2=127, max3=127, 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=127, 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] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=125, m2=127, m3=126, max1=126, max2=127, max3=127, 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=127, 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] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=125, m2=127, m3=126, max1=126, max2=127, max3=127, 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=127, 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] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=125, m2=127, m3=126, max1=126, max2=127, max3=127, 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=127, 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] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=125, m2=127, m3=126, max1=126, max2=127, max3=127, 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=127, 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] [L482] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=125, m2=127, m3=126, max1=126, max2=127, max3=127, 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=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=125, m2=127, m3=126, max1=126, max2=127, max3=127, 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=127, 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] [L489] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=125, m2=127, m3=126, max1=126, max2=127, max3=127, 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=127, 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] [L492] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=125, m2=127, m3=126, max1=126, max2=127, max3=127, 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=127, 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] [L494] COND TRUE (int )r1 < 2 [L495] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=125, m2=127, m3=126, max1=126, max2=127, max3=127, 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=127, 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, tmp=1] [L523] return (tmp); [L595] RET, EXPR check() [L595] c1 = check() [L596] CALL assert(c1) [L607] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=125, m2=127, m3=126, max1=126, max2=127, max3=127, 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=127, 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] [L596] RET assert(c1) [L578] COND TRUE 1 [L580] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND TRUE \read(mode1) [L84] COND FALSE !(r1 == 255) [L87] r1 = r1 + 1 [L88] COND TRUE \read(ep21) [L89] m1 = p21_old [L90] p21_old = nomsg [L91] COND TRUE (int )m1 > (int )max1 [L92] max1 = m1 [L93] newmax = (_Bool)1 [L96] COND FALSE !(\read(ep31)) [L104] newmax1 = newmax [L105] COND TRUE (int )r1 == 2 [L106] COND FALSE !((int )max1 == (int )id1) [L109] st1 = (char)1 [L112] mode1 = (_Bool)0 [L580] RET node1() [L581] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND TRUE \read(mode2) [L138] COND FALSE !(r2 == 255) [L141] r2 = r2 + 1 [L142] COND FALSE !(\read(ep12)) [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 [L581] RET node2() [L582] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND TRUE \read(mode3) [L192] COND FALSE !(r3 == 255) [L195] r3 = r3 + 1 [L196] COND TRUE \read(ep13) [L197] m3 = p13_old [L198] p13_old = nomsg [L199] COND FALSE !((int )m3 > (int )max3) [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 [L582] RET node3() [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L595] CALL, EXPR check() [L472] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=127, m2=-1, m3=-1, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, 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] [L475] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L521] tmp = 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=127, m2=-1, m3=-1, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, 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, tmp=0] [L523] return (tmp); [L595] RET, EXPR check() [L595] c1 = check() [L596] CALL assert(c1) [L607] COND TRUE ! arg VAL [\old(arg)=0, arg=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=127, m2=-1, m3=-1, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, 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] [L609] reach_error() VAL [\old(arg)=0, arg=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=255, id1=126, id2=125, id3=127, m1=127, m2=-1, m3=-1, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, 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.35ms. Allocated memory is still 104.9MB. Free memory is still 79.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 460.12ms. Allocated memory is still 104.9MB. Free memory was 62.0MB in the beginning and 72.7MB in the end (delta: -10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 93.03ms. Allocated memory is still 104.9MB. Free memory was 72.7MB in the beginning and 69.6MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.96ms. Allocated memory is still 104.9MB. Free memory was 69.6MB in the beginning and 67.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1562.26ms. Allocated memory was 104.9MB in the beginning and 134.2MB in the end (delta: 29.4MB). Free memory was 67.2MB in the beginning and 72.8MB in the end (delta: -5.6MB). Peak memory consumption was 50.6MB. Max. memory is 16.1GB. * CodeCheck took 130082.61ms. Allocated memory was 134.2MB in the beginning and 1.1GB in the end (delta: 998.2MB). Free memory was 72.8MB in the beginning and 682.1MB in the end (delta: -609.3MB). Peak memory consumption was 391.8MB. Max. memory is 16.1GB. * Witness Printer took 190.74ms. Allocated memory is still 1.1GB. Free memory was 682.1MB in the beginning and 660.1MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2021-11-23 00:39:29,663 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f176942-6e78-42ef-a146-2145c95b0989/bin/ukojak-LBtLqBUTdQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE