./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b73238e7-82a8-4569-989d-31386e65a4b3/bin/ukojak-fKGseLULKY/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b73238e7-82a8-4569-989d-31386e65a4b3/bin/ukojak-fKGseLULKY/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b73238e7-82a8-4569-989d-31386e65a4b3/bin/ukojak-fKGseLULKY/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b73238e7-82a8-4569-989d-31386e65a4b3/bin/ukojak-fKGseLULKY/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b73238e7-82a8-4569-989d-31386e65a4b3/bin/ukojak-fKGseLULKY/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b73238e7-82a8-4569-989d-31386e65a4b3/bin/ukojak-fKGseLULKY --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 b739021e30f97b7f6c12f1e65d06881bd6d44857 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 04:50:01,961 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 04:50:01,963 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 04:50:02,016 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 04:50:02,017 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 04:50:02,021 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 04:50:02,023 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 04:50:02,028 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 04:50:02,030 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 04:50:02,038 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 04:50:02,039 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 04:50:02,041 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 04:50:02,042 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 04:50:02,045 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 04:50:02,048 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 04:50:02,053 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 04:50:02,056 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 04:50:02,057 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 04:50:02,061 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 04:50:02,066 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 04:50:02,070 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 04:50:02,071 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 04:50:02,075 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 04:50:02,076 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 04:50:02,083 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 04:50:02,083 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 04:50:02,083 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 04:50:02,086 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 04:50:02,086 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 04:50:02,088 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 04:50:02,089 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 04:50:02,090 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 04:50:02,092 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 04:50:02,093 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 04:50:02,095 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 04:50:02,095 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 04:50:02,096 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 04:50:02,096 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 04:50:02,097 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 04:50:02,098 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 04:50:02,098 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 04:50:02,102 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b73238e7-82a8-4569-989d-31386e65a4b3/bin/ukojak-fKGseLULKY/config/svcomp-Reach-32bit-Kojak_Default.epf [2021-10-13 04:50:02,147 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 04:50:02,148 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 04:50:02,150 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-13 04:50:02,150 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2021-10-13 04:50:02,150 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 04:50:02,151 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 04:50:02,151 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 04:50:02,151 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 04:50:02,151 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 04:50:02,155 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 04:50:02,156 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 04:50:02,156 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 04:50:02,156 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 04:50:02,156 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 04:50:02,157 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 04:50:02,157 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 04:50:02,157 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 04:50:02,157 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 04:50:02,158 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2021-10-13 04:50:02,158 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2021-10-13 04:50:02,158 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 04:50:02,158 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-10-13 04:50:02,159 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 04:50:02,159 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 04:50:02,159 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 04:50:02,159 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2021-10-13 04:50:02,159 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 04:50:02,160 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 04:50:02,160 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_b73238e7-82a8-4569-989d-31386e65a4b3/bin/ukojak-fKGseLULKY/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_b73238e7-82a8-4569-989d-31386e65a4b3/bin/ukojak-fKGseLULKY 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 -> b739021e30f97b7f6c12f1e65d06881bd6d44857 [2021-10-13 04:50:02,449 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 04:50:02,478 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 04:50:02,481 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 04:50:02,482 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 04:50:02,483 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 04:50:02,484 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b73238e7-82a8-4569-989d-31386e65a4b3/bin/ukojak-fKGseLULKY/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c [2021-10-13 04:50:02,558 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b73238e7-82a8-4569-989d-31386e65a4b3/bin/ukojak-fKGseLULKY/data/96acc361e/a0072a2dae85417e94efffd7835b4ad8/FLAG75602d0c6 [2021-10-13 04:50:03,024 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 04:50:03,030 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b73238e7-82a8-4569-989d-31386e65a4b3/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c [2021-10-13 04:50:03,040 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b73238e7-82a8-4569-989d-31386e65a4b3/bin/ukojak-fKGseLULKY/data/96acc361e/a0072a2dae85417e94efffd7835b4ad8/FLAG75602d0c6 [2021-10-13 04:50:03,355 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b73238e7-82a8-4569-989d-31386e65a4b3/bin/ukojak-fKGseLULKY/data/96acc361e/a0072a2dae85417e94efffd7835b4ad8 [2021-10-13 04:50:03,358 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 04:50:03,359 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 04:50:03,364 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 04:50:03,365 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 04:50:03,369 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 04:50:03,369 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:50:03" (1/1) ... [2021-10-13 04:50:03,374 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@493835d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:50:03, skipping insertion in model container [2021-10-13 04:50:03,376 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:50:03" (1/1) ... [2021-10-13 04:50:03,383 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 04:50:03,423 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 04:50:03,671 WARN L228 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_b73238e7-82a8-4569-989d-31386e65a4b3/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c[14511,14524] [2021-10-13 04:50:03,674 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 04:50:03,684 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 04:50:03,746 WARN L228 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_b73238e7-82a8-4569-989d-31386e65a4b3/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c[14511,14524] [2021-10-13 04:50:03,746 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 04:50:03,762 INFO L208 MainTranslator]: Completed translation [2021-10-13 04:50:03,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:50:03 WrapperNode [2021-10-13 04:50:03,763 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 04:50:03,764 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 04:50:03,764 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 04:50:03,764 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 04:50:03,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:50:03" (1/1) ... [2021-10-13 04:50:03,784 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:50:03" (1/1) ... [2021-10-13 04:50:03,825 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 04:50:03,826 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 04:50:03,826 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 04:50:03,827 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 04:50:03,834 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:50:03" (1/1) ... [2021-10-13 04:50:03,835 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:50:03" (1/1) ... [2021-10-13 04:50:03,839 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:50:03" (1/1) ... [2021-10-13 04:50:03,840 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:50:03" (1/1) ... [2021-10-13 04:50:03,850 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:50:03" (1/1) ... [2021-10-13 04:50:03,859 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:50:03" (1/1) ... [2021-10-13 04:50:03,862 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:50:03" (1/1) ... [2021-10-13 04:50:03,868 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 04:50:03,869 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 04:50:03,870 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 04:50:03,870 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 04:50:03,871 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:50:03" (1/1) ... [2021-10-13 04:50:03,878 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-10-13 04:50:03,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b73238e7-82a8-4569-989d-31386e65a4b3/bin/ukojak-fKGseLULKY/z3 [2021-10-13 04:50:03,944 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b73238e7-82a8-4569-989d-31386e65a4b3/bin/ukojak-fKGseLULKY/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2021-10-13 04:50:04,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b73238e7-82a8-4569-989d-31386e65a4b3/bin/ukojak-fKGseLULKY/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2021-10-13 04:50:04,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 04:50:04,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 04:50:04,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 04:50:04,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 04:50:06,802 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 04:50:06,802 INFO L299 CfgBuilder]: Removed 19 assume(true) statements. [2021-10-13 04:50:06,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:50:06 BoogieIcfgContainer [2021-10-13 04:50:06,805 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 04:50:06,806 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2021-10-13 04:50:06,806 INFO L271 PluginConnector]: Initializing CodeCheck... [2021-10-13 04:50:06,816 INFO L275 PluginConnector]: CodeCheck initialized [2021-10-13 04:50:06,817 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:50:06" (1/1) ... [2021-10-13 04:50:06,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 04:50:06,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-13 04:50:06,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 18 states and 29 transitions. [2021-10-13 04:50:06,869 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 29 transitions. [2021-10-13 04:50:06,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-13 04:50:06,872 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-13 04:50:06,874 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 04:50:07,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 04:50:07,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 04:50:07,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-13 04:50:07,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 19 states and 31 transitions. [2021-10-13 04:50:07,817 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 31 transitions. [2021-10-13 04:50:07,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-13 04:50:07,818 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-13 04:50:07,818 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 04:50:08,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 04:50:08,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 04:50:08,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-13 04:50:08,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 22 states and 37 transitions. [2021-10-13 04:50:08,478 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 37 transitions. [2021-10-13 04:50:08,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-13 04:50:08,481 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-13 04:50:08,481 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 04:50:08,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 04:50:08,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 04:50:09,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-13 04:50:09,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 26 states and 45 transitions. [2021-10-13 04:50:09,215 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 45 transitions. [2021-10-13 04:50:09,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-13 04:50:09,216 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-13 04:50:09,216 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 04:50:09,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 04:50:09,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 04:50:10,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-13 04:50:10,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 31 states and 55 transitions. [2021-10-13 04:50:10,105 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 55 transitions. [2021-10-13 04:50:10,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-13 04:50:10,106 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-13 04:50:10,106 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 04:50:10,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 04:50:10,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 04:50:11,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-13 04:50:11,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 38 states and 67 transitions. [2021-10-13 04:50:11,312 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 67 transitions. [2021-10-13 04:50:11,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-13 04:50:11,313 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-13 04:50:11,313 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 04:50:11,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 04:50:11,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 04:50:12,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-13 04:50:12,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 44 states and 78 transitions. [2021-10-13 04:50:12,562 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 78 transitions. [2021-10-13 04:50:12,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-13 04:50:12,563 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-13 04:50:12,564 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 04:50:12,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 04:50:12,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 04:50:12,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-13 04:50:12,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 45 states and 78 transitions. [2021-10-13 04:50:12,902 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 78 transitions. [2021-10-13 04:50:12,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-13 04:50:12,902 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-13 04:50:12,903 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 04:50:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 04:50:12,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 04:50:13,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-13 04:50:13,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 46 states and 79 transitions. [2021-10-13 04:50:13,022 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 79 transitions. [2021-10-13 04:50:13,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-13 04:50:13,023 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-13 04:50:13,023 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 04:50:13,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 04:50:13,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 04:50:14,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-13 04:50:14,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 56 states and 95 transitions. [2021-10-13 04:50:14,993 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 95 transitions. [2021-10-13 04:50:14,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-13 04:50:14,994 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-13 04:50:14,994 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 04:50:15,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 04:50:15,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 04:50:15,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-13 04:50:15,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 59 states and 107 transitions. [2021-10-13 04:50:15,408 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 107 transitions. [2021-10-13 04:50:15,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-13 04:50:15,409 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-13 04:50:15,409 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 04:50:15,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 04:50:16,221 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 04:50:20,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-13 04:50:20,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 74 states and 136 transitions. [2021-10-13 04:50:20,177 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 136 transitions. [2021-10-13 04:50:20,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-13 04:50:20,178 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-13 04:50:20,178 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 04:50:20,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 04:50:20,825 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 04:50:24,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-13 04:50:24,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 87 states and 158 transitions. [2021-10-13 04:50:24,430 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 158 transitions. [2021-10-13 04:50:24,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 04:50:24,431 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-13 04:50:24,432 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 04:50:24,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 04:50:25,428 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 04:50:30,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-13 04:50:30,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 104 states and 187 transitions. [2021-10-13 04:50:30,293 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 187 transitions. [2021-10-13 04:50:30,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-13 04:50:30,295 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-13 04:50:30,295 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 04:50:30,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 04:50:30,866 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 04:50:35,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-13 04:50:35,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 122 states and 217 transitions. [2021-10-13 04:50:35,678 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 217 transitions. [2021-10-13 04:50:35,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-13 04:50:35,680 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-13 04:50:35,680 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 04:50:35,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 04:50:36,751 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 04:50:41,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-13 04:50:41,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 129 states and 230 transitions. [2021-10-13 04:50:41,252 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 230 transitions. [2021-10-13 04:50:41,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-13 04:50:41,254 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-13 04:50:41,254 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 04:50:41,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 04:50:41,702 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 04:50:43,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-13 04:50:43,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 134 states and 239 transitions. [2021-10-13 04:50:43,487 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 239 transitions. [2021-10-13 04:50:43,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-13 04:50:43,488 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-13 04:50:43,488 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 04:50:43,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 04:50:44,496 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 04:50:48,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-13 04:50:48,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 141 states and 254 transitions. [2021-10-13 04:50:48,392 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 254 transitions. [2021-10-13 04:50:48,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-13 04:50:48,394 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-13 04:50:48,394 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 04:50:48,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 04:50:49,582 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 04:50:54,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-13 04:50:54,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 153 states and 282 transitions. [2021-10-13 04:50:54,268 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 282 transitions. [2021-10-13 04:50:54,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-13 04:50:54,269 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-13 04:50:54,270 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 04:50:54,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 04:50:55,497 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 04:51:00,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-13 04:51:00,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 164 states and 302 transitions. [2021-10-13 04:51:00,450 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 302 transitions. [2021-10-13 04:51:00,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-13 04:51:00,451 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-13 04:51:00,451 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 04:51:00,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 04:51:01,528 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 04:51:05,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-13 04:51:05,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 173 states and 318 transitions. [2021-10-13 04:51:05,691 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 318 transitions. [2021-10-13 04:51:05,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-13 04:51:05,692 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-13 04:51:05,693 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 04:51:06,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 04:51:06,127 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 04:51:07,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-13 04:51:07,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 176 states and 327 transitions. [2021-10-13 04:51:07,505 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 327 transitions. [2021-10-13 04:51:07,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-13 04:51:07,506 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-13 04:51:07,506 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 04:51:07,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 04:51:08,696 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 04:51:12,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-13 04:51:12,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 184 states and 342 transitions. [2021-10-13 04:51:12,806 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 342 transitions. [2021-10-13 04:51:12,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-13 04:51:12,806 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-13 04:51:12,807 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 04:51:13,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 04:51:13,324 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 04:51:15,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-13 04:51:15,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 188 states and 354 transitions. [2021-10-13 04:51:15,531 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 354 transitions. [2021-10-13 04:51:15,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-13 04:51:15,532 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-13 04:51:15,532 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 04:51:15,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 04:51:15,943 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 04:51:17,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-13 04:51:17,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 191 states and 363 transitions. [2021-10-13 04:51:17,452 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 363 transitions. [2021-10-13 04:51:17,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-13 04:51:17,453 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-13 04:51:17,453 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 04:51:18,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 04:51:19,856 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 04:51:23,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-13 04:51:23,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 193 states and 369 transitions. [2021-10-13 04:51:23,292 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 369 transitions. [2021-10-13 04:51:23,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-13 04:51:23,293 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-13 04:51:23,293 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 04:51:23,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 04:51:24,217 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 04:51:26,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-13 04:51:26,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 196 states and 381 transitions. [2021-10-13 04:51:26,060 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 381 transitions. [2021-10-13 04:51:26,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-13 04:51:26,061 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-13 04:51:26,062 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 04:51:26,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 04:51:26,909 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 04:51:30,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-13 04:51:30,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 201 states and 394 transitions. [2021-10-13 04:51:30,099 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 394 transitions. [2021-10-13 04:51:30,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-13 04:51:30,100 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-13 04:51:30,100 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 04:51:30,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 04:51:31,026 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 04:51:33,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-13 04:51:33,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 205 states and 405 transitions. [2021-10-13 04:51:33,709 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 405 transitions. [2021-10-13 04:51:33,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-13 04:51:33,709 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-13 04:51:33,709 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 04:51:33,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 04:51:34,839 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 04:51:38,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-13 04:51:38,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 213 states and 420 transitions. [2021-10-13 04:51:38,752 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 420 transitions. [2021-10-13 04:51:38,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-13 04:51:38,753 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-13 04:51:38,754 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 04:51:39,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 04:51:39,353 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 04:51:41,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-13 04:51:41,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 217 states and 430 transitions. [2021-10-13 04:51:41,799 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 430 transitions. [2021-10-13 04:51:41,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-13 04:51:41,800 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-13 04:51:41,800 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 04:51:42,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 04:51:42,170 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 04:51:44,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-13 04:51:44,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 220 states and 440 transitions. [2021-10-13 04:51:44,137 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 440 transitions. [2021-10-13 04:51:44,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-13 04:51:44,138 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-13 04:51:44,139 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 04:51:44,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 04:51:44,504 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 04:51:45,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-13 04:51:45,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 222 states and 442 transitions. [2021-10-13 04:51:45,912 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 442 transitions. [2021-10-13 04:51:45,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-13 04:51:45,913 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-13 04:51:45,913 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 04:51:46,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 04:51:46,450 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 04:51:48,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-13 04:51:48,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 225 states and 449 transitions. [2021-10-13 04:51:48,372 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 449 transitions. [2021-10-13 04:51:48,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-13 04:51:48,373 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-13 04:51:48,373 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 04:51:48,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 04:51:50,507 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 04:51:55,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-13 04:51:55,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 229 states and 465 transitions. [2021-10-13 04:51:55,675 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 465 transitions. [2021-10-13 04:51:55,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-13 04:51:55,676 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-13 04:51:55,676 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 04:51:56,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 04:51:56,545 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 04:51:59,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-13 04:51:59,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 234 states and 477 transitions. [2021-10-13 04:51:59,838 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 477 transitions. [2021-10-13 04:51:59,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-13 04:51:59,840 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-13 04:51:59,840 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 04:52:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 04:52:00,416 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 04:52:01,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-13 04:52:01,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 235 states and 479 transitions. [2021-10-13 04:52:01,107 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 479 transitions. [2021-10-13 04:52:01,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-13 04:52:01,108 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-13 04:52:01,108 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 04:52:01,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 04:52:01,697 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 04:52:02,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-13 04:52:02,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 236 states and 480 transitions. [2021-10-13 04:52:02,488 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 480 transitions. [2021-10-13 04:52:02,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-13 04:52:02,489 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-13 04:52:02,489 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 04:52:02,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 04:52:03,029 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 04:52:04,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-13 04:52:04,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 239 states and 488 transitions. [2021-10-13 04:52:04,626 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 488 transitions. [2021-10-13 04:52:04,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-10-13 04:52:04,626 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-13 04:52:04,627 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 04:52:05,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 04:52:05,253 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 04:52:06,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 04:52:06,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 04:52:06,261 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 04:52:06,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 04:52:06,626 WARN L480 CodeCheckObserver]: This program is UNSAFE, Check terminated with 39 iterations. [2021-10-13 04:52:06,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.10 04:52:06 ImpRootNode [2021-10-13 04:52:06,916 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2021-10-13 04:52:06,916 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 04:52:06,916 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 04:52:06,917 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 04:52:06,917 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:50:06" (3/4) ... [2021-10-13 04:52:06,919 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-13 04:52:07,163 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b73238e7-82a8-4569-989d-31386e65a4b3/bin/ukojak-fKGseLULKY/witness.graphml [2021-10-13 04:52:07,163 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 04:52:07,165 INFO L168 Benchmark]: Toolchain (without parser) took 123804.94 ms. Allocated memory was 109.1 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 69.3 MB in the beginning and 394.7 MB in the end (delta: -325.5 MB). Peak memory consumption was 758.4 MB. Max. memory is 16.1 GB. [2021-10-13 04:52:07,166 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 109.1 MB. Free memory is still 86.0 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 04:52:07,166 INFO L168 Benchmark]: CACSL2BoogieTranslator took 399.45 ms. Allocated memory is still 109.1 MB. Free memory was 69.1 MB in the beginning and 78.1 MB in the end (delta: -9.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-13 04:52:07,167 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.83 ms. Allocated memory is still 109.1 MB. Free memory was 78.1 MB in the beginning and 74.8 MB in the end (delta: 3.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-13 04:52:07,167 INFO L168 Benchmark]: Boogie Preprocessor took 42.31 ms. Allocated memory is still 109.1 MB. Free memory was 74.8 MB in the beginning and 72.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 04:52:07,167 INFO L168 Benchmark]: RCFGBuilder took 2936.06 ms. Allocated memory was 109.1 MB in the beginning and 138.4 MB in the end (delta: 29.4 MB). Free memory was 72.2 MB in the beginning and 59.9 MB in the end (delta: 12.3 MB). Peak memory consumption was 66.5 MB. Max. memory is 16.1 GB. [2021-10-13 04:52:07,168 INFO L168 Benchmark]: CodeCheck took 120109.72 ms. Allocated memory was 138.4 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 59.9 MB in the beginning and 416.8 MB in the end (delta: -356.8 MB). Peak memory consumption was 699.1 MB. Max. memory is 16.1 GB. [2021-10-13 04:52:07,168 INFO L168 Benchmark]: Witness Printer took 247.35 ms. Allocated memory is still 1.2 GB. Free memory was 416.8 MB in the beginning and 394.7 MB in the end (delta: 22.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2021-10-13 04:52:07,282 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 119782.6ms, OverallIterations: 39, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 0.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: -2147483648 SDtfs, -1056255628 SDslu, 0 SDs, 0 SdLazy, -1808875352 SolverSat, -230695060 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 81741.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11301 GetRequests, 9951 SyntacticMatches, 522 SemanticMatches, 828 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409804 ImplicationChecksByTransitivity, 94735.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 214.7ms SsaConstructionTime, 11991.5ms SatisfiabilityAnalysisTime, 15302.6ms InterpolantComputationTime, 1088 NumberOfCodeBlocks, 1088 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1005 ConstructedInterpolants, 0 QuantifiedInterpolants, 16429 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 10 PerfectInterpolantSequences, 130/691 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 609]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] msg_t nomsg = (msg_t )-1; [L29] port_t p12 ; [L30] char p12_old ; [L31] char p12_new ; [L32] _Bool ep12 ; [L33] port_t p13 ; [L34] char p13_old ; [L35] char p13_new ; [L36] _Bool ep13 ; [L37] port_t p21 ; [L38] char p21_old ; [L39] char p21_new ; [L40] _Bool ep21 ; [L41] port_t p23 ; [L42] char p23_old ; [L43] char p23_new ; [L44] _Bool ep23 ; [L45] port_t p31 ; [L46] char p31_old ; [L47] char p31_new ; [L48] _Bool ep31 ; [L49] port_t p32 ; [L50] char p32_old ; [L51] char p32_new ; [L52] _Bool ep32 ; [L53] char id1 ; [L54] unsigned char r1 ; [L55] char st1 ; [L56] char nl1 ; [L57] char m1 ; [L58] char max1 ; [L59] _Bool mode1 ; [L60] _Bool newmax1 ; [L61] char id2 ; [L62] unsigned char r2 ; [L63] char st2 ; [L64] char nl2 ; [L65] char m2 ; [L66] char max2 ; [L67] _Bool mode2 ; [L68] _Bool newmax2 ; [L69] char id3 ; [L70] unsigned char r3 ; [L71] char st3 ; [L72] char nl3 ; [L73] char m3 ; [L74] char max3 ; [L75] _Bool mode3 ; [L76] _Bool newmax3 ; [L528] int c1 ; [L529] int i2 ; [L532] c1 = 0 [L533] ep12 = __VERIFIER_nondet_bool() [L534] ep13 = __VERIFIER_nondet_bool() [L535] ep21 = __VERIFIER_nondet_bool() [L536] ep23 = __VERIFIER_nondet_bool() [L537] ep31 = __VERIFIER_nondet_bool() [L538] ep32 = __VERIFIER_nondet_bool() [L539] id1 = __VERIFIER_nondet_char() [L540] r1 = __VERIFIER_nondet_uchar() [L541] st1 = __VERIFIER_nondet_char() [L542] nl1 = __VERIFIER_nondet_char() [L543] m1 = __VERIFIER_nondet_char() [L544] max1 = __VERIFIER_nondet_char() [L545] mode1 = __VERIFIER_nondet_bool() [L546] newmax1 = __VERIFIER_nondet_bool() [L547] id2 = __VERIFIER_nondet_char() [L548] r2 = __VERIFIER_nondet_uchar() [L549] st2 = __VERIFIER_nondet_char() [L550] nl2 = __VERIFIER_nondet_char() [L551] m2 = __VERIFIER_nondet_char() [L552] max2 = __VERIFIER_nondet_char() [L553] mode2 = __VERIFIER_nondet_bool() [L554] newmax2 = __VERIFIER_nondet_bool() [L555] id3 = __VERIFIER_nondet_char() [L556] r3 = __VERIFIER_nondet_uchar() [L557] st3 = __VERIFIER_nondet_char() [L558] nl3 = __VERIFIER_nondet_char() [L559] m3 = __VERIFIER_nondet_char() [L560] max3 = __VERIFIER_nondet_char() [L561] mode3 = __VERIFIER_nondet_bool() [L562] newmax3 = __VERIFIER_nondet_bool() [L241] _Bool r121 ; [L242] _Bool r131 ; [L243] _Bool r211 ; [L244] _Bool r231 ; [L245] _Bool r311 ; [L246] _Bool r321 ; [L247] _Bool r122 ; [L248] int tmp ; [L249] _Bool r132 ; [L250] int tmp___0 ; [L251] _Bool r212 ; [L252] int tmp___1 ; [L253] _Bool r232 ; [L254] int tmp___2 ; [L255] _Bool r312 ; [L256] int tmp___3 ; [L257] _Bool r322 ; [L258] int tmp___4 ; [L259] int tmp___5 ; [L262] r121 = ep12 [L263] r131 = ep13 [L264] r211 = ep21 [L265] r231 = ep23 [L266] r311 = ep31 [L267] r321 = ep32 [L268] COND TRUE \read(r121) [L269] tmp = 1 [L280] r122 = (_Bool )tmp [L281] COND TRUE \read(r131) [L282] tmp___0 = 1 [L293] r132 = (_Bool )tmp___0 [L294] COND TRUE \read(r211) [L295] tmp___1 = 1 [L306] r212 = (_Bool )tmp___1 [L307] COND TRUE \read(r231) [L308] tmp___2 = 1 [L319] r232 = (_Bool )tmp___2 [L320] COND TRUE \read(r311) [L321] tmp___3 = 1 [L332] r312 = (_Bool )tmp___3 [L333] COND FALSE !(\read(r321)) [L336] COND TRUE \read(r311) [L337] COND TRUE \read(ep12) [L338] tmp___4 = 1 [L345] r322 = (_Bool )tmp___4 [L346] COND TRUE (int )id1 != (int )id2 [L347] COND TRUE (int )id1 != (int )id3 [L348] COND TRUE (int )id2 != (int )id3 [L349] COND TRUE (int )id1 >= 0 [L350] COND TRUE (int )id2 >= 0 [L351] COND TRUE (int )id3 >= 0 [L352] COND TRUE (int )r1 == 0 [L353] COND TRUE (int )r2 == 0 [L354] COND TRUE (int )r3 == 0 [L355] COND TRUE \read(r122) [L356] COND TRUE \read(r132) [L357] COND TRUE \read(r212) [L358] COND TRUE \read(r232) [L359] COND TRUE \read(r312) [L360] COND TRUE \read(r322) [L361] COND TRUE (int )max1 == (int )id1 [L362] COND TRUE (int )max2 == (int )id2 [L363] COND TRUE (int )max3 == (int )id3 [L364] COND TRUE (int )st1 == 0 [L365] COND TRUE (int )st2 == 0 [L366] COND TRUE (int )st3 == 0 [L367] COND TRUE (int )nl1 == 0 [L368] COND TRUE (int )nl2 == 0 [L369] COND TRUE (int )nl3 == 0 [L370] COND TRUE (int )mode1 == 0 [L371] COND TRUE (int )mode2 == 0 [L372] COND TRUE (int )mode3 == 0 [L373] COND TRUE \read(newmax1) [L374] COND TRUE \read(newmax2) [L375] COND TRUE \read(newmax3) [L376] tmp___5 = 1 [L467] return (tmp___5); [L563] i2 = init() [L22] COND FALSE !(!cond) [L565] p12_old = nomsg [L566] p12_new = nomsg [L567] p13_old = nomsg [L568] p13_new = nomsg [L569] p21_old = nomsg [L570] p21_new = nomsg [L571] p23_old = nomsg [L572] p23_new = nomsg [L573] p31_old = nomsg [L574] p31_new = nomsg [L575] p32_old = nomsg [L576] p32_new = nomsg [L577] i2 = 0 VAL [ep12=1, ep13=255, ep21=1, ep23=255, ep31=255, ep32=0, id1=1, id2=2, id3=0, m1=-1, m2=127, m3=2, max1=1, max2=2, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L578] COND TRUE 1 [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND FALSE !(\read(mode1)) [L114] COND TRUE (int )r1 < 2 [L115] COND TRUE \read(ep12) [L116] COND TRUE \read(newmax1) [L117] EXPR max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L117] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L120] COND TRUE \read(ep13) [L121] COND TRUE \read(newmax1) [L122] EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L122] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L126] mode1 = (_Bool)1 [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND FALSE !(\read(mode2)) [L168] COND TRUE (int )r2 < 2 [L169] COND TRUE \read(ep21) [L170] COND TRUE \read(newmax2) [L171] EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L171] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L174] COND TRUE \read(ep23) [L175] COND TRUE \read(newmax2) [L176] EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L176] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L180] mode2 = (_Bool)1 [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND FALSE !(\read(mode3)) [L222] COND TRUE (int )r3 < 2 [L223] COND TRUE \read(ep31) [L224] COND TRUE \read(newmax3) [L225] EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L225] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L228] COND FALSE !(\read(ep32)) [L234] mode3 = (_Bool)1 [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L472] int tmp ; VAL [ep12=1, ep13=255, ep21=1, ep23=255, ep31=255, ep32=0, id1=1, id2=2, id3=0, m1=-1, m2=127, m3=2, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=255, ep21=1, ep23=255, ep31=255, ep32=0, id1=1, id2=2, id3=0, m1=-1, m2=127, m3=2, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=255, ep21=1, ep23=255, ep31=255, ep32=0, id1=1, id2=2, id3=0, m1=-1, m2=127, m3=2, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=255, ep21=1, ep23=255, ep31=255, ep32=0, id1=1, id2=2, id3=0, m1=-1, m2=127, m3=2, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=255, ep21=1, ep23=255, ep31=255, ep32=0, id1=1, id2=2, id3=0, m1=-1, m2=127, m3=2, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=0, 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=255, ep21=1, ep23=255, ep31=255, ep32=0, id1=1, id2=2, id3=0, m1=-1, m2=127, m3=2, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=255, ep21=1, ep23=255, ep31=255, ep32=0, id1=1, id2=2, id3=0, m1=-1, m2=127, m3=2, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=0, 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 VAL [ep12=1, ep13=255, ep21=1, ep23=255, ep31=255, ep32=0, id1=1, id2=2, id3=0, m1=-1, m2=127, m3=2, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L489] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=255, ep21=1, ep23=255, ep31=255, ep32=0, id1=1, id2=2, id3=0, m1=-1, m2=127, m3=2, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L492] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=255, ep21=1, ep23=255, ep31=255, ep32=0, id1=1, id2=2, id3=0, m1=-1, m2=127, m3=2, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L494] COND TRUE (int )r1 < 2 [L495] tmp = 1 VAL [ep12=1, ep13=255, ep21=1, ep23=255, ep31=255, ep32=0, id1=1, id2=2, id3=0, m1=-1, m2=127, m3=2, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L523] return (tmp); [L595] c1 = check() [L607] COND FALSE !(! arg) VAL [ep12=1, ep13=255, ep21=1, ep23=255, ep31=255, ep32=0, id1=1, id2=2, id3=0, m1=-1, m2=127, m3=2, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L578] COND TRUE 1 [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND TRUE \read(mode1) [L84] COND FALSE !(r1 == 255) [L87] r1 = r1 + 1 [L88] COND TRUE \read(ep21) [L89] m1 = p21_old [L90] p21_old = nomsg [L91] COND TRUE (int )m1 > (int )max1 [L92] max1 = m1 [L93] newmax = (_Bool)1 [L96] COND TRUE \read(ep31) [L97] m1 = p31_old [L98] p31_old = nomsg [L99] COND FALSE !((int )m1 > (int )max1) [L104] newmax1 = newmax [L105] COND FALSE !((int )r1 == 2) [L112] mode1 = (_Bool)0 [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND TRUE \read(mode2) [L138] COND FALSE !(r2 == 255) [L141] r2 = r2 + 1 [L142] COND TRUE \read(ep12) [L143] m2 = p12_old [L144] p12_old = nomsg [L145] COND FALSE !((int )m2 > (int )max2) [L150] COND FALSE !(\read(ep32)) [L158] newmax2 = newmax [L159] COND FALSE !((int )r2 == 2) [L166] mode2 = (_Bool)0 [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND TRUE \read(mode3) [L192] COND FALSE !(r3 == 255) [L195] r3 = r3 + 1 [L196] COND TRUE \read(ep13) [L197] m3 = p13_old [L198] p13_old = nomsg [L199] COND TRUE (int )m3 > (int )max3 [L200] max3 = m3 [L201] newmax = (_Bool)1 [L204] COND TRUE \read(ep23) [L205] m3 = p23_old [L206] p23_old = nomsg [L207] COND TRUE (int )m3 > (int )max3 [L208] max3 = m3 [L209] newmax = (_Bool)1 [L212] newmax3 = newmax [L213] COND FALSE !((int )r3 == 2) [L220] mode3 = (_Bool)0 [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L472] int tmp ; VAL [ep12=1, ep13=255, ep21=1, ep23=255, ep31=255, ep32=0, id1=1, id2=2, id3=0, m1=0, m2=1, m3=2, max1=2, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, 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=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=255, ep21=1, ep23=255, ep31=255, ep32=0, id1=1, id2=2, id3=0, m1=0, m2=1, m3=2, max1=2, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, 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=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=255, ep21=1, ep23=255, ep31=255, ep32=0, id1=1, id2=2, id3=0, m1=0, m2=1, m3=2, max1=2, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, 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=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=255, ep21=1, ep23=255, ep31=255, ep32=0, id1=1, id2=2, id3=0, m1=0, m2=1, m3=2, max1=2, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, 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=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=255, ep21=1, ep23=255, ep31=255, ep32=0, id1=1, id2=2, id3=0, m1=0, m2=1, m3=2, max1=2, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, 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=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=255, ep21=1, ep23=255, ep31=255, ep32=0, id1=1, id2=2, id3=0, m1=0, m2=1, m3=2, max1=2, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, 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=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=255, ep21=1, ep23=255, ep31=255, ep32=0, id1=1, id2=2, id3=0, m1=0, m2=1, m3=2, max1=2, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, 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=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=255, ep21=1, ep23=255, ep31=255, ep32=0, id1=1, id2=2, id3=0, m1=0, m2=1, m3=2, max1=2, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, 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=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L489] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=255, ep21=1, ep23=255, ep31=255, ep32=0, id1=1, id2=2, id3=0, m1=0, m2=1, m3=2, max1=2, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, 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=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L492] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=255, ep21=1, ep23=255, ep31=255, ep32=0, id1=1, id2=2, id3=0, m1=0, m2=1, m3=2, max1=2, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, 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=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L494] COND TRUE (int )r1 < 2 [L495] tmp = 1 VAL [ep12=1, ep13=255, ep21=1, ep23=255, ep31=255, ep32=0, id1=1, id2=2, id3=0, m1=0, m2=1, m3=2, max1=2, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, 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=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L523] return (tmp); [L595] c1 = check() [L607] COND FALSE !(! arg) VAL [ep12=1, ep13=255, ep21=1, ep23=255, ep31=255, ep32=0, id1=1, id2=2, id3=0, m1=0, m2=1, m3=2, max1=2, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, 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=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L578] COND TRUE 1 [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND FALSE !(\read(mode1)) [L114] COND TRUE (int )r1 < 2 [L115] COND TRUE \read(ep12) [L116] COND TRUE \read(newmax1) [L117] EXPR max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L117] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L120] COND TRUE \read(ep13) [L121] COND TRUE \read(newmax1) [L122] EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L122] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L126] mode1 = (_Bool)1 [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND FALSE !(\read(mode2)) [L168] COND TRUE (int )r2 < 2 [L169] COND TRUE \read(ep21) [L170] COND FALSE !(\read(newmax2)) [L174] COND TRUE \read(ep23) [L175] COND FALSE !(\read(newmax2)) [L180] mode2 = (_Bool)1 [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND FALSE !(\read(mode3)) [L222] COND TRUE (int )r3 < 2 [L223] COND TRUE \read(ep31) [L224] COND TRUE \read(newmax3) [L225] EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L225] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L228] COND FALSE !(\read(ep32)) [L234] mode3 = (_Bool)1 [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L472] int tmp ; VAL [ep12=1, ep13=255, ep21=1, ep23=255, ep31=255, ep32=0, id1=1, id2=2, id3=0, m1=0, m2=1, m3=2, max1=2, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=255, ep21=1, ep23=255, ep31=255, ep32=0, id1=1, id2=2, id3=0, m1=0, m2=1, m3=2, max1=2, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=255, ep21=1, ep23=255, ep31=255, ep32=0, id1=1, id2=2, id3=0, m1=0, m2=1, m3=2, max1=2, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=255, ep21=1, ep23=255, ep31=255, ep32=0, id1=1, id2=2, id3=0, m1=0, m2=1, m3=2, max1=2, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=255, ep21=1, ep23=255, ep31=255, ep32=0, id1=1, id2=2, id3=0, m1=0, m2=1, m3=2, max1=2, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, 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=255, ep21=1, ep23=255, ep31=255, ep32=0, id1=1, id2=2, id3=0, m1=0, m2=1, m3=2, max1=2, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=255, ep21=1, ep23=255, ep31=255, ep32=0, id1=1, id2=2, id3=0, m1=0, m2=1, m3=2, max1=2, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=255, ep21=1, ep23=255, ep31=255, ep32=0, id1=1, id2=2, id3=0, m1=0, m2=1, m3=2, max1=2, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L489] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=255, ep21=1, ep23=255, ep31=255, ep32=0, id1=1, id2=2, id3=0, m1=0, m2=1, m3=2, max1=2, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L492] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=255, ep21=1, ep23=255, ep31=255, ep32=0, id1=1, id2=2, id3=0, m1=0, m2=1, m3=2, max1=2, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L494] COND TRUE (int )r1 < 2 [L495] tmp = 1 VAL [ep12=1, ep13=255, ep21=1, ep23=255, ep31=255, ep32=0, id1=1, id2=2, id3=0, m1=0, m2=1, m3=2, max1=2, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L523] return (tmp); [L595] c1 = check() [L607] COND FALSE !(! arg) VAL [ep12=1, ep13=255, ep21=1, ep23=255, ep31=255, ep32=0, id1=1, id2=2, id3=0, m1=0, m2=1, m3=2, max1=2, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L578] COND TRUE 1 [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND TRUE \read(mode1) [L84] COND FALSE !(r1 == 255) [L87] r1 = r1 + 1 [L88] COND TRUE \read(ep21) [L89] m1 = p21_old [L90] p21_old = nomsg [L91] COND FALSE !((int )m1 > (int )max1) [L96] COND TRUE \read(ep31) [L97] m1 = p31_old [L98] p31_old = nomsg [L99] COND FALSE !((int )m1 > (int )max1) [L104] newmax1 = newmax [L105] COND TRUE (int )r1 == 2 [L106] COND FALSE !((int )max1 == (int )id1) [L109] st1 = (char)1 [L112] mode1 = (_Bool)0 [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND TRUE \read(mode2) [L138] COND FALSE !(r2 == 255) [L141] r2 = r2 + 1 [L142] COND TRUE \read(ep12) [L143] m2 = p12_old [L144] p12_old = nomsg [L145] COND FALSE !((int )m2 > (int )max2) [L150] COND FALSE !(\read(ep32)) [L158] newmax2 = newmax [L159] COND TRUE (int )r2 == 2 [L160] COND TRUE (int )max2 == (int )id2 [L161] st2 = (char)1 [L166] mode2 = (_Bool)0 [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND TRUE \read(mode3) [L192] COND FALSE !(r3 == 255) [L195] r3 = r3 + 1 [L196] COND TRUE \read(ep13) [L197] m3 = p13_old [L198] p13_old = nomsg [L199] COND FALSE !((int )m3 > (int )max3) [L204] COND TRUE \read(ep23) [L205] m3 = p23_old [L206] p23_old = nomsg [L207] COND FALSE !((int )m3 > (int )max3) [L212] newmax3 = newmax [L213] COND TRUE (int )r3 == 2 [L214] COND FALSE !((int )max3 == (int )id3) [L217] nl3 = (char)1 [L220] mode3 = (_Bool)0 [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L472] int tmp ; VAL [ep12=1, ep13=255, ep21=1, ep23=255, ep31=255, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=2, m3=-1, max1=2, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] [L475] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L521] tmp = 0 VAL [ep12=1, ep13=255, ep21=1, ep23=255, ep31=255, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=2, m3=-1, max1=2, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] [L523] return (tmp); [L595] c1 = check() [L607] COND TRUE ! arg VAL [ep12=1, ep13=255, ep21=1, ep23=255, ep31=255, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=2, m3=-1, max1=2, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] [L609] reach_error() VAL [ep12=1, ep13=255, ep21=1, ep23=255, ep31=255, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=2, m3=-1, max1=2, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 109.1 MB. Free memory is still 86.0 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 399.45 ms. Allocated memory is still 109.1 MB. Free memory was 69.1 MB in the beginning and 78.1 MB in the end (delta: -9.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 61.83 ms. Allocated memory is still 109.1 MB. Free memory was 78.1 MB in the beginning and 74.8 MB in the end (delta: 3.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 42.31 ms. Allocated memory is still 109.1 MB. Free memory was 74.8 MB in the beginning and 72.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2936.06 ms. Allocated memory was 109.1 MB in the beginning and 138.4 MB in the end (delta: 29.4 MB). Free memory was 72.2 MB in the beginning and 59.9 MB in the end (delta: 12.3 MB). Peak memory consumption was 66.5 MB. Max. memory is 16.1 GB. * CodeCheck took 120109.72 ms. Allocated memory was 138.4 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 59.9 MB in the beginning and 416.8 MB in the end (delta: -356.8 MB). Peak memory consumption was 699.1 MB. Max. memory is 16.1 GB. * Witness Printer took 247.35 ms. Allocated memory is still 1.2 GB. Free memory was 416.8 MB in the beginning and 394.7 MB in the end (delta: 22.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. RESULT: Ultimate proved your program to be incorrect! [2021-10-13 04:52:07,338 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b73238e7-82a8-4569-989d-31386e65a4b3/bin/ukojak-fKGseLULKY/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...