./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.BOUNDED-6.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_4219afc3-fd8d-4a27-b9f6-493df9f70d46/bin/ukojak-rkRKPMF4O4/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4219afc3-fd8d-4a27-b9f6-493df9f70d46/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_4219afc3-fd8d-4a27-b9f6-493df9f70d46/bin/ukojak-rkRKPMF4O4/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4219afc3-fd8d-4a27-b9f6-493df9f70d46/bin/ukojak-rkRKPMF4O4/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4219afc3-fd8d-4a27-b9f6-493df9f70d46/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_4219afc3-fd8d-4a27-b9f6-493df9f70d46/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 c3ae342bfdc7bf76083bf4321cb5b6b26fe707bda9cd6edf475282aebbd1033a --- 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:20:50,889 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 21:20:50,891 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 21:20:50,909 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 21:20:50,910 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 21:20:50,910 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 21:20:50,912 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 21:20:50,913 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 21:20:50,915 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 21:20:50,915 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 21:20:50,916 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 21:20:50,917 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 21:20:50,918 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 21:20:50,918 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 21:20:50,919 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 21:20:50,920 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 21:20:50,921 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 21:20:50,922 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 21:20:50,923 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 21:20:50,925 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 21:20:50,926 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 21:20:50,927 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 21:20:50,929 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 21:20:50,929 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 21:20:50,933 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 21:20:50,933 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 21:20:50,933 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 21:20:50,934 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 21:20:50,934 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 21:20:50,935 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 21:20:50,935 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 21:20:50,936 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 21:20:50,937 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 21:20:50,937 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 21:20:50,938 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 21:20:50,939 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 21:20:50,939 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 21:20:50,939 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 21:20:50,940 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 21:20:50,940 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 21:20:50,941 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 21:20:50,941 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4219afc3-fd8d-4a27-b9f6-493df9f70d46/bin/ukojak-rkRKPMF4O4/config/svcomp-Reach-32bit-Kojak_Default.epf [2022-12-14 21:20:50,961 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 21:20:50,962 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 21:20:50,962 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 21:20:50,962 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2022-12-14 21:20:50,963 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 21:20:50,963 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 21:20:50,964 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 21:20:50,964 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 21:20:50,964 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 21:20:50,964 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 21:20:50,964 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 21:20:50,964 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 21:20:50,964 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 21:20:50,964 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 21:20:50,965 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 21:20:50,965 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 21:20:50,965 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 21:20:50,965 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 21:20:50,965 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2022-12-14 21:20:50,965 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2022-12-14 21:20:50,965 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 21:20:50,965 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-14 21:20:50,966 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 21:20:50,966 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 21:20:50,966 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 21:20:50,966 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2022-12-14 21:20:50,966 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 21:20:50,966 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 21:20:50,966 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_4219afc3-fd8d-4a27-b9f6-493df9f70d46/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_4219afc3-fd8d-4a27-b9f6-493df9f70d46/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 -> c3ae342bfdc7bf76083bf4321cb5b6b26fe707bda9cd6edf475282aebbd1033a [2022-12-14 21:20:51,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 21:20:51,191 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 21:20:51,193 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 21:20:51,194 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 21:20:51,195 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 21:20:51,196 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4219afc3-fd8d-4a27-b9f6-493df9f70d46/bin/ukojak-rkRKPMF4O4/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c [2022-12-14 21:20:53,769 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 21:20:53,939 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 21:20:53,940 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4219afc3-fd8d-4a27-b9f6-493df9f70d46/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c [2022-12-14 21:20:53,946 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4219afc3-fd8d-4a27-b9f6-493df9f70d46/bin/ukojak-rkRKPMF4O4/data/19458584c/523971d99b3542ffad504b3fd04b7443/FLAG834da821f [2022-12-14 21:20:53,959 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4219afc3-fd8d-4a27-b9f6-493df9f70d46/bin/ukojak-rkRKPMF4O4/data/19458584c/523971d99b3542ffad504b3fd04b7443 [2022-12-14 21:20:53,961 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 21:20:53,963 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 21:20:53,964 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 21:20:53,964 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 21:20:53,967 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 21:20:53,968 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 09:20:53" (1/1) ... [2022-12-14 21:20:53,969 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3baa57e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:20:53, skipping insertion in model container [2022-12-14 21:20:53,969 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 09:20:53" (1/1) ... [2022-12-14 21:20:53,975 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 21:20:54,012 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 21:20:54,201 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_4219afc3-fd8d-4a27-b9f6-493df9f70d46/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c[12764,12777] [2022-12-14 21:20:54,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 21:20:54,216 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 21:20:54,267 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_4219afc3-fd8d-4a27-b9f6-493df9f70d46/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c[12764,12777] [2022-12-14 21:20:54,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 21:20:54,283 INFO L208 MainTranslator]: Completed translation [2022-12-14 21:20:54,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:20:54 WrapperNode [2022-12-14 21:20:54,284 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 21:20:54,285 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 21:20:54,285 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 21:20:54,285 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 21:20:54,292 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:20:54" (1/1) ... [2022-12-14 21:20:54,303 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:20:54" (1/1) ... [2022-12-14 21:20:54,334 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 417 [2022-12-14 21:20:54,334 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 21:20:54,335 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 21:20:54,335 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 21:20:54,335 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 21:20:54,344 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:20:54" (1/1) ... [2022-12-14 21:20:54,344 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:20:54" (1/1) ... [2022-12-14 21:20:54,348 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:20:54" (1/1) ... [2022-12-14 21:20:54,349 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:20:54" (1/1) ... [2022-12-14 21:20:54,359 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:20:54" (1/1) ... [2022-12-14 21:20:54,366 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:20:54" (1/1) ... [2022-12-14 21:20:54,367 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:20:54" (1/1) ... [2022-12-14 21:20:54,369 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:20:54" (1/1) ... [2022-12-14 21:20:54,371 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 21:20:54,372 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 21:20:54,372 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 21:20:54,372 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 21:20:54,373 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:20:54" (1/1) ... [2022-12-14 21:20:54,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-14 21:20:54,387 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4219afc3-fd8d-4a27-b9f6-493df9f70d46/bin/ukojak-rkRKPMF4O4/z3 [2022-12-14 21:20:54,398 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4219afc3-fd8d-4a27-b9f6-493df9f70d46/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2022-12-14 21:20:54,400 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4219afc3-fd8d-4a27-b9f6-493df9f70d46/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2022-12-14 21:20:54,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 21:20:54,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 21:20:54,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 21:20:54,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 21:20:54,513 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 21:20:54,515 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 21:20:54,928 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 21:20:55,339 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 21:20:55,339 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-14 21:20:55,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:20:55 BoogieIcfgContainer [2022-12-14 21:20:55,342 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 21:20:55,343 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2022-12-14 21:20:55,343 INFO L271 PluginConnector]: Initializing CodeCheck... [2022-12-14 21:20:55,352 INFO L275 PluginConnector]: CodeCheck initialized [2022-12-14 21:20:55,352 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:20:55" (1/1) ... [2022-12-14 21:20:55,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 21:20:55,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:20:55,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2022-12-14 21:20:55,413 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2022-12-14 21:20:55,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 21:20:55,415 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:20:55,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:20:55,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:20:56,497 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:20:56,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:20:56,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 21 states and 34 transitions. [2022-12-14 21:20:56,583 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2022-12-14 21:20:56,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 21:20:56,583 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:20:56,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:20:56,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:20:57,251 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:20:57,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:20:57,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 24 states and 41 transitions. [2022-12-14 21:20:57,482 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2022-12-14 21:20:57,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 21:20:57,483 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:20:57,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:20:57,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:20:58,206 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:20:58,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:20:58,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 28 states and 50 transitions. [2022-12-14 21:20:58,529 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 50 transitions. [2022-12-14 21:20:58,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 21:20:58,530 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:20:58,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:20:58,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:20:59,282 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:20:59,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:20:59,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 33 states and 61 transitions. [2022-12-14 21:20:59,779 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 61 transitions. [2022-12-14 21:20:59,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 21:20:59,780 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:20:59,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:20:59,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:21:00,626 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:21:01,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:21:01,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 40 states and 74 transitions. [2022-12-14 21:21:01,287 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 74 transitions. [2022-12-14 21:21:01,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 21:21:01,287 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:21:01,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:21:01,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:21:01,742 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:21:02,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:21:02,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 46 states and 86 transitions. [2022-12-14 21:21:02,588 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 86 transitions. [2022-12-14 21:21:02,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 21:21:02,589 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:21:02,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:21:02,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:21:02,641 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:21:02,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:21:02,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 47 states and 86 transitions. [2022-12-14 21:21:02,789 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 86 transitions. [2022-12-14 21:21:02,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 21:21:02,789 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:21:02,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:21:02,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:21:02,831 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:21:02,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:21:02,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 48 states and 87 transitions. [2022-12-14 21:21:02,841 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 87 transitions. [2022-12-14 21:21:02,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 21:21:02,842 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:21:02,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:21:02,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:21:03,434 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:21:04,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:21:04,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 58 states and 104 transitions. [2022-12-14 21:21:04,714 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 104 transitions. [2022-12-14 21:21:04,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 21:21:04,715 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:21:04,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:21:04,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:21:04,959 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:21:05,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:21:05,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 61 states and 109 transitions. [2022-12-14 21:21:05,138 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 109 transitions. [2022-12-14 21:21:05,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 21:21:05,139 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:21:05,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:21:05,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:21:06,913 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:21:10,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:21:10,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 77 states and 143 transitions. [2022-12-14 21:21:10,342 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 143 transitions. [2022-12-14 21:21:10,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 21:21:10,343 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:21:10,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:21:10,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:21:11,380 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:21:15,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:21:15,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 94 states and 180 transitions. [2022-12-14 21:21:15,564 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 180 transitions. [2022-12-14 21:21:15,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 21:21:15,565 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:21:15,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:21:15,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:21:16,424 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:21:19,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:21:19,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 107 states and 201 transitions. [2022-12-14 21:21:19,424 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 201 transitions. [2022-12-14 21:21:19,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 21:21:19,424 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:21:19,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:21:19,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:21:20,601 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:21:25,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:21:25,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 125 states and 241 transitions. [2022-12-14 21:21:25,515 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 241 transitions. [2022-12-14 21:21:25,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 21:21:25,516 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:21:25,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:21:25,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:21:27,113 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:21:30,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:21:30,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 137 states and 259 transitions. [2022-12-14 21:21:30,663 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 259 transitions. [2022-12-14 21:21:30,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 21:21:30,664 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:21:30,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:21:30,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:21:31,853 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:21:36,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:21:36,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 144 states and 275 transitions. [2022-12-14 21:21:36,504 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 275 transitions. [2022-12-14 21:21:36,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 21:21:36,505 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:21:36,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:21:36,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:21:38,628 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:21:45,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:21:45,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 163 states and 313 transitions. [2022-12-14 21:21:45,619 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 313 transitions. [2022-12-14 21:21:45,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 21:21:45,619 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:21:45,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:21:45,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:21:46,469 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:21:52,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:21:52,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 181 states and 344 transitions. [2022-12-14 21:21:52,310 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 344 transitions. [2022-12-14 21:21:52,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 21:21:52,311 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:21:52,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:21:52,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:21:53,034 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:21:53,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:21:53,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 182 states and 345 transitions. [2022-12-14 21:21:53,289 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 345 transitions. [2022-12-14 21:21:53,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 21:21:53,289 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:21:53,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:21:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:21:53,962 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:21:54,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:21:54,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 186 states and 353 transitions. [2022-12-14 21:21:54,979 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 353 transitions. [2022-12-14 21:21:54,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 21:21:54,980 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:21:54,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:21:55,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:21:56,709 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:22:01,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:22:01,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 194 states and 372 transitions. [2022-12-14 21:22:01,282 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 372 transitions. [2022-12-14 21:22:01,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 21:22:01,282 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:22:01,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:22:01,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:22:03,450 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:22:10,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:22:10,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 212 states and 408 transitions. [2022-12-14 21:22:10,157 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 408 transitions. [2022-12-14 21:22:10,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 21:22:10,158 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:22:10,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:22:10,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:22:11,960 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:22:19,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:22:19,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 226 states and 463 transitions. [2022-12-14 21:22:19,245 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 463 transitions. [2022-12-14 21:22:19,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 21:22:19,245 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:22:19,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:22:19,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:22:21,080 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:22:27,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:22:27,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 239 states and 495 transitions. [2022-12-14 21:22:27,081 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 495 transitions. [2022-12-14 21:22:27,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 21:22:27,082 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:22:27,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:22:27,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:22:29,486 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:22:40,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:22:40,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 263 states and 569 transitions. [2022-12-14 21:22:40,842 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 569 transitions. [2022-12-14 21:22:40,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 21:22:40,843 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:22:40,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:22:40,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:22:43,770 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:23:00,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:23:00,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 291 states and 644 transitions. [2022-12-14 21:23:00,136 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 644 transitions. [2022-12-14 21:23:00,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 21:23:00,137 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:23:00,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:23:00,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:23:01,784 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:23:07,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:23:07,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 302 states and 667 transitions. [2022-12-14 21:23:07,745 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 667 transitions. [2022-12-14 21:23:07,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 21:23:07,745 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:23:07,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:23:07,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:23:08,640 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:23:14,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:23:14,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 315 states and 691 transitions. [2022-12-14 21:23:14,274 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 691 transitions. [2022-12-14 21:23:14,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 21:23:14,274 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:23:14,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:23:14,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:23:15,170 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:23:15,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:23:15,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 316 states and 695 transitions. [2022-12-14 21:23:15,817 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 695 transitions. [2022-12-14 21:23:15,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 21:23:15,818 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:23:15,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:23:15,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:23:17,458 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:23:19,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:23:19,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 319 states and 702 transitions. [2022-12-14 21:23:19,419 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 702 transitions. [2022-12-14 21:23:19,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 21:23:19,420 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:23:19,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:23:19,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:23:20,353 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:23:21,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:23:21,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 320 states and 704 transitions. [2022-12-14 21:23:21,138 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 704 transitions. [2022-12-14 21:23:21,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 21:23:21,139 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:23:21,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:23:21,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:23:22,967 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:23:31,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:23:31,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 332 states and 736 transitions. [2022-12-14 21:23:31,214 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 736 transitions. [2022-12-14 21:23:31,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 21:23:31,214 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:23:31,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:23:31,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:23:34,919 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:23:44,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:23:44,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 342 states and 768 transitions. [2022-12-14 21:23:44,596 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 768 transitions. [2022-12-14 21:23:44,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 21:23:44,596 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:23:44,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:23:44,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:23:45,507 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:23:46,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:23:46,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 343 states and 774 transitions. [2022-12-14 21:23:46,402 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 774 transitions. [2022-12-14 21:23:46,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 21:23:46,403 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:23:46,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:23:46,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:23:47,283 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:23:47,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:23:47,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 344 states and 776 transitions. [2022-12-14 21:23:47,945 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 776 transitions. [2022-12-14 21:23:47,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 21:23:47,946 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:23:47,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:23:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:23:48,819 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:23:49,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:23:49,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 345 states and 779 transitions. [2022-12-14 21:23:49,633 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 779 transitions. [2022-12-14 21:23:49,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 21:23:49,633 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:23:49,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:23:49,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:23:50,542 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:23:51,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:23:51,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 346 states and 784 transitions. [2022-12-14 21:23:51,241 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 784 transitions. [2022-12-14 21:23:51,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 21:23:51,241 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:23:51,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:23:51,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:23:52,170 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:23:57,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:23:57,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 354 states and 797 transitions. [2022-12-14 21:23:57,277 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 797 transitions. [2022-12-14 21:23:57,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 21:23:57,278 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:23:57,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:23:57,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:24:00,299 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:24:12,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:24:12,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 366 states and 833 transitions. [2022-12-14 21:24:12,111 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 833 transitions. [2022-12-14 21:24:12,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 21:24:12,111 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:24:12,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:24:12,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:24:14,070 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:24:17,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:24:17,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 367 states and 838 transitions. [2022-12-14 21:24:17,184 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 838 transitions. [2022-12-14 21:24:17,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 21:24:17,185 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:24:17,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:24:17,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:24:18,044 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:24:25,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:24:25,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 376 states and 861 transitions. [2022-12-14 21:24:25,569 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 861 transitions. [2022-12-14 21:24:25,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 21:24:25,569 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:24:25,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:24:25,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:24:26,405 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:24:33,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:24:33,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 385 states and 885 transitions. [2022-12-14 21:24:33,179 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 885 transitions. [2022-12-14 21:24:33,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 21:24:33,179 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:24:33,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:24:33,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:24:34,106 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:24:37,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:24:37,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 388 states and 899 transitions. [2022-12-14 21:24:37,268 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 899 transitions. [2022-12-14 21:24:37,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 21:24:37,269 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:24:37,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:24:37,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:24:40,047 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:24:50,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:24:50,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 395 states and 918 transitions. [2022-12-14 21:24:50,512 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 918 transitions. [2022-12-14 21:24:50,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 21:24:50,512 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:24:50,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:24:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:24:52,761 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:24:58,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:24:58,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 399 states and 940 transitions. [2022-12-14 21:24:58,733 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 940 transitions. [2022-12-14 21:24:58,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 21:24:58,734 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:24:58,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:24:58,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:25:00,001 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:25:06,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:25:06,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 403 states and 953 transitions. [2022-12-14 21:25:06,355 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 953 transitions. [2022-12-14 21:25:06,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 21:25:06,355 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:25:06,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:25:06,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:25:07,555 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:25:12,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:25:12,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 406 states and 960 transitions. [2022-12-14 21:25:12,545 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 960 transitions. [2022-12-14 21:25:12,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 21:25:12,545 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:25:12,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:25:12,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:25:14,087 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:25:15,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:25:15,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 407 states and 964 transitions. [2022-12-14 21:25:15,448 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 964 transitions. [2022-12-14 21:25:15,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 21:25:15,448 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:25:15,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:25:15,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:25:16,780 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:25:19,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:25:19,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 410 states and 978 transitions. [2022-12-14 21:25:19,752 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 978 transitions. [2022-12-14 21:25:19,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 21:25:19,752 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:25:19,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:25:19,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:25:20,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:25:28,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:25:28,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 417 states and 1002 transitions. [2022-12-14 21:25:28,386 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 1002 transitions. [2022-12-14 21:25:28,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 21:25:28,387 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:25:28,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:25:28,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:25:30,622 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:25:36,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:25:36,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 421 states and 1015 transitions. [2022-12-14 21:25:36,224 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 1015 transitions. [2022-12-14 21:25:36,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 21:25:36,225 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:25:36,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:25:36,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:25:37,157 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:25:41,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:25:41,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 425 states and 1030 transitions. [2022-12-14 21:25:41,001 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 1030 transitions. [2022-12-14 21:25:41,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 21:25:41,001 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:25:41,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:25:41,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:25:44,035 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:25:47,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:25:47,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 426 states and 1031 transitions. [2022-12-14 21:25:47,274 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 1031 transitions. [2022-12-14 21:25:47,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 21:25:47,274 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:25:47,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:25:47,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:25:49,045 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:25:52,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:25:52,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 429 states and 1042 transitions. [2022-12-14 21:25:52,117 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 1042 transitions. [2022-12-14 21:25:52,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 21:25:52,117 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:25:52,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:25:52,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:25:52,893 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:25:54,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:25:54,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 430 states and 1044 transitions. [2022-12-14 21:25:54,204 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1044 transitions. [2022-12-14 21:25:54,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 21:25:54,205 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:25:54,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:25:54,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:25:56,027 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:26:05,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:26:05,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 437 states and 1069 transitions. [2022-12-14 21:26:05,495 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 1069 transitions. [2022-12-14 21:26:05,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 21:26:05,495 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:26:05,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:26:05,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:26:07,512 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:26:12,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:26:12,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 441 states and 1090 transitions. [2022-12-14 21:26:12,746 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 1090 transitions. [2022-12-14 21:26:12,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 21:26:12,746 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:26:12,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:26:12,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:26:16,283 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:26:28,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:26:28,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 453 states and 1111 transitions. [2022-12-14 21:26:28,185 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 1111 transitions. [2022-12-14 21:26:28,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 21:26:28,186 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:26:28,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:26:28,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:26:29,432 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:26:32,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:26:32,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 455 states and 1116 transitions. [2022-12-14 21:26:32,915 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 1116 transitions. [2022-12-14 21:26:32,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 21:26:32,915 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:26:32,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:26:33,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:26:34,162 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:26:35,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:26:35,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 456 states and 1118 transitions. [2022-12-14 21:26:35,024 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 1118 transitions. [2022-12-14 21:26:35,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 21:26:35,024 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:26:35,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:26:35,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:26:36,334 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:26:37,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:26:37,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 457 states and 1119 transitions. [2022-12-14 21:26:37,469 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 1119 transitions. [2022-12-14 21:26:37,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-14 21:26:37,469 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:26:37,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:26:37,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 21:26:37,827 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 21:26:38,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 21:26:38,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 21:26:38,679 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 21:26:39,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 21:26:39,133 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 62 iterations. [2022-12-14 21:26:39,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 14.12 09:26:39 ImpRootNode [2022-12-14 21:26:39,220 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2022-12-14 21:26:39,221 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 21:26:39,221 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 21:26:39,221 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 21:26:39,221 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:20:55" (3/4) ... [2022-12-14 21:26:39,223 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-14 21:26:39,298 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4219afc3-fd8d-4a27-b9f6-493df9f70d46/bin/ukojak-rkRKPMF4O4/witness.graphml [2022-12-14 21:26:39,298 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 21:26:39,299 INFO L158 Benchmark]: Toolchain (without parser) took 345336.12ms. Allocated memory was 117.4MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 74.3MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 500.6MB. Max. memory is 16.1GB. [2022-12-14 21:26:39,299 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 117.4MB. Free memory is still 90.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 21:26:39,299 INFO L158 Benchmark]: CACSL2BoogieTranslator took 319.86ms. Allocated memory is still 117.4MB. Free memory was 74.3MB in the beginning and 58.2MB in the end (delta: 16.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-14 21:26:39,299 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.79ms. Allocated memory is still 117.4MB. Free memory was 58.2MB in the beginning and 55.1MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 21:26:39,300 INFO L158 Benchmark]: Boogie Preprocessor took 36.33ms. Allocated memory is still 117.4MB. Free memory was 55.1MB in the beginning and 52.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 21:26:39,300 INFO L158 Benchmark]: RCFGBuilder took 969.91ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 52.6MB in the beginning and 102.8MB in the end (delta: -50.2MB). Peak memory consumption was 42.9MB. Max. memory is 16.1GB. [2022-12-14 21:26:39,300 INFO L158 Benchmark]: CodeCheck took 343877.87ms. Allocated memory was 151.0MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 102.8MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 479.4MB. Max. memory is 16.1GB. [2022-12-14 21:26:39,300 INFO L158 Benchmark]: Witness Printer took 77.81ms. Allocated memory is still 1.7GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-14 21:26:39,301 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: 343.8s, OverallIterations: 62, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 39202 SdHoareTripleChecker+Valid, 243.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 37191 mSDsluCounter, 15416 SdHoareTripleChecker+Invalid, 216.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14417 mSDsCounter, 10422 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 107362 IncrementalHoareTripleChecker+Invalid, 117784 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10422 mSolverCounterUnsat, 999 mSDtfsCounter, 107362 mSolverCounterSat, 1.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23162 GetRequests, 20910 SyntacticMatches, 758 SemanticMatches, 1494 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1349800 ImplicationChecksByTransitivity, 271.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 6.0s SatisfiabilityAnalysisTime, 79.0s InterpolantComputationTime, 1919 NumberOfCodeBlocks, 1919 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 1810 ConstructedInterpolants, 0 QuantifiedInterpolants, 19292 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 61 InterpolantComputations, 10 PerfectInterpolantSequences, 224/1235 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: 555]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] msg_t nomsg = (msg_t )-1; [L25] port_t p12 ; [L26] char p12_old ; [L27] char p12_new ; [L28] _Bool ep12 ; [L29] port_t p13 ; [L30] char p13_old ; [L31] char p13_new ; [L32] _Bool ep13 ; [L33] port_t p21 ; [L34] char p21_old ; [L35] char p21_new ; [L36] _Bool ep21 ; [L37] port_t p23 ; [L38] char p23_old ; [L39] char p23_new ; [L40] _Bool ep23 ; [L41] port_t p31 ; [L42] char p31_old ; [L43] char p31_new ; [L44] _Bool ep31 ; [L45] port_t p32 ; [L46] char p32_old ; [L47] char p32_new ; [L48] _Bool ep32 ; [L49] char id1 ; [L50] char r1 ; [L51] char st1 ; [L52] char nl1 ; [L53] char m1 ; [L54] char max1 ; [L55] _Bool mode1 ; [L56] char id2 ; [L57] char r2 ; [L58] char st2 ; [L59] char nl2 ; [L60] char m2 ; [L61] char max2 ; [L62] _Bool mode2 ; [L63] char id3 ; [L64] char r3 ; [L65] char st3 ; [L66] char nl3 ; [L67] char m3 ; [L68] char max3 ; [L69] _Bool mode3 ; [L476] int c1 ; [L477] int i2 ; [L480] c1 = 0 [L481] ep12 = __VERIFIER_nondet_bool() [L482] ep13 = __VERIFIER_nondet_bool() [L483] ep21 = __VERIFIER_nondet_bool() [L484] ep23 = __VERIFIER_nondet_bool() [L485] ep31 = __VERIFIER_nondet_bool() [L486] ep32 = __VERIFIER_nondet_bool() [L487] id1 = __VERIFIER_nondet_char() [L488] r1 = __VERIFIER_nondet_char() [L489] st1 = __VERIFIER_nondet_char() [L490] nl1 = __VERIFIER_nondet_char() [L491] m1 = __VERIFIER_nondet_char() [L492] max1 = __VERIFIER_nondet_char() [L493] mode1 = __VERIFIER_nondet_bool() [L494] id2 = __VERIFIER_nondet_char() [L495] r2 = __VERIFIER_nondet_char() [L496] st2 = __VERIFIER_nondet_char() [L497] nl2 = __VERIFIER_nondet_char() [L498] m2 = __VERIFIER_nondet_char() [L499] max2 = __VERIFIER_nondet_char() [L500] mode2 = __VERIFIER_nondet_bool() [L501] id3 = __VERIFIER_nondet_char() [L502] r3 = __VERIFIER_nondet_char() [L503] st3 = __VERIFIER_nondet_char() [L504] nl3 = __VERIFIER_nondet_char() [L505] m3 = __VERIFIER_nondet_char() [L506] max3 = __VERIFIER_nondet_char() [L507] mode3 = __VERIFIER_nondet_bool() [L508] CALL, EXPR init() [L201] _Bool r121 ; [L202] _Bool r131 ; [L203] _Bool r211 ; [L204] _Bool r231 ; [L205] _Bool r311 ; [L206] _Bool r321 ; [L207] _Bool r122 ; [L208] int tmp ; [L209] _Bool r132 ; [L210] int tmp___0 ; [L211] _Bool r212 ; [L212] int tmp___1 ; [L213] _Bool r232 ; [L214] int tmp___2 ; [L215] _Bool r312 ; [L216] int tmp___3 ; [L217] _Bool r322 ; [L218] int tmp___4 ; [L219] int tmp___5 ; [L222] r121 = ep12 [L223] r131 = ep13 [L224] r211 = ep21 [L225] r231 = ep23 [L226] r311 = ep31 [L227] r321 = ep32 [L228] COND FALSE !(\read(r121)) [L231] COND TRUE \read(r131) [L232] COND TRUE \read(ep32) [L233] tmp = 1 [L240] r122 = (_Bool )tmp [L241] COND TRUE \read(r131) [L242] tmp___0 = 1 [L253] r132 = (_Bool )tmp___0 [L254] COND FALSE !(\read(r211)) [L257] COND TRUE \read(r231) [L258] COND TRUE \read(ep31) [L259] tmp___1 = 1 [L266] r212 = (_Bool )tmp___1 [L267] COND TRUE \read(r231) [L268] tmp___2 = 1 [L279] r232 = (_Bool )tmp___2 [L280] COND TRUE \read(r311) [L281] tmp___3 = 1 [L292] r312 = (_Bool )tmp___3 [L293] COND TRUE \read(r321) [L294] tmp___4 = 1 [L305] r322 = (_Bool )tmp___4 [L306] COND TRUE (int )id1 != (int )id2 [L307] COND TRUE (int )id1 != (int )id3 [L308] COND TRUE (int )id2 != (int )id3 [L309] COND TRUE (int )id1 >= 0 [L310] COND TRUE (int )id2 >= 0 [L311] COND TRUE (int )id3 >= 0 [L312] COND TRUE (int )r1 == 0 [L313] COND TRUE (int )r2 == 0 [L314] COND TRUE (int )r3 == 0 [L315] COND TRUE \read(r122) [L316] COND TRUE \read(r132) [L317] COND TRUE \read(r212) [L318] COND TRUE \read(r232) [L319] COND TRUE \read(r312) [L320] COND TRUE \read(r322) [L321] COND TRUE (int )max1 == (int )id1 [L322] COND TRUE (int )max2 == (int )id2 [L323] COND TRUE (int )max3 == (int )id3 [L324] COND TRUE (int )st1 == 0 [L325] COND TRUE (int )st2 == 0 [L326] COND TRUE (int )st3 == 0 [L327] COND TRUE (int )nl1 == 0 [L328] COND TRUE (int )nl2 == 0 [L329] COND TRUE (int )nl3 == 0 [L330] COND TRUE (int )mode1 == 0 [L331] COND TRUE (int )mode2 == 0 [L332] COND TRUE (int )mode3 == 0 [L333] tmp___5 = 1 [L415] return (tmp___5); [L508] RET, EXPR init() [L508] i2 = init() [L509] COND FALSE !(!(i2)) [L510] p12_old = nomsg [L511] p12_new = nomsg [L512] p13_old = nomsg [L513] p13_new = nomsg [L514] p21_old = nomsg [L515] p21_new = nomsg [L516] p23_old = nomsg [L517] p23_new = nomsg [L518] p31_old = nomsg [L519] p31_new = nomsg [L520] p32_old = nomsg [L521] p32_new = nomsg [L522] i2 = 0 VAL [c1=0, ep12=0, ep13=1, ep21=0, ep23=255, ep31=1, ep32=1, i2=0, id1=0, id2=2, id3=1, m1=3, m2=3, m3=3, max1=0, max2=2, max3=1, mode1=0, mode2=0, mode3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L523] COND TRUE i2 < 6 [L525] CALL node1() [L75] COND FALSE !(\read(mode1)) [L100] COND TRUE (int )r1 < 2 [L101] COND FALSE !(\read(ep12)) [L104] COND TRUE \read(ep13) [L105] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L108] mode1 = (_Bool)1 [L525] RET node1() [L526] CALL node2() [L118] COND FALSE !(\read(mode2)) [L143] COND TRUE (int )r2 < 2 [L144] COND FALSE !(\read(ep21)) [L147] COND TRUE \read(ep23) [L148] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L151] mode2 = (_Bool)1 [L526] RET node2() [L527] CALL node3() [L161] COND FALSE !(\read(mode3)) [L186] COND TRUE (int )r3 < 2 [L187] COND TRUE \read(ep31) [L188] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L190] COND TRUE \read(ep32) [L191] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L194] mode3 = (_Bool)1 [L527] RET node3() [L528] p12_old = p12_new [L529] p12_new = nomsg [L530] p13_old = p13_new [L531] p13_new = nomsg [L532] p21_old = p21_new [L533] p21_new = nomsg [L534] p23_old = p23_new [L535] p23_new = nomsg [L536] p31_old = p31_new [L537] p31_new = nomsg [L538] p32_old = p32_new [L539] p32_new = nomsg [L540] CALL, EXPR check() [L420] int tmp ; VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=1, ep32=1, id1=0, id2=2, id3=1, m1=3, m2=3, m3=3, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, 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] [L423] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=1, ep32=1, id1=0, id2=2, id3=1, m1=3, m2=3, m3=3, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, 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] [L424] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=1, ep32=1, id1=0, id2=2, id3=1, m1=3, m2=3, m3=3, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, 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] [L425] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=1, ep32=1, id1=0, id2=2, id3=1, m1=3, m2=3, m3=3, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, 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] [L426] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=1, ep32=1, id1=0, id2=2, id3=1, m1=3, m2=3, m3=3, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, 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] [L427] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=1, ep32=1, id1=0, id2=2, id3=1, m1=3, m2=3, m3=3, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, 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] [L430] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=1, ep32=1, id1=0, id2=2, id3=1, m1=3, m2=3, m3=3, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, 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] [L432] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=1, ep32=1, id1=0, id2=2, id3=1, m1=3, m2=3, m3=3, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, 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] [L437] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=1, ep32=1, id1=0, id2=2, id3=1, m1=3, m2=3, m3=3, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, 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] [L440] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=1, ep32=1, id1=0, id2=2, id3=1, m1=3, m2=3, m3=3, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, 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] [L442] COND TRUE (int )r1 < 2 [L443] tmp = 1 VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=1, ep32=1, id1=0, id2=2, id3=1, m1=3, m2=3, m3=3, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=1, p32=0, p32_new=-1, p32_old=1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0, tmp=1] [L471] return (tmp); [L540] RET, EXPR check() [L540] c1 = check() [L541] CALL assert(c1) [L553] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=0, ep13=1, ep21=0, ep23=255, ep31=1, ep32=1, id1=0, id2=2, id3=1, m1=3, m2=3, m3=3, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, 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] [L541] RET assert(c1) [L542] i2 ++ VAL [c1=1, ep12=0, ep13=1, ep21=0, ep23=255, ep31=1, ep32=1, i2=1, id1=0, id2=2, id3=1, m1=3, m2=3, m3=3, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, 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] [L523] COND TRUE i2 < 6 [L525] CALL node1() [L75] COND TRUE \read(mode1) [L76] r1 = (char )((int )r1 + 1) [L77] COND FALSE !(\read(ep21)) [L84] COND TRUE \read(ep31) [L85] m1 = p31_old [L86] p31_old = nomsg [L87] COND TRUE (int )m1 > (int )max1 [L88] max1 = m1 [L91] COND FALSE !((int )r1 == 2) [L98] mode1 = (_Bool)0 [L525] RET node1() [L526] CALL node2() [L118] COND TRUE \read(mode2) [L119] r2 = (char )((int )r2 + 1) [L120] COND FALSE !(\read(ep12)) [L127] COND TRUE \read(ep32) [L128] m2 = p32_old [L129] p32_old = nomsg [L130] COND FALSE !((int )m2 > (int )max2) [L134] COND FALSE !((int )r2 == 2) [L141] mode2 = (_Bool)0 [L526] RET node2() [L527] CALL node3() [L161] COND TRUE \read(mode3) [L162] r3 = (char )((int )r3 + 1) [L163] COND TRUE \read(ep13) [L164] m3 = p13_old [L165] p13_old = nomsg [L166] COND FALSE !((int )m3 > (int )max3) [L170] COND TRUE \read(ep23) [L171] m3 = p23_old [L172] p23_old = nomsg [L173] COND TRUE (int )m3 > (int )max3 [L174] max3 = m3 [L177] COND FALSE !((int )r3 == 2) [L184] mode3 = (_Bool)0 [L527] RET node3() [L528] p12_old = p12_new [L529] p12_new = nomsg [L530] p13_old = p13_new [L531] p13_new = nomsg [L532] p21_old = p21_new [L533] p21_new = nomsg [L534] p23_old = p23_new [L535] p23_new = nomsg [L536] p31_old = p31_new [L537] p31_new = nomsg [L538] p32_old = p32_new [L539] p32_new = nomsg [L540] CALL, EXPR check() [L420] int tmp ; VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=1, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=1, m3=2, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=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] [L423] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=1, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=1, m3=2, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=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] [L424] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=1, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=1, m3=2, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=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] [L425] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=1, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=1, m3=2, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=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] [L426] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=1, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=1, m3=2, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=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] [L427] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=1, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=1, m3=2, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=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] [L430] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=1, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=1, m3=2, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=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] [L432] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=1, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=1, m3=2, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=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] [L437] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=1, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=1, m3=2, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=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] [L440] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=1, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=1, m3=2, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=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] [L442] COND TRUE (int )r1 < 2 [L443] tmp = 1 VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=1, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=1, m3=2, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=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] [L471] return (tmp); [L540] RET, EXPR check() [L540] c1 = check() [L541] CALL assert(c1) [L553] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=0, ep13=1, ep21=0, ep23=255, ep31=1, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=1, m3=2, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=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] [L541] RET assert(c1) [L542] i2 ++ VAL [c1=1, ep12=0, ep13=1, ep21=0, ep23=255, ep31=1, ep32=1, i2=2, id1=0, id2=2, id3=1, m1=1, m2=1, m3=2, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=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] [L523] COND TRUE i2 < 6 [L525] CALL node1() [L75] COND FALSE !(\read(mode1)) [L100] COND TRUE (int )r1 < 2 [L101] COND FALSE !(\read(ep12)) [L104] COND TRUE \read(ep13) [L105] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L108] mode1 = (_Bool)1 [L525] RET node1() [L526] CALL node2() [L118] COND FALSE !(\read(mode2)) [L143] COND TRUE (int )r2 < 2 [L144] COND FALSE !(\read(ep21)) [L147] COND TRUE \read(ep23) [L148] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L151] mode2 = (_Bool)1 [L526] RET node2() [L527] CALL node3() [L161] COND FALSE !(\read(mode3)) [L186] COND TRUE (int )r3 < 2 [L187] COND TRUE \read(ep31) [L188] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L190] COND TRUE \read(ep32) [L191] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L194] mode3 = (_Bool)1 [L527] RET node3() [L528] p12_old = p12_new [L529] p12_new = nomsg [L530] p13_old = p13_new [L531] p13_new = nomsg [L532] p21_old = p21_new [L533] p21_new = nomsg [L534] p23_old = p23_new [L535] p23_new = nomsg [L536] p31_old = p31_new [L537] p31_new = nomsg [L538] p32_old = p32_new [L539] p32_new = nomsg [L540] CALL, EXPR check() [L420] int tmp ; VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=1, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=1, m3=2, max1=1, max2=2, max3=2, mode1=1, mode2=1, mode3=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=2, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L423] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=1, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=1, m3=2, max1=1, max2=2, max3=2, mode1=1, mode2=1, mode3=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=2, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L424] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=1, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=1, m3=2, max1=1, max2=2, max3=2, mode1=1, mode2=1, mode3=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=2, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L425] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=1, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=1, m3=2, max1=1, max2=2, max3=2, mode1=1, mode2=1, mode3=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=2, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L426] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=1, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=1, m3=2, max1=1, max2=2, max3=2, mode1=1, mode2=1, mode3=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=2, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L427] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=1, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=1, m3=2, max1=1, max2=2, max3=2, mode1=1, mode2=1, mode3=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=2, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L430] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=1, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=1, m3=2, max1=1, max2=2, max3=2, mode1=1, mode2=1, mode3=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=2, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L432] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=1, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=1, m3=2, max1=1, max2=2, max3=2, mode1=1, mode2=1, mode3=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=2, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L437] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=1, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=1, m3=2, max1=1, max2=2, max3=2, mode1=1, mode2=1, mode3=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=2, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L440] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=1, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=1, m3=2, max1=1, max2=2, max3=2, mode1=1, mode2=1, mode3=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=2, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L442] COND TRUE (int )r1 < 2 [L443] tmp = 1 VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=1, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=1, m3=2, max1=1, max2=2, max3=2, mode1=1, mode2=1, mode3=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=2, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L471] return (tmp); [L540] RET, EXPR check() [L540] c1 = check() [L541] CALL assert(c1) [L553] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=0, ep13=1, ep21=0, ep23=255, ep31=1, ep32=1, id1=0, id2=2, id3=1, m1=1, m2=1, m3=2, max1=1, max2=2, max3=2, mode1=1, mode2=1, mode3=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=2, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L541] RET assert(c1) [L542] i2 ++ VAL [c1=1, ep12=0, ep13=1, ep21=0, ep23=255, ep31=1, ep32=1, i2=3, id1=0, id2=2, id3=1, m1=1, m2=1, m3=2, max1=1, max2=2, max3=2, mode1=1, mode2=1, mode3=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=2, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L523] COND TRUE i2 < 6 [L525] CALL node1() [L75] COND TRUE \read(mode1) [L76] r1 = (char )((int )r1 + 1) [L77] COND FALSE !(\read(ep21)) [L84] COND TRUE \read(ep31) [L85] m1 = p31_old [L86] p31_old = nomsg [L87] COND TRUE (int )m1 > (int )max1 [L88] max1 = m1 [L91] COND TRUE (int )r1 == 2 [L92] COND FALSE !((int )max1 == (int )id1) [L95] st1 = (char)1 [L98] mode1 = (_Bool)0 [L525] RET node1() [L526] CALL node2() [L118] COND TRUE \read(mode2) [L119] r2 = (char )((int )r2 + 1) [L120] COND FALSE !(\read(ep12)) [L127] COND TRUE \read(ep32) [L128] m2 = p32_old [L129] p32_old = nomsg [L130] COND FALSE !((int )m2 > (int )max2) [L134] COND TRUE (int )r2 == 2 [L135] COND TRUE (int )max2 == (int )id2 [L136] st2 = (char)1 [L141] mode2 = (_Bool)0 [L526] RET node2() [L527] CALL node3() [L161] COND TRUE \read(mode3) [L162] r3 = (char )((int )r3 + 1) [L163] COND TRUE \read(ep13) [L164] m3 = p13_old [L165] p13_old = nomsg [L166] COND FALSE !((int )m3 > (int )max3) [L170] COND TRUE \read(ep23) [L171] m3 = p23_old [L172] p23_old = nomsg [L173] COND FALSE !((int )m3 > (int )max3) [L177] COND TRUE (int )r3 == 2 [L178] COND FALSE !((int )max3 == (int )id3) [L181] nl3 = (char)1 [L184] mode3 = (_Bool)0 [L527] RET node3() [L528] p12_old = p12_new [L529] p12_new = nomsg [L530] p13_old = p13_new [L531] p13_new = nomsg [L532] p21_old = p21_new [L533] p21_new = nomsg [L534] p23_old = p23_new [L535] p23_new = nomsg [L536] p31_old = p31_new [L537] p31_new = nomsg [L538] p32_old = p32_new [L539] p32_new = nomsg [L540] CALL, EXPR check() [L420] int tmp ; VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=1, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=2, m3=2, max1=2, max2=2, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] [L423] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L469] tmp = 0 VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=1, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=2, m3=2, max1=2, max2=2, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0, tmp=0] [L471] return (tmp); [L540] RET, EXPR check() [L540] c1 = check() [L541] CALL assert(c1) [L553] COND TRUE ! arg VAL [\old(arg)=0, arg=0, ep12=0, ep13=1, ep21=0, ep23=255, ep31=1, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=2, m3=2, max1=2, max2=2, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] [L555] reach_error() VAL [\old(arg)=0, arg=0, ep12=0, ep13=1, ep21=0, ep23=255, ep31=1, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=2, m3=2, max1=2, max2=2, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 117.4MB. Free memory is still 90.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 319.86ms. Allocated memory is still 117.4MB. Free memory was 74.3MB in the beginning and 58.2MB in the end (delta: 16.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.79ms. Allocated memory is still 117.4MB. Free memory was 58.2MB in the beginning and 55.1MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.33ms. Allocated memory is still 117.4MB. Free memory was 55.1MB in the beginning and 52.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 969.91ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 52.6MB in the beginning and 102.8MB in the end (delta: -50.2MB). Peak memory consumption was 42.9MB. Max. memory is 16.1GB. * CodeCheck took 343877.87ms. Allocated memory was 151.0MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 102.8MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 479.4MB. Max. memory is 16.1GB. * Witness Printer took 77.81ms. Allocated memory is still 1.7GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2022-12-14 21:26:39,322 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4219afc3-fd8d-4a27-b9f6-493df9f70d46/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