./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 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5651f9b-1131-48e1-9c26-11cb7ef5795b/bin/ukojak-rkRKPMF4O4/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5651f9b-1131-48e1-9c26-11cb7ef5795b/bin/ukojak-rkRKPMF4O4/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5651f9b-1131-48e1-9c26-11cb7ef5795b/bin/ukojak-rkRKPMF4O4/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5651f9b-1131-48e1-9c26-11cb7ef5795b/bin/ukojak-rkRKPMF4O4/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_a5651f9b-1131-48e1-9c26-11cb7ef5795b/bin/ukojak-rkRKPMF4O4/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5651f9b-1131-48e1-9c26-11cb7ef5795b/bin/ukojak-rkRKPMF4O4 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 588484d75150429774731f7aacf4daf77752c68fdc38fffa31465a5f910e2823 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 21:48:30,002 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 21:48:30,004 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 21:48:30,020 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 21:48:30,021 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 21:48:30,021 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 21:48:30,022 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 21:48:30,023 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 21:48:30,024 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 21:48:30,025 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 21:48:30,025 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 21:48:30,026 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 21:48:30,026 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 21:48:30,027 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 21:48:30,027 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 21:48:30,028 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 21:48:30,029 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 21:48:30,029 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 21:48:30,030 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 21:48:30,031 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 21:48:30,032 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 21:48:30,033 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 21:48:30,034 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 21:48:30,034 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 21:48:30,036 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 21:48:30,036 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 21:48:30,037 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 21:48:30,037 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 21:48:30,038 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 21:48:30,038 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 21:48:30,039 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 21:48:30,039 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 21:48:30,040 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 21:48:30,040 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 21:48:30,041 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 21:48:30,041 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 21:48:30,042 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 21:48:30,042 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 21:48:30,042 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 21:48:30,042 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 21:48:30,043 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 21:48:30,044 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5651f9b-1131-48e1-9c26-11cb7ef5795b/bin/ukojak-rkRKPMF4O4/config/svcomp-Reach-32bit-Kojak_Default.epf [2022-12-14 21:48:30,056 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 21:48:30,057 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 21:48:30,057 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 21:48:30,057 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2022-12-14 21:48:30,058 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 21:48:30,058 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 21:48:30,058 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 21:48:30,058 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 21:48:30,058 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 21:48:30,058 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 21:48:30,059 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 21:48:30,059 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 21:48:30,059 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 21:48:30,059 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 21:48:30,059 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 21:48:30,059 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 21:48:30,059 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 21:48:30,059 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 21:48:30,060 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2022-12-14 21:48:30,060 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2022-12-14 21:48:30,060 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 21:48:30,060 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-14 21:48:30,060 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 21:48:30,060 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 21:48:30,060 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 21:48:30,060 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2022-12-14 21:48:30,060 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 21:48:30,061 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 21:48:30,061 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_a5651f9b-1131-48e1-9c26-11cb7ef5795b/bin/ukojak-rkRKPMF4O4/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_a5651f9b-1131-48e1-9c26-11cb7ef5795b/bin/ukojak-rkRKPMF4O4 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 588484d75150429774731f7aacf4daf77752c68fdc38fffa31465a5f910e2823 [2022-12-14 21:48:30,235 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 21:48:30,255 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 21:48:30,258 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 21:48:30,259 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 21:48:30,259 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 21:48:30,261 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5651f9b-1131-48e1-9c26-11cb7ef5795b/bin/ukojak-rkRKPMF4O4/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c [2022-12-14 21:48:32,923 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 21:48:33,069 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 21:48:33,069 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5651f9b-1131-48e1-9c26-11cb7ef5795b/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c [2022-12-14 21:48:33,075 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5651f9b-1131-48e1-9c26-11cb7ef5795b/bin/ukojak-rkRKPMF4O4/data/7dfd8c4a3/870b5f67fcb5461f9b3729471836369a/FLAG86493a6cb [2022-12-14 21:48:33,087 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5651f9b-1131-48e1-9c26-11cb7ef5795b/bin/ukojak-rkRKPMF4O4/data/7dfd8c4a3/870b5f67fcb5461f9b3729471836369a [2022-12-14 21:48:33,089 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 21:48:33,090 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 21:48:33,091 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 21:48:33,091 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 21:48:33,094 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 21:48:33,094 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 09:48:33" (1/1) ... [2022-12-14 21:48:33,095 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d1e3dd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:48:33, skipping insertion in model container [2022-12-14 21:48:33,095 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 09:48:33" (1/1) ... [2022-12-14 21:48:33,101 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 21:48:33,131 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 21:48:33,316 WARN L237 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_a5651f9b-1131-48e1-9c26-11cb7ef5795b/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c[14511,14524] [2022-12-14 21:48:33,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 21:48:33,333 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 21:48:33,387 WARN L237 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_a5651f9b-1131-48e1-9c26-11cb7ef5795b/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c[14511,14524] [2022-12-14 21:48:33,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 21:48:33,403 INFO L208 MainTranslator]: Completed translation [2022-12-14 21:48:33,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:48:33 WrapperNode [2022-12-14 21:48:33,403 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 21:48:33,405 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 21:48:33,405 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 21:48:33,405 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 21:48:33,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:48:33" (1/1) ... [2022-12-14 21:48:33,423 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:48:33" (1/1) ... [2022-12-14 21:48:33,449 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 455 [2022-12-14 21:48:33,450 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 21:48:33,450 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 21:48:33,450 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 21:48:33,450 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 21:48:33,459 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:48:33" (1/1) ... [2022-12-14 21:48:33,460 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:48:33" (1/1) ... [2022-12-14 21:48:33,463 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:48:33" (1/1) ... [2022-12-14 21:48:33,463 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:48:33" (1/1) ... [2022-12-14 21:48:33,470 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:48:33" (1/1) ... [2022-12-14 21:48:33,476 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:48:33" (1/1) ... [2022-12-14 21:48:33,478 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:48:33" (1/1) ... [2022-12-14 21:48:33,480 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:48:33" (1/1) ... [2022-12-14 21:48:33,484 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 21:48:33,485 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 21:48:33,485 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 21:48:33,485 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 21:48:33,486 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:48:33" (1/1) ... [2022-12-14 21:48:33,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-14 21:48:33,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5651f9b-1131-48e1-9c26-11cb7ef5795b/bin/ukojak-rkRKPMF4O4/z3 [2022-12-14 21:48:33,512 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5651f9b-1131-48e1-9c26-11cb7ef5795b/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2022-12-14 21:48:33,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5651f9b-1131-48e1-9c26-11cb7ef5795b/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2022-12-14 21:48:33,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 21:48:33,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 21:48:33,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 21:48:33,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 21:48:33,621 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 21:48:33,623 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 21:48:34,007 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 21:48:34,448 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 21:48:34,448 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-14 21:48:34,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:48:34 BoogieIcfgContainer [2022-12-14 21:48:34,451 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 21:48:34,452 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2022-12-14 21:48:34,452 INFO L271 PluginConnector]: Initializing CodeCheck... [2022-12-14 21:48:34,458 INFO L275 PluginConnector]: CodeCheck initialized [2022-12-14 21:48:34,459 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:48:34" (1/1) ... [2022-12-14 21:48:34,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 21:48:34,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:34,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2022-12-14 21:48:34,509 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2022-12-14 21:48:34,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 21:48:34,511 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:34,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:34,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:35,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:48:35,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:35,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 20 states and 32 transitions. [2022-12-14 21:48:35,907 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 32 transitions. [2022-12-14 21:48:35,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 21:48:35,907 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:35,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:36,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:36,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:48:37,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:37,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 23 states and 39 transitions. [2022-12-14 21:48:37,009 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 39 transitions. [2022-12-14 21:48:37,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 21:48:37,010 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:37,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:37,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:37,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:48:38,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:38,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 27 states and 48 transitions. [2022-12-14 21:48:38,029 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 48 transitions. [2022-12-14 21:48:38,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 21:48:38,032 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:38,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:38,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:38,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:48:39,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:39,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 32 states and 59 transitions. [2022-12-14 21:48:39,120 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 59 transitions. [2022-12-14 21:48:39,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 21:48:39,121 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:39,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:39,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:39,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:48:40,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:40,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 39 states and 72 transitions. [2022-12-14 21:48:40,492 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 72 transitions. [2022-12-14 21:48:40,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 21:48:40,493 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:40,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:40,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:41,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:48:42,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:42,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 45 states and 84 transitions. [2022-12-14 21:48:42,080 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 84 transitions. [2022-12-14 21:48:42,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 21:48:42,081 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:42,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:42,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:42,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:48:42,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:42,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 46 states and 84 transitions. [2022-12-14 21:48:42,339 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 84 transitions. [2022-12-14 21:48:42,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 21:48:42,339 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:42,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:42,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:42,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:48:42,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:42,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 47 states and 85 transitions. [2022-12-14 21:48:42,395 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 85 transitions. [2022-12-14 21:48:42,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 21:48:42,396 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:42,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:42,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:43,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:48:44,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:44,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 57 states and 102 transitions. [2022-12-14 21:48:44,905 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 102 transitions. [2022-12-14 21:48:44,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 21:48:44,905 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:44,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:45,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:48:45,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:45,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 60 states and 106 transitions. [2022-12-14 21:48:45,340 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 106 transitions. [2022-12-14 21:48:45,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 21:48:45,341 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:45,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:45,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:47,028 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:48:50,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:50,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 76 states and 133 transitions. [2022-12-14 21:48:50,292 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 133 transitions. [2022-12-14 21:48:50,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 21:48:50,292 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:50,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:50,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:51,943 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:48:55,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:55,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 91 states and 157 transitions. [2022-12-14 21:48:55,251 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 157 transitions. [2022-12-14 21:48:55,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 21:48:55,251 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:55,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:55,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:56,409 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:48:56,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:48:56,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 92 states and 160 transitions. [2022-12-14 21:48:56,697 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 160 transitions. [2022-12-14 21:48:56,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 21:48:56,698 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:48:56,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:48:56,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:48:57,756 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:49:01,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:49:01,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 110 states and 192 transitions. [2022-12-14 21:49:01,824 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 192 transitions. [2022-12-14 21:49:01,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 21:49:01,824 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:49:01,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:49:01,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:49:02,602 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:49:02,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:49:02,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 111 states and 196 transitions. [2022-12-14 21:49:02,979 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 196 transitions. [2022-12-14 21:49:02,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 21:49:02,980 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:49:02,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:49:03,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:49:03,937 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:49:07,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:49:07,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 127 states and 219 transitions. [2022-12-14 21:49:07,773 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 219 transitions. [2022-12-14 21:49:07,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 21:49:07,773 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:49:07,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:49:07,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:49:08,930 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:49:12,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:49:12,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 140 states and 242 transitions. [2022-12-14 21:49:12,774 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 242 transitions. [2022-12-14 21:49:12,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 21:49:12,774 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:49:12,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:49:12,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:49:14,813 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:49:19,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:49:19,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 147 states and 255 transitions. [2022-12-14 21:49:19,225 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 255 transitions. [2022-12-14 21:49:19,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 21:49:19,226 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:49:19,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:49:19,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:49:20,248 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:49:22,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:49:22,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 152 states and 265 transitions. [2022-12-14 21:49:22,274 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 265 transitions. [2022-12-14 21:49:22,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 21:49:22,274 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:49:22,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:49:22,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:49:24,068 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:49:28,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:49:28,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 159 states and 282 transitions. [2022-12-14 21:49:28,171 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 282 transitions. [2022-12-14 21:49:28,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 21:49:28,171 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:49:28,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:49:28,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:49:30,536 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:49:37,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:49:37,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 173 states and 330 transitions. [2022-12-14 21:49:37,727 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 330 transitions. [2022-12-14 21:49:37,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 21:49:37,727 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:49:37,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:49:37,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:49:39,771 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:49:45,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:49:45,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 184 states and 346 transitions. [2022-12-14 21:49:45,746 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 346 transitions. [2022-12-14 21:49:45,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 21:49:45,746 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:49:45,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:49:45,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:49:47,467 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:49:48,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:49:48,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 185 states and 361 transitions. [2022-12-14 21:49:48,699 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 361 transitions. [2022-12-14 21:49:48,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 21:49:48,700 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:49:48,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:49:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:49:50,301 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:49:55,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:49:55,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 195 states and 378 transitions. [2022-12-14 21:49:55,567 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 378 transitions. [2022-12-14 21:49:55,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 21:49:55,567 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:49:55,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:49:55,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:49:56,634 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:49:57,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:49:57,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 196 states and 378 transitions. [2022-12-14 21:49:57,431 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 378 transitions. [2022-12-14 21:49:57,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 21:49:57,431 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:49:57,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:49:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:49:58,662 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:49:59,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:49:59,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 197 states and 391 transitions. [2022-12-14 21:49:59,425 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 391 transitions. [2022-12-14 21:49:59,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 21:49:59,426 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:49:59,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:49:59,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:50:01,376 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:50:11,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:50:11,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 215 states and 440 transitions. [2022-12-14 21:50:11,219 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 440 transitions. [2022-12-14 21:50:11,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 21:50:11,220 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:50:11,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:50:11,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:50:12,337 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:50:14,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:50:14,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 219 states and 456 transitions. [2022-12-14 21:50:14,584 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 456 transitions. [2022-12-14 21:50:14,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 21:50:14,585 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:50:14,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:50:14,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:50:15,700 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:50:17,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:50:17,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 221 states and 478 transitions. [2022-12-14 21:50:17,032 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 478 transitions. [2022-12-14 21:50:17,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 21:50:17,032 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:50:17,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:50:17,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:50:19,468 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:50:23,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:50:23,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 225 states and 490 transitions. [2022-12-14 21:50:23,829 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 490 transitions. [2022-12-14 21:50:23,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 21:50:23,829 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:50:23,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:50:24,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:50:26,078 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:50:29,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:50:29,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 228 states and 507 transitions. [2022-12-14 21:50:29,129 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 507 transitions. [2022-12-14 21:50:29,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 21:50:29,130 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:50:29,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:50:29,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:50:32,708 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:50:37,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:50:37,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 232 states and 525 transitions. [2022-12-14 21:50:37,028 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 525 transitions. [2022-12-14 21:50:37,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 21:50:37,028 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:50:37,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:50:37,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:50:40,226 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:50:42,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:50:42,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 233 states and 527 transitions. [2022-12-14 21:50:42,172 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 527 transitions. [2022-12-14 21:50:42,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 21:50:42,172 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:50:42,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:50:42,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:50:43,958 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:50:45,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:50:45,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 236 states and 532 transitions. [2022-12-14 21:50:45,928 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 532 transitions. [2022-12-14 21:50:45,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 21:50:45,929 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:50:45,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:50:46,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:50:49,362 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:50:51,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:50:51,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 237 states and 541 transitions. [2022-12-14 21:50:51,608 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 541 transitions. [2022-12-14 21:50:51,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 21:50:51,608 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:50:51,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:50:51,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:50:53,067 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:50:53,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:50:53,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 238 states and 548 transitions. [2022-12-14 21:50:53,890 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 548 transitions. [2022-12-14 21:50:53,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 21:50:53,890 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:50:53,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:50:54,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:50:55,918 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:51:08,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:51:08,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 255 states and 607 transitions. [2022-12-14 21:51:08,937 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 607 transitions. [2022-12-14 21:51:08,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 21:51:08,938 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:51:08,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:51:09,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:51:10,497 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:51:15,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:51:15,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 260 states and 623 transitions. [2022-12-14 21:51:15,255 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 623 transitions. [2022-12-14 21:51:15,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 21:51:15,256 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:51:15,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:51:15,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:51:16,425 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:51:17,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:51:17,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 261 states and 630 transitions. [2022-12-14 21:51:17,445 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 630 transitions. [2022-12-14 21:51:17,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 21:51:17,446 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:51:17,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:51:17,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:51:18,936 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:51:21,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:51:21,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 264 states and 639 transitions. [2022-12-14 21:51:21,773 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 639 transitions. [2022-12-14 21:51:21,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 21:51:21,773 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:51:21,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:51:21,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:51:22,966 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:51:23,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:51:23,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 265 states and 646 transitions. [2022-12-14 21:51:23,847 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 646 transitions. [2022-12-14 21:51:23,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 21:51:23,848 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:51:23,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:51:24,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:51:24,979 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:51:28,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:51:28,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 269 states and 661 transitions. [2022-12-14 21:51:28,076 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 661 transitions. [2022-12-14 21:51:28,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 21:51:28,076 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:51:28,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:51:28,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:51:30,043 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:51:37,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:51:37,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 280 states and 676 transitions. [2022-12-14 21:51:37,562 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 676 transitions. [2022-12-14 21:51:37,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 21:51:37,562 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:51:37,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:51:37,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:51:38,703 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:51:39,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:51:39,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 281 states and 680 transitions. [2022-12-14 21:51:39,600 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 680 transitions. [2022-12-14 21:51:39,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 21:51:39,600 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:51:39,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:51:40,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:51:43,377 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:51:52,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:51:52,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 287 states and 708 transitions. [2022-12-14 21:51:52,624 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 708 transitions. [2022-12-14 21:51:52,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 21:51:52,624 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:51:52,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:51:52,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:51:54,597 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:51:59,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:51:59,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 291 states and 729 transitions. [2022-12-14 21:51:59,026 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 729 transitions. [2022-12-14 21:51:59,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 21:51:59,027 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:51:59,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:51:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:52:02,575 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:52:08,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:52:08,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 295 states and 742 transitions. [2022-12-14 21:52:08,446 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 742 transitions. [2022-12-14 21:52:08,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 21:52:08,446 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:52:08,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:52:08,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:52:10,424 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:52:13,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:52:13,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 297 states and 753 transitions. [2022-12-14 21:52:13,258 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 753 transitions. [2022-12-14 21:52:13,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 21:52:13,258 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:52:13,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:52:13,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:52:14,879 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:52:17,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:52:17,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 299 states and 755 transitions. [2022-12-14 21:52:17,183 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 755 transitions. [2022-12-14 21:52:17,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 21:52:17,183 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:52:17,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:52:17,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:52:18,724 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:52:20,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:52:20,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 301 states and 756 transitions. [2022-12-14 21:52:20,687 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 756 transitions. [2022-12-14 21:52:20,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 21:52:20,687 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:52:20,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:52:20,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:52:23,826 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:52:25,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:52:25,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 302 states and 763 transitions. [2022-12-14 21:52:25,894 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 763 transitions. [2022-12-14 21:52:25,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 21:52:25,894 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:52:25,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:52:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:52:29,028 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:52:30,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:52:30,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 303 states and 765 transitions. [2022-12-14 21:52:30,109 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 765 transitions. [2022-12-14 21:52:30,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-14 21:52:30,109 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:52:30,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:52:30,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 21:52:30,812 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 21:52:31,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 21:52:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 21:52:31,989 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 21:52:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 21:52:32,283 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 53 iterations. [2022-12-14 21:52:32,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 14.12 09:52:32 ImpRootNode [2022-12-14 21:52:32,378 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2022-12-14 21:52:32,378 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 21:52:32,378 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 21:52:32,378 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 21:52:32,379 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:48:34" (3/4) ... [2022-12-14 21:52:32,380 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-14 21:52:32,463 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5651f9b-1131-48e1-9c26-11cb7ef5795b/bin/ukojak-rkRKPMF4O4/witness.graphml [2022-12-14 21:52:32,463 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 21:52:32,464 INFO L158 Benchmark]: Toolchain (without parser) took 239373.98ms. Allocated memory was 161.5MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 124.7MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 299.0MB. Max. memory is 16.1GB. [2022-12-14 21:52:32,464 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 161.5MB. Free memory is still 132.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 21:52:32,464 INFO L158 Benchmark]: CACSL2BoogieTranslator took 313.03ms. Allocated memory is still 161.5MB. Free memory was 124.7MB in the beginning and 107.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-14 21:52:32,464 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.26ms. Allocated memory is still 161.5MB. Free memory was 107.9MB in the beginning and 104.9MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 21:52:32,465 INFO L158 Benchmark]: Boogie Preprocessor took 33.87ms. Allocated memory is still 161.5MB. Free memory was 104.9MB in the beginning and 102.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 21:52:32,465 INFO L158 Benchmark]: RCFGBuilder took 966.06ms. Allocated memory was 161.5MB in the beginning and 199.2MB in the end (delta: 37.7MB). Free memory was 102.2MB in the beginning and 121.1MB in the end (delta: -18.8MB). Peak memory consumption was 72.6MB. Max. memory is 16.1GB. [2022-12-14 21:52:32,465 INFO L158 Benchmark]: CodeCheck took 237926.19ms. Allocated memory was 199.2MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 121.1MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 239.0MB. Max. memory is 16.1GB. [2022-12-14 21:52:32,465 INFO L158 Benchmark]: Witness Printer took 85.34ms. Allocated memory is still 1.5GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-14 21:52:32,467 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 237.8s, OverallIterations: 53, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21596 SdHoareTripleChecker+Valid, 170.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19836 mSDsluCounter, 7568 SdHoareTripleChecker+Invalid, 154.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6722 mSDsCounter, 7152 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 61080 IncrementalHoareTripleChecker+Invalid, 68232 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7152 mSolverCounterUnsat, 846 mSDtfsCounter, 61080 mSolverCounterSat, 0.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15499 GetRequests, 13601 SyntacticMatches, 782 SemanticMatches, 1116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 757395 ImplicationChecksByTransitivity, 161.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 9.2s SatisfiabilityAnalysisTime, 74.1s InterpolantComputationTime, 1639 NumberOfCodeBlocks, 1639 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 1539 ConstructedInterpolants, 0 QuantifiedInterpolants, 20133 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 52 InterpolantComputations, 10 PerfectInterpolantSequences, 195/1085 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 609]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] msg_t nomsg = (msg_t )-1; [L29] port_t p12 ; [L30] char p12_old ; [L31] char p12_new ; [L32] _Bool ep12 ; [L33] port_t p13 ; [L34] char p13_old ; [L35] char p13_new ; [L36] _Bool ep13 ; [L37] port_t p21 ; [L38] char p21_old ; [L39] char p21_new ; [L40] _Bool ep21 ; [L41] port_t p23 ; [L42] char p23_old ; [L43] char p23_new ; [L44] _Bool ep23 ; [L45] port_t p31 ; [L46] char p31_old ; [L47] char p31_new ; [L48] _Bool ep31 ; [L49] port_t p32 ; [L50] char p32_old ; [L51] char p32_new ; [L52] _Bool ep32 ; [L53] char id1 ; [L54] unsigned char r1 ; [L55] char st1 ; [L56] char nl1 ; [L57] char m1 ; [L58] char max1 ; [L59] _Bool mode1 ; [L60] _Bool newmax1 ; [L61] char id2 ; [L62] unsigned char r2 ; [L63] char st2 ; [L64] char nl2 ; [L65] char m2 ; [L66] char max2 ; [L67] _Bool mode2 ; [L68] _Bool newmax2 ; [L69] char id3 ; [L70] unsigned char r3 ; [L71] char st3 ; [L72] char nl3 ; [L73] char m3 ; [L74] char max3 ; [L75] _Bool mode3 ; [L76] _Bool newmax3 ; [L528] int c1 ; [L529] int i2 ; [L532] c1 = 0 [L533] ep12 = __VERIFIER_nondet_bool() [L534] ep13 = __VERIFIER_nondet_bool() [L535] ep21 = __VERIFIER_nondet_bool() [L536] ep23 = __VERIFIER_nondet_bool() [L537] ep31 = __VERIFIER_nondet_bool() [L538] ep32 = __VERIFIER_nondet_bool() [L539] id1 = __VERIFIER_nondet_char() [L540] r1 = __VERIFIER_nondet_uchar() [L541] st1 = __VERIFIER_nondet_char() [L542] nl1 = __VERIFIER_nondet_char() [L543] m1 = __VERIFIER_nondet_char() [L544] max1 = __VERIFIER_nondet_char() [L545] mode1 = __VERIFIER_nondet_bool() [L546] newmax1 = __VERIFIER_nondet_bool() [L547] id2 = __VERIFIER_nondet_char() [L548] r2 = __VERIFIER_nondet_uchar() [L549] st2 = __VERIFIER_nondet_char() [L550] nl2 = __VERIFIER_nondet_char() [L551] m2 = __VERIFIER_nondet_char() [L552] max2 = __VERIFIER_nondet_char() [L553] mode2 = __VERIFIER_nondet_bool() [L554] newmax2 = __VERIFIER_nondet_bool() [L555] id3 = __VERIFIER_nondet_char() [L556] r3 = __VERIFIER_nondet_uchar() [L557] st3 = __VERIFIER_nondet_char() [L558] nl3 = __VERIFIER_nondet_char() [L559] m3 = __VERIFIER_nondet_char() [L560] max3 = __VERIFIER_nondet_char() [L561] mode3 = __VERIFIER_nondet_bool() [L562] newmax3 = __VERIFIER_nondet_bool() [L563] CALL, EXPR init() [L241] _Bool r121 ; [L242] _Bool r131 ; [L243] _Bool r211 ; [L244] _Bool r231 ; [L245] _Bool r311 ; [L246] _Bool r321 ; [L247] _Bool r122 ; [L248] int tmp ; [L249] _Bool r132 ; [L250] int tmp___0 ; [L251] _Bool r212 ; [L252] int tmp___1 ; [L253] _Bool r232 ; [L254] int tmp___2 ; [L255] _Bool r312 ; [L256] int tmp___3 ; [L257] _Bool r322 ; [L258] int tmp___4 ; [L259] int tmp___5 ; [L262] r121 = ep12 [L263] r131 = ep13 [L264] r211 = ep21 [L265] r231 = ep23 [L266] r311 = ep31 [L267] r321 = ep32 [L268] COND FALSE !(\read(r121)) [L271] COND TRUE \read(r131) [L272] COND TRUE \read(ep32) [L273] tmp = 1 [L280] r122 = (_Bool )tmp [L281] COND TRUE \read(r131) [L282] tmp___0 = 1 [L293] r132 = (_Bool )tmp___0 [L294] COND FALSE !(\read(r211)) [L297] COND TRUE \read(r231) [L298] COND TRUE \read(ep31) [L299] 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 TRUE \read(r321) [L334] tmp___4 = 1 [L345] r322 = (_Bool )tmp___4 [L346] COND TRUE (int )id1 != (int )id2 [L347] COND TRUE (int )id1 != (int )id3 [L348] COND TRUE (int )id2 != (int )id3 [L349] COND TRUE (int )id1 >= 0 [L350] COND TRUE (int )id2 >= 0 [L351] COND TRUE (int )id3 >= 0 [L352] COND TRUE (int )r1 == 0 [L353] COND TRUE (int )r2 == 0 [L354] COND TRUE (int )r3 == 0 [L355] COND TRUE \read(r122) [L356] COND TRUE \read(r132) [L357] COND TRUE \read(r212) [L358] COND TRUE \read(r232) [L359] COND TRUE \read(r312) [L360] COND TRUE \read(r322) [L361] COND TRUE (int )max1 == (int )id1 [L362] COND TRUE (int )max2 == (int )id2 [L363] COND TRUE (int )max3 == (int )id3 [L364] COND TRUE (int )st1 == 0 [L365] COND TRUE (int )st2 == 0 [L366] COND TRUE (int )st3 == 0 [L367] COND TRUE (int )nl1 == 0 [L368] COND TRUE (int )nl2 == 0 [L369] COND TRUE (int )nl3 == 0 [L370] COND TRUE (int )mode1 == 0 [L371] COND TRUE (int )mode2 == 0 [L372] COND TRUE (int )mode3 == 0 [L373] COND TRUE \read(newmax1) [L374] COND TRUE \read(newmax2) [L375] COND TRUE \read(newmax3) [L376] tmp___5 = 1 [L467] return (tmp___5); [L563] RET, EXPR init() [L563] i2 = init() [L564] CALL assume_abort_if_not(i2) [L22] COND FALSE !(!cond) [L564] RET assume_abort_if_not(i2) [L565] p12_old = nomsg [L566] p12_new = nomsg [L567] p13_old = nomsg [L568] p13_new = nomsg [L569] p21_old = nomsg [L570] p21_new = nomsg [L571] p23_old = nomsg [L572] p23_new = nomsg [L573] p31_old = nomsg [L574] p31_new = nomsg [L575] p32_old = nomsg [L576] p32_new = nomsg [L577] i2 = 0 VAL [c1=0, ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, i2=0, id1=125, id2=124, id3=126, m1=127, m2=-2, m3=127, max1=125, max2=124, max3=126, mode1=0, mode2=0, mode3=0, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L578] COND TRUE 1 [L580] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND FALSE !(\read(mode1)) [L114] COND TRUE (int )r1 < 2 [L115] COND FALSE !(\read(ep12)) [L120] COND TRUE \read(ep13) [L121] COND TRUE \read(newmax1) [L122] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L126] mode1 = (_Bool)1 [L580] RET node1() [L581] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND FALSE !(\read(mode2)) [L168] COND TRUE (int )r2 < 2 [L169] COND FALSE !(\read(ep21)) [L174] COND TRUE \read(ep23) [L175] COND TRUE \read(newmax2) [L176] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L180] mode2 = (_Bool)1 [L581] RET node2() [L582] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND FALSE !(\read(mode3)) [L222] COND TRUE (int )r3 < 2 [L223] COND TRUE \read(ep31) [L224] COND TRUE \read(newmax3) [L225] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L228] COND TRUE \read(ep32) [L229] COND TRUE \read(newmax3) [L230] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L234] mode3 = (_Bool)1 [L582] RET node3() [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L595] CALL, EXPR check() [L472] int tmp ; VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=125, id2=124, id3=126, m1=127, m2=-2, m3=127, max1=125, max2=124, max3=126, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=124, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=125, id2=124, id3=126, m1=127, m2=-2, m3=127, max1=125, max2=124, max3=126, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=124, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=125, id2=124, id3=126, m1=127, m2=-2, m3=127, max1=125, max2=124, max3=126, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=124, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=125, id2=124, id3=126, m1=127, m2=-2, m3=127, max1=125, max2=124, max3=126, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=124, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=125, id2=124, id3=126, m1=127, m2=-2, m3=127, max1=125, max2=124, max3=126, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=124, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=125, id2=124, id3=126, m1=127, m2=-2, m3=127, max1=125, max2=124, max3=126, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=124, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=125, id2=124, id3=126, m1=127, m2=-2, m3=127, max1=125, max2=124, max3=126, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=124, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=125, id2=124, id3=126, m1=127, m2=-2, m3=127, max1=125, max2=124, max3=126, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=124, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L489] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=125, id2=124, id3=126, m1=127, m2=-2, m3=127, max1=125, max2=124, max3=126, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=124, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L492] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=125, id2=124, id3=126, m1=127, m2=-2, m3=127, max1=125, max2=124, max3=126, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=124, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L494] COND TRUE (int )r1 < 2 [L495] tmp = 1 VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=125, id2=124, id3=126, m1=127, m2=-2, m3=127, max1=125, max2=124, max3=126, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=124, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0, tmp=1] [L523] return (tmp); [L595] RET, EXPR check() [L595] c1 = check() [L596] CALL assert(c1) [L607] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=125, id2=124, id3=126, m1=127, m2=-2, m3=127, max1=125, max2=124, max3=126, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=124, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L596] RET assert(c1) [L578] COND TRUE 1 [L580] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND TRUE \read(mode1) [L84] COND FALSE !(r1 == 255) [L87] r1 = r1 + 1 [L88] COND FALSE !(\read(ep21)) [L96] COND TRUE \read(ep31) [L97] m1 = p31_old [L98] p31_old = nomsg [L99] COND TRUE (int )m1 > (int )max1 [L100] max1 = m1 [L101] newmax = (_Bool)1 [L104] newmax1 = newmax [L105] COND FALSE !((int )r1 == 2) [L112] mode1 = (_Bool)0 [L580] RET node1() [L581] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND TRUE \read(mode2) [L138] COND FALSE !(r2 == 255) [L141] r2 = r2 + 1 [L142] COND FALSE !(\read(ep12)) [L150] COND TRUE \read(ep32) [L151] m2 = p32_old [L152] p32_old = nomsg [L153] COND TRUE (int )m2 > (int )max2 [L154] max2 = m2 [L155] newmax = (_Bool)1 [L158] newmax2 = newmax [L159] COND FALSE !((int )r2 == 2) [L166] mode2 = (_Bool)0 [L581] RET node2() [L582] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND TRUE \read(mode3) [L192] COND FALSE !(r3 == 255) [L195] r3 = r3 + 1 [L196] COND TRUE \read(ep13) [L197] m3 = p13_old [L198] p13_old = nomsg [L199] COND FALSE !((int )m3 > (int )max3) [L204] COND TRUE \read(ep23) [L205] m3 = p23_old [L206] p23_old = nomsg [L207] COND FALSE !((int )m3 > (int )max3) [L212] newmax3 = newmax [L213] COND FALSE !((int )r3 == 2) [L220] mode3 = (_Bool)0 [L582] RET node3() [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L595] CALL, EXPR check() [L472] int tmp ; VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=125, id2=124, id3=126, m1=126, m2=126, m3=124, max1=126, max2=126, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=125, id2=124, id3=126, m1=126, m2=126, m3=124, max1=126, max2=126, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=125, id2=124, id3=126, m1=126, m2=126, m3=124, max1=126, max2=126, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=125, id2=124, id3=126, m1=126, m2=126, m3=124, max1=126, max2=126, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=125, id2=124, id3=126, m1=126, m2=126, m3=124, max1=126, max2=126, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=125, id2=124, id3=126, m1=126, m2=126, m3=124, max1=126, max2=126, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=125, id2=124, id3=126, m1=126, m2=126, m3=124, max1=126, max2=126, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=125, id2=124, id3=126, m1=126, m2=126, m3=124, max1=126, max2=126, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L489] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=125, id2=124, id3=126, m1=126, m2=126, m3=124, max1=126, max2=126, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L492] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=125, id2=124, id3=126, m1=126, m2=126, m3=124, max1=126, max2=126, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L494] COND TRUE (int )r1 < 2 [L495] tmp = 1 VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=125, id2=124, id3=126, m1=126, m2=126, m3=124, max1=126, max2=126, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L523] return (tmp); [L595] RET, EXPR check() [L595] c1 = check() [L596] CALL assert(c1) [L607] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=125, id2=124, id3=126, m1=126, m2=126, m3=124, max1=126, max2=126, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L596] RET assert(c1) [L578] COND TRUE 1 [L580] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND FALSE !(\read(mode1)) [L114] COND TRUE (int )r1 < 2 [L115] COND FALSE !(\read(ep12)) [L120] COND TRUE \read(ep13) [L121] COND TRUE \read(newmax1) [L122] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L126] mode1 = (_Bool)1 [L580] RET node1() [L581] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND FALSE !(\read(mode2)) [L168] COND TRUE (int )r2 < 2 [L169] COND FALSE !(\read(ep21)) [L174] COND TRUE \read(ep23) [L175] COND TRUE \read(newmax2) [L176] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L180] mode2 = (_Bool)1 [L581] RET node2() [L582] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND FALSE !(\read(mode3)) [L222] COND TRUE (int )r3 < 2 [L223] COND TRUE \read(ep31) [L224] COND FALSE !(\read(newmax3)) [L228] COND TRUE \read(ep32) [L229] COND FALSE !(\read(newmax3)) [L234] mode3 = (_Bool)1 [L582] RET node3() [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L595] CALL, EXPR check() [L472] int tmp ; VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=125, id2=124, id3=126, m1=126, m2=126, m3=124, max1=126, max2=126, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=125, id2=124, id3=126, m1=126, m2=126, m3=124, max1=126, max2=126, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=125, id2=124, id3=126, m1=126, m2=126, m3=124, max1=126, max2=126, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=125, id2=124, id3=126, m1=126, m2=126, m3=124, max1=126, max2=126, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=125, id2=124, id3=126, m1=126, m2=126, m3=124, max1=126, max2=126, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=125, id2=124, id3=126, m1=126, m2=126, m3=124, max1=126, max2=126, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=125, id2=124, id3=126, m1=126, m2=126, m3=124, max1=126, max2=126, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=125, id2=124, id3=126, m1=126, m2=126, m3=124, max1=126, max2=126, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L489] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=125, id2=124, id3=126, m1=126, m2=126, m3=124, max1=126, max2=126, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L492] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=125, id2=124, id3=126, m1=126, m2=126, m3=124, max1=126, max2=126, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L494] COND TRUE (int )r1 < 2 [L495] tmp = 1 VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=125, id2=124, id3=126, m1=126, m2=126, m3=124, max1=126, max2=126, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L523] return (tmp); [L595] RET, EXPR check() [L595] c1 = check() [L596] CALL assert(c1) [L607] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=125, id2=124, id3=126, m1=126, m2=126, m3=124, max1=126, max2=126, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L596] RET assert(c1) [L578] COND TRUE 1 [L580] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND TRUE \read(mode1) [L84] COND FALSE !(r1 == 255) [L87] r1 = r1 + 1 [L88] COND FALSE !(\read(ep21)) [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 [L580] RET node1() [L581] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND TRUE \read(mode2) [L138] COND FALSE !(r2 == 255) [L141] r2 = r2 + 1 [L142] COND FALSE !(\read(ep12)) [L150] COND TRUE \read(ep32) [L151] m2 = p32_old [L152] p32_old = nomsg [L153] COND FALSE !((int )m2 > (int )max2) [L158] newmax2 = newmax [L159] COND TRUE (int )r2 == 2 [L160] COND FALSE !((int )max2 == (int )id2) [L163] nl2 = (char)1 [L166] mode2 = (_Bool)0 [L581] RET node2() [L582] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND TRUE \read(mode3) [L192] COND FALSE !(r3 == 255) [L195] r3 = r3 + 1 [L196] COND TRUE \read(ep13) [L197] m3 = p13_old [L198] p13_old = nomsg [L199] COND FALSE !((int )m3 > (int )max3) [L204] COND 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 TRUE (int )max3 == (int )id3 [L215] st3 = (char)1 [L220] mode3 = (_Bool)0 [L582] RET node3() [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L595] CALL, EXPR check() [L472] int tmp ; VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=125, id2=124, id3=126, m1=-1, m2=-1, m3=126, max1=126, max2=126, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L475] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L521] tmp = 0 VAL [ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=125, id2=124, id3=126, m1=-1, m2=-1, m3=126, max1=126, max2=126, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1, tmp=0] [L523] return (tmp); [L595] RET, EXPR check() [L595] c1 = check() [L596] CALL assert(c1) [L607] COND TRUE ! arg VAL [\old(arg)=0, arg=0, ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=125, id2=124, id3=126, m1=-1, m2=-1, m3=126, max1=126, max2=126, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L609] reach_error() VAL [\old(arg)=0, arg=0, ep12=0, ep13=255, ep21=0, ep23=255, ep31=255, ep32=1, id1=125, id2=124, id3=126, m1=-1, m2=-1, m3=126, max1=126, max2=126, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 161.5MB. Free memory is still 132.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 313.03ms. Allocated memory is still 161.5MB. Free memory was 124.7MB in the beginning and 107.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.26ms. Allocated memory is still 161.5MB. Free memory was 107.9MB in the beginning and 104.9MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.87ms. Allocated memory is still 161.5MB. Free memory was 104.9MB in the beginning and 102.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 966.06ms. Allocated memory was 161.5MB in the beginning and 199.2MB in the end (delta: 37.7MB). Free memory was 102.2MB in the beginning and 121.1MB in the end (delta: -18.8MB). Peak memory consumption was 72.6MB. Max. memory is 16.1GB. * CodeCheck took 237926.19ms. Allocated memory was 199.2MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 121.1MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 239.0MB. Max. memory is 16.1GB. * Witness Printer took 85.34ms. Allocated memory is still 1.5GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2022-12-14 21:52:32,492 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5651f9b-1131-48e1-9c26-11cb7ef5795b/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE