./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix044_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4fc63b2a 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_5e30d75e-2623-4761-a13b-79fb3e706e37/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e30d75e-2623-4761-a13b-79fb3e706e37/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e30d75e-2623-4761-a13b-79fb3e706e37/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e30d75e-2623-4761-a13b-79fb3e706e37/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix044_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e30d75e-2623-4761-a13b-79fb3e706e37/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e30d75e-2623-4761-a13b-79fb3e706e37/bin/uautomizer-verify-4GaUIPS5ZU --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 40f0a1ff0b59c9897722e1cc89a9065b61569e5c28581990c7adb84261d57e0b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:04:25,176 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:04:25,243 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e30d75e-2623-4761-a13b-79fb3e706e37/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-31 22:04:25,248 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:04:25,249 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:04:25,273 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:04:25,273 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:04:25,274 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:04:25,274 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:04:25,275 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:04:25,275 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:04:25,276 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:04:25,276 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:04:25,277 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:04:25,277 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:04:25,278 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:04:25,278 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:04:25,279 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:04:25,279 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:04:25,279 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:04:25,280 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-31 22:04:25,284 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-31 22:04:25,284 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-31 22:04:25,284 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:04:25,285 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 22:04:25,285 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:04:25,285 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 22:04:25,286 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:04:25,286 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:04:25,286 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:04:25,287 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:04:25,287 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:04:25,290 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:04:25,291 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:04:25,291 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:04:25,292 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:04:25,292 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:04:25,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:04:25,292 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:04:25,292 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:04:25,293 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:04:25,295 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:04:25,295 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_5e30d75e-2623-4761-a13b-79fb3e706e37/bin/uautomizer-verify-4GaUIPS5ZU/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_5e30d75e-2623-4761-a13b-79fb3e706e37/bin/uautomizer-verify-4GaUIPS5ZU 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 -> 40f0a1ff0b59c9897722e1cc89a9065b61569e5c28581990c7adb84261d57e0b [2024-10-31 22:04:25,567 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:04:25,596 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:04:25,598 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:04:25,600 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:04:25,600 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:04:25,601 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e30d75e-2623-4761-a13b-79fb3e706e37/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/pthread-wmm/mix044_power.oepc_pso.oepc_rmo.oepc.i Unable to find full path for "g++" [2024-10-31 22:04:27,959 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:04:28,286 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:04:28,287 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e30d75e-2623-4761-a13b-79fb3e706e37/sv-benchmarks/c/pthread-wmm/mix044_power.oepc_pso.oepc_rmo.oepc.i [2024-10-31 22:04:28,307 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e30d75e-2623-4761-a13b-79fb3e706e37/bin/uautomizer-verify-4GaUIPS5ZU/data/255218174/dda967a72a6f462ba002aa08388e3207/FLAGb5c60e5ca [2024-10-31 22:04:28,331 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e30d75e-2623-4761-a13b-79fb3e706e37/bin/uautomizer-verify-4GaUIPS5ZU/data/255218174/dda967a72a6f462ba002aa08388e3207 [2024-10-31 22:04:28,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:04:28,336 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:04:28,339 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:04:28,339 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:04:28,345 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:04:28,346 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:04:28" (1/1) ... [2024-10-31 22:04:28,347 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6350c164 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:28, skipping insertion in model container [2024-10-31 22:04:28,350 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:04:28" (1/1) ... [2024-10-31 22:04:28,413 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:04:29,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:04:29,116 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:04:29,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:04:29,271 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:04:29,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:29 WrapperNode [2024-10-31 22:04:29,271 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:04:29,272 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:04:29,272 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:04:29,273 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:04:29,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:29" (1/1) ... [2024-10-31 22:04:29,301 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:29" (1/1) ... [2024-10-31 22:04:29,350 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 132 [2024-10-31 22:04:29,351 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:04:29,352 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:04:29,352 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:04:29,352 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:04:29,372 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:29" (1/1) ... [2024-10-31 22:04:29,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:29" (1/1) ... [2024-10-31 22:04:29,377 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:29" (1/1) ... [2024-10-31 22:04:29,397 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-31 22:04:29,397 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:29" (1/1) ... [2024-10-31 22:04:29,398 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:29" (1/1) ... [2024-10-31 22:04:29,417 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:29" (1/1) ... [2024-10-31 22:04:29,420 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:29" (1/1) ... [2024-10-31 22:04:29,427 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:29" (1/1) ... [2024-10-31 22:04:29,429 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:29" (1/1) ... [2024-10-31 22:04:29,436 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:04:29,438 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:04:29,438 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:04:29,438 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:04:29,439 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:29" (1/1) ... [2024-10-31 22:04:29,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:04:29,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e30d75e-2623-4761-a13b-79fb3e706e37/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:04:29,484 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e30d75e-2623-4761-a13b-79fb3e706e37/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:04:29,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e30d75e-2623-4761-a13b-79fb3e706e37/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:04:29,521 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-31 22:04:29,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:04:29,521 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-31 22:04:29,522 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-31 22:04:29,523 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-31 22:04:29,523 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-31 22:04:29,523 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-31 22:04:29,524 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-31 22:04:29,524 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-10-31 22:04:29,524 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-10-31 22:04:29,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:04:29,526 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-31 22:04:29,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:04:29,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:04:29,529 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-31 22:04:29,745 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:04:29,747 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:04:30,176 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-31 22:04:30,177 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:04:30,501 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:04:30,502 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-31 22:04:30,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:04:30 BoogieIcfgContainer [2024-10-31 22:04:30,502 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:04:30,504 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:04:30,505 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:04:30,508 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:04:30,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:04:28" (1/3) ... [2024-10-31 22:04:30,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69bd2c10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:04:30, skipping insertion in model container [2024-10-31 22:04:30,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:29" (2/3) ... [2024-10-31 22:04:30,511 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69bd2c10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:04:30, skipping insertion in model container [2024-10-31 22:04:30,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:04:30" (3/3) ... [2024-10-31 22:04:30,513 INFO L112 eAbstractionObserver]: Analyzing ICFG mix044_power.oepc_pso.oepc_rmo.oepc.i [2024-10-31 22:04:30,530 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:04:30,530 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-31 22:04:30,530 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-31 22:04:30,603 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-31 22:04:30,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 55 transitions, 126 flow [2024-10-31 22:04:30,694 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2024-10-31 22:04:30,695 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:04:30,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 51 events. 2/51 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 105 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2024-10-31 22:04:30,719 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 55 transitions, 126 flow [2024-10-31 22:04:30,728 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 51 transitions, 114 flow [2024-10-31 22:04:30,753 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:04:30,771 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@4c18f409, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:04:30,771 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-31 22:04:30,782 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-31 22:04:30,786 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-10-31 22:04:30,787 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:04:30,787 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:04:30,788 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-10-31 22:04:30,789 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-31 22:04:30,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:30,806 INFO L85 PathProgramCache]: Analyzing trace with hash 12835840, now seen corresponding path program 1 times [2024-10-31 22:04:30,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:30,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593818779] [2024-10-31 22:04:30,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:30,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:31,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:31,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:04:31,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:04:31,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593818779] [2024-10-31 22:04:31,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593818779] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:04:31,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:04:31,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-31 22:04:31,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228351111] [2024-10-31 22:04:31,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:04:31,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:04:31,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:04:31,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:04:31,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:04:31,440 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 55 [2024-10-31 22:04:31,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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) [2024-10-31 22:04:31,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:04:31,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 55 [2024-10-31 22:04:31,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:04:33,061 INFO L124 PetriNetUnfolderBase]: 3311/5215 cut-off events. [2024-10-31 22:04:33,062 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-10-31 22:04:33,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9895 conditions, 5215 events. 3311/5215 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 33357 event pairs, 2177 based on Foata normal form. 288/5459 useless extension candidates. Maximal degree in co-relation 9883. Up to 3661 conditions per place. [2024-10-31 22:04:33,116 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 41 selfloop transitions, 2 changer transitions 2/67 dead transitions. [2024-10-31 22:04:33,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 67 transitions, 245 flow [2024-10-31 22:04:33,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:04:33,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:04:33,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2024-10-31 22:04:33,131 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7757575757575758 [2024-10-31 22:04:33,133 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 128 transitions. [2024-10-31 22:04:33,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 67 transitions, 245 flow [2024-10-31 22:04:33,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 67 transitions, 238 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-31 22:04:33,143 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 104 flow [2024-10-31 22:04:33,145 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, 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=58, PETRI_TRANSITIONS=46} [2024-10-31 22:04:33,151 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2024-10-31 22:04:33,152 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 104 flow [2024-10-31 22:04:33,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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) [2024-10-31 22:04:33,152 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:04:33,153 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:04:33,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:04:33,153 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-31 22:04:33,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:33,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1230100567, now seen corresponding path program 1 times [2024-10-31 22:04:33,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:33,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329455372] [2024-10-31 22:04:33,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:33,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:33,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:33,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:04:33,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:04:33,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329455372] [2024-10-31 22:04:33,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329455372] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:04:33,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:04:33,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-31 22:04:33,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135399364] [2024-10-31 22:04:33,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:04:33,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:04:33,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:04:33,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:04:33,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:04:33,296 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 55 [2024-10-31 22:04:33,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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) [2024-10-31 22:04:33,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:04:33,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 55 [2024-10-31 22:04:33,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:04:34,465 INFO L124 PetriNetUnfolderBase]: 2903/4947 cut-off events. [2024-10-31 22:04:34,465 INFO L125 PetriNetUnfolderBase]: For 278/278 co-relation queries the response was YES. [2024-10-31 22:04:34,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9351 conditions, 4947 events. 2903/4947 cut-off events. For 278/278 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 34997 event pairs, 2903 based on Foata normal form. 144/4929 useless extension candidates. Maximal degree in co-relation 9341. Up to 4016 conditions per place. [2024-10-31 22:04:34,508 INFO L140 encePairwiseOnDemand]: 53/55 looper letters, 22 selfloop transitions, 1 changer transitions 1/45 dead transitions. [2024-10-31 22:04:34,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 45 transitions, 150 flow [2024-10-31 22:04:34,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:04:34,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:04:34,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2024-10-31 22:04:34,511 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2024-10-31 22:04:34,512 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 100 transitions. [2024-10-31 22:04:34,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 45 transitions, 150 flow [2024-10-31 22:04:34,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 45 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:04:34,514 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 98 flow [2024-10-31 22:04:34,514 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2024-10-31 22:04:34,515 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, -6 predicate places. [2024-10-31 22:04:34,516 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 98 flow [2024-10-31 22:04:34,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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) [2024-10-31 22:04:34,516 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:04:34,516 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:04:34,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:04:34,517 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-31 22:04:34,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:34,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1230101755, now seen corresponding path program 1 times [2024-10-31 22:04:34,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:34,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873417393] [2024-10-31 22:04:34,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:34,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:34,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:34,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:04:34,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:04:34,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873417393] [2024-10-31 22:04:34,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873417393] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:04:34,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:04:34,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:04:34,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829128764] [2024-10-31 22:04:34,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:04:34,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:04:34,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:04:34,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:04:34,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:04:34,984 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 55 [2024-10-31 22:04:34,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 98 flow. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 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) [2024-10-31 22:04:34,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:04:34,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 55 [2024-10-31 22:04:34,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:04:44,014 INFO L124 PetriNetUnfolderBase]: 37338/54099 cut-off events. [2024-10-31 22:04:44,014 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:04:44,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104562 conditions, 54099 events. 37338/54099 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2299. Compared 397949 event pairs, 8919 based on Foata normal form. 0/52662 useless extension candidates. Maximal degree in co-relation 104556. Up to 18479 conditions per place. [2024-10-31 22:04:44,310 INFO L140 encePairwiseOnDemand]: 43/55 looper letters, 47 selfloop transitions, 8 changer transitions 103/171 dead transitions. [2024-10-31 22:04:44,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 171 transitions, 672 flow [2024-10-31 22:04:44,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-31 22:04:44,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-31 22:04:44,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 322 transitions. [2024-10-31 22:04:44,313 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6505050505050505 [2024-10-31 22:04:44,313 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 98 flow. Second operand 9 states and 322 transitions. [2024-10-31 22:04:44,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 171 transitions, 672 flow [2024-10-31 22:04:44,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 171 transitions, 671 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 22:04:44,321 INFO L231 Difference]: Finished difference. Result has 70 places, 50 transitions, 207 flow [2024-10-31 22:04:44,323 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=207, PETRI_PLACES=70, PETRI_TRANSITIONS=50} [2024-10-31 22:04:44,324 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 8 predicate places. [2024-10-31 22:04:44,324 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 50 transitions, 207 flow [2024-10-31 22:04:44,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 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) [2024-10-31 22:04:44,325 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:04:44,325 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:04:44,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:04:44,325 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-31 22:04:44,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:44,326 INFO L85 PathProgramCache]: Analyzing trace with hash 2073826458, now seen corresponding path program 1 times [2024-10-31 22:04:44,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:44,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3336816] [2024-10-31 22:04:44,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:44,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:44,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:44,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:04:44,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:04:44,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3336816] [2024-10-31 22:04:44,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3336816] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:04:44,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:04:44,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:04:44,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541123284] [2024-10-31 22:04:44,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:04:44,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:04:44,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:04:44,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:04:44,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:04:44,585 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2024-10-31 22:04:44,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 50 transitions, 207 flow. Second operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 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) [2024-10-31 22:04:44,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:04:44,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2024-10-31 22:04:44,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:04:51,331 INFO L124 PetriNetUnfolderBase]: 19868/31489 cut-off events. [2024-10-31 22:04:51,332 INFO L125 PetriNetUnfolderBase]: For 33013/35058 co-relation queries the response was YES. [2024-10-31 22:04:51,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82051 conditions, 31489 events. 19868/31489 cut-off events. For 33013/35058 co-relation queries the response was YES. Maximal size of possible extension queue 1556. Compared 256644 event pairs, 5489 based on Foata normal form. 1244/31215 useless extension candidates. Maximal degree in co-relation 82036. Up to 16154 conditions per place. [2024-10-31 22:04:51,629 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 34 selfloop transitions, 3 changer transitions 43/103 dead transitions. [2024-10-31 22:04:51,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 103 transitions, 531 flow [2024-10-31 22:04:51,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 22:04:51,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-31 22:04:51,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 237 transitions. [2024-10-31 22:04:51,632 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6155844155844156 [2024-10-31 22:04:51,633 INFO L175 Difference]: Start difference. First operand has 70 places, 50 transitions, 207 flow. Second operand 7 states and 237 transitions. [2024-10-31 22:04:51,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 103 transitions, 531 flow [2024-10-31 22:04:51,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 103 transitions, 485 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-10-31 22:04:51,973 INFO L231 Difference]: Finished difference. Result has 70 places, 50 transitions, 196 flow [2024-10-31 22:04:51,973 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=196, PETRI_PLACES=70, PETRI_TRANSITIONS=50} [2024-10-31 22:04:51,975 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 8 predicate places. [2024-10-31 22:04:51,975 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 50 transitions, 196 flow [2024-10-31 22:04:51,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 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) [2024-10-31 22:04:51,976 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:04:51,976 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:04:51,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:04:51,977 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-31 22:04:51,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:51,978 INFO L85 PathProgramCache]: Analyzing trace with hash 309675321, now seen corresponding path program 1 times [2024-10-31 22:04:51,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:51,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620439875] [2024-10-31 22:04:51,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:51,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:52,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:04:52,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:04:52,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620439875] [2024-10-31 22:04:52,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620439875] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:04:52,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:04:52,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:04:52,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652562909] [2024-10-31 22:04:52,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:04:52,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:04:52,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:04:52,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:04:52,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:04:52,191 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 55 [2024-10-31 22:04:52,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 50 transitions, 196 flow. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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) [2024-10-31 22:04:52,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:04:52,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 55 [2024-10-31 22:04:52,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:04:53,875 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([436] L829-->L845: Formula: (let ((.cse10 (= (mod v_~b$r_buff1_thd4~0_62 256) 0)) (.cse2 (= (mod v_~b$r_buff0_thd4~0_64 256) 0))) (let ((.cse11 (= (mod v_~weak$$choice2~0_30 256) 0)) (.cse5 (not .cse2)) (.cse1 (and .cse10 .cse2)) (.cse8 (and .cse2 (= (mod v_~b$w_buff1_used~0_123 256) 0))) (.cse12 (= (mod v_~b$w_buff0_used~0_134 256) 0))) (let ((.cse6 (or .cse1 .cse8 .cse12)) (.cse7 (and .cse5 (not .cse12))) (.cse0 (not .cse11)) (.cse3 (= 0 (mod v_~b$w_buff1_used~0_122 256))) (.cse4 (= (mod v_~b$w_buff0_used~0_133 256) 0))) (and (= (ite (= (mod (ite .cse0 v_~b$r_buff0_thd4~0_64 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~b$r_buff0_thd4~0_64 (ite (and (not .cse4) .cse5) 0 v_~b$r_buff0_thd4~0_64))) 256) 0) 0 1) v_~b$r_buff0_thd4~0_63) (= v_~__unbuffered_p3_EBX~0_16 (ite .cse6 v_~b~0_69 (ite .cse7 v_~b$w_buff0~0_47 v_~b$w_buff1~0_38))) (= v_~b$w_buff0~0_47 v_~b$w_buff0~0_46) (or (= |v_P3_#t~nondet4_29| 1) (= |v_P3_#t~nondet4_29| 0)) (= (ite (= (mod |v_P3_#t~nondet4_29| 256) 0) 0 1) v_~weak$$choice2~0_30) (or (= |v_P3_#t~nondet3_29| 1) (= |v_P3_#t~nondet3_29| 0)) (= v_~b$w_buff0_used~0_133 (ite (= (mod (ite .cse0 v_~b$w_buff0_used~0_134 (ite .cse6 v_~b$w_buff0_used~0_134 (ite .cse7 0 v_~b$w_buff0_used~0_134))) 256) 0) 0 1)) (= (ite (= (mod |v_P3_#t~nondet3_29| 256) 0) 0 1) v_~weak$$choice0~0_7) (= (ite (= (mod (ite .cse0 v_~b$w_buff1_used~0_123 (ite (or .cse1 .cse8 .cse4) v_~b$w_buff1_used~0_123 0)) 256) 0) 0 1) v_~b$w_buff1_used~0_122) (= v_~b$flush_delayed~0_31 0) (= v_~b$r_buff1_thd4~0_61 (ite (= (mod (ite .cse0 v_~b$r_buff1_thd4~0_62 (ite (let ((.cse9 (= (mod v_~b$r_buff0_thd4~0_63 256) 0))) (or (and .cse3 .cse9) (and .cse10 .cse9) .cse4)) v_~b$r_buff1_thd4~0_62 0)) 256) 0) 0 1)) (= v_~b~0_68 (ite (not (= (mod (ite .cse11 0 1) 256) 0)) v_~b$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_16)) (= v_~b$w_buff1~0_38 v_~b$w_buff1~0_37) (= v_~b$mem_tmp~0_18 v_~b~0_69))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_134, ~b~0=v_~b~0_69, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_123, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_62, ~b$w_buff1~0=v_~b$w_buff1~0_38, ~b$w_buff0~0=v_~b$w_buff0~0_47, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_64} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_31, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_133, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~b~0=v_~b~0_68, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_122, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_61, ~b$w_buff1~0=v_~b$w_buff1~0_37, ~b$w_buff0~0=v_~b$w_buff0~0_46, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_63, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} AuxVars[|v_P3_#t~nondet3_29|, |v_P3_#t~nondet4_29|] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][59], [30#L806true, 33#L793true, 14#L877true, 63#true, Black: 106#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 99#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 104#(and (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 102#(and (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 98#(= ~__unbuffered_p3_EAX~0 0), 5#L773true, 65#true, 112#true, 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 61#true, 67#true, 96#true, Black: 83#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 13#L845true, Black: 85#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 78#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 81#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= (mod ~main$tmp_guard1~0 256) 0)))]) [2024-10-31 22:04:53,875 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-10-31 22:04:53,875 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-31 22:04:53,875 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-31 22:04:53,875 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-31 22:04:54,460 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([436] L829-->L845: Formula: (let ((.cse10 (= (mod v_~b$r_buff1_thd4~0_62 256) 0)) (.cse2 (= (mod v_~b$r_buff0_thd4~0_64 256) 0))) (let ((.cse11 (= (mod v_~weak$$choice2~0_30 256) 0)) (.cse5 (not .cse2)) (.cse1 (and .cse10 .cse2)) (.cse8 (and .cse2 (= (mod v_~b$w_buff1_used~0_123 256) 0))) (.cse12 (= (mod v_~b$w_buff0_used~0_134 256) 0))) (let ((.cse6 (or .cse1 .cse8 .cse12)) (.cse7 (and .cse5 (not .cse12))) (.cse0 (not .cse11)) (.cse3 (= 0 (mod v_~b$w_buff1_used~0_122 256))) (.cse4 (= (mod v_~b$w_buff0_used~0_133 256) 0))) (and (= (ite (= (mod (ite .cse0 v_~b$r_buff0_thd4~0_64 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~b$r_buff0_thd4~0_64 (ite (and (not .cse4) .cse5) 0 v_~b$r_buff0_thd4~0_64))) 256) 0) 0 1) v_~b$r_buff0_thd4~0_63) (= v_~__unbuffered_p3_EBX~0_16 (ite .cse6 v_~b~0_69 (ite .cse7 v_~b$w_buff0~0_47 v_~b$w_buff1~0_38))) (= v_~b$w_buff0~0_47 v_~b$w_buff0~0_46) (or (= |v_P3_#t~nondet4_29| 1) (= |v_P3_#t~nondet4_29| 0)) (= (ite (= (mod |v_P3_#t~nondet4_29| 256) 0) 0 1) v_~weak$$choice2~0_30) (or (= |v_P3_#t~nondet3_29| 1) (= |v_P3_#t~nondet3_29| 0)) (= v_~b$w_buff0_used~0_133 (ite (= (mod (ite .cse0 v_~b$w_buff0_used~0_134 (ite .cse6 v_~b$w_buff0_used~0_134 (ite .cse7 0 v_~b$w_buff0_used~0_134))) 256) 0) 0 1)) (= (ite (= (mod |v_P3_#t~nondet3_29| 256) 0) 0 1) v_~weak$$choice0~0_7) (= (ite (= (mod (ite .cse0 v_~b$w_buff1_used~0_123 (ite (or .cse1 .cse8 .cse4) v_~b$w_buff1_used~0_123 0)) 256) 0) 0 1) v_~b$w_buff1_used~0_122) (= v_~b$flush_delayed~0_31 0) (= v_~b$r_buff1_thd4~0_61 (ite (= (mod (ite .cse0 v_~b$r_buff1_thd4~0_62 (ite (let ((.cse9 (= (mod v_~b$r_buff0_thd4~0_63 256) 0))) (or (and .cse3 .cse9) (and .cse10 .cse9) .cse4)) v_~b$r_buff1_thd4~0_62 0)) 256) 0) 0 1)) (= v_~b~0_68 (ite (not (= (mod (ite .cse11 0 1) 256) 0)) v_~b$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_16)) (= v_~b$w_buff1~0_38 v_~b$w_buff1~0_37) (= v_~b$mem_tmp~0_18 v_~b~0_69))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_134, ~b~0=v_~b~0_69, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_123, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_62, ~b$w_buff1~0=v_~b$w_buff1~0_38, ~b$w_buff0~0=v_~b$w_buff0~0_47, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_64} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_31, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_133, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~b~0=v_~b~0_68, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_122, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_61, ~b$w_buff1~0=v_~b$w_buff1~0_37, ~b$w_buff0~0=v_~b$w_buff0~0_46, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_63, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} AuxVars[|v_P3_#t~nondet3_29|, |v_P3_#t~nondet4_29|] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][59], [30#L806true, 33#L793true, 14#L877true, 63#true, Black: 106#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 99#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 104#(and (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 102#(and (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 98#(= ~__unbuffered_p3_EAX~0 0), 65#true, 40#P0EXITtrue, 112#true, 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 61#true, 96#true, 67#true, Black: 83#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 13#L845true, Black: 85#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 78#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 81#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= (mod ~main$tmp_guard1~0 256) 0)))]) [2024-10-31 22:04:54,460 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-10-31 22:04:54,460 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-31 22:04:54,460 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-31 22:04:54,460 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-31 22:04:54,495 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([436] L829-->L845: Formula: (let ((.cse10 (= (mod v_~b$r_buff1_thd4~0_62 256) 0)) (.cse2 (= (mod v_~b$r_buff0_thd4~0_64 256) 0))) (let ((.cse11 (= (mod v_~weak$$choice2~0_30 256) 0)) (.cse5 (not .cse2)) (.cse1 (and .cse10 .cse2)) (.cse8 (and .cse2 (= (mod v_~b$w_buff1_used~0_123 256) 0))) (.cse12 (= (mod v_~b$w_buff0_used~0_134 256) 0))) (let ((.cse6 (or .cse1 .cse8 .cse12)) (.cse7 (and .cse5 (not .cse12))) (.cse0 (not .cse11)) (.cse3 (= 0 (mod v_~b$w_buff1_used~0_122 256))) (.cse4 (= (mod v_~b$w_buff0_used~0_133 256) 0))) (and (= (ite (= (mod (ite .cse0 v_~b$r_buff0_thd4~0_64 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~b$r_buff0_thd4~0_64 (ite (and (not .cse4) .cse5) 0 v_~b$r_buff0_thd4~0_64))) 256) 0) 0 1) v_~b$r_buff0_thd4~0_63) (= v_~__unbuffered_p3_EBX~0_16 (ite .cse6 v_~b~0_69 (ite .cse7 v_~b$w_buff0~0_47 v_~b$w_buff1~0_38))) (= v_~b$w_buff0~0_47 v_~b$w_buff0~0_46) (or (= |v_P3_#t~nondet4_29| 1) (= |v_P3_#t~nondet4_29| 0)) (= (ite (= (mod |v_P3_#t~nondet4_29| 256) 0) 0 1) v_~weak$$choice2~0_30) (or (= |v_P3_#t~nondet3_29| 1) (= |v_P3_#t~nondet3_29| 0)) (= v_~b$w_buff0_used~0_133 (ite (= (mod (ite .cse0 v_~b$w_buff0_used~0_134 (ite .cse6 v_~b$w_buff0_used~0_134 (ite .cse7 0 v_~b$w_buff0_used~0_134))) 256) 0) 0 1)) (= (ite (= (mod |v_P3_#t~nondet3_29| 256) 0) 0 1) v_~weak$$choice0~0_7) (= (ite (= (mod (ite .cse0 v_~b$w_buff1_used~0_123 (ite (or .cse1 .cse8 .cse4) v_~b$w_buff1_used~0_123 0)) 256) 0) 0 1) v_~b$w_buff1_used~0_122) (= v_~b$flush_delayed~0_31 0) (= v_~b$r_buff1_thd4~0_61 (ite (= (mod (ite .cse0 v_~b$r_buff1_thd4~0_62 (ite (let ((.cse9 (= (mod v_~b$r_buff0_thd4~0_63 256) 0))) (or (and .cse3 .cse9) (and .cse10 .cse9) .cse4)) v_~b$r_buff1_thd4~0_62 0)) 256) 0) 0 1)) (= v_~b~0_68 (ite (not (= (mod (ite .cse11 0 1) 256) 0)) v_~b$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_16)) (= v_~b$w_buff1~0_38 v_~b$w_buff1~0_37) (= v_~b$mem_tmp~0_18 v_~b~0_69))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_134, ~b~0=v_~b~0_69, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_123, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_62, ~b$w_buff1~0=v_~b$w_buff1~0_38, ~b$w_buff0~0=v_~b$w_buff0~0_47, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_64} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_31, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_133, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~b~0=v_~b~0_68, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_122, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_61, ~b$w_buff1~0=v_~b$w_buff1~0_37, ~b$w_buff0~0=v_~b$w_buff0~0_46, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_63, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} AuxVars[|v_P3_#t~nondet3_29|, |v_P3_#t~nondet4_29|] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][59], [30#L806true, 14#L877true, 63#true, Black: 106#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 99#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 104#(and (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 102#(and (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 98#(= ~__unbuffered_p3_EAX~0 0), 65#true, 5#L773true, 112#true, 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 61#true, 96#true, 67#true, Black: 83#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 13#L845true, Black: 85#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 78#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 23#P1EXITtrue, Black: 81#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= (mod ~main$tmp_guard1~0 256) 0)))]) [2024-10-31 22:04:54,496 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-10-31 22:04:54,496 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-31 22:04:54,496 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-31 22:04:54,496 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-31 22:04:54,506 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([436] L829-->L845: Formula: (let ((.cse10 (= (mod v_~b$r_buff1_thd4~0_62 256) 0)) (.cse2 (= (mod v_~b$r_buff0_thd4~0_64 256) 0))) (let ((.cse11 (= (mod v_~weak$$choice2~0_30 256) 0)) (.cse5 (not .cse2)) (.cse1 (and .cse10 .cse2)) (.cse8 (and .cse2 (= (mod v_~b$w_buff1_used~0_123 256) 0))) (.cse12 (= (mod v_~b$w_buff0_used~0_134 256) 0))) (let ((.cse6 (or .cse1 .cse8 .cse12)) (.cse7 (and .cse5 (not .cse12))) (.cse0 (not .cse11)) (.cse3 (= 0 (mod v_~b$w_buff1_used~0_122 256))) (.cse4 (= (mod v_~b$w_buff0_used~0_133 256) 0))) (and (= (ite (= (mod (ite .cse0 v_~b$r_buff0_thd4~0_64 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~b$r_buff0_thd4~0_64 (ite (and (not .cse4) .cse5) 0 v_~b$r_buff0_thd4~0_64))) 256) 0) 0 1) v_~b$r_buff0_thd4~0_63) (= v_~__unbuffered_p3_EBX~0_16 (ite .cse6 v_~b~0_69 (ite .cse7 v_~b$w_buff0~0_47 v_~b$w_buff1~0_38))) (= v_~b$w_buff0~0_47 v_~b$w_buff0~0_46) (or (= |v_P3_#t~nondet4_29| 1) (= |v_P3_#t~nondet4_29| 0)) (= (ite (= (mod |v_P3_#t~nondet4_29| 256) 0) 0 1) v_~weak$$choice2~0_30) (or (= |v_P3_#t~nondet3_29| 1) (= |v_P3_#t~nondet3_29| 0)) (= v_~b$w_buff0_used~0_133 (ite (= (mod (ite .cse0 v_~b$w_buff0_used~0_134 (ite .cse6 v_~b$w_buff0_used~0_134 (ite .cse7 0 v_~b$w_buff0_used~0_134))) 256) 0) 0 1)) (= (ite (= (mod |v_P3_#t~nondet3_29| 256) 0) 0 1) v_~weak$$choice0~0_7) (= (ite (= (mod (ite .cse0 v_~b$w_buff1_used~0_123 (ite (or .cse1 .cse8 .cse4) v_~b$w_buff1_used~0_123 0)) 256) 0) 0 1) v_~b$w_buff1_used~0_122) (= v_~b$flush_delayed~0_31 0) (= v_~b$r_buff1_thd4~0_61 (ite (= (mod (ite .cse0 v_~b$r_buff1_thd4~0_62 (ite (let ((.cse9 (= (mod v_~b$r_buff0_thd4~0_63 256) 0))) (or (and .cse3 .cse9) (and .cse10 .cse9) .cse4)) v_~b$r_buff1_thd4~0_62 0)) 256) 0) 0 1)) (= v_~b~0_68 (ite (not (= (mod (ite .cse11 0 1) 256) 0)) v_~b$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_16)) (= v_~b$w_buff1~0_38 v_~b$w_buff1~0_37) (= v_~b$mem_tmp~0_18 v_~b~0_69))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_134, ~b~0=v_~b~0_69, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_123, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_62, ~b$w_buff1~0=v_~b$w_buff1~0_38, ~b$w_buff0~0=v_~b$w_buff0~0_47, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_64} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_31, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_133, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~b~0=v_~b~0_68, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_122, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_61, ~b$w_buff1~0=v_~b$w_buff1~0_37, ~b$w_buff0~0=v_~b$w_buff0~0_46, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_63, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} AuxVars[|v_P3_#t~nondet3_29|, |v_P3_#t~nondet4_29|] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][59], [30#L806true, 33#L793true, 63#true, Black: 106#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 99#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 104#(and (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 102#(and (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 98#(= ~__unbuffered_p3_EAX~0 0), 5#L773true, 65#true, 112#true, 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 61#true, 96#true, 67#true, 35#L881true, Black: 83#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 13#L845true, Black: 85#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 78#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 81#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= (mod ~main$tmp_guard1~0 256) 0)))]) [2024-10-31 22:04:54,506 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-10-31 22:04:54,506 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-31 22:04:54,506 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-31 22:04:54,507 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-31 22:04:54,875 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([436] L829-->L845: Formula: (let ((.cse10 (= (mod v_~b$r_buff1_thd4~0_62 256) 0)) (.cse2 (= (mod v_~b$r_buff0_thd4~0_64 256) 0))) (let ((.cse11 (= (mod v_~weak$$choice2~0_30 256) 0)) (.cse5 (not .cse2)) (.cse1 (and .cse10 .cse2)) (.cse8 (and .cse2 (= (mod v_~b$w_buff1_used~0_123 256) 0))) (.cse12 (= (mod v_~b$w_buff0_used~0_134 256) 0))) (let ((.cse6 (or .cse1 .cse8 .cse12)) (.cse7 (and .cse5 (not .cse12))) (.cse0 (not .cse11)) (.cse3 (= 0 (mod v_~b$w_buff1_used~0_122 256))) (.cse4 (= (mod v_~b$w_buff0_used~0_133 256) 0))) (and (= (ite (= (mod (ite .cse0 v_~b$r_buff0_thd4~0_64 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~b$r_buff0_thd4~0_64 (ite (and (not .cse4) .cse5) 0 v_~b$r_buff0_thd4~0_64))) 256) 0) 0 1) v_~b$r_buff0_thd4~0_63) (= v_~__unbuffered_p3_EBX~0_16 (ite .cse6 v_~b~0_69 (ite .cse7 v_~b$w_buff0~0_47 v_~b$w_buff1~0_38))) (= v_~b$w_buff0~0_47 v_~b$w_buff0~0_46) (or (= |v_P3_#t~nondet4_29| 1) (= |v_P3_#t~nondet4_29| 0)) (= (ite (= (mod |v_P3_#t~nondet4_29| 256) 0) 0 1) v_~weak$$choice2~0_30) (or (= |v_P3_#t~nondet3_29| 1) (= |v_P3_#t~nondet3_29| 0)) (= v_~b$w_buff0_used~0_133 (ite (= (mod (ite .cse0 v_~b$w_buff0_used~0_134 (ite .cse6 v_~b$w_buff0_used~0_134 (ite .cse7 0 v_~b$w_buff0_used~0_134))) 256) 0) 0 1)) (= (ite (= (mod |v_P3_#t~nondet3_29| 256) 0) 0 1) v_~weak$$choice0~0_7) (= (ite (= (mod (ite .cse0 v_~b$w_buff1_used~0_123 (ite (or .cse1 .cse8 .cse4) v_~b$w_buff1_used~0_123 0)) 256) 0) 0 1) v_~b$w_buff1_used~0_122) (= v_~b$flush_delayed~0_31 0) (= v_~b$r_buff1_thd4~0_61 (ite (= (mod (ite .cse0 v_~b$r_buff1_thd4~0_62 (ite (let ((.cse9 (= (mod v_~b$r_buff0_thd4~0_63 256) 0))) (or (and .cse3 .cse9) (and .cse10 .cse9) .cse4)) v_~b$r_buff1_thd4~0_62 0)) 256) 0) 0 1)) (= v_~b~0_68 (ite (not (= (mod (ite .cse11 0 1) 256) 0)) v_~b$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_16)) (= v_~b$w_buff1~0_38 v_~b$w_buff1~0_37) (= v_~b$mem_tmp~0_18 v_~b~0_69))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_134, ~b~0=v_~b~0_69, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_123, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_62, ~b$w_buff1~0=v_~b$w_buff1~0_38, ~b$w_buff0~0=v_~b$w_buff0~0_47, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_64} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_31, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_133, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~b~0=v_~b~0_68, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_122, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_61, ~b$w_buff1~0=v_~b$w_buff1~0_37, ~b$w_buff0~0=v_~b$w_buff0~0_46, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_63, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} AuxVars[|v_P3_#t~nondet3_29|, |v_P3_#t~nondet4_29|] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][59], [30#L806true, 33#L793true, 63#true, 53#L887true, Black: 106#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 99#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 104#(and (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 102#(and (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 98#(= ~__unbuffered_p3_EAX~0 0), 65#true, 5#L773true, 112#true, 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 61#true, 96#true, 67#true, Black: 83#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 85#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 13#L845true, Black: 78#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 81#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= (mod ~main$tmp_guard1~0 256) 0)))]) [2024-10-31 22:04:54,875 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-10-31 22:04:54,875 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-31 22:04:54,875 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-31 22:04:54,876 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-31 22:04:54,877 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L887-->L890: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= 2 v_~z~0_4) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~z~0=v_~z~0_4, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~z~0=v_~z~0_4, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][70], [30#L806true, 33#L793true, 63#true, Black: 106#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 99#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 104#(and (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 102#(and (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 98#(= ~__unbuffered_p3_EAX~0 0), 65#true, 5#L773true, 112#true, 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 61#true, 49#L890true, 96#true, 67#true, 7#L829true, Black: 83#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 85#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 78#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 81#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= (mod ~main$tmp_guard1~0 256) 0)))]) [2024-10-31 22:04:54,877 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-10-31 22:04:54,877 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-31 22:04:54,877 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-31 22:04:54,877 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-31 22:04:55,114 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([436] L829-->L845: Formula: (let ((.cse10 (= (mod v_~b$r_buff1_thd4~0_62 256) 0)) (.cse2 (= (mod v_~b$r_buff0_thd4~0_64 256) 0))) (let ((.cse11 (= (mod v_~weak$$choice2~0_30 256) 0)) (.cse5 (not .cse2)) (.cse1 (and .cse10 .cse2)) (.cse8 (and .cse2 (= (mod v_~b$w_buff1_used~0_123 256) 0))) (.cse12 (= (mod v_~b$w_buff0_used~0_134 256) 0))) (let ((.cse6 (or .cse1 .cse8 .cse12)) (.cse7 (and .cse5 (not .cse12))) (.cse0 (not .cse11)) (.cse3 (= 0 (mod v_~b$w_buff1_used~0_122 256))) (.cse4 (= (mod v_~b$w_buff0_used~0_133 256) 0))) (and (= (ite (= (mod (ite .cse0 v_~b$r_buff0_thd4~0_64 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~b$r_buff0_thd4~0_64 (ite (and (not .cse4) .cse5) 0 v_~b$r_buff0_thd4~0_64))) 256) 0) 0 1) v_~b$r_buff0_thd4~0_63) (= v_~__unbuffered_p3_EBX~0_16 (ite .cse6 v_~b~0_69 (ite .cse7 v_~b$w_buff0~0_47 v_~b$w_buff1~0_38))) (= v_~b$w_buff0~0_47 v_~b$w_buff0~0_46) (or (= |v_P3_#t~nondet4_29| 1) (= |v_P3_#t~nondet4_29| 0)) (= (ite (= (mod |v_P3_#t~nondet4_29| 256) 0) 0 1) v_~weak$$choice2~0_30) (or (= |v_P3_#t~nondet3_29| 1) (= |v_P3_#t~nondet3_29| 0)) (= v_~b$w_buff0_used~0_133 (ite (= (mod (ite .cse0 v_~b$w_buff0_used~0_134 (ite .cse6 v_~b$w_buff0_used~0_134 (ite .cse7 0 v_~b$w_buff0_used~0_134))) 256) 0) 0 1)) (= (ite (= (mod |v_P3_#t~nondet3_29| 256) 0) 0 1) v_~weak$$choice0~0_7) (= (ite (= (mod (ite .cse0 v_~b$w_buff1_used~0_123 (ite (or .cse1 .cse8 .cse4) v_~b$w_buff1_used~0_123 0)) 256) 0) 0 1) v_~b$w_buff1_used~0_122) (= v_~b$flush_delayed~0_31 0) (= v_~b$r_buff1_thd4~0_61 (ite (= (mod (ite .cse0 v_~b$r_buff1_thd4~0_62 (ite (let ((.cse9 (= (mod v_~b$r_buff0_thd4~0_63 256) 0))) (or (and .cse3 .cse9) (and .cse10 .cse9) .cse4)) v_~b$r_buff1_thd4~0_62 0)) 256) 0) 0 1)) (= v_~b~0_68 (ite (not (= (mod (ite .cse11 0 1) 256) 0)) v_~b$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_16)) (= v_~b$w_buff1~0_38 v_~b$w_buff1~0_37) (= v_~b$mem_tmp~0_18 v_~b~0_69))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_134, ~b~0=v_~b~0_69, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_123, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_62, ~b$w_buff1~0=v_~b$w_buff1~0_38, ~b$w_buff0~0=v_~b$w_buff0~0_47, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_64} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_31, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_133, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~b~0=v_~b~0_68, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_122, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_61, ~b$w_buff1~0=v_~b$w_buff1~0_37, ~b$w_buff0~0=v_~b$w_buff0~0_46, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_63, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} AuxVars[|v_P3_#t~nondet3_29|, |v_P3_#t~nondet4_29|] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][59], [30#L806true, 14#L877true, 63#true, Black: 106#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 99#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 104#(and (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 102#(and (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 98#(= ~__unbuffered_p3_EAX~0 0), 65#true, 40#P0EXITtrue, 112#true, 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 61#true, 96#true, 67#true, Black: 83#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 13#L845true, Black: 85#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 78#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 23#P1EXITtrue, Black: 81#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= (mod ~main$tmp_guard1~0 256) 0)))]) [2024-10-31 22:04:55,114 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-10-31 22:04:55,114 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-31 22:04:55,115 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-31 22:04:55,115 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-31 22:04:55,118 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([436] L829-->L845: Formula: (let ((.cse10 (= (mod v_~b$r_buff1_thd4~0_62 256) 0)) (.cse2 (= (mod v_~b$r_buff0_thd4~0_64 256) 0))) (let ((.cse11 (= (mod v_~weak$$choice2~0_30 256) 0)) (.cse5 (not .cse2)) (.cse1 (and .cse10 .cse2)) (.cse8 (and .cse2 (= (mod v_~b$w_buff1_used~0_123 256) 0))) (.cse12 (= (mod v_~b$w_buff0_used~0_134 256) 0))) (let ((.cse6 (or .cse1 .cse8 .cse12)) (.cse7 (and .cse5 (not .cse12))) (.cse0 (not .cse11)) (.cse3 (= 0 (mod v_~b$w_buff1_used~0_122 256))) (.cse4 (= (mod v_~b$w_buff0_used~0_133 256) 0))) (and (= (ite (= (mod (ite .cse0 v_~b$r_buff0_thd4~0_64 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~b$r_buff0_thd4~0_64 (ite (and (not .cse4) .cse5) 0 v_~b$r_buff0_thd4~0_64))) 256) 0) 0 1) v_~b$r_buff0_thd4~0_63) (= v_~__unbuffered_p3_EBX~0_16 (ite .cse6 v_~b~0_69 (ite .cse7 v_~b$w_buff0~0_47 v_~b$w_buff1~0_38))) (= v_~b$w_buff0~0_47 v_~b$w_buff0~0_46) (or (= |v_P3_#t~nondet4_29| 1) (= |v_P3_#t~nondet4_29| 0)) (= (ite (= (mod |v_P3_#t~nondet4_29| 256) 0) 0 1) v_~weak$$choice2~0_30) (or (= |v_P3_#t~nondet3_29| 1) (= |v_P3_#t~nondet3_29| 0)) (= v_~b$w_buff0_used~0_133 (ite (= (mod (ite .cse0 v_~b$w_buff0_used~0_134 (ite .cse6 v_~b$w_buff0_used~0_134 (ite .cse7 0 v_~b$w_buff0_used~0_134))) 256) 0) 0 1)) (= (ite (= (mod |v_P3_#t~nondet3_29| 256) 0) 0 1) v_~weak$$choice0~0_7) (= (ite (= (mod (ite .cse0 v_~b$w_buff1_used~0_123 (ite (or .cse1 .cse8 .cse4) v_~b$w_buff1_used~0_123 0)) 256) 0) 0 1) v_~b$w_buff1_used~0_122) (= v_~b$flush_delayed~0_31 0) (= v_~b$r_buff1_thd4~0_61 (ite (= (mod (ite .cse0 v_~b$r_buff1_thd4~0_62 (ite (let ((.cse9 (= (mod v_~b$r_buff0_thd4~0_63 256) 0))) (or (and .cse3 .cse9) (and .cse10 .cse9) .cse4)) v_~b$r_buff1_thd4~0_62 0)) 256) 0) 0 1)) (= v_~b~0_68 (ite (not (= (mod (ite .cse11 0 1) 256) 0)) v_~b$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_16)) (= v_~b$w_buff1~0_38 v_~b$w_buff1~0_37) (= v_~b$mem_tmp~0_18 v_~b~0_69))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_134, ~b~0=v_~b~0_69, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_123, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_62, ~b$w_buff1~0=v_~b$w_buff1~0_38, ~b$w_buff0~0=v_~b$w_buff0~0_47, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_64} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_31, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_133, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~b~0=v_~b~0_68, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_122, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_61, ~b$w_buff1~0=v_~b$w_buff1~0_37, ~b$w_buff0~0=v_~b$w_buff0~0_46, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_63, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} AuxVars[|v_P3_#t~nondet3_29|, |v_P3_#t~nondet4_29|] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][59], [30#L806true, 33#L793true, 63#true, Black: 106#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 99#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 104#(and (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 102#(and (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 98#(= ~__unbuffered_p3_EAX~0 0), 65#true, 40#P0EXITtrue, 112#true, 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 61#true, 96#true, 67#true, 35#L881true, Black: 83#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 13#L845true, Black: 85#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 78#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 81#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= (mod ~main$tmp_guard1~0 256) 0)))]) [2024-10-31 22:04:55,118 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-10-31 22:04:55,119 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-31 22:04:55,119 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-31 22:04:55,119 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-31 22:04:55,325 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([436] L829-->L845: Formula: (let ((.cse10 (= (mod v_~b$r_buff1_thd4~0_62 256) 0)) (.cse2 (= (mod v_~b$r_buff0_thd4~0_64 256) 0))) (let ((.cse11 (= (mod v_~weak$$choice2~0_30 256) 0)) (.cse5 (not .cse2)) (.cse1 (and .cse10 .cse2)) (.cse8 (and .cse2 (= (mod v_~b$w_buff1_used~0_123 256) 0))) (.cse12 (= (mod v_~b$w_buff0_used~0_134 256) 0))) (let ((.cse6 (or .cse1 .cse8 .cse12)) (.cse7 (and .cse5 (not .cse12))) (.cse0 (not .cse11)) (.cse3 (= 0 (mod v_~b$w_buff1_used~0_122 256))) (.cse4 (= (mod v_~b$w_buff0_used~0_133 256) 0))) (and (= (ite (= (mod (ite .cse0 v_~b$r_buff0_thd4~0_64 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~b$r_buff0_thd4~0_64 (ite (and (not .cse4) .cse5) 0 v_~b$r_buff0_thd4~0_64))) 256) 0) 0 1) v_~b$r_buff0_thd4~0_63) (= v_~__unbuffered_p3_EBX~0_16 (ite .cse6 v_~b~0_69 (ite .cse7 v_~b$w_buff0~0_47 v_~b$w_buff1~0_38))) (= v_~b$w_buff0~0_47 v_~b$w_buff0~0_46) (or (= |v_P3_#t~nondet4_29| 1) (= |v_P3_#t~nondet4_29| 0)) (= (ite (= (mod |v_P3_#t~nondet4_29| 256) 0) 0 1) v_~weak$$choice2~0_30) (or (= |v_P3_#t~nondet3_29| 1) (= |v_P3_#t~nondet3_29| 0)) (= v_~b$w_buff0_used~0_133 (ite (= (mod (ite .cse0 v_~b$w_buff0_used~0_134 (ite .cse6 v_~b$w_buff0_used~0_134 (ite .cse7 0 v_~b$w_buff0_used~0_134))) 256) 0) 0 1)) (= (ite (= (mod |v_P3_#t~nondet3_29| 256) 0) 0 1) v_~weak$$choice0~0_7) (= (ite (= (mod (ite .cse0 v_~b$w_buff1_used~0_123 (ite (or .cse1 .cse8 .cse4) v_~b$w_buff1_used~0_123 0)) 256) 0) 0 1) v_~b$w_buff1_used~0_122) (= v_~b$flush_delayed~0_31 0) (= v_~b$r_buff1_thd4~0_61 (ite (= (mod (ite .cse0 v_~b$r_buff1_thd4~0_62 (ite (let ((.cse9 (= (mod v_~b$r_buff0_thd4~0_63 256) 0))) (or (and .cse3 .cse9) (and .cse10 .cse9) .cse4)) v_~b$r_buff1_thd4~0_62 0)) 256) 0) 0 1)) (= v_~b~0_68 (ite (not (= (mod (ite .cse11 0 1) 256) 0)) v_~b$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_16)) (= v_~b$w_buff1~0_38 v_~b$w_buff1~0_37) (= v_~b$mem_tmp~0_18 v_~b~0_69))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_134, ~b~0=v_~b~0_69, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_123, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_62, ~b$w_buff1~0=v_~b$w_buff1~0_38, ~b$w_buff0~0=v_~b$w_buff0~0_47, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_64} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_31, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_133, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~b~0=v_~b~0_68, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_122, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_61, ~b$w_buff1~0=v_~b$w_buff1~0_37, ~b$w_buff0~0=v_~b$w_buff0~0_46, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_63, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} AuxVars[|v_P3_#t~nondet3_29|, |v_P3_#t~nondet4_29|] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][59], [30#L806true, 63#true, Black: 106#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 99#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 104#(and (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 102#(and (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 98#(= ~__unbuffered_p3_EAX~0 0), 65#true, 5#L773true, 112#true, 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 61#true, 96#true, 67#true, 35#L881true, Black: 83#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 13#L845true, Black: 85#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 78#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 23#P1EXITtrue, Black: 81#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= (mod ~main$tmp_guard1~0 256) 0)))]) [2024-10-31 22:04:55,325 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-10-31 22:04:55,326 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-31 22:04:55,327 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-31 22:04:55,327 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-31 22:04:55,696 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([436] L829-->L845: Formula: (let ((.cse10 (= (mod v_~b$r_buff1_thd4~0_62 256) 0)) (.cse2 (= (mod v_~b$r_buff0_thd4~0_64 256) 0))) (let ((.cse11 (= (mod v_~weak$$choice2~0_30 256) 0)) (.cse5 (not .cse2)) (.cse1 (and .cse10 .cse2)) (.cse8 (and .cse2 (= (mod v_~b$w_buff1_used~0_123 256) 0))) (.cse12 (= (mod v_~b$w_buff0_used~0_134 256) 0))) (let ((.cse6 (or .cse1 .cse8 .cse12)) (.cse7 (and .cse5 (not .cse12))) (.cse0 (not .cse11)) (.cse3 (= 0 (mod v_~b$w_buff1_used~0_122 256))) (.cse4 (= (mod v_~b$w_buff0_used~0_133 256) 0))) (and (= (ite (= (mod (ite .cse0 v_~b$r_buff0_thd4~0_64 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~b$r_buff0_thd4~0_64 (ite (and (not .cse4) .cse5) 0 v_~b$r_buff0_thd4~0_64))) 256) 0) 0 1) v_~b$r_buff0_thd4~0_63) (= v_~__unbuffered_p3_EBX~0_16 (ite .cse6 v_~b~0_69 (ite .cse7 v_~b$w_buff0~0_47 v_~b$w_buff1~0_38))) (= v_~b$w_buff0~0_47 v_~b$w_buff0~0_46) (or (= |v_P3_#t~nondet4_29| 1) (= |v_P3_#t~nondet4_29| 0)) (= (ite (= (mod |v_P3_#t~nondet4_29| 256) 0) 0 1) v_~weak$$choice2~0_30) (or (= |v_P3_#t~nondet3_29| 1) (= |v_P3_#t~nondet3_29| 0)) (= v_~b$w_buff0_used~0_133 (ite (= (mod (ite .cse0 v_~b$w_buff0_used~0_134 (ite .cse6 v_~b$w_buff0_used~0_134 (ite .cse7 0 v_~b$w_buff0_used~0_134))) 256) 0) 0 1)) (= (ite (= (mod |v_P3_#t~nondet3_29| 256) 0) 0 1) v_~weak$$choice0~0_7) (= (ite (= (mod (ite .cse0 v_~b$w_buff1_used~0_123 (ite (or .cse1 .cse8 .cse4) v_~b$w_buff1_used~0_123 0)) 256) 0) 0 1) v_~b$w_buff1_used~0_122) (= v_~b$flush_delayed~0_31 0) (= v_~b$r_buff1_thd4~0_61 (ite (= (mod (ite .cse0 v_~b$r_buff1_thd4~0_62 (ite (let ((.cse9 (= (mod v_~b$r_buff0_thd4~0_63 256) 0))) (or (and .cse3 .cse9) (and .cse10 .cse9) .cse4)) v_~b$r_buff1_thd4~0_62 0)) 256) 0) 0 1)) (= v_~b~0_68 (ite (not (= (mod (ite .cse11 0 1) 256) 0)) v_~b$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_16)) (= v_~b$w_buff1~0_38 v_~b$w_buff1~0_37) (= v_~b$mem_tmp~0_18 v_~b~0_69))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_134, ~b~0=v_~b~0_69, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_123, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_62, ~b$w_buff1~0=v_~b$w_buff1~0_38, ~b$w_buff0~0=v_~b$w_buff0~0_47, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_64} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_31, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_133, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~b~0=v_~b~0_68, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_122, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_61, ~b$w_buff1~0=v_~b$w_buff1~0_37, ~b$w_buff0~0=v_~b$w_buff0~0_46, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_63, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} AuxVars[|v_P3_#t~nondet3_29|, |v_P3_#t~nondet4_29|] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][59], [30#L806true, 33#L793true, 63#true, 53#L887true, Black: 106#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 99#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 104#(and (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 102#(and (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 98#(= ~__unbuffered_p3_EAX~0 0), 65#true, 40#P0EXITtrue, 112#true, 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 61#true, 96#true, 67#true, Black: 83#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 13#L845true, Black: 85#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 78#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 81#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= (mod ~main$tmp_guard1~0 256) 0)))]) [2024-10-31 22:04:55,696 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-10-31 22:04:55,696 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-31 22:04:55,696 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-31 22:04:55,696 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-31 22:04:55,697 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L887-->L890: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= 2 v_~z~0_4) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~z~0=v_~z~0_4, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~z~0=v_~z~0_4, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][70], [30#L806true, 33#L793true, 63#true, Black: 106#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 99#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 104#(and (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 102#(and (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 98#(= ~__unbuffered_p3_EAX~0 0), 65#true, 40#P0EXITtrue, 112#true, 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 61#true, 49#L890true, 96#true, 67#true, Black: 83#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 7#L829true, Black: 85#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 78#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 81#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= (mod ~main$tmp_guard1~0 256) 0)))]) [2024-10-31 22:04:55,697 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-10-31 22:04:55,697 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-31 22:04:55,697 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-31 22:04:55,697 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-31 22:04:55,758 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([436] L829-->L845: Formula: (let ((.cse10 (= (mod v_~b$r_buff1_thd4~0_62 256) 0)) (.cse2 (= (mod v_~b$r_buff0_thd4~0_64 256) 0))) (let ((.cse11 (= (mod v_~weak$$choice2~0_30 256) 0)) (.cse5 (not .cse2)) (.cse1 (and .cse10 .cse2)) (.cse8 (and .cse2 (= (mod v_~b$w_buff1_used~0_123 256) 0))) (.cse12 (= (mod v_~b$w_buff0_used~0_134 256) 0))) (let ((.cse6 (or .cse1 .cse8 .cse12)) (.cse7 (and .cse5 (not .cse12))) (.cse0 (not .cse11)) (.cse3 (= 0 (mod v_~b$w_buff1_used~0_122 256))) (.cse4 (= (mod v_~b$w_buff0_used~0_133 256) 0))) (and (= (ite (= (mod (ite .cse0 v_~b$r_buff0_thd4~0_64 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~b$r_buff0_thd4~0_64 (ite (and (not .cse4) .cse5) 0 v_~b$r_buff0_thd4~0_64))) 256) 0) 0 1) v_~b$r_buff0_thd4~0_63) (= v_~__unbuffered_p3_EBX~0_16 (ite .cse6 v_~b~0_69 (ite .cse7 v_~b$w_buff0~0_47 v_~b$w_buff1~0_38))) (= v_~b$w_buff0~0_47 v_~b$w_buff0~0_46) (or (= |v_P3_#t~nondet4_29| 1) (= |v_P3_#t~nondet4_29| 0)) (= (ite (= (mod |v_P3_#t~nondet4_29| 256) 0) 0 1) v_~weak$$choice2~0_30) (or (= |v_P3_#t~nondet3_29| 1) (= |v_P3_#t~nondet3_29| 0)) (= v_~b$w_buff0_used~0_133 (ite (= (mod (ite .cse0 v_~b$w_buff0_used~0_134 (ite .cse6 v_~b$w_buff0_used~0_134 (ite .cse7 0 v_~b$w_buff0_used~0_134))) 256) 0) 0 1)) (= (ite (= (mod |v_P3_#t~nondet3_29| 256) 0) 0 1) v_~weak$$choice0~0_7) (= (ite (= (mod (ite .cse0 v_~b$w_buff1_used~0_123 (ite (or .cse1 .cse8 .cse4) v_~b$w_buff1_used~0_123 0)) 256) 0) 0 1) v_~b$w_buff1_used~0_122) (= v_~b$flush_delayed~0_31 0) (= v_~b$r_buff1_thd4~0_61 (ite (= (mod (ite .cse0 v_~b$r_buff1_thd4~0_62 (ite (let ((.cse9 (= (mod v_~b$r_buff0_thd4~0_63 256) 0))) (or (and .cse3 .cse9) (and .cse10 .cse9) .cse4)) v_~b$r_buff1_thd4~0_62 0)) 256) 0) 0 1)) (= v_~b~0_68 (ite (not (= (mod (ite .cse11 0 1) 256) 0)) v_~b$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_16)) (= v_~b$w_buff1~0_38 v_~b$w_buff1~0_37) (= v_~b$mem_tmp~0_18 v_~b~0_69))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_134, ~b~0=v_~b~0_69, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_123, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_62, ~b$w_buff1~0=v_~b$w_buff1~0_38, ~b$w_buff0~0=v_~b$w_buff0~0_47, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_64} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_31, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_133, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~b~0=v_~b~0_68, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_122, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_61, ~b$w_buff1~0=v_~b$w_buff1~0_37, ~b$w_buff0~0=v_~b$w_buff0~0_46, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_63, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} AuxVars[|v_P3_#t~nondet3_29|, |v_P3_#t~nondet4_29|] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][59], [30#L806true, 63#true, 53#L887true, Black: 106#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 99#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 104#(and (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 102#(and (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 98#(= ~__unbuffered_p3_EAX~0 0), 65#true, 5#L773true, 112#true, 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 61#true, 96#true, 67#true, Black: 83#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 13#L845true, Black: 85#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 78#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 23#P1EXITtrue, Black: 81#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= (mod ~main$tmp_guard1~0 256) 0)))]) [2024-10-31 22:04:55,758 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-10-31 22:04:55,759 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-31 22:04:55,759 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-31 22:04:55,759 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-31 22:04:55,759 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L887-->L890: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= 2 v_~z~0_4) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~z~0=v_~z~0_4, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~z~0=v_~z~0_4, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][70], [30#L806true, 63#true, Black: 106#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 99#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 104#(and (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 102#(and (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 98#(= ~__unbuffered_p3_EAX~0 0), 65#true, 5#L773true, 112#true, 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 61#true, 49#L890true, 96#true, 67#true, 7#L829true, Black: 83#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 85#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 78#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 23#P1EXITtrue, Black: 81#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= (mod ~main$tmp_guard1~0 256) 0)))]) [2024-10-31 22:04:55,759 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-10-31 22:04:55,759 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-31 22:04:55,759 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-31 22:04:55,760 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-31 22:04:56,090 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([436] L829-->L845: Formula: (let ((.cse10 (= (mod v_~b$r_buff1_thd4~0_62 256) 0)) (.cse2 (= (mod v_~b$r_buff0_thd4~0_64 256) 0))) (let ((.cse11 (= (mod v_~weak$$choice2~0_30 256) 0)) (.cse5 (not .cse2)) (.cse1 (and .cse10 .cse2)) (.cse8 (and .cse2 (= (mod v_~b$w_buff1_used~0_123 256) 0))) (.cse12 (= (mod v_~b$w_buff0_used~0_134 256) 0))) (let ((.cse6 (or .cse1 .cse8 .cse12)) (.cse7 (and .cse5 (not .cse12))) (.cse0 (not .cse11)) (.cse3 (= 0 (mod v_~b$w_buff1_used~0_122 256))) (.cse4 (= (mod v_~b$w_buff0_used~0_133 256) 0))) (and (= (ite (= (mod (ite .cse0 v_~b$r_buff0_thd4~0_64 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~b$r_buff0_thd4~0_64 (ite (and (not .cse4) .cse5) 0 v_~b$r_buff0_thd4~0_64))) 256) 0) 0 1) v_~b$r_buff0_thd4~0_63) (= v_~__unbuffered_p3_EBX~0_16 (ite .cse6 v_~b~0_69 (ite .cse7 v_~b$w_buff0~0_47 v_~b$w_buff1~0_38))) (= v_~b$w_buff0~0_47 v_~b$w_buff0~0_46) (or (= |v_P3_#t~nondet4_29| 1) (= |v_P3_#t~nondet4_29| 0)) (= (ite (= (mod |v_P3_#t~nondet4_29| 256) 0) 0 1) v_~weak$$choice2~0_30) (or (= |v_P3_#t~nondet3_29| 1) (= |v_P3_#t~nondet3_29| 0)) (= v_~b$w_buff0_used~0_133 (ite (= (mod (ite .cse0 v_~b$w_buff0_used~0_134 (ite .cse6 v_~b$w_buff0_used~0_134 (ite .cse7 0 v_~b$w_buff0_used~0_134))) 256) 0) 0 1)) (= (ite (= (mod |v_P3_#t~nondet3_29| 256) 0) 0 1) v_~weak$$choice0~0_7) (= (ite (= (mod (ite .cse0 v_~b$w_buff1_used~0_123 (ite (or .cse1 .cse8 .cse4) v_~b$w_buff1_used~0_123 0)) 256) 0) 0 1) v_~b$w_buff1_used~0_122) (= v_~b$flush_delayed~0_31 0) (= v_~b$r_buff1_thd4~0_61 (ite (= (mod (ite .cse0 v_~b$r_buff1_thd4~0_62 (ite (let ((.cse9 (= (mod v_~b$r_buff0_thd4~0_63 256) 0))) (or (and .cse3 .cse9) (and .cse10 .cse9) .cse4)) v_~b$r_buff1_thd4~0_62 0)) 256) 0) 0 1)) (= v_~b~0_68 (ite (not (= (mod (ite .cse11 0 1) 256) 0)) v_~b$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_16)) (= v_~b$w_buff1~0_38 v_~b$w_buff1~0_37) (= v_~b$mem_tmp~0_18 v_~b~0_69))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_134, ~b~0=v_~b~0_69, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_123, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_62, ~b$w_buff1~0=v_~b$w_buff1~0_38, ~b$w_buff0~0=v_~b$w_buff0~0_47, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_64} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_31, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_133, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~b~0=v_~b~0_68, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_122, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_61, ~b$w_buff1~0=v_~b$w_buff1~0_37, ~b$w_buff0~0=v_~b$w_buff0~0_46, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_63, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} AuxVars[|v_P3_#t~nondet3_29|, |v_P3_#t~nondet4_29|] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][59], [30#L806true, 63#true, Black: 106#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 99#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 104#(and (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 102#(and (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 98#(= ~__unbuffered_p3_EAX~0 0), 65#true, 40#P0EXITtrue, 112#true, 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 61#true, 96#true, 67#true, 35#L881true, Black: 83#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 13#L845true, Black: 85#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 78#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 23#P1EXITtrue, Black: 81#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= (mod ~main$tmp_guard1~0 256) 0)))]) [2024-10-31 22:04:56,090 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-10-31 22:04:56,090 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-31 22:04:56,091 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-31 22:04:56,091 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-31 22:04:56,511 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([436] L829-->L845: Formula: (let ((.cse10 (= (mod v_~b$r_buff1_thd4~0_62 256) 0)) (.cse2 (= (mod v_~b$r_buff0_thd4~0_64 256) 0))) (let ((.cse11 (= (mod v_~weak$$choice2~0_30 256) 0)) (.cse5 (not .cse2)) (.cse1 (and .cse10 .cse2)) (.cse8 (and .cse2 (= (mod v_~b$w_buff1_used~0_123 256) 0))) (.cse12 (= (mod v_~b$w_buff0_used~0_134 256) 0))) (let ((.cse6 (or .cse1 .cse8 .cse12)) (.cse7 (and .cse5 (not .cse12))) (.cse0 (not .cse11)) (.cse3 (= 0 (mod v_~b$w_buff1_used~0_122 256))) (.cse4 (= (mod v_~b$w_buff0_used~0_133 256) 0))) (and (= (ite (= (mod (ite .cse0 v_~b$r_buff0_thd4~0_64 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~b$r_buff0_thd4~0_64 (ite (and (not .cse4) .cse5) 0 v_~b$r_buff0_thd4~0_64))) 256) 0) 0 1) v_~b$r_buff0_thd4~0_63) (= v_~__unbuffered_p3_EBX~0_16 (ite .cse6 v_~b~0_69 (ite .cse7 v_~b$w_buff0~0_47 v_~b$w_buff1~0_38))) (= v_~b$w_buff0~0_47 v_~b$w_buff0~0_46) (or (= |v_P3_#t~nondet4_29| 1) (= |v_P3_#t~nondet4_29| 0)) (= (ite (= (mod |v_P3_#t~nondet4_29| 256) 0) 0 1) v_~weak$$choice2~0_30) (or (= |v_P3_#t~nondet3_29| 1) (= |v_P3_#t~nondet3_29| 0)) (= v_~b$w_buff0_used~0_133 (ite (= (mod (ite .cse0 v_~b$w_buff0_used~0_134 (ite .cse6 v_~b$w_buff0_used~0_134 (ite .cse7 0 v_~b$w_buff0_used~0_134))) 256) 0) 0 1)) (= (ite (= (mod |v_P3_#t~nondet3_29| 256) 0) 0 1) v_~weak$$choice0~0_7) (= (ite (= (mod (ite .cse0 v_~b$w_buff1_used~0_123 (ite (or .cse1 .cse8 .cse4) v_~b$w_buff1_used~0_123 0)) 256) 0) 0 1) v_~b$w_buff1_used~0_122) (= v_~b$flush_delayed~0_31 0) (= v_~b$r_buff1_thd4~0_61 (ite (= (mod (ite .cse0 v_~b$r_buff1_thd4~0_62 (ite (let ((.cse9 (= (mod v_~b$r_buff0_thd4~0_63 256) 0))) (or (and .cse3 .cse9) (and .cse10 .cse9) .cse4)) v_~b$r_buff1_thd4~0_62 0)) 256) 0) 0 1)) (= v_~b~0_68 (ite (not (= (mod (ite .cse11 0 1) 256) 0)) v_~b$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_16)) (= v_~b$w_buff1~0_38 v_~b$w_buff1~0_37) (= v_~b$mem_tmp~0_18 v_~b~0_69))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_134, ~b~0=v_~b~0_69, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_123, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_62, ~b$w_buff1~0=v_~b$w_buff1~0_38, ~b$w_buff0~0=v_~b$w_buff0~0_47, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_64} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_31, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_133, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~b~0=v_~b~0_68, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_122, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_61, ~b$w_buff1~0=v_~b$w_buff1~0_37, ~b$w_buff0~0=v_~b$w_buff0~0_46, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_63, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} AuxVars[|v_P3_#t~nondet3_29|, |v_P3_#t~nondet4_29|] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][59], [30#L806true, 63#true, 53#L887true, Black: 106#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 99#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 104#(and (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 102#(and (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 98#(= ~__unbuffered_p3_EAX~0 0), 65#true, 40#P0EXITtrue, 112#true, 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 61#true, 96#true, 67#true, Black: 83#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 13#L845true, Black: 85#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 78#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 23#P1EXITtrue, Black: 81#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= (mod ~main$tmp_guard1~0 256) 0)))]) [2024-10-31 22:04:56,511 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-10-31 22:04:56,511 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-31 22:04:56,512 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-31 22:04:56,512 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-31 22:04:56,512 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L887-->L890: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= 2 v_~z~0_4) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~z~0=v_~z~0_4, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~z~0=v_~z~0_4, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][70], [30#L806true, 63#true, Black: 106#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 99#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 104#(and (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 102#(and (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 98#(= ~__unbuffered_p3_EAX~0 0), 65#true, 40#P0EXITtrue, 112#true, 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 61#true, 49#L890true, 96#true, 67#true, Black: 83#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 7#L829true, Black: 85#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 78#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 23#P1EXITtrue, Black: 81#(and (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= (mod ~main$tmp_guard1~0 256) 0)))]) [2024-10-31 22:04:56,512 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-10-31 22:04:56,512 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-31 22:04:56,512 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-31 22:04:56,512 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-31 22:04:57,107 INFO L124 PetriNetUnfolderBase]: 18839/30115 cut-off events. [2024-10-31 22:04:57,107 INFO L125 PetriNetUnfolderBase]: For 36542/36943 co-relation queries the response was YES. [2024-10-31 22:04:57,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78848 conditions, 30115 events. 18839/30115 cut-off events. For 36542/36943 co-relation queries the response was YES. Maximal size of possible extension queue 1499. Compared 246451 event pairs, 7566 based on Foata normal form. 747/29265 useless extension candidates. Maximal degree in co-relation 78830. Up to 19606 conditions per place. [2024-10-31 22:04:57,493 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 44 selfloop transitions, 5 changer transitions 55/125 dead transitions. [2024-10-31 22:04:57,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 125 transitions, 700 flow [2024-10-31 22:04:57,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 22:04:57,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-31 22:04:57,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 242 transitions. [2024-10-31 22:04:57,496 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2024-10-31 22:04:57,496 INFO L175 Difference]: Start difference. First operand has 70 places, 50 transitions, 196 flow. Second operand 7 states and 242 transitions. [2024-10-31 22:04:57,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 125 transitions, 700 flow [2024-10-31 22:04:57,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 125 transitions, 678 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-10-31 22:04:57,960 INFO L231 Difference]: Finished difference. Result has 71 places, 54 transitions, 255 flow [2024-10-31 22:04:57,961 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=255, PETRI_PLACES=71, PETRI_TRANSITIONS=54} [2024-10-31 22:04:57,962 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 9 predicate places. [2024-10-31 22:04:57,964 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 54 transitions, 255 flow [2024-10-31 22:04:57,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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) [2024-10-31 22:04:57,965 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:04:57,965 INFO L204 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] [2024-10-31 22:04:57,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:04:57,965 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-31 22:04:57,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:57,966 INFO L85 PathProgramCache]: Analyzing trace with hash 529306968, now seen corresponding path program 1 times [2024-10-31 22:04:57,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:04:57,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494813033] [2024-10-31 22:04:57,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:57,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:04:58,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:58,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:04:58,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:04:58,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494813033] [2024-10-31 22:04:58,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494813033] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:04:58,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:04:58,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:04:58,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333621479] [2024-10-31 22:04:58,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:04:58,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:04:58,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:04:58,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:04:58,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:04:58,173 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2024-10-31 22:04:58,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 54 transitions, 255 flow. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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) [2024-10-31 22:04:58,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:04:58,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2024-10-31 22:04:58,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand