./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.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_e92e1d81-8e33-4cbc-a3a3-5d48b115b58a/bin/ukojak-LBtLqBUTdQ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e92e1d81-8e33-4cbc-a3a3-5d48b115b58a/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_e92e1d81-8e33-4cbc-a3a3-5d48b115b58a/bin/ukojak-LBtLqBUTdQ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e92e1d81-8e33-4cbc-a3a3-5d48b115b58a/bin/ukojak-LBtLqBUTdQ/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e92e1d81-8e33-4cbc-a3a3-5d48b115b58a/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_e92e1d81-8e33-4cbc-a3a3-5d48b115b58a/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 205f0e0aff0d53187144e7eaaf7c9176a7ca6bc04dd0065235effeefd306421c --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-23 01:05:42,622 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 01:05:42,625 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 01:05:42,664 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 01:05:42,665 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 01:05:42,666 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 01:05:42,668 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 01:05:42,670 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 01:05:42,672 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 01:05:42,674 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 01:05:42,675 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 01:05:42,677 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 01:05:42,677 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 01:05:42,679 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 01:05:42,680 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 01:05:42,682 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 01:05:42,684 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 01:05:42,685 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 01:05:42,688 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 01:05:42,690 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 01:05:42,693 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 01:05:42,694 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 01:05:42,696 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 01:05:42,697 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 01:05:42,701 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 01:05:42,707 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 01:05:42,707 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 01:05:42,708 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 01:05:42,709 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 01:05:42,710 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 01:05:42,711 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 01:05:42,712 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 01:05:42,713 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 01:05:42,714 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 01:05:42,715 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 01:05:42,715 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 01:05:42,716 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 01:05:42,716 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 01:05:42,716 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 01:05:42,717 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 01:05:42,717 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 01:05:42,720 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e92e1d81-8e33-4cbc-a3a3-5d48b115b58a/bin/ukojak-LBtLqBUTdQ/config/svcomp-Reach-32bit-Kojak_Default.epf [2021-11-23 01:05:42,768 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 01:05:42,769 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 01:05:42,771 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-23 01:05:42,772 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2021-11-23 01:05:42,772 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-23 01:05:42,773 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-23 01:05:42,773 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 01:05:42,773 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 01:05:42,780 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 01:05:42,780 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 01:05:42,781 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 01:05:42,781 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-23 01:05:42,782 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 01:05:42,782 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-23 01:05:42,782 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 01:05:42,782 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-23 01:05:42,783 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 01:05:42,783 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-23 01:05:42,783 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2021-11-23 01:05:42,783 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2021-11-23 01:05:42,784 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 01:05:42,784 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-11-23 01:05:42,785 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 01:05:42,785 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 01:05:42,785 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-23 01:05:42,786 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2021-11-23 01:05:42,786 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 01:05:42,786 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-23 01:05:42,786 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_e92e1d81-8e33-4cbc-a3a3-5d48b115b58a/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_e92e1d81-8e33-4cbc-a3a3-5d48b115b58a/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 -> 205f0e0aff0d53187144e7eaaf7c9176a7ca6bc04dd0065235effeefd306421c [2021-11-23 01:05:43,118 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 01:05:43,152 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 01:05:43,155 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 01:05:43,156 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 01:05:43,157 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 01:05:43,159 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e92e1d81-8e33-4cbc-a3a3-5d48b115b58a/bin/ukojak-LBtLqBUTdQ/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c [2021-11-23 01:05:43,239 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e92e1d81-8e33-4cbc-a3a3-5d48b115b58a/bin/ukojak-LBtLqBUTdQ/data/1a79b3c1d/04fa70fcf6a941058d6e4d0414134ae5/FLAGfd66ae854 [2021-11-23 01:05:43,865 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 01:05:43,866 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e92e1d81-8e33-4cbc-a3a3-5d48b115b58a/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c [2021-11-23 01:05:43,886 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e92e1d81-8e33-4cbc-a3a3-5d48b115b58a/bin/ukojak-LBtLqBUTdQ/data/1a79b3c1d/04fa70fcf6a941058d6e4d0414134ae5/FLAGfd66ae854 [2021-11-23 01:05:44,142 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e92e1d81-8e33-4cbc-a3a3-5d48b115b58a/bin/ukojak-LBtLqBUTdQ/data/1a79b3c1d/04fa70fcf6a941058d6e4d0414134ae5 [2021-11-23 01:05:44,145 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 01:05:44,146 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 01:05:44,148 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 01:05:44,148 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 01:05:44,151 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 01:05:44,152 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:05:44" (1/1) ... [2021-11-23 01:05:44,153 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@148c9d80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:44, skipping insertion in model container [2021-11-23 01:05:44,153 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:05:44" (1/1) ... [2021-11-23 01:05:44,160 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 01:05:44,231 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 01:05:44,447 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_e92e1d81-8e33-4cbc-a3a3-5d48b115b58a/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c[14511,14524] [2021-11-23 01:05:44,450 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 01:05:44,461 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 01:05:44,580 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_e92e1d81-8e33-4cbc-a3a3-5d48b115b58a/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c[14511,14524] [2021-11-23 01:05:44,580 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 01:05:44,622 INFO L208 MainTranslator]: Completed translation [2021-11-23 01:05:44,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:44 WrapperNode [2021-11-23 01:05:44,623 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 01:05:44,624 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 01:05:44,624 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 01:05:44,624 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 01:05:44,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:44" (1/1) ... [2021-11-23 01:05:44,663 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:44" (1/1) ... [2021-11-23 01:05:44,712 INFO L137 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 479 [2021-11-23 01:05:44,713 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 01:05:44,714 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 01:05:44,714 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 01:05:44,714 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 01:05:44,726 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:44" (1/1) ... [2021-11-23 01:05:44,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:44" (1/1) ... [2021-11-23 01:05:44,750 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:44" (1/1) ... [2021-11-23 01:05:44,750 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:44" (1/1) ... [2021-11-23 01:05:44,760 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:44" (1/1) ... [2021-11-23 01:05:44,770 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:44" (1/1) ... [2021-11-23 01:05:44,773 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:44" (1/1) ... [2021-11-23 01:05:44,778 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 01:05:44,779 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 01:05:44,779 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 01:05:44,780 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 01:05:44,781 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:44" (1/1) ... [2021-11-23 01:05:44,789 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-11-23 01:05:44,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e92e1d81-8e33-4cbc-a3a3-5d48b115b58a/bin/ukojak-LBtLqBUTdQ/z3 [2021-11-23 01:05:44,817 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e92e1d81-8e33-4cbc-a3a3-5d48b115b58a/bin/ukojak-LBtLqBUTdQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2021-11-23 01:05:44,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e92e1d81-8e33-4cbc-a3a3-5d48b115b58a/bin/ukojak-LBtLqBUTdQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2021-11-23 01:05:44,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 01:05:44,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-23 01:05:44,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 01:05:44,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 01:05:44,968 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 01:05:44,970 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 01:05:45,689 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 01:05:46,430 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 01:05:46,430 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-23 01:05:46,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:05:46 BoogieIcfgContainer [2021-11-23 01:05:46,433 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 01:05:46,434 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2021-11-23 01:05:46,435 INFO L271 PluginConnector]: Initializing CodeCheck... [2021-11-23 01:05:46,479 INFO L275 PluginConnector]: CodeCheck initialized [2021-11-23 01:05:46,480 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:05:46" (1/1) ... [2021-11-23 01:05:46,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:05:46,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:05:46,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2021-11-23 01:05:46,590 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2021-11-23 01:05:46,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-23 01:05:46,593 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:05:46,594 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:05:46,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:05:47,165 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 01:05:47,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:05:47,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 20 states and 32 transitions. [2021-11-23 01:05:47,316 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 32 transitions. [2021-11-23 01:05:47,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-23 01:05:47,317 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:05:47,317 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:05:47,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:05:47,540 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 01:05:47,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:05:47,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 23 states and 38 transitions. [2021-11-23 01:05:47,928 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2021-11-23 01:05:47,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-23 01:05:47,929 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:05:47,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:05:47,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:05:48,105 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 01:05:48,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:05:48,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 27 states and 46 transitions. [2021-11-23 01:05:48,561 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 46 transitions. [2021-11-23 01:05:48,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-23 01:05:48,564 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:05:48,564 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:05:48,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:05:48,767 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 01:05:49,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:05:49,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 32 states and 56 transitions. [2021-11-23 01:05:49,426 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 56 transitions. [2021-11-23 01:05:49,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-23 01:05:49,427 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:05:49,427 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:05:49,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:05:49,718 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 01:05:50,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:05:50,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 39 states and 68 transitions. [2021-11-23 01:05:50,598 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 68 transitions. [2021-11-23 01:05:50,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-23 01:05:50,598 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:05:50,599 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:05:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:05:50,911 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 01:05:51,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:05:51,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 45 states and 79 transitions. [2021-11-23 01:05:51,909 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 79 transitions. [2021-11-23 01:05:51,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-23 01:05:51,910 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:05:51,910 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:05:51,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:05:52,016 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 01:05:52,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:05:52,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 46 states and 79 transitions. [2021-11-23 01:05:52,247 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 79 transitions. [2021-11-23 01:05:52,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-23 01:05:52,248 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:05:52,248 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:05:52,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:05:52,313 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 01:05:52,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:05:52,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 47 states and 80 transitions. [2021-11-23 01:05:52,324 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 80 transitions. [2021-11-23 01:05:52,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-23 01:05:52,325 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:05:52,325 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:05:52,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:05:52,661 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 01:05:54,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:05:54,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 57 states and 97 transitions. [2021-11-23 01:05:54,524 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 97 transitions. [2021-11-23 01:05:54,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-23 01:05:54,525 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:05:54,525 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:05:54,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:05:54,708 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 01:05:54,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:05:54,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 60 states and 103 transitions. [2021-11-23 01:05:54,974 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 103 transitions. [2021-11-23 01:05:54,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-23 01:05:54,975 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:05:54,975 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:05:55,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:05:55,773 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 01:05:59,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:05:59,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 76 states and 134 transitions. [2021-11-23 01:05:59,750 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 134 transitions. [2021-11-23 01:05:59,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-23 01:05:59,759 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:05:59,761 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:05:59,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:05:59,965 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 01:06:02,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:06:02,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 90 states and 154 transitions. [2021-11-23 01:06:02,771 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 154 transitions. [2021-11-23 01:06:02,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-23 01:06:02,772 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:06:02,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:06:02,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:06:03,117 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 01:06:06,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:06:06,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 108 states and 187 transitions. [2021-11-23 01:06:06,856 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 187 transitions. [2021-11-23 01:06:06,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-23 01:06:06,858 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:06:06,858 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:06:06,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:06:06,958 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 01:06:07,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:06:07,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 109 states and 188 transitions. [2021-11-23 01:06:07,328 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 188 transitions. [2021-11-23 01:06:07,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-23 01:06:07,329 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:06:07,329 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:06:07,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:06:07,848 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 01:06:11,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:06:11,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 123 states and 214 transitions. [2021-11-23 01:06:11,625 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 214 transitions. [2021-11-23 01:06:11,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-23 01:06:11,626 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:06:11,627 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:06:11,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:06:11,736 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 01:06:12,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:06:12,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 124 states and 219 transitions. [2021-11-23 01:06:12,123 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 219 transitions. [2021-11-23 01:06:12,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-23 01:06:12,124 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:06:12,125 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:06:12,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:06:12,245 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 01:06:12,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:06:12,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 126 states and 222 transitions. [2021-11-23 01:06:12,943 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 222 transitions. [2021-11-23 01:06:12,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-23 01:06:12,944 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:06:12,944 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:06:12,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:06:13,049 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 01:06:13,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:06:13,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 127 states and 223 transitions. [2021-11-23 01:06:13,389 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 223 transitions. [2021-11-23 01:06:13,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-23 01:06:13,390 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:06:13,390 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:06:13,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:06:14,394 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 01:06:20,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:06:20,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 147 states and 255 transitions. [2021-11-23 01:06:20,431 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 255 transitions. [2021-11-23 01:06:20,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-23 01:06:20,432 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:06:20,432 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:06:20,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:06:20,852 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 01:06:24,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:06:24,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 155 states and 269 transitions. [2021-11-23 01:06:24,994 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 269 transitions. [2021-11-23 01:06:24,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-23 01:06:24,994 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:06:24,995 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:06:25,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:06:26,025 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 01:06:30,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:06:30,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 163 states and 286 transitions. [2021-11-23 01:06:30,529 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 286 transitions. [2021-11-23 01:06:30,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-23 01:06:30,530 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:06:30,530 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:06:30,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:06:31,755 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 01:06:38,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:06:38,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 177 states and 332 transitions. [2021-11-23 01:06:38,542 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 332 transitions. [2021-11-23 01:06:38,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-23 01:06:38,543 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:06:38,543 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:06:38,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:06:39,468 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 01:06:46,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:06:46,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 192 states and 369 transitions. [2021-11-23 01:06:46,324 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 369 transitions. [2021-11-23 01:06:46,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-23 01:06:46,325 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:06:46,325 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:06:46,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:06:48,186 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:06:56,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:06:56,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 207 states and 401 transitions. [2021-11-23 01:06:56,689 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 401 transitions. [2021-11-23 01:06:56,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-23 01:06:56,690 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:06:56,690 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:06:56,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:06:58,572 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:07:05,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:07:05,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 218 states and 419 transitions. [2021-11-23 01:07:05,142 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 419 transitions. [2021-11-23 01:07:05,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-23 01:07:05,143 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:07:05,143 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:07:05,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:07:05,398 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:07:06,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:07:06,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 220 states and 427 transitions. [2021-11-23 01:07:06,902 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 427 transitions. [2021-11-23 01:07:06,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-23 01:07:06,903 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:07:06,904 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:07:06,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:07:07,936 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 01:07:14,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:07:14,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 226 states and 439 transitions. [2021-11-23 01:07:14,445 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 439 transitions. [2021-11-23 01:07:14,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-23 01:07:14,446 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:07:14,446 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:07:14,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:07:14,622 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 01:07:16,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:07:16,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 229 states and 449 transitions. [2021-11-23 01:07:16,894 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 449 transitions. [2021-11-23 01:07:16,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-23 01:07:16,895 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:07:16,895 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:07:16,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:07:17,083 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 01:07:17,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:07:17,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 230 states and 450 transitions. [2021-11-23 01:07:17,942 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 450 transitions. [2021-11-23 01:07:17,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-23 01:07:17,943 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:07:17,943 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:07:18,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:07:19,121 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:07:25,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:07:25,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 242 states and 475 transitions. [2021-11-23 01:07:25,423 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 475 transitions. [2021-11-23 01:07:25,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-23 01:07:25,424 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:07:25,424 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:07:25,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:07:25,924 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:07:29,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:07:29,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 246 states and 505 transitions. [2021-11-23 01:07:29,332 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 505 transitions. [2021-11-23 01:07:29,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-23 01:07:29,333 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:07:29,333 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:07:29,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:07:29,880 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:07:31,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:07:31,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 247 states and 516 transitions. [2021-11-23 01:07:31,027 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 516 transitions. [2021-11-23 01:07:31,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-23 01:07:31,030 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:07:31,030 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:07:31,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:07:31,420 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:07:32,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:07:32,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 248 states and 517 transitions. [2021-11-23 01:07:32,589 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 517 transitions. [2021-11-23 01:07:32,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-23 01:07:32,590 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:07:32,590 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:07:32,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:07:33,584 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 01:07:41,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:07:41,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 257 states and 536 transitions. [2021-11-23 01:07:41,225 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 536 transitions. [2021-11-23 01:07:41,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-23 01:07:41,226 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:07:41,226 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:07:41,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:07:41,399 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 01:07:45,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:07:45,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 262 states and 553 transitions. [2021-11-23 01:07:45,432 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 553 transitions. [2021-11-23 01:07:45,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-23 01:07:45,432 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:07:45,433 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:07:45,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:07:45,719 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 01:07:46,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:07:46,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 263 states and 555 transitions. [2021-11-23 01:07:46,598 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 555 transitions. [2021-11-23 01:07:46,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-23 01:07:46,599 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:07:46,599 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:07:46,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:07:46,754 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 01:07:47,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:07:47,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 264 states and 557 transitions. [2021-11-23 01:07:47,764 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 557 transitions. [2021-11-23 01:07:47,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-23 01:07:47,765 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:07:47,765 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:07:47,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:07:47,918 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 01:07:50,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:07:50,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 267 states and 562 transitions. [2021-11-23 01:07:50,692 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 562 transitions. [2021-11-23 01:07:50,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-23 01:07:50,693 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:07:50,693 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:07:50,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:07:50,923 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 01:07:51,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:07:51,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 267 states and 561 transitions. [2021-11-23 01:07:51,287 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 561 transitions. [2021-11-23 01:07:51,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-23 01:07:51,288 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:07:51,288 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:07:52,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 01:07:52,239 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 01:07:54,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 01:07:55,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 01:07:55,024 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 01:07:55,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 01:07:56,012 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 40 iterations. [2021-11-23 01:07:56,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 01:07:56 ImpRootNode [2021-11-23 01:07:56,334 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2021-11-23 01:07:56,335 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-23 01:07:56,335 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-23 01:07:56,335 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-23 01:07:56,336 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:05:46" (3/4) ... [2021-11-23 01:07:56,338 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-23 01:07:56,596 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e92e1d81-8e33-4cbc-a3a3-5d48b115b58a/bin/ukojak-LBtLqBUTdQ/witness.graphml [2021-11-23 01:07:56,597 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-23 01:07:56,598 INFO L158 Benchmark]: Toolchain (without parser) took 132450.82ms. Allocated memory was 81.8MB in the beginning and 977.3MB in the end (delta: 895.5MB). Free memory was 42.4MB in the beginning and 460.1MB in the end (delta: -417.7MB). Peak memory consumption was 478.6MB. Max. memory is 16.1GB. [2021-11-23 01:07:56,598 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 81.8MB. Free memory was 59.7MB in the beginning and 59.6MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 01:07:56,599 INFO L158 Benchmark]: CACSL2BoogieTranslator took 475.32ms. Allocated memory was 81.8MB in the beginning and 109.1MB in the end (delta: 27.3MB). Free memory was 42.2MB in the beginning and 73.6MB in the end (delta: -31.4MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. [2021-11-23 01:07:56,599 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.98ms. Allocated memory is still 109.1MB. Free memory was 73.6MB in the beginning and 71.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-23 01:07:56,600 INFO L158 Benchmark]: Boogie Preprocessor took 64.63ms. Allocated memory is still 109.1MB. Free memory was 70.6MB in the beginning and 68.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-23 01:07:56,600 INFO L158 Benchmark]: RCFGBuilder took 1654.60ms. Allocated memory is still 109.1MB. Free memory was 67.9MB in the beginning and 41.9MB in the end (delta: 26.1MB). Peak memory consumption was 50.5MB. Max. memory is 16.1GB. [2021-11-23 01:07:56,601 INFO L158 Benchmark]: CodeCheck took 129900.17ms. Allocated memory was 109.1MB in the beginning and 977.3MB in the end (delta: 868.2MB). Free memory was 41.9MB in the beginning and 481.1MB in the end (delta: -439.3MB). Peak memory consumption was 428.2MB. Max. memory is 16.1GB. [2021-11-23 01:07:56,601 INFO L158 Benchmark]: Witness Printer took 261.59ms. Allocated memory is still 977.3MB. Free memory was 481.1MB in the beginning and 460.1MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2021-11-23 01:07:56,604 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.5s, OverallIterations: 40, 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, 12939 SdHoareTripleChecker+Valid, 102.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11648 mSDsluCounter, 4246 SdHoareTripleChecker+Invalid, 90.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3621 mSDsCounter, 3983 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 33906 IncrementalHoareTripleChecker+Invalid, 37889 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3983 mSolverCounterUnsat, 625 mSDtfsCounter, 33906 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10999 GetRequests, 9563 SyntacticMatches, 590 SemanticMatches, 846 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413368 ImplicationChecksByTransitivity, 109.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.3s SsaConstructionTime, 5.1s SatisfiabilityAnalysisTime, 14.6s InterpolantComputationTime, 1122 NumberOfCodeBlocks, 1122 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1035 ConstructedInterpolants, 0 QuantifiedInterpolants, 13576 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 11 PerfectInterpolantSequences, 152/661 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 TRUE \read(r311) [L321] 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=255, ep21=1, ep23=0, ep31=255, ep32=255, i2=0, id1=0, id2=4, id3=3, m1=5, m2=2, m3=-2, max1=0, max2=4, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L578] COND TRUE 1 [L580] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND FALSE !(\read(mode1)) [L114] COND TRUE (int )r1 < 1 [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 TRUE \read(ep31) [L224] COND TRUE \read(newmax3) [L225] EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L225] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [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=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=0, id2=4, id3=3, m1=5, m2=2, m3=-2, max1=0, max2=4, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, 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=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=0, id2=4, id3=3, m1=5, m2=2, m3=-2, max1=0, max2=4, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=0, id2=4, id3=3, m1=5, m2=2, m3=-2, max1=0, max2=4, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=0, id2=4, id3=3, m1=5, m2=2, m3=-2, max1=0, max2=4, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=0, id2=4, id3=3, m1=5, m2=2, m3=-2, max1=0, max2=4, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=0, id2=4, id3=3, m1=5, m2=2, m3=-2, max1=0, max2=4, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, 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=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=0, id2=4, id3=3, m1=5, m2=2, m3=-2, max1=0, max2=4, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=0, id2=4, id3=3, m1=5, m2=2, m3=-2, max1=0, max2=4, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L489] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=0, id2=4, id3=3, m1=5, m2=2, m3=-2, max1=0, max2=4, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, 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=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=0, id2=4, id3=3, m1=5, m2=2, m3=-2, max1=0, max2=4, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, 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=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=0, id2=4, id3=3, m1=5, m2=2, m3=-2, max1=0, max2=4, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, 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=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=0, id2=4, id3=3, m1=5, m2=2, m3=-2, max1=0, max2=4, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, 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 TRUE (int )m1 > (int )max1 [L92] max1 = m1 [L93] newmax = (_Bool)1 [L96] COND TRUE \read(ep31) [L97] m1 = p31_old [L98] p31_old = nomsg [L99] COND FALSE !((int )m1 > (int )max1) [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 FALSE !((int )m2 > (int )max2) [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=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=0, id2=4, id3=3, m1=3, m2=3, m3=0, max1=4, max2=4, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=0, id2=4, id3=3, m1=3, m2=3, m3=0, max1=4, max2=4, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=0, id2=4, id3=3, m1=3, m2=3, m3=0, max1=4, max2=4, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=0, id2=4, id3=3, m1=3, m2=3, m3=0, max1=4, max2=4, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=0, id2=4, id3=3, m1=3, m2=3, m3=0, max1=4, max2=4, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=0, id2=4, id3=3, m1=3, m2=3, m3=0, max1=4, max2=4, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=0, id2=4, id3=3, m1=3, m2=3, m3=0, max1=4, max2=4, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=0, id2=4, id3=3, m1=3, m2=3, m3=0, max1=4, max2=4, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L489] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=0, id2=4, id3=3, m1=3, m2=3, m3=0, max1=4, max2=4, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L492] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=0, id2=4, id3=3, m1=3, m2=3, m3=0, max1=4, max2=4, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L494] COND TRUE (int )r1 < 2 [L495] tmp = 1 VAL [ep12=0, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=0, id2=4, id3=3, m1=3, m2=3, m3=0, max1=4, max2=4, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, 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=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=0, id2=4, id3=3, m1=3, m2=3, m3=0, max1=4, max2=4, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [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 FALSE !((int )r1 < 1) [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 FALSE !(\read(newmax2)) [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 TRUE \read(ep31) [L224] COND FALSE !(\read(newmax3)) [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=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=0, id2=4, id3=3, m1=3, m2=3, m3=0, max1=4, max2=4, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=0, id2=4, id3=3, m1=3, m2=3, m3=0, max1=4, max2=4, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=0, id2=4, id3=3, m1=3, m2=3, m3=0, max1=4, max2=4, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=0, id2=4, id3=3, m1=3, m2=3, m3=0, max1=4, max2=4, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=0, id2=4, id3=3, m1=3, m2=3, m3=0, max1=4, max2=4, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=0, id2=4, id3=3, m1=3, m2=3, m3=0, max1=4, max2=4, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=0, id2=4, id3=3, m1=3, m2=3, m3=0, max1=4, max2=4, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=0, id2=4, id3=3, m1=3, m2=3, m3=0, max1=4, max2=4, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L489] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=0, id2=4, id3=3, m1=3, m2=3, m3=0, max1=4, max2=4, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L492] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=0, id2=4, id3=3, m1=3, m2=3, m3=0, max1=4, max2=4, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L494] COND TRUE (int )r1 < 2 [L495] tmp = 1 VAL [ep12=0, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=0, id2=4, id3=3, m1=3, m2=3, m3=0, max1=4, max2=4, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, 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=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=0, id2=4, id3=3, m1=3, m2=3, m3=0, max1=4, max2=4, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [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 TRUE \read(ep31) [L97] m1 = p31_old [L98] p31_old = nomsg [L99] COND FALSE !((int )m1 > (int )max1) [L104] newmax1 = newmax [L105] COND TRUE (int )r1 == 2 [L106] COND FALSE !((int )max1 == (int )id1) [L109] nl1 = (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 TRUE (int )max2 == (int )id2 [L161] st2 = (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=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=0, id2=4, id3=3, m1=-1, m2=-1, m3=-1, max1=4, max2=4, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L475] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L521] tmp = 0 VAL [ep12=0, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=0, id2=4, id3=3, m1=-1, m2=-1, m3=-1, max1=4, max2=4, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, 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=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=0, id2=4, id3=3, m1=-1, m2=-1, m3=-1, max1=4, max2=4, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L609] reach_error() VAL [\old(arg)=0, arg=0, ep12=0, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=0, id2=4, id3=3, m1=-1, m2=-1, m3=-1, max1=4, max2=4, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 81.8MB. Free memory was 59.7MB in the beginning and 59.6MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 475.32ms. Allocated memory was 81.8MB in the beginning and 109.1MB in the end (delta: 27.3MB). Free memory was 42.2MB in the beginning and 73.6MB in the end (delta: -31.4MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.98ms. Allocated memory is still 109.1MB. Free memory was 73.6MB in the beginning and 71.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.63ms. Allocated memory is still 109.1MB. Free memory was 70.6MB in the beginning and 68.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1654.60ms. Allocated memory is still 109.1MB. Free memory was 67.9MB in the beginning and 41.9MB in the end (delta: 26.1MB). Peak memory consumption was 50.5MB. Max. memory is 16.1GB. * CodeCheck took 129900.17ms. Allocated memory was 109.1MB in the beginning and 977.3MB in the end (delta: 868.2MB). Free memory was 41.9MB in the beginning and 481.1MB in the end (delta: -439.3MB). Peak memory consumption was 428.2MB. Max. memory is 16.1GB. * Witness Printer took 261.59ms. Allocated memory is still 977.3MB. Free memory was 481.1MB in the beginning and 460.1MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2021-11-23 01:07:56,647 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e92e1d81-8e33-4cbc-a3a3-5d48b115b58a/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