./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.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_5e0cbdcc-5eb7-4f49-bf84-81cd2beb9f64/bin/ukojak-LBtLqBUTdQ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e0cbdcc-5eb7-4f49-bf84-81cd2beb9f64/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_5e0cbdcc-5eb7-4f49-bf84-81cd2beb9f64/bin/ukojak-LBtLqBUTdQ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e0cbdcc-5eb7-4f49-bf84-81cd2beb9f64/bin/ukojak-LBtLqBUTdQ/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e0cbdcc-5eb7-4f49-bf84-81cd2beb9f64/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_5e0cbdcc-5eb7-4f49-bf84-81cd2beb9f64/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 5a61d3db55f61e1c69c316c83f1e37b4c9c56a755bd5e8fcd2da0d467aefc9f7 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-23 01:43:52,653 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 01:43:52,655 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 01:43:52,699 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 01:43:52,700 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 01:43:52,705 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 01:43:52,708 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 01:43:52,713 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 01:43:52,716 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 01:43:52,724 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 01:43:52,725 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 01:43:52,727 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 01:43:52,727 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 01:43:52,731 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 01:43:52,734 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 01:43:52,741 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 01:43:52,744 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 01:43:52,745 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 01:43:52,748 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 01:43:52,752 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 01:43:52,757 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 01:43:52,759 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 01:43:52,762 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 01:43:52,763 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 01:43:52,770 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 01:43:52,771 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 01:43:52,771 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 01:43:52,773 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 01:43:52,774 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 01:43:52,776 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 01:43:52,777 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 01:43:52,778 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 01:43:52,780 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 01:43:52,781 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 01:43:52,783 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 01:43:52,783 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 01:43:52,784 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 01:43:52,784 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 01:43:52,784 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 01:43:52,785 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 01:43:52,786 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 01:43:52,787 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e0cbdcc-5eb7-4f49-bf84-81cd2beb9f64/bin/ukojak-LBtLqBUTdQ/config/svcomp-Reach-32bit-Kojak_Default.epf [2021-11-23 01:43:52,836 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 01:43:52,836 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 01:43:52,838 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-23 01:43:52,839 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2021-11-23 01:43:52,840 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-23 01:43:52,840 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-23 01:43:52,840 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 01:43:52,840 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 01:43:52,841 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 01:43:52,841 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 01:43:52,842 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 01:43:52,849 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-23 01:43:52,849 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 01:43:52,849 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-23 01:43:52,849 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 01:43:52,850 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-23 01:43:52,850 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 01:43:52,850 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-23 01:43:52,850 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2021-11-23 01:43:52,850 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2021-11-23 01:43:52,851 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 01:43:52,851 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-11-23 01:43:52,851 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 01:43:52,851 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 01:43:52,851 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-23 01:43:52,852 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2021-11-23 01:43:52,852 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 01:43:52,852 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-23 01:43:52,852 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_5e0cbdcc-5eb7-4f49-bf84-81cd2beb9f64/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_5e0cbdcc-5eb7-4f49-bf84-81cd2beb9f64/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 -> 5a61d3db55f61e1c69c316c83f1e37b4c9c56a755bd5e8fcd2da0d467aefc9f7 [2021-11-23 01:43:53,128 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 01:43:53,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 01:43:53,166 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 01:43:53,168 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 01:43:53,169 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 01:43:53,170 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e0cbdcc-5eb7-4f49-bf84-81cd2beb9f64/bin/ukojak-LBtLqBUTdQ/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c [2021-11-23 01:43:53,245 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e0cbdcc-5eb7-4f49-bf84-81cd2beb9f64/bin/ukojak-LBtLqBUTdQ/data/8e3950941/02df66730c304fd7bbd44d4df818003a/FLAG99f5bfcae [2021-11-23 01:43:53,725 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 01:43:53,725 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e0cbdcc-5eb7-4f49-bf84-81cd2beb9f64/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c [2021-11-23 01:43:53,743 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e0cbdcc-5eb7-4f49-bf84-81cd2beb9f64/bin/ukojak-LBtLqBUTdQ/data/8e3950941/02df66730c304fd7bbd44d4df818003a/FLAG99f5bfcae [2021-11-23 01:43:54,057 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e0cbdcc-5eb7-4f49-bf84-81cd2beb9f64/bin/ukojak-LBtLqBUTdQ/data/8e3950941/02df66730c304fd7bbd44d4df818003a [2021-11-23 01:43:54,060 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 01:43:54,061 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 01:43:54,072 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 01:43:54,072 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 01:43:54,076 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 01:43:54,077 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:43:54" (1/1) ... [2021-11-23 01:43:54,078 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69edd88e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:54, skipping insertion in model container [2021-11-23 01:43:54,078 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:43:54" (1/1) ... [2021-11-23 01:43:54,086 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 01:43:54,150 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 01:43:54,466 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_5e0cbdcc-5eb7-4f49-bf84-81cd2beb9f64/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c[14373,14386] [2021-11-23 01:43:54,474 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 01:43:54,484 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 01:43:54,550 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_5e0cbdcc-5eb7-4f49-bf84-81cd2beb9f64/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c[14373,14386] [2021-11-23 01:43:54,551 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 01:43:54,566 INFO L208 MainTranslator]: Completed translation [2021-11-23 01:43:54,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:54 WrapperNode [2021-11-23 01:43:54,567 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 01:43:54,568 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 01:43:54,569 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 01:43:54,569 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 01:43:54,576 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:43:54" (1/1) ... [2021-11-23 01:43:54,587 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:43:54" (1/1) ... [2021-11-23 01:43:54,639 INFO L137 Inliner]: procedures = 22, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 479 [2021-11-23 01:43:54,645 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 01:43:54,645 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 01:43:54,646 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 01:43:54,646 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 01:43:54,654 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:54" (1/1) ... [2021-11-23 01:43:54,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:54" (1/1) ... [2021-11-23 01:43:54,671 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:54" (1/1) ... [2021-11-23 01:43:54,673 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:54" (1/1) ... [2021-11-23 01:43:54,684 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:54" (1/1) ... [2021-11-23 01:43:54,698 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:54" (1/1) ... [2021-11-23 01:43:54,701 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:54" (1/1) ... [2021-11-23 01:43:54,706 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 01:43:54,707 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 01:43:54,707 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 01:43:54,707 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 01:43:54,708 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:54" (1/1) ... [2021-11-23 01:43:54,733 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-11-23 01:43:54,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e0cbdcc-5eb7-4f49-bf84-81cd2beb9f64/bin/ukojak-LBtLqBUTdQ/z3 [2021-11-23 01:43:54,756 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e0cbdcc-5eb7-4f49-bf84-81cd2beb9f64/bin/ukojak-LBtLqBUTdQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2021-11-23 01:43:54,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e0cbdcc-5eb7-4f49-bf84-81cd2beb9f64/bin/ukojak-LBtLqBUTdQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2021-11-23 01:43:54,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 01:43:54,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-23 01:43:54,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 01:43:54,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 01:43:54,927 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 01:43:54,929 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 01:43:55,505 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 01:43:56,069 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 01:43:56,069 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-23 01:43:56,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:43:56 BoogieIcfgContainer [2021-11-23 01:43:56,072 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 01:43:56,073 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2021-11-23 01:43:56,074 INFO L271 PluginConnector]: Initializing CodeCheck... [2021-11-23 01:43:56,084 INFO L275 PluginConnector]: CodeCheck initialized [2021-11-23 01:43:56,085 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:43:56" (1/1) ... [2021-11-23 01:43:56,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:43:56,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:43:56,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2021-11-23 01:43:56,168 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2021-11-23 01:43:56,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-23 01:43:56,170 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:43:56,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:43:56,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:43:56,615 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:43:56,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:43:56,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 21 states and 34 transitions. [2021-11-23 01:43:56,730 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2021-11-23 01:43:56,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-23 01:43:56,730 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:43:56,731 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:43:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:43:56,976 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:43:57,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:43:57,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 24 states and 41 transitions. [2021-11-23 01:43:57,258 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2021-11-23 01:43:57,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-23 01:43:57,258 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:43:57,258 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:43:57,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:43:57,415 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:43:57,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:43:57,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 28 states and 50 transitions. [2021-11-23 01:43:57,908 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 50 transitions. [2021-11-23 01:43:57,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-23 01:43:57,911 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:43:57,911 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:43:57,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:43:58,056 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:43:58,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:43:58,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 33 states and 61 transitions. [2021-11-23 01:43:58,723 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 61 transitions. [2021-11-23 01:43:58,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-23 01:43:58,723 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:43:58,723 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:43:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:43:59,025 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:43:59,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:43:59,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 40 states and 74 transitions. [2021-11-23 01:43:59,893 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 74 transitions. [2021-11-23 01:43:59,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-23 01:43:59,893 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:43:59,894 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:43:59,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:44:00,032 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:44:00,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:44:00,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 46 states and 86 transitions. [2021-11-23 01:44:00,967 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 86 transitions. [2021-11-23 01:44:00,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-23 01:44:00,967 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:44:00,968 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:44:00,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:44:01,065 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:44:01,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:44:01,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 47 states and 86 transitions. [2021-11-23 01:44:01,254 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 86 transitions. [2021-11-23 01:44:01,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-23 01:44:01,255 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:44:01,255 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:44:01,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:44:01,304 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:44:01,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:44:01,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 48 states and 87 transitions. [2021-11-23 01:44:01,315 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 87 transitions. [2021-11-23 01:44:01,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-23 01:44:01,316 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:44:01,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:44:01,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:44:01,588 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:44:03,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:44:03,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 58 states and 104 transitions. [2021-11-23 01:44:03,149 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 104 transitions. [2021-11-23 01:44:03,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-23 01:44:03,149 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:44:03,149 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:44:03,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:44:03,347 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:44:03,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:44:03,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 61 states and 109 transitions. [2021-11-23 01:44:03,574 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 109 transitions. [2021-11-23 01:44:03,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-23 01:44:03,575 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:44:03,575 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:44:03,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:44:04,285 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:44:08,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:44:08,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 77 states and 142 transitions. [2021-11-23 01:44:08,242 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 142 transitions. [2021-11-23 01:44:08,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-23 01:44:08,244 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:44:08,244 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:44:08,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:44:08,549 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:44:12,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:44:12,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 94 states and 176 transitions. [2021-11-23 01:44:12,450 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 176 transitions. [2021-11-23 01:44:12,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-23 01:44:12,452 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:44:12,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:44:12,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:44:12,831 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:44:16,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:44:16,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 108 states and 203 transitions. [2021-11-23 01:44:16,221 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 203 transitions. [2021-11-23 01:44:16,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-23 01:44:16,224 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:44:16,224 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:44:16,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:44:16,317 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:44:16,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:44:16,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 109 states and 204 transitions. [2021-11-23 01:44:16,699 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 204 transitions. [2021-11-23 01:44:16,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-23 01:44:16,700 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:44:16,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:44:16,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:44:16,839 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:44:17,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:44:17,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 110 states and 208 transitions. [2021-11-23 01:44:17,219 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 208 transitions. [2021-11-23 01:44:17,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-23 01:44:17,228 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:44:17,229 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:44:17,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:44:17,749 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:44:21,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:44:21,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 124 states and 237 transitions. [2021-11-23 01:44:21,646 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 237 transitions. [2021-11-23 01:44:21,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-23 01:44:21,646 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:44:21,647 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:44:21,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:44:21,737 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:44:22,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:44:22,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 127 states and 246 transitions. [2021-11-23 01:44:22,826 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 246 transitions. [2021-11-23 01:44:22,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-23 01:44:22,827 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:44:22,827 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:44:22,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:44:22,942 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:44:23,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:44:23,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 129 states and 251 transitions. [2021-11-23 01:44:23,769 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 251 transitions. [2021-11-23 01:44:23,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-23 01:44:23,769 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:44:23,769 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:44:23,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:44:24,563 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:44:30,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:44:30,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 149 states and 288 transitions. [2021-11-23 01:44:30,654 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 288 transitions. [2021-11-23 01:44:30,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-23 01:44:30,655 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:44:30,655 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:44:30,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:44:31,149 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:44:32,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:44:32,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 154 states and 297 transitions. [2021-11-23 01:44:32,539 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 297 transitions. [2021-11-23 01:44:32,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-23 01:44:32,540 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:44:32,540 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:44:32,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:44:33,270 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:44:35,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:44:35,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 157 states and 303 transitions. [2021-11-23 01:44:35,705 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 303 transitions. [2021-11-23 01:44:35,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-23 01:44:35,705 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:44:35,706 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:44:35,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:44:36,121 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:44:37,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:44:37,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 162 states and 315 transitions. [2021-11-23 01:44:37,799 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 315 transitions. [2021-11-23 01:44:37,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-23 01:44:37,800 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:44:37,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:44:37,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:44:39,237 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:44:46,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:44:46,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 176 states and 366 transitions. [2021-11-23 01:44:46,474 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 366 transitions. [2021-11-23 01:44:46,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-23 01:44:46,475 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:44:46,475 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:44:46,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:44:46,714 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:44:48,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:44:48,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 181 states and 376 transitions. [2021-11-23 01:44:48,823 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 376 transitions. [2021-11-23 01:44:48,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-23 01:44:48,824 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:44:48,824 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:44:48,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:44:49,756 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:44:55,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:44:55,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 194 states and 416 transitions. [2021-11-23 01:44:55,625 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 416 transitions. [2021-11-23 01:44:55,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-23 01:44:55,626 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:44:55,627 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:44:55,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:44:55,755 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:44:57,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:44:57,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 197 states and 420 transitions. [2021-11-23 01:44:57,170 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 420 transitions. [2021-11-23 01:44:57,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-23 01:44:57,171 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:44:57,171 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:44:57,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:44:58,126 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:45:04,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:45:04,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 211 states and 453 transitions. [2021-11-23 01:45:04,070 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 453 transitions. [2021-11-23 01:45:04,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-23 01:45:04,071 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:45:04,071 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:45:04,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:45:04,263 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:45:06,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:45:06,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 216 states and 460 transitions. [2021-11-23 01:45:06,057 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 460 transitions. [2021-11-23 01:45:06,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-23 01:45:06,058 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:45:06,058 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:45:06,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:45:07,037 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:45:12,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:45:12,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 225 states and 477 transitions. [2021-11-23 01:45:12,392 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 477 transitions. [2021-11-23 01:45:12,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-23 01:45:12,393 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:45:12,393 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:45:12,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:45:12,505 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:45:13,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:45:13,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 221 states and 476 transitions. [2021-11-23 01:45:13,849 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 476 transitions. [2021-11-23 01:45:13,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-23 01:45:13,850 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:45:13,850 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:45:13,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:45:14,851 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:45:20,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:45:20,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 227 states and 497 transitions. [2021-11-23 01:45:20,523 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 497 transitions. [2021-11-23 01:45:20,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-23 01:45:20,524 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:45:20,524 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:45:20,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:45:20,689 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:45:23,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:45:23,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 231 states and 511 transitions. [2021-11-23 01:45:23,461 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 511 transitions. [2021-11-23 01:45:23,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-23 01:45:23,462 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:45:23,462 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:45:23,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:45:24,530 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:45:29,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:45:29,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 239 states and 532 transitions. [2021-11-23 01:45:29,675 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 532 transitions. [2021-11-23 01:45:29,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-23 01:45:29,676 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:45:29,677 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:45:29,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:45:29,775 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:45:30,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:45:30,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 240 states and 537 transitions. [2021-11-23 01:45:30,511 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 537 transitions. [2021-11-23 01:45:30,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-23 01:45:30,511 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:45:30,512 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:45:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:45:30,608 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:45:32,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:45:32,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 244 states and 549 transitions. [2021-11-23 01:45:32,999 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 549 transitions. [2021-11-23 01:45:33,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-23 01:45:33,000 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:45:33,000 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:45:33,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:45:34,638 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:45:43,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:45:43,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 265 states and 591 transitions. [2021-11-23 01:45:43,643 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 591 transitions. [2021-11-23 01:45:43,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-23 01:45:43,643 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:45:43,643 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:45:43,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:45:43,888 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:45:44,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:45:44,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 266 states and 595 transitions. [2021-11-23 01:45:44,838 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 595 transitions. [2021-11-23 01:45:44,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-23 01:45:44,839 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:45:44,840 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:45:44,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:45:45,078 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:45:47,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:45:47,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 270 states and 611 transitions. [2021-11-23 01:45:47,381 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 611 transitions. [2021-11-23 01:45:47,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-23 01:45:47,382 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:45:47,383 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:45:48,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 01:45:48,641 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 01:45:49,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 01:45:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 01:45:50,691 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 01:45:50,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 01:45:51,117 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 39 iterations. [2021-11-23 01:45:51,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 01:45:51 ImpRootNode [2021-11-23 01:45:51,366 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2021-11-23 01:45:51,367 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-23 01:45:51,367 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-23 01:45:51,367 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-23 01:45:51,368 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:43:56" (3/4) ... [2021-11-23 01:45:51,369 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-23 01:45:51,591 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e0cbdcc-5eb7-4f49-bf84-81cd2beb9f64/bin/ukojak-LBtLqBUTdQ/witness.graphml [2021-11-23 01:45:51,591 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-23 01:45:51,592 INFO L158 Benchmark]: Toolchain (without parser) took 117530.61ms. Allocated memory was 98.6MB in the beginning and 918.6MB in the end (delta: 820.0MB). Free memory was 57.5MB in the beginning and 665.6MB in the end (delta: -608.1MB). Peak memory consumption was 212.5MB. Max. memory is 16.1GB. [2021-11-23 01:45:51,593 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 98.6MB. Free memory was 74.5MB in the beginning and 74.5MB in the end (delta: 45.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 01:45:51,593 INFO L158 Benchmark]: CACSL2BoogieTranslator took 495.30ms. Allocated memory is still 98.6MB. Free memory was 57.2MB in the beginning and 68.4MB in the end (delta: -11.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-23 01:45:51,594 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.65ms. Allocated memory is still 98.6MB. Free memory was 68.4MB in the beginning and 65.2MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-23 01:45:51,594 INFO L158 Benchmark]: Boogie Preprocessor took 60.63ms. Allocated memory is still 98.6MB. Free memory was 65.2MB in the beginning and 62.7MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-23 01:45:51,595 INFO L158 Benchmark]: RCFGBuilder took 1365.45ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 62.7MB in the beginning and 61.2MB in the end (delta: 1.5MB). Peak memory consumption was 46.7MB. Max. memory is 16.1GB. [2021-11-23 01:45:51,595 INFO L158 Benchmark]: CodeCheck took 115293.00ms. Allocated memory was 119.5MB in the beginning and 918.6MB in the end (delta: 799.0MB). Free memory was 60.4MB in the beginning and 687.6MB in the end (delta: -627.2MB). Peak memory consumption was 172.6MB. Max. memory is 16.1GB. [2021-11-23 01:45:51,596 INFO L158 Benchmark]: Witness Printer took 224.56ms. Allocated memory is still 918.6MB. Free memory was 687.6MB in the beginning and 665.6MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2021-11-23 01:45:51,598 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: 115.0s, OverallIterations: 39, 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, 11310 SdHoareTripleChecker+Valid, 77.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10099 mSDsluCounter, 3769 SdHoareTripleChecker+Invalid, 67.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3161 mSDsCounter, 3483 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 31493 IncrementalHoareTripleChecker+Invalid, 34976 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3483 mSolverCounterUnsat, 608 mSDtfsCounter, 31493 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10412 GetRequests, 9030 SyntacticMatches, 542 SemanticMatches, 840 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409845 ImplicationChecksByTransitivity, 99.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 3.3s SatisfiabilityAnalysisTime, 13.6s InterpolantComputationTime, 1048 NumberOfCodeBlocks, 1048 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 962 ConstructedInterpolants, 0 QuantifiedInterpolants, 13964 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 10 PerfectInterpolantSequences, 104/564 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: 600]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L27] msg_t nomsg = (msg_t )-1; [L28] port_t p12 ; [L29] char p12_old ; [L30] char p12_new ; [L31] _Bool ep12 ; [L32] port_t p13 ; [L33] char p13_old ; [L34] char p13_new ; [L35] _Bool ep13 ; [L36] port_t p21 ; [L37] char p21_old ; [L38] char p21_new ; [L39] _Bool ep21 ; [L40] port_t p23 ; [L41] char p23_old ; [L42] char p23_new ; [L43] _Bool ep23 ; [L44] port_t p31 ; [L45] char p31_old ; [L46] char p31_new ; [L47] _Bool ep31 ; [L48] port_t p32 ; [L49] char p32_old ; [L50] char p32_new ; [L51] _Bool ep32 ; [L52] char id1 ; [L53] char r1 ; [L54] char st1 ; [L55] char nl1 ; [L56] char m1 ; [L57] char max1 ; [L58] _Bool mode1 ; [L59] _Bool newmax1 ; [L60] char id2 ; [L61] char r2 ; [L62] char st2 ; [L63] char nl2 ; [L64] char m2 ; [L65] char max2 ; [L66] _Bool mode2 ; [L67] _Bool newmax2 ; [L68] char id3 ; [L69] char r3 ; [L70] char st3 ; [L71] char nl3 ; [L72] char m3 ; [L73] char max3 ; [L74] _Bool mode3 ; [L75] _Bool newmax3 ; [L518] int c1 ; [L519] int i2 ; [L522] c1 = 0 [L523] ep12 = __VERIFIER_nondet_bool() [L524] ep13 = __VERIFIER_nondet_bool() [L525] ep21 = __VERIFIER_nondet_bool() [L526] ep23 = __VERIFIER_nondet_bool() [L527] ep31 = __VERIFIER_nondet_bool() [L528] ep32 = __VERIFIER_nondet_bool() [L529] id1 = __VERIFIER_nondet_char() [L530] r1 = __VERIFIER_nondet_char() [L531] st1 = __VERIFIER_nondet_char() [L532] nl1 = __VERIFIER_nondet_char() [L533] m1 = __VERIFIER_nondet_char() [L534] max1 = __VERIFIER_nondet_char() [L535] mode1 = __VERIFIER_nondet_bool() [L536] newmax1 = __VERIFIER_nondet_bool() [L537] id2 = __VERIFIER_nondet_char() [L538] r2 = __VERIFIER_nondet_char() [L539] st2 = __VERIFIER_nondet_char() [L540] nl2 = __VERIFIER_nondet_char() [L541] m2 = __VERIFIER_nondet_char() [L542] max2 = __VERIFIER_nondet_char() [L543] mode2 = __VERIFIER_nondet_bool() [L544] newmax2 = __VERIFIER_nondet_bool() [L545] id3 = __VERIFIER_nondet_char() [L546] r3 = __VERIFIER_nondet_char() [L547] st3 = __VERIFIER_nondet_char() [L548] nl3 = __VERIFIER_nondet_char() [L549] m3 = __VERIFIER_nondet_char() [L550] max3 = __VERIFIER_nondet_char() [L551] mode3 = __VERIFIER_nondet_bool() [L552] newmax3 = __VERIFIER_nondet_bool() [L553] CALL, EXPR init() [L231] _Bool r121 ; [L232] _Bool r131 ; [L233] _Bool r211 ; [L234] _Bool r231 ; [L235] _Bool r311 ; [L236] _Bool r321 ; [L237] _Bool r122 ; [L238] int tmp ; [L239] _Bool r132 ; [L240] int tmp___0 ; [L241] _Bool r212 ; [L242] int tmp___1 ; [L243] _Bool r232 ; [L244] int tmp___2 ; [L245] _Bool r312 ; [L246] int tmp___3 ; [L247] _Bool r322 ; [L248] int tmp___4 ; [L249] int tmp___5 ; [L252] r121 = ep12 [L253] r131 = ep13 [L254] r211 = ep21 [L255] r231 = ep23 [L256] r311 = ep31 [L257] r321 = ep32 [L258] COND TRUE \read(r121) [L259] tmp = 1 [L270] r122 = (_Bool )tmp [L271] COND TRUE \read(r131) [L272] tmp___0 = 1 [L283] r132 = (_Bool )tmp___0 [L284] COND TRUE \read(r211) [L285] tmp___1 = 1 [L296] r212 = (_Bool )tmp___1 [L297] COND FALSE !(\read(r231)) [L300] COND TRUE \read(r211) [L301] COND TRUE \read(ep13) [L302] tmp___2 = 1 [L309] r232 = (_Bool )tmp___2 [L310] COND FALSE !(\read(r311)) [L313] COND TRUE \read(r321) [L314] COND TRUE \read(ep21) [L315] tmp___3 = 1 [L322] r312 = (_Bool )tmp___3 [L323] COND TRUE \read(r321) [L324] tmp___4 = 1 [L335] r322 = (_Bool )tmp___4 [L336] COND TRUE (int )id1 != (int )id2 [L337] COND TRUE (int )id1 != (int )id3 [L338] COND TRUE (int )id2 != (int )id3 [L339] COND TRUE (int )id1 >= 0 [L340] COND TRUE (int )id2 >= 0 [L341] COND TRUE (int )id3 >= 0 [L342] COND TRUE (int )r1 == 0 [L343] COND TRUE (int )r2 == 0 [L344] COND TRUE (int )r3 == 0 [L345] COND TRUE \read(r122) [L346] COND TRUE \read(r132) [L347] COND TRUE \read(r212) [L348] COND TRUE \read(r232) [L349] COND TRUE \read(r312) [L350] COND TRUE \read(r322) [L351] COND TRUE (int )max1 == (int )id1 [L352] COND TRUE (int )max2 == (int )id2 [L353] COND TRUE (int )max3 == (int )id3 [L354] COND TRUE (int )st1 == 0 [L355] COND TRUE (int )st2 == 0 [L356] COND TRUE (int )st3 == 0 [L357] COND TRUE (int )nl1 == 0 [L358] COND TRUE (int )nl2 == 0 [L359] COND TRUE (int )nl3 == 0 [L360] COND TRUE (int )mode1 == 0 [L361] COND TRUE (int )mode2 == 0 [L362] COND TRUE (int )mode3 == 0 [L363] COND TRUE \read(newmax1) [L364] COND TRUE \read(newmax2) [L365] COND TRUE \read(newmax3) [L366] tmp___5 = 1 [L457] return (tmp___5); [L553] RET, EXPR init() [L553] i2 = init() [L554] CALL assume_abort_if_not(i2) [L21] COND FALSE !(!cond) [L554] RET assume_abort_if_not(i2) [L555] p12_old = nomsg [L556] p12_new = nomsg [L557] p13_old = nomsg [L558] p13_new = nomsg [L559] p21_old = nomsg [L560] p21_new = nomsg [L561] p23_old = nomsg [L562] p23_new = nomsg [L563] p31_old = nomsg [L564] p31_new = nomsg [L565] p32_old = nomsg [L566] p32_new = nomsg [L567] i2 = 0 VAL [c1=0, ep12=1, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, i2=0, id1=0, id2=3, id3=1, m1=4, m2=2, m3=-2, max1=0, max2=3, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L568] COND TRUE i2 < 6 [L570] CALL node1() [L78] _Bool newmax ; [L81] newmax = (_Bool)0 [L82] COND FALSE !(\read(mode1)) [L110] COND TRUE (int )r1 < 1 [L111] COND TRUE \read(ep12) [L112] COND TRUE \read(newmax1) [L113] EXPR max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L113] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L116] COND TRUE \read(ep13) [L117] COND TRUE \read(newmax1) [L118] EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L118] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L122] mode1 = (_Bool)1 [L570] RET node1() [L571] CALL node2() [L129] _Bool newmax ; [L132] newmax = (_Bool)0 [L133] COND FALSE !(\read(mode2)) [L161] COND TRUE (int )r2 < 2 [L162] COND TRUE \read(ep21) [L163] COND TRUE \read(newmax2) [L164] EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L164] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L167] COND FALSE !(\read(ep23)) [L173] mode2 = (_Bool)1 [L571] RET node2() [L572] CALL node3() [L180] _Bool newmax ; [L183] newmax = (_Bool)0 [L184] COND FALSE !(\read(mode3)) [L212] COND TRUE (int )r3 < 2 [L213] COND FALSE !(\read(ep31)) [L218] COND TRUE \read(ep32) [L219] COND TRUE \read(newmax3) [L220] EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L220] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L224] mode3 = (_Bool)1 [L572] RET node3() [L573] p12_old = p12_new [L574] p12_new = nomsg [L575] p13_old = p13_new [L576] p13_new = nomsg [L577] p21_old = p21_new [L578] p21_new = nomsg [L579] p23_old = p23_new [L580] p23_new = nomsg [L581] p31_old = p31_new [L582] p31_new = nomsg [L583] p32_old = p32_new [L584] p32_new = nomsg [L585] CALL, EXPR check() [L462] int tmp ; VAL [ep12=1, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=0, id2=3, id3=1, m1=4, m2=2, m3=-2, max1=0, max2=3, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=3, 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] [L465] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=0, id2=3, id3=1, m1=4, m2=2, m3=-2, max1=0, max2=3, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=3, 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] [L466] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=0, id2=3, id3=1, m1=4, m2=2, m3=-2, max1=0, max2=3, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=3, 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] [L467] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=0, id2=3, id3=1, m1=4, m2=2, m3=-2, max1=0, max2=3, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=3, 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] [L468] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=0, id2=3, id3=1, m1=4, m2=2, m3=-2, max1=0, max2=3, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=3, 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] [L469] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=0, id2=3, id3=1, m1=4, m2=2, m3=-2, max1=0, max2=3, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=3, 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] [L472] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=0, id2=3, id3=1, m1=4, m2=2, m3=-2, max1=0, max2=3, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=3, 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] [L474] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=0, id2=3, id3=1, m1=4, m2=2, m3=-2, max1=0, max2=3, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=3, 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] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=0, id2=3, id3=1, m1=4, m2=2, m3=-2, max1=0, max2=3, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=3, 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] [L482] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=0, id2=3, id3=1, m1=4, m2=2, m3=-2, max1=0, max2=3, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 [L485] tmp = 1 VAL [ep12=1, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=0, id2=3, id3=1, m1=4, m2=2, m3=-2, max1=0, max2=3, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=3, 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, tmp=1] [L513] return (tmp); [L585] RET, EXPR check() [L585] c1 = check() [L586] CALL assert(c1) [L598] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=1, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=0, id2=3, id3=1, m1=4, m2=2, m3=-2, max1=0, max2=3, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=3, 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] [L586] RET assert(c1) [L587] i2 ++ VAL [c1=1, ep12=1, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, i2=1, id1=0, id2=3, id3=1, m1=4, m2=2, m3=-2, max1=0, max2=3, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=3, 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] [L568] COND TRUE i2 < 6 [L570] CALL node1() [L78] _Bool newmax ; [L81] newmax = (_Bool)0 [L82] COND TRUE \read(mode1) [L83] r1 = (char )((int )r1 + 1) [L84] COND TRUE \read(ep21) [L85] m1 = p21_old [L86] p21_old = nomsg [L87] COND TRUE (int )m1 > (int )max1 [L88] max1 = m1 [L89] newmax = (_Bool)1 [L92] COND FALSE !(\read(ep31)) [L100] newmax1 = newmax [L101] COND FALSE !((int )r1 == 2) [L108] mode1 = (_Bool)0 [L570] RET node1() [L571] CALL node2() [L129] _Bool newmax ; [L132] newmax = (_Bool)0 [L133] COND TRUE \read(mode2) [L134] r2 = (char )((int )r2 + 1) [L135] COND TRUE \read(ep12) [L136] m2 = p12_old [L137] p12_old = nomsg [L138] COND FALSE !((int )m2 > (int )max2) [L143] COND TRUE \read(ep32) [L144] m2 = p32_old [L145] p32_old = nomsg [L146] COND FALSE !((int )m2 > (int )max2) [L151] newmax2 = newmax [L152] COND FALSE !((int )r2 == 2) [L159] mode2 = (_Bool)0 [L571] RET node2() [L572] CALL node3() [L180] _Bool newmax ; [L183] newmax = (_Bool)0 [L184] COND TRUE \read(mode3) [L185] r3 = (char )((int )r3 + 1) [L186] COND TRUE \read(ep13) [L187] m3 = p13_old [L188] p13_old = nomsg [L189] COND FALSE !((int )m3 > (int )max3) [L194] COND FALSE !(\read(ep23)) [L202] newmax3 = newmax [L203] COND FALSE !((int )r3 == 2) [L210] mode3 = (_Bool)0 [L572] RET node3() [L573] p12_old = p12_new [L574] p12_new = nomsg [L575] p13_old = p13_new [L576] p13_new = nomsg [L577] p21_old = p21_new [L578] p21_new = nomsg [L579] p23_old = p23_new [L580] p23_new = nomsg [L581] p31_old = p31_new [L582] p31_new = nomsg [L583] p32_old = p32_new [L584] p32_new = nomsg [L585] CALL, EXPR check() [L462] int tmp ; VAL [ep12=1, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=0, id2=3, id3=1, m1=3, m2=1, m3=0, max1=3, max2=3, max3=1, 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] [L465] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=0, id2=3, id3=1, m1=3, m2=1, m3=0, max1=3, max2=3, max3=1, 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] [L466] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=0, id2=3, id3=1, m1=3, m2=1, m3=0, max1=3, max2=3, max3=1, 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] [L467] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=0, id2=3, id3=1, m1=3, m2=1, m3=0, max1=3, max2=3, max3=1, 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] [L468] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=0, id2=3, id3=1, m1=3, m2=1, m3=0, max1=3, max2=3, max3=1, 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] [L469] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=0, id2=3, id3=1, m1=3, m2=1, m3=0, max1=3, max2=3, max3=1, 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] [L472] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=0, id2=3, id3=1, m1=3, m2=1, m3=0, max1=3, max2=3, max3=1, 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] [L474] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=0, id2=3, id3=1, m1=3, m2=1, m3=0, max1=3, max2=3, max3=1, 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=1, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=0, id2=3, id3=1, m1=3, m2=1, m3=0, max1=3, max2=3, max3=1, 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 )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=0, id2=3, id3=1, m1=3, m2=1, m3=0, max1=3, max2=3, max3=1, 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 [L485] tmp = 1 VAL [ep12=1, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=0, id2=3, id3=1, m1=3, m2=1, m3=0, max1=3, max2=3, max3=1, 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] [L513] return (tmp); [L585] RET, EXPR check() [L585] c1 = check() [L586] CALL assert(c1) [L598] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=1, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=0, id2=3, id3=1, m1=3, m2=1, m3=0, max1=3, max2=3, max3=1, 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] [L586] RET assert(c1) [L587] i2 ++ VAL [c1=1, ep12=1, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, i2=2, id1=0, id2=3, id3=1, m1=3, m2=1, m3=0, max1=3, max2=3, max3=1, 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] [L568] COND TRUE i2 < 6 [L570] CALL node1() [L78] _Bool newmax ; [L81] newmax = (_Bool)0 [L82] COND FALSE !(\read(mode1)) [L110] COND FALSE !((int )r1 < 1) [L122] mode1 = (_Bool)1 [L570] RET node1() [L571] CALL node2() [L129] _Bool newmax ; [L132] newmax = (_Bool)0 [L133] COND FALSE !(\read(mode2)) [L161] COND TRUE (int )r2 < 2 [L162] COND TRUE \read(ep21) [L163] COND FALSE !(\read(newmax2)) [L167] COND FALSE !(\read(ep23)) [L173] mode2 = (_Bool)1 [L571] RET node2() [L572] CALL node3() [L180] _Bool newmax ; [L183] newmax = (_Bool)0 [L184] COND FALSE !(\read(mode3)) [L212] COND TRUE (int )r3 < 2 [L213] COND FALSE !(\read(ep31)) [L218] COND TRUE \read(ep32) [L219] COND FALSE !(\read(newmax3)) [L224] mode3 = (_Bool)1 [L572] RET node3() [L573] p12_old = p12_new [L574] p12_new = nomsg [L575] p13_old = p13_new [L576] p13_new = nomsg [L577] p21_old = p21_new [L578] p21_new = nomsg [L579] p23_old = p23_new [L580] p23_new = nomsg [L581] p31_old = p31_new [L582] p31_new = nomsg [L583] p32_old = p32_new [L584] p32_new = nomsg [L585] CALL, EXPR check() [L462] int tmp ; VAL [ep12=1, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=0, id2=3, id3=1, m1=3, m2=1, m3=0, max1=3, max2=3, max3=1, 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] [L465] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=0, id2=3, id3=1, m1=3, m2=1, m3=0, max1=3, max2=3, max3=1, 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] [L466] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=0, id2=3, id3=1, m1=3, m2=1, m3=0, max1=3, max2=3, max3=1, 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] [L467] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=0, id2=3, id3=1, m1=3, m2=1, m3=0, max1=3, max2=3, max3=1, 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] [L468] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=0, id2=3, id3=1, m1=3, m2=1, m3=0, max1=3, max2=3, max3=1, 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] [L469] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=0, id2=3, id3=1, m1=3, m2=1, m3=0, max1=3, max2=3, max3=1, 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] [L472] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=0, id2=3, id3=1, m1=3, m2=1, m3=0, max1=3, max2=3, max3=1, 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] [L474] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=0, id2=3, id3=1, m1=3, m2=1, m3=0, max1=3, max2=3, max3=1, 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=1, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=0, id2=3, id3=1, m1=3, m2=1, m3=0, max1=3, max2=3, max3=1, 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 )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=0, id2=3, id3=1, m1=3, m2=1, m3=0, max1=3, max2=3, max3=1, 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 [L485] tmp = 1 VAL [ep12=1, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=0, id2=3, id3=1, m1=3, m2=1, m3=0, max1=3, max2=3, max3=1, 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] [L513] return (tmp); [L585] RET, EXPR check() [L585] c1 = check() [L586] CALL assert(c1) [L598] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=1, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=0, id2=3, id3=1, m1=3, m2=1, m3=0, max1=3, max2=3, max3=1, 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] [L586] RET assert(c1) [L587] i2 ++ VAL [c1=1, ep12=1, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, i2=3, id1=0, id2=3, id3=1, m1=3, m2=1, m3=0, max1=3, max2=3, max3=1, 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] [L568] COND TRUE i2 < 6 [L570] CALL node1() [L78] _Bool newmax ; [L81] newmax = (_Bool)0 [L82] COND TRUE \read(mode1) [L83] r1 = (char )((int )r1 + 1) [L84] COND TRUE \read(ep21) [L85] m1 = p21_old [L86] p21_old = nomsg [L87] COND FALSE !((int )m1 > (int )max1) [L92] COND FALSE !(\read(ep31)) [L100] newmax1 = newmax [L101] COND TRUE (int )r1 == 2 [L102] COND FALSE !((int )max1 == (int )id1) [L105] nl1 = (char)1 [L108] mode1 = (_Bool)0 [L570] RET node1() [L571] CALL node2() [L129] _Bool newmax ; [L132] newmax = (_Bool)0 [L133] COND TRUE \read(mode2) [L134] r2 = (char )((int )r2 + 1) [L135] COND TRUE \read(ep12) [L136] m2 = p12_old [L137] p12_old = nomsg [L138] COND FALSE !((int )m2 > (int )max2) [L143] COND TRUE \read(ep32) [L144] m2 = p32_old [L145] p32_old = nomsg [L146] COND FALSE !((int )m2 > (int )max2) [L151] newmax2 = newmax [L152] COND TRUE (int )r2 == 2 [L153] COND TRUE (int )max2 == (int )id2 [L154] st2 = (char)1 [L159] mode2 = (_Bool)0 [L571] RET node2() [L572] CALL node3() [L180] _Bool newmax ; [L183] newmax = (_Bool)0 [L184] COND TRUE \read(mode3) [L185] r3 = (char )((int )r3 + 1) [L186] COND TRUE \read(ep13) [L187] m3 = p13_old [L188] p13_old = nomsg [L189] COND FALSE !((int )m3 > (int )max3) [L194] COND FALSE !(\read(ep23)) [L202] newmax3 = newmax [L203] COND TRUE (int )r3 == 2 [L204] COND TRUE (int )max3 == (int )id3 [L205] st3 = (char)1 [L210] mode3 = (_Bool)0 [L572] RET node3() [L573] p12_old = p12_new [L574] p12_new = nomsg [L575] p13_old = p13_new [L576] p13_new = nomsg [L577] p21_old = p21_new [L578] p21_new = nomsg [L579] p23_old = p23_new [L580] p23_new = nomsg [L581] p31_old = p31_new [L582] p31_new = nomsg [L583] p32_old = p32_new [L584] p32_new = nomsg [L585] CALL, EXPR check() [L462] int tmp ; VAL [ep12=1, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=0, id2=3, id3=1, m1=-1, m2=-1, m3=-1, max1=3, max2=3, max3=1, 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] [L465] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L511] tmp = 0 VAL [ep12=1, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=0, id2=3, id3=1, m1=-1, m2=-1, m3=-1, max1=3, max2=3, max3=1, 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] [L513] return (tmp); [L585] RET, EXPR check() [L585] c1 = check() [L586] CALL assert(c1) [L598] COND TRUE ! arg VAL [\old(arg)=0, arg=0, ep12=1, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=0, id2=3, id3=1, m1=-1, m2=-1, m3=-1, max1=3, max2=3, max3=1, 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] [L600] reach_error() VAL [\old(arg)=0, arg=0, ep12=1, ep13=1, ep21=255, ep23=0, ep31=0, ep32=255, id1=0, id2=3, id3=1, m1=-1, m2=-1, m3=-1, max1=3, max2=3, max3=1, 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.31ms. Allocated memory is still 98.6MB. Free memory was 74.5MB in the beginning and 74.5MB in the end (delta: 45.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 495.30ms. Allocated memory is still 98.6MB. Free memory was 57.2MB in the beginning and 68.4MB in the end (delta: -11.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.65ms. Allocated memory is still 98.6MB. Free memory was 68.4MB in the beginning and 65.2MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.63ms. Allocated memory is still 98.6MB. Free memory was 65.2MB in the beginning and 62.7MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1365.45ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 62.7MB in the beginning and 61.2MB in the end (delta: 1.5MB). Peak memory consumption was 46.7MB. Max. memory is 16.1GB. * CodeCheck took 115293.00ms. Allocated memory was 119.5MB in the beginning and 918.6MB in the end (delta: 799.0MB). Free memory was 60.4MB in the beginning and 687.6MB in the end (delta: -627.2MB). Peak memory consumption was 172.6MB. Max. memory is 16.1GB. * Witness Printer took 224.56ms. Allocated memory is still 918.6MB. Free memory was 687.6MB in the beginning and 665.6MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2021-11-23 01:45:51,638 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e0cbdcc-5eb7-4f49-bf84-81cd2beb9f64/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