./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ea86164637dd5d5bd9745ca8d3f5dc708b98bc3f75b645830d494ea6e5cae6ff --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:49:47,980 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:49:48,104 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-26 11:49:48,113 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:49:48,114 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:49:48,146 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:49:48,147 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:49:48,148 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:49:48,149 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:49:48,149 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:49:48,150 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:49:48,151 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:49:48,152 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:49:48,154 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:49:48,155 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:49:48,156 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:49:48,158 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:49:48,162 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:49:48,163 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:49:48,163 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:49:48,165 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-26 11:49:48,166 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-26 11:49:48,166 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-26 11:49:48,167 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:49:48,167 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-26 11:49:48,167 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 11:49:48,168 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:49:48,168 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:49:48,169 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:49:48,169 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:49:48,170 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 11:49:48,170 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:49:48,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:49:48,171 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:49:48,171 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:49:48,171 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 11:49:48,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 11:49:48,172 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:49:48,172 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:49:48,172 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:49:48,172 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:49:48,173 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/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_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer 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 -> ea86164637dd5d5bd9745ca8d3f5dc708b98bc3f75b645830d494ea6e5cae6ff [2023-11-26 11:49:48,512 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:49:48,548 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:49:48,554 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:49:48,555 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:49:48,556 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:49:48,558 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread-wmm/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2023-11-26 11:49:51,803 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:49:52,182 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:49:52,183 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/sv-benchmarks/c/pthread-wmm/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2023-11-26 11:49:52,203 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/data/f29afd57e/6682732a41484c9595d0d071d4ec91e1/FLAGc3f842c84 [2023-11-26 11:49:52,227 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/data/f29afd57e/6682732a41484c9595d0d071d4ec91e1 [2023-11-26 11:49:52,234 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:49:52,237 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:49:52,242 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:49:52,243 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:49:52,249 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:49:52,250 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:49:52" (1/1) ... [2023-11-26 11:49:52,252 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42eba5d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:49:52, skipping insertion in model container [2023-11-26 11:49:52,252 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:49:52" (1/1) ... [2023-11-26 11:49:52,344 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:49:52,885 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:49:52,903 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:49:52,962 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:49:53,001 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 11:49:53,001 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 11:49:53,009 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:49:53,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:49:53 WrapperNode [2023-11-26 11:49:53,010 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:49:53,011 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:49:53,011 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:49:53,012 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:49:53,019 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:49:53" (1/1) ... [2023-11-26 11:49:53,037 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:49:53" (1/1) ... [2023-11-26 11:49:53,070 INFO L138 Inliner]: procedures = 176, calls = 57, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 134 [2023-11-26 11:49:53,071 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:49:53,071 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:49:53,072 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:49:53,072 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:49:53,083 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:49:53" (1/1) ... [2023-11-26 11:49:53,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:49:53" (1/1) ... [2023-11-26 11:49:53,088 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:49:53" (1/1) ... [2023-11-26 11:49:53,106 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2023-11-26 11:49:53,106 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:49:53" (1/1) ... [2023-11-26 11:49:53,107 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:49:53" (1/1) ... [2023-11-26 11:49:53,116 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:49:53" (1/1) ... [2023-11-26 11:49:53,118 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:49:53" (1/1) ... [2023-11-26 11:49:53,121 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:49:53" (1/1) ... [2023-11-26 11:49:53,123 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:49:53" (1/1) ... [2023-11-26 11:49:53,127 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:49:53,128 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:49:53,128 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:49:53,128 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:49:53,129 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:49:53" (1/1) ... [2023-11-26 11:49:53,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:49:53,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:49:53,222 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 11:49:53,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 11:49:53,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-26 11:49:53,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-26 11:49:53,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-26 11:49:53,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-26 11:49:53,269 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-26 11:49:53,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:49:53,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 11:49:53,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 11:49:53,269 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-26 11:49:53,270 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-26 11:49:53,271 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-26 11:49:53,272 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-26 11:49:53,272 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-26 11:49:53,272 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-26 11:49:53,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 11:49:53,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-26 11:49:53,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-26 11:49:53,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-26 11:49:53,273 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-26 11:49:53,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:49:53,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:49:53,276 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-26 11:49:53,468 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:49:53,470 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:49:53,800 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:49:54,012 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:49:54,012 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-26 11:49:54,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:49:54 BoogieIcfgContainer [2023-11-26 11:49:54,013 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:49:54,015 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:49:54,015 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:49:54,018 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:49:54,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:49:52" (1/3) ... [2023-11-26 11:49:54,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51af488f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:49:54, skipping insertion in model container [2023-11-26 11:49:54,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:49:53" (2/3) ... [2023-11-26 11:49:54,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51af488f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:49:54, skipping insertion in model container [2023-11-26 11:49:54,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:49:54" (3/3) ... [2023-11-26 11:49:54,021 INFO L112 eAbstractionObserver]: Analyzing ICFG mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2023-11-26 11:49:54,037 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:49:54,037 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-26 11:49:54,037 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 11:49:54,103 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 11:49:54,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 54 transitions, 120 flow [2023-11-26 11:49:54,192 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2023-11-26 11:49:54,192 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:49:54,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 51 events. 2/51 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 99 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2023-11-26 11:49:54,197 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 54 transitions, 120 flow [2023-11-26 11:49:54,202 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 51 transitions, 111 flow [2023-11-26 11:49:54,218 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:49:54,225 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5e591290, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:49:54,225 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-26 11:49:54,228 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 11:49:54,228 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-26 11:49:54,228 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:49:54,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:49:54,229 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-26 11:49:54,230 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:49:54,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:49:54,236 INFO L85 PathProgramCache]: Analyzing trace with hash 12588, now seen corresponding path program 1 times [2023-11-26 11:49:54,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:49:54,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933352147] [2023-11-26 11:49:54,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:49:54,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:49:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:49:54,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:49:54,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:49:54,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933352147] [2023-11-26 11:49:54,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933352147] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:49:54,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:49:54,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:49:54,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112477813] [2023-11-26 11:49:54,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:49:54,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:49:54,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:49:54,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:49:54,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:49:54,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 54 [2023-11-26 11:49:54,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 111 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:54,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:49:54,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 54 [2023-11-26 11:49:54,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:49:55,453 INFO L124 PetriNetUnfolderBase]: 1057/2053 cut-off events. [2023-11-26 11:49:55,454 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-26 11:49:55,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3679 conditions, 2053 events. 1057/2053 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 13986 event pairs, 791 based on Foata normal form. 120/1966 useless extension candidates. Maximal degree in co-relation 3665. Up to 1193 conditions per place. [2023-11-26 11:49:55,494 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 30 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2023-11-26 11:49:55,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 56 transitions, 185 flow [2023-11-26 11:49:55,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:49:55,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:49:55,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2023-11-26 11:49:55,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7160493827160493 [2023-11-26 11:49:55,518 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 116 transitions. [2023-11-26 11:49:55,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 116 transitions. [2023-11-26 11:49:55,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:49:55,524 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 116 transitions. [2023-11-26 11:49:55,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:55,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:55,537 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:55,540 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 111 flow. Second operand 3 states and 116 transitions. [2023-11-26 11:49:55,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 56 transitions, 185 flow [2023-11-26 11:49:55,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 56 transitions, 182 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-26 11:49:55,558 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 104 flow [2023-11-26 11:49:55,560 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2023-11-26 11:49:55,565 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -3 predicate places. [2023-11-26 11:49:55,566 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 104 flow [2023-11-26 11:49:55,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:55,566 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:49:55,567 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-26 11:49:55,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 11:49:55,568 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:49:55,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:49:55,570 INFO L85 PathProgramCache]: Analyzing trace with hash 12589, now seen corresponding path program 1 times [2023-11-26 11:49:55,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:49:55,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743810459] [2023-11-26 11:49:55,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:49:55,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:49:55,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:49:55,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:49:55,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:49:55,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743810459] [2023-11-26 11:49:55,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743810459] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:49:55,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:49:55,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:49:55,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596636307] [2023-11-26 11:49:55,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:49:55,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:49:55,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:49:55,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:49:55,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:49:55,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 54 [2023-11-26 11:49:55,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:55,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:49:55,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 54 [2023-11-26 11:49:55,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:49:56,338 INFO L124 PetriNetUnfolderBase]: 1057/2052 cut-off events. [2023-11-26 11:49:56,338 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-26 11:49:56,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3736 conditions, 2052 events. 1057/2052 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 14034 event pairs, 791 based on Foata normal form. 1/1846 useless extension candidates. Maximal degree in co-relation 3725. Up to 1192 conditions per place. [2023-11-26 11:49:56,364 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 29 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-11-26 11:49:56,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 55 transitions, 182 flow [2023-11-26 11:49:56,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:49:56,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:49:56,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2023-11-26 11:49:56,367 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7160493827160493 [2023-11-26 11:49:56,368 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 116 transitions. [2023-11-26 11:49:56,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 116 transitions. [2023-11-26 11:49:56,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:49:56,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 116 transitions. [2023-11-26 11:49:56,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:56,372 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:56,372 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:56,373 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 104 flow. Second operand 3 states and 116 transitions. [2023-11-26 11:49:56,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 55 transitions, 182 flow [2023-11-26 11:49:56,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 55 transitions, 178 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:49:56,378 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 102 flow [2023-11-26 11:49:56,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2023-11-26 11:49:56,380 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -4 predicate places. [2023-11-26 11:49:56,380 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 102 flow [2023-11-26 11:49:56,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:56,381 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:49:56,381 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 11:49:56,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 11:49:56,382 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:49:56,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:49:56,383 INFO L85 PathProgramCache]: Analyzing trace with hash 375389224, now seen corresponding path program 1 times [2023-11-26 11:49:56,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:49:56,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137449746] [2023-11-26 11:49:56,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:49:56,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:49:56,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:49:56,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:49:56,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:49:56,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137449746] [2023-11-26 11:49:56,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137449746] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:49:56,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:49:56,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:49:56,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935931843] [2023-11-26 11:49:56,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:49:56,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:49:56,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:49:56,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:49:56,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:49:56,542 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 54 [2023-11-26 11:49:56,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:56,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:49:56,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 54 [2023-11-26 11:49:56,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:49:57,015 INFO L124 PetriNetUnfolderBase]: 1061/2039 cut-off events. [2023-11-26 11:49:57,016 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-26 11:49:57,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3732 conditions, 2039 events. 1061/2039 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 13871 event pairs, 815 based on Foata normal form. 0/1842 useless extension candidates. Maximal degree in co-relation 3721. Up to 1195 conditions per place. [2023-11-26 11:49:57,037 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 30 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2023-11-26 11:49:57,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 54 transitions, 182 flow [2023-11-26 11:49:57,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:49:57,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:49:57,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2023-11-26 11:49:57,043 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7037037037037037 [2023-11-26 11:49:57,043 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 114 transitions. [2023-11-26 11:49:57,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 114 transitions. [2023-11-26 11:49:57,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:49:57,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 114 transitions. [2023-11-26 11:49:57,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:57,050 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:57,050 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:57,050 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 102 flow. Second operand 3 states and 114 transitions. [2023-11-26 11:49:57,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 54 transitions, 182 flow [2023-11-26 11:49:57,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 54 transitions, 178 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:49:57,057 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 100 flow [2023-11-26 11:49:57,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2023-11-26 11:49:57,059 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -5 predicate places. [2023-11-26 11:49:57,059 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 100 flow [2023-11-26 11:49:57,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:57,060 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:49:57,060 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 11:49:57,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 11:49:57,060 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:49:57,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:49:57,061 INFO L85 PathProgramCache]: Analyzing trace with hash 375389225, now seen corresponding path program 1 times [2023-11-26 11:49:57,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:49:57,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052513291] [2023-11-26 11:49:57,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:49:57,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:49:57,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:49:57,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:49:57,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:49:57,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052513291] [2023-11-26 11:49:57,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052513291] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:49:57,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:49:57,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:49:57,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176530428] [2023-11-26 11:49:57,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:49:57,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:49:57,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:49:57,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:49:57,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:49:57,231 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 54 [2023-11-26 11:49:57,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:57,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:49:57,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 54 [2023-11-26 11:49:57,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:49:57,641 INFO L124 PetriNetUnfolderBase]: 1057/2042 cut-off events. [2023-11-26 11:49:57,641 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2023-11-26 11:49:57,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3730 conditions, 2042 events. 1057/2042 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 14016 event pairs, 571 based on Foata normal form. 5/1853 useless extension candidates. Maximal degree in co-relation 3720. Up to 1186 conditions per place. [2023-11-26 11:49:57,660 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 29 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-11-26 11:49:57,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 53 transitions, 178 flow [2023-11-26 11:49:57,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:49:57,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:49:57,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2023-11-26 11:49:57,663 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7160493827160493 [2023-11-26 11:49:57,663 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 116 transitions. [2023-11-26 11:49:57,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 116 transitions. [2023-11-26 11:49:57,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:49:57,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 116 transitions. [2023-11-26 11:49:57,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:57,665 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:57,665 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:57,666 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 100 flow. Second operand 3 states and 116 transitions. [2023-11-26 11:49:57,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 53 transitions, 178 flow [2023-11-26 11:49:57,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 53 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:49:57,668 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 98 flow [2023-11-26 11:49:57,669 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2023-11-26 11:49:57,670 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -6 predicate places. [2023-11-26 11:49:57,670 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 98 flow [2023-11-26 11:49:57,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:57,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:49:57,671 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 11:49:57,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 11:49:57,671 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:49:57,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:49:57,672 INFO L85 PathProgramCache]: Analyzing trace with hash 375389620, now seen corresponding path program 1 times [2023-11-26 11:49:57,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:49:57,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128023064] [2023-11-26 11:49:57,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:49:57,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:49:57,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:49:57,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:49:57,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:49:57,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128023064] [2023-11-26 11:49:57,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128023064] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:49:57,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:49:57,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:49:57,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625715182] [2023-11-26 11:49:57,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:49:57,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:49:57,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:49:57,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:49:57,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:49:57,781 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 54 [2023-11-26 11:49:57,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:57,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:49:57,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 54 [2023-11-26 11:49:57,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:49:58,132 INFO L124 PetriNetUnfolderBase]: 825/1541 cut-off events. [2023-11-26 11:49:58,133 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2023-11-26 11:49:58,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2872 conditions, 1541 events. 825/1541 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9916 event pairs, 129 based on Foata normal form. 0/1518 useless extension candidates. Maximal degree in co-relation 2862. Up to 1009 conditions per place. [2023-11-26 11:49:58,146 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 33 selfloop transitions, 2 changer transitions 2/59 dead transitions. [2023-11-26 11:49:58,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 59 transitions, 210 flow [2023-11-26 11:49:58,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:49:58,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:49:58,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2023-11-26 11:49:58,149 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7716049382716049 [2023-11-26 11:49:58,149 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 125 transitions. [2023-11-26 11:49:58,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 125 transitions. [2023-11-26 11:49:58,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:49:58,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 125 transitions. [2023-11-26 11:49:58,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:58,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:58,151 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:58,151 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 98 flow. Second operand 3 states and 125 transitions. [2023-11-26 11:49:58,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 59 transitions, 210 flow [2023-11-26 11:49:58,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 59 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:49:58,154 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 94 flow [2023-11-26 11:49:58,155 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2023-11-26 11:49:58,155 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -7 predicate places. [2023-11-26 11:49:58,156 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 94 flow [2023-11-26 11:49:58,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:58,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:49:58,156 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:49:58,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 11:49:58,157 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:49:58,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:49:58,158 INFO L85 PathProgramCache]: Analyzing trace with hash -874089373, now seen corresponding path program 1 times [2023-11-26 11:49:58,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:49:58,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531551742] [2023-11-26 11:49:58,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:49:58,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:49:58,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:49:58,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:49:58,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:49:58,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531551742] [2023-11-26 11:49:58,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531551742] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:49:58,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:49:58,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:49:58,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514744637] [2023-11-26 11:49:58,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:49:58,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:49:58,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:49:58,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:49:58,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:49:58,232 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 54 [2023-11-26 11:49:58,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:58,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:49:58,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 54 [2023-11-26 11:49:58,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:49:58,533 INFO L124 PetriNetUnfolderBase]: 738/1467 cut-off events. [2023-11-26 11:49:58,533 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2023-11-26 11:49:58,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2719 conditions, 1467 events. 738/1467 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9586 event pairs, 260 based on Foata normal form. 0/1420 useless extension candidates. Maximal degree in co-relation 2708. Up to 934 conditions per place. [2023-11-26 11:49:58,546 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 27 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2023-11-26 11:49:58,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 49 transitions, 168 flow [2023-11-26 11:49:58,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:49:58,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:49:58,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2023-11-26 11:49:58,548 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6851851851851852 [2023-11-26 11:49:58,548 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 111 transitions. [2023-11-26 11:49:58,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 111 transitions. [2023-11-26 11:49:58,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:49:58,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 111 transitions. [2023-11-26 11:49:58,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:58,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:58,551 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:58,551 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 94 flow. Second operand 3 states and 111 transitions. [2023-11-26 11:49:58,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 49 transitions, 168 flow [2023-11-26 11:49:58,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 49 transitions, 162 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:49:58,553 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 92 flow [2023-11-26 11:49:58,553 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2023-11-26 11:49:58,554 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -9 predicate places. [2023-11-26 11:49:58,555 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 92 flow [2023-11-26 11:49:58,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:58,555 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:49:58,555 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:49:58,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 11:49:58,556 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:49:58,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:49:58,556 INFO L85 PathProgramCache]: Analyzing trace with hash -874089372, now seen corresponding path program 1 times [2023-11-26 11:49:58,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:49:58,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701600260] [2023-11-26 11:49:58,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:49:58,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:49:58,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:49:58,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:49:58,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:49:58,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701600260] [2023-11-26 11:49:58,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701600260] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:49:58,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:49:58,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:49:58,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267415951] [2023-11-26 11:49:58,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:49:58,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:49:58,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:49:58,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:49:58,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:49:58,657 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 54 [2023-11-26 11:49:58,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:58,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:49:58,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 54 [2023-11-26 11:49:58,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:49:58,972 INFO L124 PetriNetUnfolderBase]: 721/1418 cut-off events. [2023-11-26 11:49:58,972 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2023-11-26 11:49:58,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2605 conditions, 1418 events. 721/1418 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9089 event pairs, 420 based on Foata normal form. 12/1387 useless extension candidates. Maximal degree in co-relation 2595. Up to 905 conditions per place. [2023-11-26 11:49:58,984 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 26 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2023-11-26 11:49:58,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 48 transitions, 162 flow [2023-11-26 11:49:58,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:49:58,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:49:58,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2023-11-26 11:49:58,986 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6975308641975309 [2023-11-26 11:49:58,986 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 113 transitions. [2023-11-26 11:49:58,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 113 transitions. [2023-11-26 11:49:58,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:49:58,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 113 transitions. [2023-11-26 11:49:58,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:58,993 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:58,994 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:58,994 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 92 flow. Second operand 3 states and 113 transitions. [2023-11-26 11:49:58,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 48 transitions, 162 flow [2023-11-26 11:49:58,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 48 transitions, 158 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:49:58,996 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 90 flow [2023-11-26 11:49:58,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2023-11-26 11:49:59,002 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -10 predicate places. [2023-11-26 11:49:59,002 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 90 flow [2023-11-26 11:49:59,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:59,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:49:59,003 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:49:59,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 11:49:59,004 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:49:59,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:49:59,005 INFO L85 PathProgramCache]: Analyzing trace with hash -252291527, now seen corresponding path program 1 times [2023-11-26 11:49:59,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:49:59,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974301321] [2023-11-26 11:49:59,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:49:59,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:49:59,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:49:59,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:49:59,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:49:59,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974301321] [2023-11-26 11:49:59,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974301321] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:49:59,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:49:59,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:49:59,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795701136] [2023-11-26 11:49:59,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:49:59,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-26 11:49:59,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:49:59,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-26 11:49:59,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-26 11:49:59,828 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 54 [2023-11-26 11:49:59,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 90 flow. Second operand has 8 states, 8 states have (on average 25.75) internal successors, (206), 8 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:59,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:49:59,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 54 [2023-11-26 11:49:59,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:50:00,304 INFO L124 PetriNetUnfolderBase]: 724/1389 cut-off events. [2023-11-26 11:50:00,304 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2023-11-26 11:50:00,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2584 conditions, 1389 events. 724/1389 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8700 event pairs, 372 based on Foata normal form. 48/1397 useless extension candidates. Maximal degree in co-relation 2573. Up to 905 conditions per place. [2023-11-26 11:50:00,319 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 26 selfloop transitions, 3 changer transitions 9/55 dead transitions. [2023-11-26 11:50:00,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 55 transitions, 196 flow [2023-11-26 11:50:00,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:50:00,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 11:50:00,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 183 transitions. [2023-11-26 11:50:00,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5648148148148148 [2023-11-26 11:50:00,325 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 183 transitions. [2023-11-26 11:50:00,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 183 transitions. [2023-11-26 11:50:00,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:50:00,325 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 183 transitions. [2023-11-26 11:50:00,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 30.5) internal successors, (183), 6 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:00,327 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 54.0) internal successors, (378), 7 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:00,328 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 54.0) internal successors, (378), 7 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:00,328 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 90 flow. Second operand 6 states and 183 transitions. [2023-11-26 11:50:00,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 55 transitions, 196 flow [2023-11-26 11:50:00,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 55 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:50:00,331 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 88 flow [2023-11-26 11:50:00,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=88, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2023-11-26 11:50:00,335 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -8 predicate places. [2023-11-26 11:50:00,335 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 88 flow [2023-11-26 11:50:00,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.75) internal successors, (206), 8 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:00,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:50:00,336 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:50:00,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 11:50:00,337 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:50:00,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:00,337 INFO L85 PathProgramCache]: Analyzing trace with hash -252290209, now seen corresponding path program 1 times [2023-11-26 11:50:00,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:00,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495033405] [2023-11-26 11:50:00,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:00,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:00,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:00,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:50:00,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:50:00,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495033405] [2023-11-26 11:50:00,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495033405] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:00,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:00,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:50:00,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335604678] [2023-11-26 11:50:00,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:00,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:50:00,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:50:00,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:50:00,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:50:00,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 54 [2023-11-26 11:50:00,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:00,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:50:00,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 54 [2023-11-26 11:50:00,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:50:02,303 INFO L124 PetriNetUnfolderBase]: 4854/7756 cut-off events. [2023-11-26 11:50:02,304 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2023-11-26 11:50:02,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14999 conditions, 7756 events. 4854/7756 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 53193 event pairs, 1022 based on Foata normal form. 0/7518 useless extension candidates. Maximal degree in co-relation 14988. Up to 2823 conditions per place. [2023-11-26 11:50:02,356 INFO L140 encePairwiseOnDemand]: 44/54 looper letters, 39 selfloop transitions, 6 changer transitions 78/136 dead transitions. [2023-11-26 11:50:02,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 136 transitions, 538 flow [2023-11-26 11:50:02,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 11:50:02,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-26 11:50:02,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 332 transitions. [2023-11-26 11:50:02,360 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6831275720164609 [2023-11-26 11:50:02,360 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 332 transitions. [2023-11-26 11:50:02,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 332 transitions. [2023-11-26 11:50:02,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:50:02,361 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 332 transitions. [2023-11-26 11:50:02,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 36.888888888888886) internal successors, (332), 9 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:02,364 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 54.0) internal successors, (540), 10 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:02,365 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 54.0) internal successors, (540), 10 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:02,365 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 88 flow. Second operand 9 states and 332 transitions. [2023-11-26 11:50:02,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 136 transitions, 538 flow [2023-11-26 11:50:02,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 136 transitions, 530 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-26 11:50:02,370 INFO L231 Difference]: Finished difference. Result has 62 places, 42 transitions, 165 flow [2023-11-26 11:50:02,371 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=165, PETRI_PLACES=62, PETRI_TRANSITIONS=42} [2023-11-26 11:50:02,372 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 3 predicate places. [2023-11-26 11:50:02,372 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 42 transitions, 165 flow [2023-11-26 11:50:02,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:02,372 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:50:02,373 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:50:02,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 11:50:02,373 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:50:02,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:02,374 INFO L85 PathProgramCache]: Analyzing trace with hash -242803202, now seen corresponding path program 1 times [2023-11-26 11:50:02,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:02,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461732985] [2023-11-26 11:50:02,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:02,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:02,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:02,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:50:02,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:50:02,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461732985] [2023-11-26 11:50:02,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461732985] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:02,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:02,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:50:02,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185755746] [2023-11-26 11:50:02,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:02,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:50:02,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:50:02,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:50:02,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:50:02,713 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 54 [2023-11-26 11:50:02,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 42 transitions, 165 flow. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:02,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:50:02,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 54 [2023-11-26 11:50:02,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:50:04,135 INFO L124 PetriNetUnfolderBase]: 3436/5689 cut-off events. [2023-11-26 11:50:04,136 INFO L125 PetriNetUnfolderBase]: For 6029/6034 co-relation queries the response was YES. [2023-11-26 11:50:04,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15599 conditions, 5689 events. 3436/5689 cut-off events. For 6029/6034 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 37946 event pairs, 647 based on Foata normal form. 196/5854 useless extension candidates. Maximal degree in co-relation 15580. Up to 1958 conditions per place. [2023-11-26 11:50:04,176 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 46 selfloop transitions, 6 changer transitions 66/131 dead transitions. [2023-11-26 11:50:04,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 131 transitions, 753 flow [2023-11-26 11:50:04,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-26 11:50:04,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-26 11:50:04,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 341 transitions. [2023-11-26 11:50:04,179 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6314814814814815 [2023-11-26 11:50:04,179 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 341 transitions. [2023-11-26 11:50:04,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 341 transitions. [2023-11-26 11:50:04,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:50:04,180 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 341 transitions. [2023-11-26 11:50:04,182 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 34.1) internal successors, (341), 10 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:04,183 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 54.0) internal successors, (594), 11 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:04,184 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 54.0) internal successors, (594), 11 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:04,184 INFO L175 Difference]: Start difference. First operand has 62 places, 42 transitions, 165 flow. Second operand 10 states and 341 transitions. [2023-11-26 11:50:04,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 131 transitions, 753 flow [2023-11-26 11:50:04,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 131 transitions, 657 flow, removed 26 selfloop flow, removed 4 redundant places. [2023-11-26 11:50:04,226 INFO L231 Difference]: Finished difference. Result has 69 places, 44 transitions, 195 flow [2023-11-26 11:50:04,227 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=195, PETRI_PLACES=69, PETRI_TRANSITIONS=44} [2023-11-26 11:50:04,228 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 10 predicate places. [2023-11-26 11:50:04,228 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 44 transitions, 195 flow [2023-11-26 11:50:04,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:04,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:50:04,229 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:50:04,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 11:50:04,230 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:50:04,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:04,231 INFO L85 PathProgramCache]: Analyzing trace with hash 733414126, now seen corresponding path program 1 times [2023-11-26 11:50:04,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:04,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246433045] [2023-11-26 11:50:04,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:04,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:04,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:04,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:50:04,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:50:04,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246433045] [2023-11-26 11:50:04,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246433045] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:04,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:04,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:50:04,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664174014] [2023-11-26 11:50:04,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:04,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:50:04,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:50:04,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:50:04,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:50:04,532 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2023-11-26 11:50:04,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 44 transitions, 195 flow. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:04,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:50:04,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2023-11-26 11:50:04,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:50:05,918 INFO L124 PetriNetUnfolderBase]: 3615/6054 cut-off events. [2023-11-26 11:50:05,919 INFO L125 PetriNetUnfolderBase]: For 5210/6247 co-relation queries the response was YES. [2023-11-26 11:50:05,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14792 conditions, 6054 events. 3615/6054 cut-off events. For 5210/6247 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 40058 event pairs, 535 based on Foata normal form. 263/6106 useless extension candidates. Maximal degree in co-relation 14766. Up to 3147 conditions per place. [2023-11-26 11:50:05,972 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 46 selfloop transitions, 5 changer transitions 0/71 dead transitions. [2023-11-26 11:50:05,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 71 transitions, 380 flow [2023-11-26 11:50:05,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 11:50:05,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-26 11:50:05,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2023-11-26 11:50:05,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2023-11-26 11:50:05,975 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 150 transitions. [2023-11-26 11:50:05,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 150 transitions. [2023-11-26 11:50:05,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:50:05,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 150 transitions. [2023-11-26 11:50:05,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:05,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 54.0) internal successors, (270), 5 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:05,977 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 54.0) internal successors, (270), 5 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:05,977 INFO L175 Difference]: Start difference. First operand has 69 places, 44 transitions, 195 flow. Second operand 4 states and 150 transitions. [2023-11-26 11:50:05,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 71 transitions, 380 flow [2023-11-26 11:50:06,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 71 transitions, 359 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-11-26 11:50:06,078 INFO L231 Difference]: Finished difference. Result has 63 places, 48 transitions, 212 flow [2023-11-26 11:50:06,078 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=212, PETRI_PLACES=63, PETRI_TRANSITIONS=48} [2023-11-26 11:50:06,079 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 4 predicate places. [2023-11-26 11:50:06,079 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 48 transitions, 212 flow [2023-11-26 11:50:06,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:06,080 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:50:06,080 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:50:06,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 11:50:06,080 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:50:06,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:06,081 INFO L85 PathProgramCache]: Analyzing trace with hash 546735262, now seen corresponding path program 1 times [2023-11-26 11:50:06,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:06,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482469822] [2023-11-26 11:50:06,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:06,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:06,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:06,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:50:06,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:50:06,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482469822] [2023-11-26 11:50:06,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482469822] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:06,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:06,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:50:06,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573243330] [2023-11-26 11:50:06,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:06,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:50:06,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:50:06,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:50:06,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:50:06,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2023-11-26 11:50:06,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 48 transitions, 212 flow. Second operand has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:06,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:50:06,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2023-11-26 11:50:06,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:50:07,077 INFO L124 PetriNetUnfolderBase]: 2554/4299 cut-off events. [2023-11-26 11:50:07,077 INFO L125 PetriNetUnfolderBase]: For 2781/3335 co-relation queries the response was YES. [2023-11-26 11:50:07,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11351 conditions, 4299 events. 2554/4299 cut-off events. For 2781/3335 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 26735 event pairs, 342 based on Foata normal form. 214/4344 useless extension candidates. Maximal degree in co-relation 11326. Up to 1277 conditions per place. [2023-11-26 11:50:07,111 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 59 selfloop transitions, 8 changer transitions 0/87 dead transitions. [2023-11-26 11:50:07,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 87 transitions, 483 flow [2023-11-26 11:50:07,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:50:07,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 11:50:07,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 190 transitions. [2023-11-26 11:50:07,113 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7037037037037037 [2023-11-26 11:50:07,113 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 190 transitions. [2023-11-26 11:50:07,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 190 transitions. [2023-11-26 11:50:07,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:50:07,114 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 190 transitions. [2023-11-26 11:50:07,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:07,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:07,117 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:07,117 INFO L175 Difference]: Start difference. First operand has 63 places, 48 transitions, 212 flow. Second operand 5 states and 190 transitions. [2023-11-26 11:50:07,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 87 transitions, 483 flow [2023-11-26 11:50:07,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 87 transitions, 472 flow, removed 4 selfloop flow, removed 5 redundant places. [2023-11-26 11:50:07,123 INFO L231 Difference]: Finished difference. Result has 64 places, 52 transitions, 256 flow [2023-11-26 11:50:07,123 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=256, PETRI_PLACES=64, PETRI_TRANSITIONS=52} [2023-11-26 11:50:07,124 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 5 predicate places. [2023-11-26 11:50:07,124 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 52 transitions, 256 flow [2023-11-26 11:50:07,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:07,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:50:07,125 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:50:07,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-26 11:50:07,126 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:50:07,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:07,126 INFO L85 PathProgramCache]: Analyzing trace with hash -2108435791, now seen corresponding path program 1 times [2023-11-26 11:50:07,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:07,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806437457] [2023-11-26 11:50:07,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:07,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:07,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:07,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:50:07,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:50:07,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806437457] [2023-11-26 11:50:07,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806437457] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:07,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:07,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 11:50:07,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651584150] [2023-11-26 11:50:07,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:07,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-26 11:50:07,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:50:07,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-26 11:50:07,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-26 11:50:08,033 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 54 [2023-11-26 11:50:08,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 52 transitions, 256 flow. Second operand has 8 states, 8 states have (on average 25.375) internal successors, (203), 8 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:08,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:50:08,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 54 [2023-11-26 11:50:08,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:50:09,908 INFO L124 PetriNetUnfolderBase]: 3250/5880 cut-off events. [2023-11-26 11:50:09,909 INFO L125 PetriNetUnfolderBase]: For 7186/8034 co-relation queries the response was YES. [2023-11-26 11:50:09,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17071 conditions, 5880 events. 3250/5880 cut-off events. For 7186/8034 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 42722 event pairs, 623 based on Foata normal form. 168/5659 useless extension candidates. Maximal degree in co-relation 17047. Up to 1576 conditions per place. [2023-11-26 11:50:09,965 INFO L140 encePairwiseOnDemand]: 40/54 looper letters, 99 selfloop transitions, 40 changer transitions 19/179 dead transitions. [2023-11-26 11:50:09,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 179 transitions, 1096 flow [2023-11-26 11:50:09,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-26 11:50:09,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-26 11:50:09,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 407 transitions. [2023-11-26 11:50:09,968 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6851851851851852 [2023-11-26 11:50:09,968 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 407 transitions. [2023-11-26 11:50:09,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 407 transitions. [2023-11-26 11:50:09,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:50:09,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 407 transitions. [2023-11-26 11:50:09,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 37.0) internal successors, (407), 11 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:09,973 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 54.0) internal successors, (648), 12 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:09,974 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 54.0) internal successors, (648), 12 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:09,974 INFO L175 Difference]: Start difference. First operand has 64 places, 52 transitions, 256 flow. Second operand 11 states and 407 transitions. [2023-11-26 11:50:09,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 179 transitions, 1096 flow [2023-11-26 11:50:09,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 179 transitions, 1084 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-26 11:50:09,989 INFO L231 Difference]: Finished difference. Result has 79 places, 83 transitions, 557 flow [2023-11-26 11:50:09,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=557, PETRI_PLACES=79, PETRI_TRANSITIONS=83} [2023-11-26 11:50:09,990 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 20 predicate places. [2023-11-26 11:50:09,990 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 83 transitions, 557 flow [2023-11-26 11:50:09,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.375) internal successors, (203), 8 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:09,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:50:09,991 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:50:09,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-26 11:50:09,992 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:50:09,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:09,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1721722419, now seen corresponding path program 2 times [2023-11-26 11:50:09,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:09,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579588091] [2023-11-26 11:50:09,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:09,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:10,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:10,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:50:10,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:50:10,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579588091] [2023-11-26 11:50:10,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579588091] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:10,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:10,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:50:10,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622239692] [2023-11-26 11:50:10,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:10,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:50:10,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:50:10,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:50:10,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:50:10,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2023-11-26 11:50:10,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 83 transitions, 557 flow. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:10,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:50:10,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2023-11-26 11:50:10,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:50:11,099 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][41], [Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 184#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0))), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 174#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 188#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 155#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 124#true, Black: 127#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 126#(= ~__unbuffered_p2_EAX~0 0), 21#L765true, 7#L844true, Black: 153#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 204#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 99#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t659~0#1.base| 0) |ULTIMATE.start_main_~#t657~0#1.base| 0) |ULTIMATE.start_main_~#t658~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t658~0#1.base|)) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|)) (not (= |ULTIMATE.start_main_~#t658~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|))), Black: 163#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 167#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 53#L785true, 43#L814true, 171#true, Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 104#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 108#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, Black: 182#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~z$w_buff0_used~0 256) 0)), P1Thread1of1ForFork1InUse, Black: 175#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z~0 0)))]) [2023-11-26 11:50:11,101 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is not cut-off event [2023-11-26 11:50:11,101 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-11-26 11:50:11,102 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-11-26 11:50:11,102 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-11-26 11:50:11,146 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][74], [Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 184#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0))), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 174#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 188#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 153#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 167#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 124#true, Black: 127#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 126#(= ~__unbuffered_p2_EAX~0 0), 7#L844true, 21#L765true, 19#L788true, Black: 155#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 99#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t659~0#1.base| 0) |ULTIMATE.start_main_~#t657~0#1.base| 0) |ULTIMATE.start_main_~#t658~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t658~0#1.base|)) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|)) (not (= |ULTIMATE.start_main_~#t658~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|))), Black: 163#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 43#L814true, 171#true, Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 104#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 206#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), Black: 108#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, Black: 182#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 175#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z~0 0))), P1Thread1of1ForFork1InUse]) [2023-11-26 11:50:11,147 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-26 11:50:11,147 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-26 11:50:11,147 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-26 11:50:11,148 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-26 11:50:11,282 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][41], [Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 184#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0))), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 174#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 188#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 155#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 124#true, Black: 127#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 126#(= ~__unbuffered_p2_EAX~0 0), 21#L765true, Black: 153#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 204#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 99#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t659~0#1.base| 0) |ULTIMATE.start_main_~#t657~0#1.base| 0) |ULTIMATE.start_main_~#t658~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t658~0#1.base|)) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|)) (not (= |ULTIMATE.start_main_~#t658~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|))), Black: 163#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 167#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 53#L785true, 43#L814true, 171#true, 17#L846true, Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 104#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 108#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, Black: 182#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 175#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z~0 0))), P1Thread1of1ForFork1InUse]) [2023-11-26 11:50:11,282 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is not cut-off event [2023-11-26 11:50:11,282 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2023-11-26 11:50:11,282 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2023-11-26 11:50:11,282 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2023-11-26 11:50:11,299 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][74], [Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 184#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0))), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 174#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 188#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 153#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 167#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 124#true, Black: 127#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 126#(= ~__unbuffered_p2_EAX~0 0), 7#L844true, Black: 155#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 99#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t659~0#1.base| 0) |ULTIMATE.start_main_~#t657~0#1.base| 0) |ULTIMATE.start_main_~#t658~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t658~0#1.base|)) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|)) (not (= |ULTIMATE.start_main_~#t658~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|))), Black: 163#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 53#L785true, 43#L814true, 5#P0EXITtrue, 171#true, Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 104#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 108#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 206#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, Black: 182#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~z$w_buff0_used~0 256) 0)), P1Thread1of1ForFork1InUse, Black: 175#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z~0 0)))]) [2023-11-26 11:50:11,299 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-26 11:50:11,300 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-26 11:50:11,300 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-26 11:50:11,300 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-26 11:50:11,303 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][74], [Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 184#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0))), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 174#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 188#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 167#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 124#true, Black: 127#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 126#(= ~__unbuffered_p2_EAX~0 0), 48#L768true, Black: 153#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 155#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 99#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t659~0#1.base| 0) |ULTIMATE.start_main_~#t657~0#1.base| 0) |ULTIMATE.start_main_~#t658~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t658~0#1.base|)) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|)) (not (= |ULTIMATE.start_main_~#t658~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|))), Black: 163#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 53#L785true, 43#L814true, 171#true, 17#L846true, Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 104#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 108#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 206#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, Black: 182#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 175#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z~0 0))), P1Thread1of1ForFork1InUse]) [2023-11-26 11:50:11,304 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-26 11:50:11,304 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-26 11:50:11,304 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-26 11:50:11,304 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-26 11:50:11,324 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][74], [Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 184#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0))), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 174#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 188#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 153#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 167#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 124#true, Black: 127#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 126#(= ~__unbuffered_p2_EAX~0 0), 21#L765true, 19#L788true, Black: 155#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 99#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t659~0#1.base| 0) |ULTIMATE.start_main_~#t657~0#1.base| 0) |ULTIMATE.start_main_~#t658~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t658~0#1.base|)) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|)) (not (= |ULTIMATE.start_main_~#t658~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|))), Black: 163#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 43#L814true, 171#true, 17#L846true, Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 104#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 108#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 206#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, Black: 182#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~z$w_buff0_used~0 256) 0)), P1Thread1of1ForFork1InUse, Black: 175#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z~0 0)))]) [2023-11-26 11:50:11,324 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-26 11:50:11,325 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-26 11:50:11,325 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-26 11:50:11,325 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-26 11:50:11,327 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][74], [Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 184#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0))), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 24#P1EXITtrue, Black: 174#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 188#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 153#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 167#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 124#true, Black: 127#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 126#(= ~__unbuffered_p2_EAX~0 0), 7#L844true, 21#L765true, Black: 155#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 99#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t659~0#1.base| 0) |ULTIMATE.start_main_~#t657~0#1.base| 0) |ULTIMATE.start_main_~#t658~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t658~0#1.base|)) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|)) (not (= |ULTIMATE.start_main_~#t658~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|))), Black: 163#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 43#L814true, 171#true, Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 104#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 108#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 206#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, Black: 182#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 175#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z~0 0))), P1Thread1of1ForFork1InUse]) [2023-11-26 11:50:11,327 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-26 11:50:11,327 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-26 11:50:11,327 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-26 11:50:11,328 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-26 11:50:11,329 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][74], [Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 184#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0))), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 174#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 188#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 167#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 124#true, Black: 127#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 126#(= ~__unbuffered_p2_EAX~0 0), 21#L765true, 19#L788true, Black: 153#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 155#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 99#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t659~0#1.base| 0) |ULTIMATE.start_main_~#t657~0#1.base| 0) |ULTIMATE.start_main_~#t658~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t658~0#1.base|)) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|)) (not (= |ULTIMATE.start_main_~#t658~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|))), Black: 163#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 43#L814true, 17#L846true, 171#true, Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 104#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 108#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 206#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, Black: 182#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 175#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z~0 0))), P1Thread1of1ForFork1InUse]) [2023-11-26 11:50:11,330 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-26 11:50:11,330 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-26 11:50:11,330 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-26 11:50:11,330 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-26 11:50:11,331 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][92], [Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 184#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0))), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 174#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 188#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 153#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 208#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 124#true, Black: 127#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 126#(= ~__unbuffered_p2_EAX~0 0), 7#L844true, 19#L788true, 48#L768true, Black: 155#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 99#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t659~0#1.base| 0) |ULTIMATE.start_main_~#t657~0#1.base| 0) |ULTIMATE.start_main_~#t658~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t658~0#1.base|)) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|)) (not (= |ULTIMATE.start_main_~#t658~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|))), Black: 167#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 43#L814true, 171#true, Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 104#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 108#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, 163#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 182#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 175#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z~0 0))), P1Thread1of1ForFork1InUse]) [2023-11-26 11:50:11,332 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-26 11:50:11,332 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-26 11:50:11,332 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-26 11:50:11,332 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-26 11:50:11,450 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][74], [Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 184#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0))), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 174#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 188#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 167#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 124#true, Black: 127#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 126#(= ~__unbuffered_p2_EAX~0 0), Black: 153#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 155#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 99#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t659~0#1.base| 0) |ULTIMATE.start_main_~#t657~0#1.base| 0) |ULTIMATE.start_main_~#t658~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t658~0#1.base|)) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|)) (not (= |ULTIMATE.start_main_~#t658~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|))), Black: 163#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 53#L785true, 43#L814true, 5#P0EXITtrue, 171#true, 17#L846true, Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 104#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 108#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 206#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, Black: 182#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~z$w_buff0_used~0 256) 0)), P1Thread1of1ForFork1InUse, Black: 175#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z~0 0)))]) [2023-11-26 11:50:11,451 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-26 11:50:11,451 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-26 11:50:11,451 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-26 11:50:11,451 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-26 11:50:11,452 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][92], [Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 184#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0))), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 174#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 188#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 153#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 208#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 124#true, Black: 127#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 126#(= ~__unbuffered_p2_EAX~0 0), 7#L844true, 19#L788true, Black: 155#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 99#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t659~0#1.base| 0) |ULTIMATE.start_main_~#t657~0#1.base| 0) |ULTIMATE.start_main_~#t658~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t658~0#1.base|)) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|)) (not (= |ULTIMATE.start_main_~#t658~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|))), Black: 167#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 43#L814true, 5#P0EXITtrue, 171#true, Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 104#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 108#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, 163#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 182#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~z$w_buff0_used~0 256) 0)), P1Thread1of1ForFork1InUse, Black: 175#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z~0 0)))]) [2023-11-26 11:50:11,452 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-26 11:50:11,453 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-26 11:50:11,453 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-26 11:50:11,453 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-26 11:50:11,457 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][92], [Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 184#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0))), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 174#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 188#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 208#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 124#true, Black: 127#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 126#(= ~__unbuffered_p2_EAX~0 0), 19#L788true, 48#L768true, Black: 153#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 155#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 99#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t659~0#1.base| 0) |ULTIMATE.start_main_~#t657~0#1.base| 0) |ULTIMATE.start_main_~#t658~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t658~0#1.base|)) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|)) (not (= |ULTIMATE.start_main_~#t658~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|))), Black: 167#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 43#L814true, 171#true, 17#L846true, Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 104#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 108#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, 163#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 182#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 175#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z~0 0))), P1Thread1of1ForFork1InUse]) [2023-11-26 11:50:11,458 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-26 11:50:11,458 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-26 11:50:11,458 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-26 11:50:11,458 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-26 11:50:11,478 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][74], [Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 184#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0))), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 24#P1EXITtrue, Black: 174#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 188#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 153#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 167#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 124#true, Black: 127#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 126#(= ~__unbuffered_p2_EAX~0 0), 21#L765true, Black: 155#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 99#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t659~0#1.base| 0) |ULTIMATE.start_main_~#t657~0#1.base| 0) |ULTIMATE.start_main_~#t658~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t658~0#1.base|)) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|)) (not (= |ULTIMATE.start_main_~#t658~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|))), Black: 163#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 43#L814true, 171#true, 17#L846true, Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 104#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 108#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 206#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, Black: 182#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 175#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z~0 0))), P1Thread1of1ForFork1InUse]) [2023-11-26 11:50:11,478 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-26 11:50:11,479 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-26 11:50:11,479 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-26 11:50:11,479 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-26 11:50:11,480 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][92], [Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 184#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0))), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 174#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 188#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 153#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 208#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 124#true, Black: 127#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 126#(= ~__unbuffered_p2_EAX~0 0), 19#L788true, 48#L768true, Black: 155#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 99#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t659~0#1.base| 0) |ULTIMATE.start_main_~#t657~0#1.base| 0) |ULTIMATE.start_main_~#t658~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t658~0#1.base|)) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|)) (not (= |ULTIMATE.start_main_~#t658~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|))), Black: 167#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 43#L814true, 171#true, 17#L846true, Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 104#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 108#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, Black: 182#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~z$w_buff0_used~0 256) 0)), 163#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), P1Thread1of1ForFork1InUse, Black: 175#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z~0 0)))]) [2023-11-26 11:50:11,481 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-26 11:50:11,481 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-26 11:50:11,481 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-26 11:50:11,481 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-26 11:50:11,483 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][74], [Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 184#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0))), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 24#P1EXITtrue, Black: 174#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 188#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 167#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 124#true, Black: 127#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 126#(= ~__unbuffered_p2_EAX~0 0), 21#L765true, Black: 153#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 155#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 99#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t659~0#1.base| 0) |ULTIMATE.start_main_~#t657~0#1.base| 0) |ULTIMATE.start_main_~#t658~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t658~0#1.base|)) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|)) (not (= |ULTIMATE.start_main_~#t658~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|))), Black: 163#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 43#L814true, 17#L846true, 171#true, Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 104#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 108#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 206#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, Black: 182#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~z$w_buff0_used~0 256) 0)), P1Thread1of1ForFork1InUse, Black: 175#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z~0 0)))]) [2023-11-26 11:50:11,483 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-26 11:50:11,483 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-26 11:50:11,483 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-26 11:50:11,484 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-26 11:50:11,485 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][92], [Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 184#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0))), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 24#P1EXITtrue, Black: 174#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 188#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 153#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 208#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 124#true, Black: 127#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 126#(= ~__unbuffered_p2_EAX~0 0), 7#L844true, 48#L768true, Black: 155#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 99#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t659~0#1.base| 0) |ULTIMATE.start_main_~#t657~0#1.base| 0) |ULTIMATE.start_main_~#t658~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t658~0#1.base|)) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|)) (not (= |ULTIMATE.start_main_~#t658~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|))), Black: 167#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 43#L814true, 171#true, Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 104#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 108#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, 163#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 182#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~z$w_buff0_used~0 256) 0)), P1Thread1of1ForFork1InUse, Black: 175#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z~0 0)))]) [2023-11-26 11:50:11,485 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-26 11:50:11,485 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-26 11:50:11,485 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-26 11:50:11,486 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-26 11:50:11,487 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][92], [Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 184#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0))), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 174#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 188#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 208#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 124#true, Black: 127#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 126#(= ~__unbuffered_p2_EAX~0 0), 19#L788true, 48#L768true, Black: 153#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 155#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 99#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t659~0#1.base| 0) |ULTIMATE.start_main_~#t657~0#1.base| 0) |ULTIMATE.start_main_~#t658~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t658~0#1.base|)) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|)) (not (= |ULTIMATE.start_main_~#t658~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|))), Black: 163#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 167#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 43#L814true, 17#L846true, 171#true, Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 104#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 108#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, Black: 182#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~z$w_buff0_used~0 256) 0)), P1Thread1of1ForFork1InUse, Black: 175#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z~0 0)))]) [2023-11-26 11:50:11,487 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-26 11:50:11,488 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-26 11:50:11,488 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-26 11:50:11,488 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-26 11:50:11,607 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][92], [Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 184#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0))), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 174#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 188#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 208#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 124#true, Black: 127#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 126#(= ~__unbuffered_p2_EAX~0 0), 19#L788true, Black: 153#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 155#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 99#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t659~0#1.base| 0) |ULTIMATE.start_main_~#t657~0#1.base| 0) |ULTIMATE.start_main_~#t658~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t658~0#1.base|)) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|)) (not (= |ULTIMATE.start_main_~#t658~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|))), Black: 167#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 43#L814true, 5#P0EXITtrue, 171#true, 17#L846true, Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 104#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 108#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, 163#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 182#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 175#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z~0 0))), P1Thread1of1ForFork1InUse]) [2023-11-26 11:50:11,608 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-26 11:50:11,608 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-26 11:50:11,609 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-26 11:50:11,609 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-26 11:50:11,610 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][92], [Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 184#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0))), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 24#P1EXITtrue, Black: 174#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 188#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 153#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 208#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 124#true, Black: 127#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 126#(= ~__unbuffered_p2_EAX~0 0), 7#L844true, Black: 155#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 99#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t659~0#1.base| 0) |ULTIMATE.start_main_~#t657~0#1.base| 0) |ULTIMATE.start_main_~#t658~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t658~0#1.base|)) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|)) (not (= |ULTIMATE.start_main_~#t658~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|))), Black: 167#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 43#L814true, 5#P0EXITtrue, 171#true, Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 104#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 108#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, 163#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 182#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~z$w_buff0_used~0 256) 0)), P1Thread1of1ForFork1InUse, Black: 175#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z~0 0)))]) [2023-11-26 11:50:11,611 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-26 11:50:11,611 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-26 11:50:11,611 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-26 11:50:11,612 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-26 11:50:11,613 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][92], [Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 184#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0))), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 174#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 188#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 208#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 124#true, Black: 127#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 126#(= ~__unbuffered_p2_EAX~0 0), 19#L788true, Black: 153#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 155#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 99#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t659~0#1.base| 0) |ULTIMATE.start_main_~#t657~0#1.base| 0) |ULTIMATE.start_main_~#t658~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t658~0#1.base|)) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|)) (not (= |ULTIMATE.start_main_~#t658~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|))), Black: 163#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 167#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 43#L814true, 5#P0EXITtrue, 171#true, 17#L846true, Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 104#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 108#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, Black: 182#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~z$w_buff0_used~0 256) 0)), P1Thread1of1ForFork1InUse, Black: 175#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z~0 0)))]) [2023-11-26 11:50:11,614 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-26 11:50:11,614 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-26 11:50:11,614 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-26 11:50:11,615 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-26 11:50:11,624 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][92], [Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 184#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0))), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 24#P1EXITtrue, Black: 174#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 188#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 208#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 124#true, Black: 127#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 126#(= ~__unbuffered_p2_EAX~0 0), 48#L768true, Black: 153#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 155#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 99#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t659~0#1.base| 0) |ULTIMATE.start_main_~#t657~0#1.base| 0) |ULTIMATE.start_main_~#t658~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t658~0#1.base|)) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|)) (not (= |ULTIMATE.start_main_~#t658~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|))), Black: 167#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 43#L814true, 171#true, 17#L846true, Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 104#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 108#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, 163#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 182#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~z$w_buff0_used~0 256) 0)), P1Thread1of1ForFork1InUse, Black: 175#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z~0 0)))]) [2023-11-26 11:50:11,624 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-26 11:50:11,625 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-26 11:50:11,625 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-26 11:50:11,625 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-26 11:50:11,648 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][92], [Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 184#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0))), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 24#P1EXITtrue, Black: 174#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 188#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 153#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 208#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 124#true, Black: 127#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 126#(= ~__unbuffered_p2_EAX~0 0), 48#L768true, Black: 155#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 99#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t659~0#1.base| 0) |ULTIMATE.start_main_~#t657~0#1.base| 0) |ULTIMATE.start_main_~#t658~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t658~0#1.base|)) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|)) (not (= |ULTIMATE.start_main_~#t658~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|))), Black: 167#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 43#L814true, 171#true, 17#L846true, Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 104#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 108#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, 163#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 182#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 175#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z~0 0))), P1Thread1of1ForFork1InUse]) [2023-11-26 11:50:11,648 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-26 11:50:11,648 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-26 11:50:11,649 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-26 11:50:11,649 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-26 11:50:11,650 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][92], [Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 184#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0))), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 174#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 188#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 153#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 208#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 124#true, Black: 127#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 126#(= ~__unbuffered_p2_EAX~0 0), 19#L788true, Black: 155#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 99#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t659~0#1.base| 0) |ULTIMATE.start_main_~#t657~0#1.base| 0) |ULTIMATE.start_main_~#t658~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t658~0#1.base|)) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|)) (not (= |ULTIMATE.start_main_~#t658~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|))), Black: 167#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 43#L814true, 5#P0EXITtrue, 171#true, 17#L846true, Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 104#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 108#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, Black: 182#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~z$w_buff0_used~0 256) 0)), 163#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 175#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z~0 0))), P1Thread1of1ForFork1InUse]) [2023-11-26 11:50:11,650 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-26 11:50:11,650 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-26 11:50:11,650 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-26 11:50:11,651 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-26 11:50:11,652 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][92], [Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 184#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0))), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 24#P1EXITtrue, Black: 174#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 188#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 208#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 124#true, Black: 127#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 126#(= ~__unbuffered_p2_EAX~0 0), 48#L768true, Black: 153#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 155#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 99#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t659~0#1.base| 0) |ULTIMATE.start_main_~#t657~0#1.base| 0) |ULTIMATE.start_main_~#t658~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t658~0#1.base|)) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|)) (not (= |ULTIMATE.start_main_~#t658~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|))), Black: 163#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 167#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 43#L814true, 17#L846true, 171#true, Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 104#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 108#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, Black: 182#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 175#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z~0 0))), P1Thread1of1ForFork1InUse]) [2023-11-26 11:50:11,652 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-26 11:50:11,652 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-26 11:50:11,653 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-26 11:50:11,653 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-26 11:50:11,733 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][92], [Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 184#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0))), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 24#P1EXITtrue, Black: 174#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 188#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 208#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 124#true, Black: 127#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 126#(= ~__unbuffered_p2_EAX~0 0), Black: 153#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 155#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 99#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t659~0#1.base| 0) |ULTIMATE.start_main_~#t657~0#1.base| 0) |ULTIMATE.start_main_~#t658~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t658~0#1.base|)) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|)) (not (= |ULTIMATE.start_main_~#t658~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|))), Black: 167#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 43#L814true, 5#P0EXITtrue, 171#true, 17#L846true, Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 104#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 108#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, 163#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 182#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~z$w_buff0_used~0 256) 0)), P1Thread1of1ForFork1InUse, Black: 175#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z~0 0)))]) [2023-11-26 11:50:11,733 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-11-26 11:50:11,733 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-26 11:50:11,733 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-26 11:50:11,734 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-26 11:50:11,735 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][92], [Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 184#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0))), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 24#P1EXITtrue, Black: 174#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 188#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 208#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 124#true, Black: 127#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 126#(= ~__unbuffered_p2_EAX~0 0), Black: 153#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 155#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 99#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t659~0#1.base| 0) |ULTIMATE.start_main_~#t657~0#1.base| 0) |ULTIMATE.start_main_~#t658~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t658~0#1.base|)) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|)) (not (= |ULTIMATE.start_main_~#t658~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|))), Black: 163#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 167#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 43#L814true, 5#P0EXITtrue, 171#true, 17#L846true, Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 104#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 108#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, Black: 182#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~z$w_buff0_used~0 256) 0)), P1Thread1of1ForFork1InUse, Black: 175#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z~0 0)))]) [2023-11-26 11:50:11,735 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-11-26 11:50:11,735 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-26 11:50:11,735 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-26 11:50:11,735 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-26 11:50:11,751 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][92], [Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 184#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~z~0 0))), Black: 176#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 24#P1EXITtrue, Black: 174#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 188#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 153#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 208#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 124#true, Black: 127#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 126#(= ~__unbuffered_p2_EAX~0 0), Black: 155#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 99#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t659~0#1.base| 0) |ULTIMATE.start_main_~#t657~0#1.base| 0) |ULTIMATE.start_main_~#t658~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t658~0#1.base|)) (not (= |ULTIMATE.start_main_~#t659~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|)) (not (= |ULTIMATE.start_main_~#t658~0#1.base| |ULTIMATE.start_main_~#t657~0#1.base|))), Black: 167#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 43#L814true, 5#P0EXITtrue, 171#true, 17#L846true, Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 104#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 108#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, 163#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 182#(and (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~z$w_buff0_used~0 256) 0)), Black: 175#(and (<= 0 (div ~z$w_buff0_used~0 256)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z~0 0))), P1Thread1of1ForFork1InUse]) [2023-11-26 11:50:11,752 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-11-26 11:50:11,752 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-26 11:50:11,752 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-26 11:50:11,752 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-26 11:50:11,925 INFO L124 PetriNetUnfolderBase]: 3976/6513 cut-off events. [2023-11-26 11:50:11,925 INFO L125 PetriNetUnfolderBase]: For 20345/22224 co-relation queries the response was YES. [2023-11-26 11:50:11,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24262 conditions, 6513 events. 3976/6513 cut-off events. For 20345/22224 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 42991 event pairs, 520 based on Foata normal form. 425/6684 useless extension candidates. Maximal degree in co-relation 24231. Up to 2431 conditions per place. [2023-11-26 11:50:11,988 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 82 selfloop transitions, 11 changer transitions 8/134 dead transitions. [2023-11-26 11:50:11,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 134 transitions, 1056 flow [2023-11-26 11:50:11,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:50:11,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 11:50:11,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 212 transitions. [2023-11-26 11:50:11,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.654320987654321 [2023-11-26 11:50:11,992 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 212 transitions. [2023-11-26 11:50:11,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 212 transitions. [2023-11-26 11:50:11,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:50:11,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 212 transitions. [2023-11-26 11:50:11,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 35.333333333333336) internal successors, (212), 6 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:11,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 54.0) internal successors, (378), 7 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:11,997 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 54.0) internal successors, (378), 7 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:11,997 INFO L175 Difference]: Start difference. First operand has 79 places, 83 transitions, 557 flow. Second operand 6 states and 212 transitions. [2023-11-26 11:50:11,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 134 transitions, 1056 flow [2023-11-26 11:50:12,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 134 transitions, 1034 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-11-26 11:50:12,043 INFO L231 Difference]: Finished difference. Result has 81 places, 80 transitions, 550 flow [2023-11-26 11:50:12,043 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=550, PETRI_PLACES=81, PETRI_TRANSITIONS=80} [2023-11-26 11:50:12,044 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 22 predicate places. [2023-11-26 11:50:12,045 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 80 transitions, 550 flow [2023-11-26 11:50:12,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:12,046 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:50:12,046 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:50:12,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-26 11:50:12,046 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:50:12,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:12,047 INFO L85 PathProgramCache]: Analyzing trace with hash -726354857, now seen corresponding path program 1 times [2023-11-26 11:50:12,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:12,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285539469] [2023-11-26 11:50:12,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:12,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:12,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:12,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:50:12,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:50:12,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285539469] [2023-11-26 11:50:12,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285539469] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:12,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:12,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:50:12,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147284864] [2023-11-26 11:50:12,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:12,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:50:12,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:50:12,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:50:12,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:50:12,543 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2023-11-26 11:50:12,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 80 transitions, 550 flow. Second operand has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:12,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:50:12,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2023-11-26 11:50:12,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:50:13,544 INFO L124 PetriNetUnfolderBase]: 2638/5103 cut-off events. [2023-11-26 11:50:13,544 INFO L125 PetriNetUnfolderBase]: For 13794/14908 co-relation queries the response was YES. [2023-11-26 11:50:13,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18357 conditions, 5103 events. 2638/5103 cut-off events. For 13794/14908 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 40287 event pairs, 661 based on Foata normal form. 128/4715 useless extension candidates. Maximal degree in co-relation 18325. Up to 1784 conditions per place. [2023-11-26 11:50:13,578 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 37 selfloop transitions, 1 changer transitions 56/128 dead transitions. [2023-11-26 11:50:13,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 128 transitions, 998 flow [2023-11-26 11:50:13,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:50:13,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 11:50:13,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 203 transitions. [2023-11-26 11:50:13,581 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6265432098765432 [2023-11-26 11:50:13,581 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 203 transitions. [2023-11-26 11:50:13,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 203 transitions. [2023-11-26 11:50:13,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:50:13,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 203 transitions. [2023-11-26 11:50:13,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 33.833333333333336) internal successors, (203), 6 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:13,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 54.0) internal successors, (378), 7 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:13,584 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 54.0) internal successors, (378), 7 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:13,584 INFO L175 Difference]: Start difference. First operand has 81 places, 80 transitions, 550 flow. Second operand 6 states and 203 transitions. [2023-11-26 11:50:13,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 128 transitions, 998 flow [2023-11-26 11:50:13,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 128 transitions, 921 flow, removed 26 selfloop flow, removed 6 redundant places. [2023-11-26 11:50:13,704 INFO L231 Difference]: Finished difference. Result has 84 places, 67 transitions, 412 flow [2023-11-26 11:50:13,704 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=412, PETRI_PLACES=84, PETRI_TRANSITIONS=67} [2023-11-26 11:50:13,705 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 25 predicate places. [2023-11-26 11:50:13,705 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 67 transitions, 412 flow [2023-11-26 11:50:13,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:13,706 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:50:13,706 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:50:13,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-26 11:50:13,706 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:50:13,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:13,707 INFO L85 PathProgramCache]: Analyzing trace with hash 568744081, now seen corresponding path program 2 times [2023-11-26 11:50:13,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:13,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981324169] [2023-11-26 11:50:13,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:13,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:13,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:14,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:50:14,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:50:14,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981324169] [2023-11-26 11:50:14,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981324169] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:14,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:14,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-26 11:50:14,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333505084] [2023-11-26 11:50:14,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:14,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-26 11:50:14,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:50:14,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-26 11:50:14,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-26 11:50:14,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 54 [2023-11-26 11:50:14,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 67 transitions, 412 flow. Second operand has 9 states, 9 states have (on average 28.88888888888889) internal successors, (260), 9 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:14,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:50:14,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 54 [2023-11-26 11:50:14,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:50:15,722 INFO L124 PetriNetUnfolderBase]: 968/2034 cut-off events. [2023-11-26 11:50:15,722 INFO L125 PetriNetUnfolderBase]: For 3662/3978 co-relation queries the response was YES. [2023-11-26 11:50:15,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6616 conditions, 2034 events. 968/2034 cut-off events. For 3662/3978 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 14195 event pairs, 192 based on Foata normal form. 58/1855 useless extension candidates. Maximal degree in co-relation 6584. Up to 711 conditions per place. [2023-11-26 11:50:15,734 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 34 selfloop transitions, 5 changer transitions 34/106 dead transitions. [2023-11-26 11:50:15,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 106 transitions, 710 flow [2023-11-26 11:50:15,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 11:50:15,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-26 11:50:15,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 302 transitions. [2023-11-26 11:50:15,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6213991769547325 [2023-11-26 11:50:15,737 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 302 transitions. [2023-11-26 11:50:15,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 302 transitions. [2023-11-26 11:50:15,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:50:15,738 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 302 transitions. [2023-11-26 11:50:15,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 33.55555555555556) internal successors, (302), 9 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:15,741 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 54.0) internal successors, (540), 10 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:15,741 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 54.0) internal successors, (540), 10 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:15,741 INFO L175 Difference]: Start difference. First operand has 84 places, 67 transitions, 412 flow. Second operand 9 states and 302 transitions. [2023-11-26 11:50:15,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 106 transitions, 710 flow [2023-11-26 11:50:15,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 106 transitions, 663 flow, removed 8 selfloop flow, removed 7 redundant places. [2023-11-26 11:50:15,767 INFO L231 Difference]: Finished difference. Result has 86 places, 59 transitions, 340 flow [2023-11-26 11:50:15,767 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=340, PETRI_PLACES=86, PETRI_TRANSITIONS=59} [2023-11-26 11:50:15,768 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 27 predicate places. [2023-11-26 11:50:15,768 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 59 transitions, 340 flow [2023-11-26 11:50:15,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 28.88888888888889) internal successors, (260), 9 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:15,769 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:50:15,769 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:50:15,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-26 11:50:15,770 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:50:15,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:15,770 INFO L85 PathProgramCache]: Analyzing trace with hash -812600905, now seen corresponding path program 3 times [2023-11-26 11:50:15,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:15,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763406573] [2023-11-26 11:50:15,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:15,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:15,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:50:15,839 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:50:15,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:50:15,928 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:50:15,928 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 11:50:15,930 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-26 11:50:15,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-26 11:50:15,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-26 11:50:15,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-26 11:50:15,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-26 11:50:15,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-26 11:50:15,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-26 11:50:15,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-26 11:50:15,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-26 11:50:15,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-26 11:50:15,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-26 11:50:15,935 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-26 11:50:15,935 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-26 11:50:15,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-26 11:50:15,935 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:50:15,942 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-26 11:50:15,942 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 11:50:16,002 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-26 11:50:16,007 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-26 11:50:16,009 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-26 11:50:16,029 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-26 11:50:16,036 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-26 11:50:16,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 11:50:16 BasicIcfg [2023-11-26 11:50:16,055 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 11:50:16,056 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 11:50:16,056 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 11:50:16,056 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 11:50:16,057 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:49:54" (3/4) ... [2023-11-26 11:50:16,059 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-26 11:50:16,060 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 11:50:16,060 INFO L158 Benchmark]: Toolchain (without parser) took 23823.60ms. Allocated memory was 144.7MB in the beginning and 914.4MB in the end (delta: 769.7MB). Free memory was 95.1MB in the beginning and 711.1MB in the end (delta: -616.0MB). Peak memory consumption was 155.4MB. Max. memory is 16.1GB. [2023-11-26 11:50:16,061 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 117.4MB. Free memory is still 73.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:50:16,061 INFO L158 Benchmark]: CACSL2BoogieTranslator took 768.12ms. Allocated memory is still 144.7MB. Free memory was 95.1MB in the beginning and 71.4MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-26 11:50:16,062 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.72ms. Allocated memory is still 144.7MB. Free memory was 71.4MB in the beginning and 68.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 11:50:16,062 INFO L158 Benchmark]: Boogie Preprocessor took 55.75ms. Allocated memory is still 144.7MB. Free memory was 68.9MB in the beginning and 65.2MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 11:50:16,062 INFO L158 Benchmark]: RCFGBuilder took 885.06ms. Allocated memory is still 144.7MB. Free memory was 65.2MB in the beginning and 68.0MB in the end (delta: -2.9MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. [2023-11-26 11:50:16,063 INFO L158 Benchmark]: TraceAbstraction took 22040.30ms. Allocated memory was 144.7MB in the beginning and 914.4MB in the end (delta: 769.7MB). Free memory was 67.5MB in the beginning and 711.1MB in the end (delta: -643.6MB). Peak memory consumption was 127.1MB. Max. memory is 16.1GB. [2023-11-26 11:50:16,063 INFO L158 Benchmark]: Witness Printer took 4.17ms. Allocated memory is still 914.4MB. Free memory is still 711.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:50:16,065 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36ms. Allocated memory is still 117.4MB. Free memory is still 73.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 768.12ms. Allocated memory is still 144.7MB. Free memory was 95.1MB in the beginning and 71.4MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.72ms. Allocated memory is still 144.7MB. Free memory was 71.4MB in the beginning and 68.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.75ms. Allocated memory is still 144.7MB. Free memory was 68.9MB in the beginning and 65.2MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 885.06ms. Allocated memory is still 144.7MB. Free memory was 65.2MB in the beginning and 68.0MB in the end (delta: -2.9MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. * TraceAbstraction took 22040.30ms. Allocated memory was 144.7MB in the beginning and 914.4MB in the end (delta: 769.7MB). Free memory was 67.5MB in the beginning and 711.1MB in the end (delta: -643.6MB). Peak memory consumption was 127.1MB. Max. memory is 16.1GB. * Witness Printer took 4.17ms. Allocated memory is still 914.4MB. Free memory is still 711.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L723] 0 int z = 0; [L724] 0 _Bool z$flush_delayed; [L725] 0 int z$mem_tmp; [L726] 0 _Bool z$r_buff0_thd0; [L727] 0 _Bool z$r_buff0_thd1; [L728] 0 _Bool z$r_buff0_thd2; [L729] 0 _Bool z$r_buff0_thd3; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$read_delayed; [L735] 0 int *z$read_delayed_var; [L736] 0 int z$w_buff0; [L737] 0 _Bool z$w_buff0_used; [L738] 0 int z$w_buff1; [L739] 0 _Bool z$w_buff1_used; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L838] 0 pthread_t t657; [L839] FCALL, FORK 0 pthread_create(&t657, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t657={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L840] 0 pthread_t t658; [L841] FCALL, FORK 0 pthread_create(&t658, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t657={5:0}, t658={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L842] 0 pthread_t t659; [L843] FCALL, FORK 0 pthread_create(&t659, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t657={5:0}, t658={6:0}, t659={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L745] 1 z$w_buff1 = z$w_buff0 [L746] 1 z$w_buff0 = 1 [L747] 1 z$w_buff1_used = z$w_buff0_used [L748] 1 z$w_buff0_used = (_Bool)1 [L749] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L749] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L750] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L751] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L752] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L753] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L754] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L777] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L794] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L797] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L800] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 3 z$flush_delayed = weak$$choice2 [L803] 3 z$mem_tmp = z [L804] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L805] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L806] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L807] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L808] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L810] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 __unbuffered_p2_EBX = z [L812] 3 z = z$flush_delayed ? z$mem_tmp : z [L813] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L816] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L817] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L818] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L819] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L820] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L780] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L781] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L782] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L783] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L784] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L760] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L761] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L762] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L763] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L764] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L823] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t657={5:0}, t658={6:0}, t659={3:0}, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L847] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L847] RET 0 assume_abort_if_not(main$tmp_guard0) [L849] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L850] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L852] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t657={5:0}, t658={6:0}, t659={3:0}, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L856] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t657={5:0}, t658={6:0}, t659={3:0}, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L17] 0 __assert_fail ("0", "mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 843]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 839]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 841]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 79 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 21.8s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 15.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 817 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 710 mSDsluCounter, 262 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 199 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2291 IncrementalHoareTripleChecker+Invalid, 2342 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 63 mSDtfsCounter, 2291 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=557occurred in iteration=13, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, 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: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 296 NumberOfCodeBlocks, 296 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 246 ConstructedInterpolants, 0 QuantifiedInterpolants, 1819 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-26 11:50:16,097 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ea86164637dd5d5bd9745ca8d3f5dc708b98bc3f75b645830d494ea6e5cae6ff --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:50:18,848 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:50:19,001 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-26 11:50:19,009 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:50:19,010 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:50:19,056 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:50:19,057 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:50:19,058 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:50:19,059 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:50:19,064 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:50:19,064 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:50:19,065 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:50:19,066 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:50:19,067 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:50:19,068 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:50:19,068 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:50:19,069 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:50:19,069 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:50:19,070 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:50:19,070 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:50:19,070 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-26 11:50:19,071 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-26 11:50:19,071 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-26 11:50:19,072 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:50:19,072 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-26 11:50:19,073 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-26 11:50:19,073 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-26 11:50:19,074 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 11:50:19,074 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:50:19,075 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:50:19,077 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:50:19,077 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:50:19,077 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 11:50:19,078 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:50:19,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:50:19,078 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:50:19,079 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:50:19,080 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-26 11:50:19,080 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-26 11:50:19,080 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:50:19,080 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:50:19,081 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:50:19,081 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:50:19,081 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-26 11:50:19,082 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/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_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer 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 -> ea86164637dd5d5bd9745ca8d3f5dc708b98bc3f75b645830d494ea6e5cae6ff [2023-11-26 11:50:19,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:50:19,584 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:50:19,587 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:50:19,588 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:50:19,589 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:50:19,590 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread-wmm/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2023-11-26 11:50:22,802 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:50:23,214 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:50:23,220 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/sv-benchmarks/c/pthread-wmm/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2023-11-26 11:50:23,242 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/data/275c550dd/29d9b2fefba0491fbfc345bc6b984b8c/FLAG1ee16b52b [2023-11-26 11:50:23,262 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/data/275c550dd/29d9b2fefba0491fbfc345bc6b984b8c [2023-11-26 11:50:23,268 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:50:23,270 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:50:23,273 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:50:23,273 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:50:23,279 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:50:23,280 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:50:23" (1/1) ... [2023-11-26 11:50:23,281 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3232babc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:23, skipping insertion in model container [2023-11-26 11:50:23,281 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:50:23" (1/1) ... [2023-11-26 11:50:23,362 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:50:23,990 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:50:24,013 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:50:24,099 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:50:24,158 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 11:50:24,158 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 11:50:24,166 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:50:24,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:24 WrapperNode [2023-11-26 11:50:24,168 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:50:24,169 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:50:24,169 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:50:24,170 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:50:24,178 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:24" (1/1) ... [2023-11-26 11:50:24,215 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:24" (1/1) ... [2023-11-26 11:50:24,266 INFO L138 Inliner]: procedures = 179, calls = 57, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 135 [2023-11-26 11:50:24,266 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:50:24,268 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:50:24,268 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:50:24,268 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:50:24,281 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:24" (1/1) ... [2023-11-26 11:50:24,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:24" (1/1) ... [2023-11-26 11:50:24,297 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:24" (1/1) ... [2023-11-26 11:50:24,329 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2023-11-26 11:50:24,329 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:24" (1/1) ... [2023-11-26 11:50:24,329 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:24" (1/1) ... [2023-11-26 11:50:24,341 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:24" (1/1) ... [2023-11-26 11:50:24,343 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:24" (1/1) ... [2023-11-26 11:50:24,347 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:24" (1/1) ... [2023-11-26 11:50:24,349 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:24" (1/1) ... [2023-11-26 11:50:24,354 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:50:24,355 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:50:24,355 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:50:24,356 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:50:24,357 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:24" (1/1) ... [2023-11-26 11:50:24,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:50:24,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:50:24,413 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 11:50:24,429 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 11:50:24,465 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-26 11:50:24,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:50:24,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 11:50:24,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 11:50:24,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-26 11:50:24,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-26 11:50:24,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-26 11:50:24,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-26 11:50:24,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-26 11:50:24,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-26 11:50:24,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-26 11:50:24,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-26 11:50:24,470 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-26 11:50:24,470 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-26 11:50:24,470 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-26 11:50:24,470 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-26 11:50:24,471 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-26 11:50:24,471 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-26 11:50:24,472 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-26 11:50:24,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:50:24,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:50:24,474 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-26 11:50:24,691 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:50:24,693 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:50:25,097 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:50:25,429 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:50:25,429 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-26 11:50:25,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:50:25 BoogieIcfgContainer [2023-11-26 11:50:25,431 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:50:25,434 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:50:25,434 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:50:25,437 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:50:25,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:50:23" (1/3) ... [2023-11-26 11:50:25,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f1642ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:50:25, skipping insertion in model container [2023-11-26 11:50:25,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:24" (2/3) ... [2023-11-26 11:50:25,441 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f1642ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:50:25, skipping insertion in model container [2023-11-26 11:50:25,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:50:25" (3/3) ... [2023-11-26 11:50:25,442 INFO L112 eAbstractionObserver]: Analyzing ICFG mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2023-11-26 11:50:25,465 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:50:25,465 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-26 11:50:25,465 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 11:50:25,543 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 11:50:25,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 54 transitions, 120 flow [2023-11-26 11:50:25,659 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2023-11-26 11:50:25,659 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:50:25,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 51 events. 2/51 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 97 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2023-11-26 11:50:25,665 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 54 transitions, 120 flow [2023-11-26 11:50:25,672 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 51 transitions, 111 flow [2023-11-26 11:50:25,689 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:50:25,696 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5c4ab76f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:50:25,697 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-26 11:50:25,701 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 11:50:25,702 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-26 11:50:25,702 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:50:25,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:50:25,703 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-26 11:50:25,704 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:50:25,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:25,712 INFO L85 PathProgramCache]: Analyzing trace with hash 12652, now seen corresponding path program 1 times [2023-11-26 11:50:25,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:50:25,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [398723678] [2023-11-26 11:50:25,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:25,728 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:50:25,728 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:50:25,731 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 11:50:25,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-26 11:50:25,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:25,899 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-26 11:50:25,904 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:50:25,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-26 11:50:25,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:50:25,996 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:50:25,997 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:50:25,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [398723678] [2023-11-26 11:50:25,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [398723678] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:25,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:25,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:50:26,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859903303] [2023-11-26 11:50:26,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:26,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:50:26,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:50:26,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:50:26,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:50:26,092 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 54 [2023-11-26 11:50:26,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 111 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:26,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:50:26,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 54 [2023-11-26 11:50:26,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:50:26,886 INFO L124 PetriNetUnfolderBase]: 1057/2053 cut-off events. [2023-11-26 11:50:26,886 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-26 11:50:26,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3679 conditions, 2053 events. 1057/2053 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 13860 event pairs, 791 based on Foata normal form. 120/1967 useless extension candidates. Maximal degree in co-relation 3665. Up to 1193 conditions per place. [2023-11-26 11:50:26,917 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 30 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2023-11-26 11:50:26,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 56 transitions, 185 flow [2023-11-26 11:50:26,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:50:26,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:50:26,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2023-11-26 11:50:26,934 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7160493827160493 [2023-11-26 11:50:26,935 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 116 transitions. [2023-11-26 11:50:26,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 116 transitions. [2023-11-26 11:50:26,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:50:26,941 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 116 transitions. [2023-11-26 11:50:26,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:26,949 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:26,950 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:26,952 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 111 flow. Second operand 3 states and 116 transitions. [2023-11-26 11:50:26,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 56 transitions, 185 flow [2023-11-26 11:50:26,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 56 transitions, 182 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-26 11:50:26,962 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 104 flow [2023-11-26 11:50:26,964 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2023-11-26 11:50:26,968 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -3 predicate places. [2023-11-26 11:50:26,969 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 104 flow [2023-11-26 11:50:26,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:26,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:50:26,970 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-26 11:50:26,978 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-11-26 11:50:27,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:50:27,178 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:50:27,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:27,179 INFO L85 PathProgramCache]: Analyzing trace with hash 12653, now seen corresponding path program 1 times [2023-11-26 11:50:27,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:50:27,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1582398303] [2023-11-26 11:50:27,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:27,180 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:50:27,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:50:27,184 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 11:50:27,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-26 11:50:27,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:27,297 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 11:50:27,298 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:50:27,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-26 11:50:27,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:50:27,320 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:50:27,320 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:50:27,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1582398303] [2023-11-26 11:50:27,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1582398303] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:27,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:27,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:50:27,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977127115] [2023-11-26 11:50:27,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:27,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:50:27,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:50:27,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:50:27,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:50:27,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 54 [2023-11-26 11:50:27,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:27,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:50:27,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 54 [2023-11-26 11:50:27,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:50:27,946 INFO L124 PetriNetUnfolderBase]: 1057/2052 cut-off events. [2023-11-26 11:50:27,946 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-26 11:50:27,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3736 conditions, 2052 events. 1057/2052 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 13883 event pairs, 791 based on Foata normal form. 1/1847 useless extension candidates. Maximal degree in co-relation 3725. Up to 1192 conditions per place. [2023-11-26 11:50:27,968 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 29 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-11-26 11:50:27,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 55 transitions, 182 flow [2023-11-26 11:50:27,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:50:27,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:50:27,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2023-11-26 11:50:27,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7160493827160493 [2023-11-26 11:50:27,983 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 116 transitions. [2023-11-26 11:50:27,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 116 transitions. [2023-11-26 11:50:27,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:50:27,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 116 transitions. [2023-11-26 11:50:27,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:27,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:27,989 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:27,989 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 104 flow. Second operand 3 states and 116 transitions. [2023-11-26 11:50:27,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 55 transitions, 182 flow [2023-11-26 11:50:27,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 55 transitions, 178 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:50:27,997 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 102 flow [2023-11-26 11:50:27,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2023-11-26 11:50:27,998 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -4 predicate places. [2023-11-26 11:50:27,998 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 102 flow [2023-11-26 11:50:27,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:27,999 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:50:27,999 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 11:50:28,010 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-26 11:50:28,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:50:28,202 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:50:28,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:28,203 INFO L85 PathProgramCache]: Analyzing trace with hash 377294386, now seen corresponding path program 1 times [2023-11-26 11:50:28,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:50:28,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1253698818] [2023-11-26 11:50:28,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:28,204 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:50:28,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:50:28,206 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 11:50:28,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-26 11:50:28,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:28,302 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-26 11:50:28,304 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:50:28,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:50:28,316 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:50:28,317 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:50:28,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1253698818] [2023-11-26 11:50:28,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1253698818] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:28,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:28,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:50:28,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43029736] [2023-11-26 11:50:28,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:28,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:50:28,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:50:28,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:50:28,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:50:28,320 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 54 [2023-11-26 11:50:28,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:28,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:50:28,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 54 [2023-11-26 11:50:28,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:50:28,681 INFO L124 PetriNetUnfolderBase]: 825/1466 cut-off events. [2023-11-26 11:50:28,682 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2023-11-26 11:50:28,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2794 conditions, 1466 events. 825/1466 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8571 event pairs, 457 based on Foata normal form. 0/1444 useless extension candidates. Maximal degree in co-relation 2783. Up to 1009 conditions per place. [2023-11-26 11:50:28,695 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 33 selfloop transitions, 2 changer transitions 2/61 dead transitions. [2023-11-26 11:50:28,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 61 transitions, 212 flow [2023-11-26 11:50:28,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:50:28,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:50:28,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2023-11-26 11:50:28,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7716049382716049 [2023-11-26 11:50:28,698 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 125 transitions. [2023-11-26 11:50:28,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 125 transitions. [2023-11-26 11:50:28,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:50:28,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 125 transitions. [2023-11-26 11:50:28,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:28,701 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:28,701 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:28,701 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 102 flow. Second operand 3 states and 125 transitions. [2023-11-26 11:50:28,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 61 transitions, 212 flow [2023-11-26 11:50:28,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 61 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:50:28,704 INFO L231 Difference]: Finished difference. Result has 54 places, 44 transitions, 98 flow [2023-11-26 11:50:28,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=54, PETRI_TRANSITIONS=44} [2023-11-26 11:50:28,706 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -5 predicate places. [2023-11-26 11:50:28,706 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 98 flow [2023-11-26 11:50:28,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:28,706 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:50:28,707 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 11:50:28,714 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-26 11:50:28,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:50:28,909 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:50:28,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:28,910 INFO L85 PathProgramCache]: Analyzing trace with hash 377293990, now seen corresponding path program 1 times [2023-11-26 11:50:28,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:50:28,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [379483588] [2023-11-26 11:50:28,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:28,910 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:50:28,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:50:28,913 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 11:50:28,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-26 11:50:29,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:29,018 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-26 11:50:29,019 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:50:29,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-26 11:50:29,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:50:29,031 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:50:29,032 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:50:29,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [379483588] [2023-11-26 11:50:29,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [379483588] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:29,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:29,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:50:29,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851937661] [2023-11-26 11:50:29,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:29,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:50:29,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:50:29,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:50:29,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:50:29,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 54 [2023-11-26 11:50:29,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:29,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:50:29,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 54 [2023-11-26 11:50:29,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:50:29,419 INFO L124 PetriNetUnfolderBase]: 724/1452 cut-off events. [2023-11-26 11:50:29,420 INFO L125 PetriNetUnfolderBase]: For 93/93 co-relation queries the response was YES. [2023-11-26 11:50:29,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2680 conditions, 1452 events. 724/1452 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9606 event pairs, 550 based on Foata normal form. 0/1381 useless extension candidates. Maximal degree in co-relation 2669. Up to 940 conditions per place. [2023-11-26 11:50:29,436 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 27 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2023-11-26 11:50:29,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 51 transitions, 172 flow [2023-11-26 11:50:29,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:50:29,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:50:29,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2023-11-26 11:50:29,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6851851851851852 [2023-11-26 11:50:29,439 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 111 transitions. [2023-11-26 11:50:29,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 111 transitions. [2023-11-26 11:50:29,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:50:29,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 111 transitions. [2023-11-26 11:50:29,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:29,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:29,442 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:29,442 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 98 flow. Second operand 3 states and 111 transitions. [2023-11-26 11:50:29,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 51 transitions, 172 flow [2023-11-26 11:50:29,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 51 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:50:29,445 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 96 flow [2023-11-26 11:50:29,445 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2023-11-26 11:50:29,446 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -7 predicate places. [2023-11-26 11:50:29,447 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 96 flow [2023-11-26 11:50:29,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:29,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:50:29,447 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 11:50:29,458 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-26 11:50:29,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:50:29,650 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:50:29,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:29,651 INFO L85 PathProgramCache]: Analyzing trace with hash 377293991, now seen corresponding path program 1 times [2023-11-26 11:50:29,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:50:29,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1771423756] [2023-11-26 11:50:29,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:29,652 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:50:29,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:50:29,654 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 11:50:29,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-26 11:50:29,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:29,749 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 11:50:29,750 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:50:29,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-26 11:50:29,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:50:29,770 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:50:29,770 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:50:29,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1771423756] [2023-11-26 11:50:29,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1771423756] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:29,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:29,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:50:29,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263304008] [2023-11-26 11:50:29,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:29,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:50:29,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:50:29,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:50:29,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:50:29,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 54 [2023-11-26 11:50:29,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:29,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:50:29,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 54 [2023-11-26 11:50:29,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:50:30,140 INFO L124 PetriNetUnfolderBase]: 721/1462 cut-off events. [2023-11-26 11:50:30,140 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2023-11-26 11:50:30,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2641 conditions, 1462 events. 721/1462 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9619 event pairs, 416 based on Foata normal form. 4/1394 useless extension candidates. Maximal degree in co-relation 2631. Up to 933 conditions per place. [2023-11-26 11:50:30,156 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 26 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2023-11-26 11:50:30,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 50 transitions, 166 flow [2023-11-26 11:50:30,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:50:30,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:50:30,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2023-11-26 11:50:30,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6975308641975309 [2023-11-26 11:50:30,162 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 113 transitions. [2023-11-26 11:50:30,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 113 transitions. [2023-11-26 11:50:30,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:50:30,162 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 113 transitions. [2023-11-26 11:50:30,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:30,166 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:30,166 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:30,166 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 96 flow. Second operand 3 states and 113 transitions. [2023-11-26 11:50:30,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 50 transitions, 166 flow [2023-11-26 11:50:30,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 50 transitions, 162 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:50:30,171 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 94 flow [2023-11-26 11:50:30,171 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2023-11-26 11:50:30,174 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -8 predicate places. [2023-11-26 11:50:30,174 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 94 flow [2023-11-26 11:50:30,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:30,175 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:50:30,175 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:50:30,184 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-26 11:50:30,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:50:30,385 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:50:30,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:30,385 INFO L85 PathProgramCache]: Analyzing trace with hash 36223593, now seen corresponding path program 1 times [2023-11-26 11:50:30,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:50:30,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1956740716] [2023-11-26 11:50:30,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:30,386 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:50:30,387 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:50:30,388 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 11:50:30,396 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-26 11:50:30,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:30,517 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-26 11:50:30,519 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:50:30,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-26 11:50:30,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:50:30,534 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:50:30,534 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:50:30,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1956740716] [2023-11-26 11:50:30,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1956740716] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:30,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:30,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:50:30,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343480648] [2023-11-26 11:50:30,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:30,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:50:30,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:50:30,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:50:30,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:50:30,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 54 [2023-11-26 11:50:30,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:30,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:50:30,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 54 [2023-11-26 11:50:30,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:50:30,874 INFO L124 PetriNetUnfolderBase]: 738/1467 cut-off events. [2023-11-26 11:50:30,874 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2023-11-26 11:50:30,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2675 conditions, 1467 events. 738/1467 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9575 event pairs, 260 based on Foata normal form. 0/1421 useless extension candidates. Maximal degree in co-relation 2665. Up to 934 conditions per place. [2023-11-26 11:50:30,889 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 27 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2023-11-26 11:50:30,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 49 transitions, 166 flow [2023-11-26 11:50:30,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:50:30,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:50:30,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2023-11-26 11:50:30,890 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6851851851851852 [2023-11-26 11:50:30,891 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 111 transitions. [2023-11-26 11:50:30,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 111 transitions. [2023-11-26 11:50:30,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:50:30,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 111 transitions. [2023-11-26 11:50:30,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:30,893 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:30,893 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:30,893 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 94 flow. Second operand 3 states and 111 transitions. [2023-11-26 11:50:30,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 49 transitions, 166 flow [2023-11-26 11:50:30,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 49 transitions, 162 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:50:30,896 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 92 flow [2023-11-26 11:50:30,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2023-11-26 11:50:30,897 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -9 predicate places. [2023-11-26 11:50:30,897 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 92 flow [2023-11-26 11:50:30,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:30,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:50:30,898 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:50:30,903 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-26 11:50:31,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:50:31,101 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:50:31,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:31,102 INFO L85 PathProgramCache]: Analyzing trace with hash 36223594, now seen corresponding path program 1 times [2023-11-26 11:50:31,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:50:31,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [607289990] [2023-11-26 11:50:31,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:31,102 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:50:31,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:50:31,104 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 11:50:31,105 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-26 11:50:31,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:31,207 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 11:50:31,209 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:50:31,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-26 11:50:31,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:50:31,228 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:50:31,229 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:50:31,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [607289990] [2023-11-26 11:50:31,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [607289990] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:31,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:31,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:50:31,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151785904] [2023-11-26 11:50:31,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:31,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:50:31,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:50:31,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:50:31,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:50:31,262 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 54 [2023-11-26 11:50:31,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:31,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:50:31,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 54 [2023-11-26 11:50:31,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:50:31,556 INFO L124 PetriNetUnfolderBase]: 721/1418 cut-off events. [2023-11-26 11:50:31,556 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2023-11-26 11:50:31,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2605 conditions, 1418 events. 721/1418 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9117 event pairs, 420 based on Foata normal form. 12/1388 useless extension candidates. Maximal degree in co-relation 2595. Up to 905 conditions per place. [2023-11-26 11:50:31,570 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 26 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2023-11-26 11:50:31,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 48 transitions, 162 flow [2023-11-26 11:50:31,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:50:31,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:50:31,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2023-11-26 11:50:31,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6975308641975309 [2023-11-26 11:50:31,573 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 113 transitions. [2023-11-26 11:50:31,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 113 transitions. [2023-11-26 11:50:31,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:50:31,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 113 transitions. [2023-11-26 11:50:31,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:31,575 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:31,576 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:31,576 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 92 flow. Second operand 3 states and 113 transitions. [2023-11-26 11:50:31,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 48 transitions, 162 flow [2023-11-26 11:50:31,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 48 transitions, 158 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:50:31,579 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 90 flow [2023-11-26 11:50:31,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2023-11-26 11:50:31,580 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -10 predicate places. [2023-11-26 11:50:31,581 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 90 flow [2023-11-26 11:50:31,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:31,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:50:31,581 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:50:31,597 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-26 11:50:31,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:50:31,782 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:50:31,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:31,783 INFO L85 PathProgramCache]: Analyzing trace with hash -105279427, now seen corresponding path program 1 times [2023-11-26 11:50:31,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:50:31,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1006305990] [2023-11-26 11:50:31,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:31,784 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:50:31,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:50:31,786 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 11:50:31,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-26 11:50:31,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:31,926 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-26 11:50:31,928 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:50:31,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:50:31,964 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:50:31,965 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:50:31,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1006305990] [2023-11-26 11:50:31,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1006305990] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:31,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:31,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:50:31,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573065615] [2023-11-26 11:50:31,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:31,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:50:31,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:50:31,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:50:31,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:50:31,980 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2023-11-26 11:50:31,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:31,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:50:31,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2023-11-26 11:50:31,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:50:32,495 INFO L124 PetriNetUnfolderBase]: 1680/2972 cut-off events. [2023-11-26 11:50:32,495 INFO L125 PetriNetUnfolderBase]: For 99/99 co-relation queries the response was YES. [2023-11-26 11:50:32,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5652 conditions, 2972 events. 1680/2972 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 19302 event pairs, 188 based on Foata normal form. 100/3024 useless extension candidates. Maximal degree in co-relation 5642. Up to 1579 conditions per place. [2023-11-26 11:50:32,524 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 43 selfloop transitions, 5 changer transitions 1/65 dead transitions. [2023-11-26 11:50:32,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 65 transitions, 244 flow [2023-11-26 11:50:32,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 11:50:32,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-26 11:50:32,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2023-11-26 11:50:32,526 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6990740740740741 [2023-11-26 11:50:32,526 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 151 transitions. [2023-11-26 11:50:32,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 151 transitions. [2023-11-26 11:50:32,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:50:32,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 151 transitions. [2023-11-26 11:50:32,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:32,528 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 54.0) internal successors, (270), 5 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:32,529 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 54.0) internal successors, (270), 5 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:32,529 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 90 flow. Second operand 4 states and 151 transitions. [2023-11-26 11:50:32,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 65 transitions, 244 flow [2023-11-26 11:50:32,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 65 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:50:32,533 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 120 flow [2023-11-26 11:50:32,534 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2023-11-26 11:50:32,535 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -7 predicate places. [2023-11-26 11:50:32,535 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 120 flow [2023-11-26 11:50:32,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:32,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:50:32,535 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:50:32,541 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-11-26 11:50:32,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:50:32,739 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:50:32,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:32,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1510135982, now seen corresponding path program 1 times [2023-11-26 11:50:32,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:50:32,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [180984069] [2023-11-26 11:50:32,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:32,740 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:50:32,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:50:32,742 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 11:50:32,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecb44c3d-e5dd-4b46-b5b0-9f21973dcf47/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-26 11:50:32,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:32,883 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 11:50:32,885 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:50:32,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:50:32,971 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:50:32,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:50:32,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [180984069] [2023-11-26 11:50:32,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [180984069] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:32,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:32,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:50:32,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385848448] [2023-11-26 11:50:32,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:32,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:50:32,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:50:32,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:50:32,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:50:32,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2023-11-26 11:50:32,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 120 flow. Second operand has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:32,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:50:32,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2023-11-26 11:50:32,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand