./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix043.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 30e01a73 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4826f4a0-038d-45b9-bc49-8454ce203d57/bin/uautomizer-verify-zZY32mL2XJ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4826f4a0-038d-45b9-bc49-8454ce203d57/bin/uautomizer-verify-zZY32mL2XJ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4826f4a0-038d-45b9-bc49-8454ce203d57/bin/uautomizer-verify-zZY32mL2XJ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4826f4a0-038d-45b9-bc49-8454ce203d57/bin/uautomizer-verify-zZY32mL2XJ/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix043.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4826f4a0-038d-45b9-bc49-8454ce203d57/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4826f4a0-038d-45b9-bc49-8454ce203d57/bin/uautomizer-verify-zZY32mL2XJ --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 9bfd96daa3950021158d7079dc25a62741fa5d5a7f9e521049c1a78760db50f1 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 21:39:42,277 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 21:39:42,397 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4826f4a0-038d-45b9-bc49-8454ce203d57/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-23 21:39:42,409 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 21:39:42,410 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 21:39:42,451 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 21:39:42,452 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 21:39:42,452 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 21:39:42,454 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 21:39:42,462 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 21:39:42,462 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 21:39:42,463 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 21:39:42,463 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 21:39:42,465 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 21:39:42,465 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 21:39:42,466 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 21:39:42,466 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 21:39:42,466 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 21:39:42,467 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-23 21:39:42,467 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-23 21:39:42,468 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-23 21:39:42,468 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 21:39:42,469 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-23 21:39:42,469 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-23 21:39:42,469 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 21:39:42,470 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 21:39:42,471 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 21:39:42,471 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 21:39:42,472 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 21:39:42,472 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 21:39:42,474 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:39:42,474 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 21:39:42,474 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 21:39:42,474 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 21:39:42,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 21:39:42,476 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 21:39:42,476 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 21:39:42,477 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 21:39:42,477 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 21:39:42,477 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_4826f4a0-038d-45b9-bc49-8454ce203d57/bin/uautomizer-verify-zZY32mL2XJ/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_4826f4a0-038d-45b9-bc49-8454ce203d57/bin/uautomizer-verify-zZY32mL2XJ 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 -> 9bfd96daa3950021158d7079dc25a62741fa5d5a7f9e521049c1a78760db50f1 [2023-11-23 21:39:42,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 21:39:42,820 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 21:39:42,823 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 21:39:42,825 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 21:39:42,825 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 21:39:42,827 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4826f4a0-038d-45b9-bc49-8454ce203d57/bin/uautomizer-verify-zZY32mL2XJ/../../sv-benchmarks/c/pthread-wmm/mix043.oepc.i [2023-11-23 21:39:46,002 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 21:39:46,274 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 21:39:46,274 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4826f4a0-038d-45b9-bc49-8454ce203d57/sv-benchmarks/c/pthread-wmm/mix043.oepc.i [2023-11-23 21:39:46,296 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4826f4a0-038d-45b9-bc49-8454ce203d57/bin/uautomizer-verify-zZY32mL2XJ/data/559c6d77d/179889e721254cedb3e3e774ccd700cc/FLAGd919363a6 [2023-11-23 21:39:46,318 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4826f4a0-038d-45b9-bc49-8454ce203d57/bin/uautomizer-verify-zZY32mL2XJ/data/559c6d77d/179889e721254cedb3e3e774ccd700cc [2023-11-23 21:39:46,321 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 21:39:46,323 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 21:39:46,324 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 21:39:46,325 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 21:39:46,331 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 21:39:46,332 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:39:46" (1/1) ... [2023-11-23 21:39:46,333 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d7965d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:46, skipping insertion in model container [2023-11-23 21:39:46,333 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:39:46" (1/1) ... [2023-11-23 21:39:46,401 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 21:39:46,843 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:39:46,857 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 21:39:46,924 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:39:46,967 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 21:39:46,967 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 21:39:46,975 INFO L206 MainTranslator]: Completed translation [2023-11-23 21:39:46,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:46 WrapperNode [2023-11-23 21:39:46,975 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 21:39:46,977 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 21:39:46,977 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 21:39:46,977 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 21:39:46,984 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:46" (1/1) ... [2023-11-23 21:39:47,002 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:46" (1/1) ... [2023-11-23 21:39:47,032 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 151 [2023-11-23 21:39:47,033 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 21:39:47,034 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 21:39:47,034 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 21:39:47,034 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 21:39:47,044 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:46" (1/1) ... [2023-11-23 21:39:47,045 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:46" (1/1) ... [2023-11-23 21:39:47,050 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:46" (1/1) ... [2023-11-23 21:39:47,050 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:46" (1/1) ... [2023-11-23 21:39:47,065 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:46" (1/1) ... [2023-11-23 21:39:47,068 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:46" (1/1) ... [2023-11-23 21:39:47,072 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:46" (1/1) ... [2023-11-23 21:39:47,075 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:46" (1/1) ... [2023-11-23 21:39:47,080 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 21:39:47,081 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 21:39:47,081 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 21:39:47,082 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 21:39:47,082 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:46" (1/1) ... [2023-11-23 21:39:47,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:39:47,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4826f4a0-038d-45b9-bc49-8454ce203d57/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 21:39:47,131 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4826f4a0-038d-45b9-bc49-8454ce203d57/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 21:39:47,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4826f4a0-038d-45b9-bc49-8454ce203d57/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 21:39:47,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-23 21:39:47,173 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-23 21:39:47,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 21:39:47,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 21:39:47,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 21:39:47,173 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-23 21:39:47,174 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-23 21:39:47,175 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-23 21:39:47,176 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-23 21:39:47,176 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-23 21:39:47,176 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-23 21:39:47,176 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-23 21:39:47,176 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-23 21:39:47,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 21:39:47,179 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-23 21:39:47,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 21:39:47,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 21:39:47,181 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-23 21:39:47,368 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 21:39:47,370 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 21:39:47,840 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 21:39:48,099 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 21:39:48,099 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-23 21:39:48,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:39:48 BoogieIcfgContainer [2023-11-23 21:39:48,101 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 21:39:48,104 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 21:39:48,104 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 21:39:48,107 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 21:39:48,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:39:46" (1/3) ... [2023-11-23 21:39:48,111 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e249b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:39:48, skipping insertion in model container [2023-11-23 21:39:48,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:46" (2/3) ... [2023-11-23 21:39:48,112 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e249b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:39:48, skipping insertion in model container [2023-11-23 21:39:48,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:39:48" (3/3) ... [2023-11-23 21:39:48,114 INFO L112 eAbstractionObserver]: Analyzing ICFG mix043.oepc.i [2023-11-23 21:39:48,135 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 21:39:48,135 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-23 21:39:48,135 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-23 21:39:48,213 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-23 21:39:48,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 67 transitions, 150 flow [2023-11-23 21:39:48,310 INFO L124 PetriNetUnfolderBase]: 2/63 cut-off events. [2023-11-23 21:39:48,310 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-23 21:39:48,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 63 events. 2/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 130 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2023-11-23 21:39:48,317 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 67 transitions, 150 flow [2023-11-23 21:39:48,322 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 63 transitions, 138 flow [2023-11-23 21:39:48,339 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 21:39:48,347 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@ad6b5f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 21:39:48,348 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-23 21:39:48,351 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-23 21:39:48,351 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-23 21:39:48,352 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-23 21:39:48,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:39:48,353 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-23 21:39:48,353 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-23 21:39:48,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:39:48,359 INFO L85 PathProgramCache]: Analyzing trace with hash 14366, now seen corresponding path program 1 times [2023-11-23 21:39:48,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:39:48,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664347001] [2023-11-23 21:39:48,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:39:48,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:39:48,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:48,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:39:48,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:39:48,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664347001] [2023-11-23 21:39:48,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664347001] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:39:48,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:39:48,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 21:39:48,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221741615] [2023-11-23 21:39:48,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:39:48,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:39:48,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:39:48,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:39:48,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:39:48,873 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-23 21:39:48,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 63 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:48,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:39:48,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-23 21:39:48,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:39:50,547 INFO L124 PetriNetUnfolderBase]: 4217/7283 cut-off events. [2023-11-23 21:39:50,548 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2023-11-23 21:39:50,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13210 conditions, 7283 events. 4217/7283 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 54556 event pairs, 3179 based on Foata normal form. 360/6916 useless extension candidates. Maximal degree in co-relation 13195. Up to 4391 conditions per place. [2023-11-23 21:39:50,632 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 36 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2023-11-23 21:39:50,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 70 transitions, 228 flow [2023-11-23 21:39:50,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:39:50,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 21:39:50,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2023-11-23 21:39:50,647 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7412935323383084 [2023-11-23 21:39:50,648 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 149 transitions. [2023-11-23 21:39:50,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 149 transitions. [2023-11-23 21:39:50,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:39:50,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 149 transitions. [2023-11-23 21:39:50,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:50,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:50,659 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:50,661 INFO L175 Difference]: Start difference. First operand has 74 places, 63 transitions, 138 flow. Second operand 3 states and 149 transitions. [2023-11-23 21:39:50,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 70 transitions, 228 flow [2023-11-23 21:39:50,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 70 transitions, 224 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-23 21:39:50,672 INFO L231 Difference]: Finished difference. Result has 70 places, 59 transitions, 130 flow [2023-11-23 21:39:50,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=70, PETRI_TRANSITIONS=59} [2023-11-23 21:39:50,677 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -4 predicate places. [2023-11-23 21:39:50,677 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 59 transitions, 130 flow [2023-11-23 21:39:50,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:50,678 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:39:50,678 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-23 21:39:50,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 21:39:50,679 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-23 21:39:50,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:39:50,679 INFO L85 PathProgramCache]: Analyzing trace with hash 14367, now seen corresponding path program 1 times [2023-11-23 21:39:50,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:39:50,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952475987] [2023-11-23 21:39:50,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:39:50,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:39:50,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:50,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:39:50,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:39:50,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952475987] [2023-11-23 21:39:50,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952475987] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:39:50,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:39:50,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 21:39:50,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289898167] [2023-11-23 21:39:50,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:39:50,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:39:50,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:39:50,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:39:50,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:39:50,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-23 21:39:50,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 59 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:50,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:39:50,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-23 21:39:50,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:39:52,301 INFO L124 PetriNetUnfolderBase]: 4217/7282 cut-off events. [2023-11-23 21:39:52,303 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2023-11-23 21:39:52,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13386 conditions, 7282 events. 4217/7282 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 54711 event pairs, 3179 based on Foata normal form. 1/6556 useless extension candidates. Maximal degree in co-relation 13375. Up to 4390 conditions per place. [2023-11-23 21:39:52,372 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 35 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2023-11-23 21:39:52,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 69 transitions, 224 flow [2023-11-23 21:39:52,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:39:52,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 21:39:52,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2023-11-23 21:39:52,380 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7412935323383084 [2023-11-23 21:39:52,380 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 149 transitions. [2023-11-23 21:39:52,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 149 transitions. [2023-11-23 21:39:52,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:39:52,383 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 149 transitions. [2023-11-23 21:39:52,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:52,388 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:52,388 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:52,388 INFO L175 Difference]: Start difference. First operand has 70 places, 59 transitions, 130 flow. Second operand 3 states and 149 transitions. [2023-11-23 21:39:52,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 69 transitions, 224 flow [2023-11-23 21:39:52,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 69 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 21:39:52,405 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 128 flow [2023-11-23 21:39:52,405 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=69, PETRI_TRANSITIONS=58} [2023-11-23 21:39:52,406 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -5 predicate places. [2023-11-23 21:39:52,407 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 128 flow [2023-11-23 21:39:52,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:52,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:39:52,412 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-23 21:39:52,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 21:39:52,412 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-23 21:39:52,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:39:52,414 INFO L85 PathProgramCache]: Analyzing trace with hash 428416841, now seen corresponding path program 1 times [2023-11-23 21:39:52,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:39:52,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810295571] [2023-11-23 21:39:52,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:39:52,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:39:52,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:52,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:39:52,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:39:52,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810295571] [2023-11-23 21:39:52,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810295571] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:39:52,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:39:52,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:39:52,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830702845] [2023-11-23 21:39:52,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:39:52,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:39:52,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:39:52,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:39:52,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:39:52,581 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-23 21:39:52,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:52,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:39:52,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-23 21:39:52,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:39:53,863 INFO L124 PetriNetUnfolderBase]: 4221/7245 cut-off events. [2023-11-23 21:39:53,863 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2023-11-23 21:39:53,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13358 conditions, 7245 events. 4221/7245 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 54264 event pairs, 3251 based on Foata normal form. 0/6528 useless extension candidates. Maximal degree in co-relation 13347. Up to 4393 conditions per place. [2023-11-23 21:39:53,942 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 36 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-11-23 21:39:53,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 68 transitions, 224 flow [2023-11-23 21:39:53,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:39:53,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 21:39:53,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2023-11-23 21:39:53,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7313432835820896 [2023-11-23 21:39:53,945 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 147 transitions. [2023-11-23 21:39:53,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 147 transitions. [2023-11-23 21:39:53,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:39:53,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 147 transitions. [2023-11-23 21:39:53,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:53,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:53,949 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:53,949 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 128 flow. Second operand 3 states and 147 transitions. [2023-11-23 21:39:53,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 68 transitions, 224 flow [2023-11-23 21:39:53,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 68 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 21:39:53,960 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 126 flow [2023-11-23 21:39:53,960 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=68, PETRI_TRANSITIONS=57} [2023-11-23 21:39:53,961 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -6 predicate places. [2023-11-23 21:39:53,961 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 126 flow [2023-11-23 21:39:53,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:53,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:39:53,962 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-23 21:39:53,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 21:39:53,963 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-23 21:39:53,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:39:53,963 INFO L85 PathProgramCache]: Analyzing trace with hash 428416842, now seen corresponding path program 1 times [2023-11-23 21:39:53,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:39:53,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761168172] [2023-11-23 21:39:53,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:39:53,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:39:53,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:54,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:39:54,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:39:54,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761168172] [2023-11-23 21:39:54,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761168172] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:39:54,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:39:54,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:39:54,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611585567] [2023-11-23 21:39:54,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:39:54,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:39:54,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:39:54,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:39:54,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:39:54,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-23 21:39:54,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:54,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:39:54,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-23 21:39:54,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:39:55,442 INFO L124 PetriNetUnfolderBase]: 4217/7272 cut-off events. [2023-11-23 21:39:55,443 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2023-11-23 21:39:55,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13380 conditions, 7272 events. 4217/7272 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 55027 event pairs, 2503 based on Foata normal form. 5/6563 useless extension candidates. Maximal degree in co-relation 13370. Up to 4384 conditions per place. [2023-11-23 21:39:55,497 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 35 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2023-11-23 21:39:55,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 67 transitions, 220 flow [2023-11-23 21:39:55,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:39:55,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 21:39:55,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2023-11-23 21:39:55,499 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7412935323383084 [2023-11-23 21:39:55,499 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 149 transitions. [2023-11-23 21:39:55,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 149 transitions. [2023-11-23 21:39:55,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:39:55,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 149 transitions. [2023-11-23 21:39:55,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:55,501 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:55,501 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:55,501 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 126 flow. Second operand 3 states and 149 transitions. [2023-11-23 21:39:55,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 67 transitions, 220 flow [2023-11-23 21:39:55,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 67 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 21:39:55,505 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 124 flow [2023-11-23 21:39:55,506 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=67, PETRI_TRANSITIONS=56} [2023-11-23 21:39:55,507 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -7 predicate places. [2023-11-23 21:39:55,507 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 124 flow [2023-11-23 21:39:55,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:55,507 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:39:55,507 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-23 21:39:55,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 21:39:55,508 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-23 21:39:55,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:39:55,508 INFO L85 PathProgramCache]: Analyzing trace with hash 428418495, now seen corresponding path program 1 times [2023-11-23 21:39:55,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:39:55,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001820271] [2023-11-23 21:39:55,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:39:55,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:39:55,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:55,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:39:55,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:39:55,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001820271] [2023-11-23 21:39:55,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001820271] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:39:55,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:39:55,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 21:39:55,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849831] [2023-11-23 21:39:55,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:39:55,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:39:55,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:39:55,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:39:55,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:39:55,605 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 67 [2023-11-23 21:39:55,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:55,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:39:55,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 67 [2023-11-23 21:39:55,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:39:56,544 INFO L124 PetriNetUnfolderBase]: 3311/5485 cut-off events. [2023-11-23 21:39:56,545 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2023-11-23 21:39:56,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10310 conditions, 5485 events. 3311/5485 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 39115 event pairs, 593 based on Foata normal form. 0/5382 useless extension candidates. Maximal degree in co-relation 10300. Up to 3661 conditions per place. [2023-11-23 21:39:56,582 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 41 selfloop transitions, 2 changer transitions 2/75 dead transitions. [2023-11-23 21:39:56,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 75 transitions, 262 flow [2023-11-23 21:39:56,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:39:56,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 21:39:56,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2023-11-23 21:39:56,584 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7960199004975125 [2023-11-23 21:39:56,584 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 160 transitions. [2023-11-23 21:39:56,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 160 transitions. [2023-11-23 21:39:56,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:39:56,585 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 160 transitions. [2023-11-23 21:39:56,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:56,587 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:56,587 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:56,588 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 124 flow. Second operand 3 states and 160 transitions. [2023-11-23 21:39:56,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 75 transitions, 262 flow [2023-11-23 21:39:56,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 75 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 21:39:56,592 INFO L231 Difference]: Finished difference. Result has 66 places, 54 transitions, 120 flow [2023-11-23 21:39:56,592 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=66, PETRI_TRANSITIONS=54} [2023-11-23 21:39:56,594 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -8 predicate places. [2023-11-23 21:39:56,595 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 120 flow [2023-11-23 21:39:56,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:56,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:39:56,595 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:39:56,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 21:39:56,596 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-23 21:39:56,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:39:56,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1676249144, now seen corresponding path program 1 times [2023-11-23 21:39:56,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:39:56,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828618700] [2023-11-23 21:39:56,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:39:56,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:39:56,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:56,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:39:56,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:39:56,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828618700] [2023-11-23 21:39:56,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828618700] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:39:56,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:39:56,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:39:56,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782680337] [2023-11-23 21:39:56,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:39:56,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:39:56,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:39:56,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:39:56,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:39:56,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-23 21:39:56,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:56,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:39:56,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-23 21:39:56,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:39:57,392 INFO L124 PetriNetUnfolderBase]: 2920/5209 cut-off events. [2023-11-23 21:39:57,393 INFO L125 PetriNetUnfolderBase]: For 281/281 co-relation queries the response was YES. [2023-11-23 21:39:57,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9645 conditions, 5209 events. 2920/5209 cut-off events. For 281/281 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 38221 event pairs, 1356 based on Foata normal form. 0/4914 useless extension candidates. Maximal degree in co-relation 9634. Up to 3460 conditions per place. [2023-11-23 21:39:57,440 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 33 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-11-23 21:39:57,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 63 transitions, 210 flow [2023-11-23 21:39:57,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:39:57,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 21:39:57,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2023-11-23 21:39:57,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7164179104477612 [2023-11-23 21:39:57,442 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 144 transitions. [2023-11-23 21:39:57,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 144 transitions. [2023-11-23 21:39:57,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:39:57,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 144 transitions. [2023-11-23 21:39:57,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:57,444 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:57,444 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:57,444 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 120 flow. Second operand 3 states and 144 transitions. [2023-11-23 21:39:57,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 63 transitions, 210 flow [2023-11-23 21:39:57,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 63 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 21:39:57,447 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 118 flow [2023-11-23 21:39:57,447 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=64, PETRI_TRANSITIONS=53} [2023-11-23 21:39:57,448 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -10 predicate places. [2023-11-23 21:39:57,448 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 118 flow [2023-11-23 21:39:57,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:57,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:39:57,449 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:39:57,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 21:39:57,449 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-23 21:39:57,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:39:57,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1676249143, now seen corresponding path program 1 times [2023-11-23 21:39:57,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:39:57,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466092936] [2023-11-23 21:39:57,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:39:57,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:39:57,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:57,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:39:57,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:39:57,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466092936] [2023-11-23 21:39:57,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466092936] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:39:57,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:39:57,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:39:57,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605221693] [2023-11-23 21:39:57,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:39:57,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:39:57,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:39:57,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:39:57,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:39:57,571 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-23 21:39:57,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:57,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:39:57,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-23 21:39:57,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:39:58,404 INFO L124 PetriNetUnfolderBase]: 2903/5128 cut-off events. [2023-11-23 21:39:58,405 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-23 21:39:58,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9409 conditions, 5128 events. 2903/5128 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 37360 event pairs, 1884 based on Foata normal form. 12/4849 useless extension candidates. Maximal degree in co-relation 9399. Up to 3431 conditions per place. [2023-11-23 21:39:58,452 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 32 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-11-23 21:39:58,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 62 transitions, 204 flow [2023-11-23 21:39:58,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:39:58,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 21:39:58,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-23 21:39:58,455 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7263681592039801 [2023-11-23 21:39:58,455 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-23 21:39:58,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-23 21:39:58,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:39:58,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-23 21:39:58,456 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:58,457 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:58,458 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:58,458 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 118 flow. Second operand 3 states and 146 transitions. [2023-11-23 21:39:58,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 62 transitions, 204 flow [2023-11-23 21:39:58,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 62 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 21:39:58,462 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 116 flow [2023-11-23 21:39:58,462 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2023-11-23 21:39:58,463 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -11 predicate places. [2023-11-23 21:39:58,463 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 116 flow [2023-11-23 21:39:58,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:58,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:39:58,464 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:39:58,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 21:39:58,465 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-23 21:39:58,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:39:58,465 INFO L85 PathProgramCache]: Analyzing trace with hash 446943736, now seen corresponding path program 1 times [2023-11-23 21:39:58,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:39:58,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44472764] [2023-11-23 21:39:58,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:39:58,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:39:58,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:58,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:39:58,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:39:58,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44472764] [2023-11-23 21:39:58,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44472764] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:39:58,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:39:58,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:39:58,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483542024] [2023-11-23 21:39:58,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:39:58,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:39:58,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:39:58,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:39:58,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:39:58,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-23 21:39:58,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:58,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:39:58,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-23 21:39:58,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:39:59,452 INFO L124 PetriNetUnfolderBase]: 2978/5159 cut-off events. [2023-11-23 21:39:59,453 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-23 21:39:59,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9551 conditions, 5159 events. 2978/5159 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 37018 event pairs, 1424 based on Foata normal form. 0/4932 useless extension candidates. Maximal degree in co-relation 9541. Up to 3426 conditions per place. [2023-11-23 21:39:59,488 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 33 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-11-23 21:39:59,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 61 transitions, 204 flow [2023-11-23 21:39:59,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:39:59,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 21:39:59,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2023-11-23 21:39:59,490 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7164179104477612 [2023-11-23 21:39:59,490 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 144 transitions. [2023-11-23 21:39:59,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 144 transitions. [2023-11-23 21:39:59,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:39:59,490 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 144 transitions. [2023-11-23 21:39:59,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:59,492 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:59,492 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:59,492 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 116 flow. Second operand 3 states and 144 transitions. [2023-11-23 21:39:59,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 61 transitions, 204 flow [2023-11-23 21:39:59,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 61 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 21:39:59,495 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 114 flow [2023-11-23 21:39:59,496 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2023-11-23 21:39:59,496 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -12 predicate places. [2023-11-23 21:39:59,497 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 114 flow [2023-11-23 21:39:59,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:59,497 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:39:59,497 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:39:59,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 21:39:59,498 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-23 21:39:59,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:39:59,498 INFO L85 PathProgramCache]: Analyzing trace with hash 446943737, now seen corresponding path program 1 times [2023-11-23 21:39:59,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:39:59,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950450296] [2023-11-23 21:39:59,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:39:59,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:39:59,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:39:59,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:39:59,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:39:59,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950450296] [2023-11-23 21:39:59,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950450296] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:39:59,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:39:59,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:39:59,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463551188] [2023-11-23 21:39:59,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:39:59,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:39:59,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:39:59,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:39:59,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:39:59,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-23 21:39:59,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:39:59,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:39:59,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-23 21:39:59,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:40:00,293 INFO L124 PetriNetUnfolderBase]: 2903/5108 cut-off events. [2023-11-23 21:40:00,293 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2023-11-23 21:40:00,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9413 conditions, 5108 events. 2903/5108 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 37094 event pairs, 920 based on Foata normal form. 36/4953 useless extension candidates. Maximal degree in co-relation 9403. Up to 3315 conditions per place. [2023-11-23 21:40:00,336 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 32 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-23 21:40:00,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 60 transitions, 200 flow [2023-11-23 21:40:00,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:40:00,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 21:40:00,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-23 21:40:00,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7263681592039801 [2023-11-23 21:40:00,339 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-23 21:40:00,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-23 21:40:00,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:40:00,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-23 21:40:00,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:40:00,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:40:00,341 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:40:00,341 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 146 transitions. [2023-11-23 21:40:00,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 60 transitions, 200 flow [2023-11-23 21:40:00,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 60 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 21:40:00,344 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 112 flow [2023-11-23 21:40:00,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2023-11-23 21:40:00,345 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -13 predicate places. [2023-11-23 21:40:00,345 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 112 flow [2023-11-23 21:40:00,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:40:00,346 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:40:00,346 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:40:00,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 21:40:00,346 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-23 21:40:00,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:40:00,347 INFO L85 PathProgramCache]: Analyzing trace with hash 698157759, now seen corresponding path program 1 times [2023-11-23 21:40:00,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:40:00,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621348252] [2023-11-23 21:40:00,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:40:00,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:40:00,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:40:01,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:40:01,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:40:01,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621348252] [2023-11-23 21:40:01,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621348252] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:40:01,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:40:01,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 21:40:01,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536428186] [2023-11-23 21:40:01,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:40:01,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 21:40:01,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:40:01,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 21:40:01,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-23 21:40:01,787 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 67 [2023-11-23 21:40:01,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 flow. Second operand has 10 states, 10 states have (on average 35.7) internal successors, (357), 10 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:40:01,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:40:01,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 67 [2023-11-23 21:40:01,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:40:03,024 INFO L124 PetriNetUnfolderBase]: 3661/5642 cut-off events. [2023-11-23 21:40:03,024 INFO L125 PetriNetUnfolderBase]: For 204/204 co-relation queries the response was YES. [2023-11-23 21:40:03,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11006 conditions, 5642 events. 3661/5642 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 35569 event pairs, 176 based on Foata normal form. 180/5730 useless extension candidates. Maximal degree in co-relation 10995. Up to 3384 conditions per place. [2023-11-23 21:40:03,056 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 48 selfloop transitions, 5 changer transitions 13/88 dead transitions. [2023-11-23 21:40:03,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 88 transitions, 322 flow [2023-11-23 21:40:03,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 21:40:03,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-23 21:40:03,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 339 transitions. [2023-11-23 21:40:03,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6324626865671642 [2023-11-23 21:40:03,058 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 339 transitions. [2023-11-23 21:40:03,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 339 transitions. [2023-11-23 21:40:03,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:40:03,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 339 transitions. [2023-11-23 21:40:03,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 42.375) internal successors, (339), 8 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:40:03,062 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:40:03,062 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:40:03,063 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 8 states and 339 transitions. [2023-11-23 21:40:03,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 88 transitions, 322 flow [2023-11-23 21:40:03,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 88 transitions, 316 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 21:40:03,066 INFO L231 Difference]: Finished difference. Result has 65 places, 48 transitions, 114 flow [2023-11-23 21:40:03,066 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=114, PETRI_PLACES=65, PETRI_TRANSITIONS=48} [2023-11-23 21:40:03,071 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -9 predicate places. [2023-11-23 21:40:03,072 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 48 transitions, 114 flow [2023-11-23 21:40:03,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 35.7) internal successors, (357), 10 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:40:03,072 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:40:03,073 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:40:03,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-23 21:40:03,073 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-23 21:40:03,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:40:03,074 INFO L85 PathProgramCache]: Analyzing trace with hash 698159135, now seen corresponding path program 1 times [2023-11-23 21:40:03,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:40:03,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788352910] [2023-11-23 21:40:03,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:40:03,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:40:03,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:40:03,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:40:03,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:40:03,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788352910] [2023-11-23 21:40:03,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788352910] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:40:03,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:40:03,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 21:40:03,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143618067] [2023-11-23 21:40:03,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:40:03,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:40:03,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:40:03,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:40:03,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:40:03,347 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 67 [2023-11-23 21:40:03,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 48 transitions, 114 flow. Second operand has 5 states, 5 states have (on average 36.8) internal successors, (184), 5 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:40:03,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:40:03,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 67 [2023-11-23 21:40:03,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:40:04,564 INFO L124 PetriNetUnfolderBase]: 7449/11598 cut-off events. [2023-11-23 21:40:04,564 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2023-11-23 21:40:04,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22230 conditions, 11598 events. 7449/11598 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 652. Compared 83628 event pairs, 1511 based on Foata normal form. 0/11239 useless extension candidates. Maximal degree in co-relation 22219. Up to 6408 conditions per place. [2023-11-23 21:40:04,641 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 35 selfloop transitions, 3 changer transitions 56/115 dead transitions. [2023-11-23 21:40:04,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 115 transitions, 440 flow [2023-11-23 21:40:04,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 21:40:04,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-23 21:40:04,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 368 transitions. [2023-11-23 21:40:04,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6865671641791045 [2023-11-23 21:40:04,644 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 368 transitions. [2023-11-23 21:40:04,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 368 transitions. [2023-11-23 21:40:04,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:40:04,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 368 transitions. [2023-11-23 21:40:04,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 46.0) internal successors, (368), 8 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:40:04,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:40:04,648 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:40:04,648 INFO L175 Difference]: Start difference. First operand has 65 places, 48 transitions, 114 flow. Second operand 8 states and 368 transitions. [2023-11-23 21:40:04,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 115 transitions, 440 flow [2023-11-23 21:40:04,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 115 transitions, 429 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-23 21:40:04,655 INFO L231 Difference]: Finished difference. Result has 70 places, 49 transitions, 138 flow [2023-11-23 21:40:04,655 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=138, PETRI_PLACES=70, PETRI_TRANSITIONS=49} [2023-11-23 21:40:04,656 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -4 predicate places. [2023-11-23 21:40:04,656 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 49 transitions, 138 flow [2023-11-23 21:40:04,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.8) internal successors, (184), 5 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:40:04,656 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:40:04,656 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:40:04,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-23 21:40:04,657 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-23 21:40:04,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:40:04,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1466223166, now seen corresponding path program 1 times [2023-11-23 21:40:04,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:40:04,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743156138] [2023-11-23 21:40:04,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:40:04,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:40:04,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:40:04,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:40:04,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:40:04,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743156138] [2023-11-23 21:40:04,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743156138] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:40:04,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:40:04,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:40:04,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561758650] [2023-11-23 21:40:04,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:40:04,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:40:04,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:40:04,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:40:04,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:40:04,909 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 67 [2023-11-23 21:40:04,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 49 transitions, 138 flow. Second operand has 6 states, 6 states have (on average 33.5) internal successors, (201), 6 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:40:04,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:40:04,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 67 [2023-11-23 21:40:04,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:40:08,041 INFO L124 PetriNetUnfolderBase]: 17377/25564 cut-off events. [2023-11-23 21:40:08,041 INFO L125 PetriNetUnfolderBase]: For 10180/10180 co-relation queries the response was YES. [2023-11-23 21:40:08,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58153 conditions, 25564 events. 17377/25564 cut-off events. For 10180/10180 co-relation queries the response was YES. Maximal size of possible extension queue 1185. Compared 177293 event pairs, 2711 based on Foata normal form. 700/26089 useless extension candidates. Maximal degree in co-relation 58137. Up to 9689 conditions per place. [2023-11-23 21:40:08,176 INFO L140 encePairwiseOnDemand]: 58/67 looper letters, 55 selfloop transitions, 6 changer transitions 79/158 dead transitions. [2023-11-23 21:40:08,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 158 transitions, 704 flow [2023-11-23 21:40:08,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 21:40:08,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-23 21:40:08,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 451 transitions. [2023-11-23 21:40:08,179 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.673134328358209 [2023-11-23 21:40:08,180 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 451 transitions. [2023-11-23 21:40:08,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 451 transitions. [2023-11-23 21:40:08,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:40:08,181 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 451 transitions. [2023-11-23 21:40:08,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 45.1) internal successors, (451), 10 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:40:08,185 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 67.0) internal successors, (737), 11 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:40:08,185 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 67.0) internal successors, (737), 11 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:40:08,185 INFO L175 Difference]: Start difference. First operand has 70 places, 49 transitions, 138 flow. Second operand 10 states and 451 transitions. [2023-11-23 21:40:08,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 158 transitions, 704 flow [2023-11-23 21:40:08,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 158 transitions, 681 flow, removed 10 selfloop flow, removed 3 redundant places. [2023-11-23 21:40:08,457 INFO L231 Difference]: Finished difference. Result has 79 places, 53 transitions, 207 flow [2023-11-23 21:40:08,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=207, PETRI_PLACES=79, PETRI_TRANSITIONS=53} [2023-11-23 21:40:08,458 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 5 predicate places. [2023-11-23 21:40:08,458 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 53 transitions, 207 flow [2023-11-23 21:40:08,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 33.5) internal successors, (201), 6 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:40:08,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:40:08,459 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:40:08,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-23 21:40:08,459 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-23 21:40:08,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:40:08,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1542090851, now seen corresponding path program 1 times [2023-11-23 21:40:08,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:40:08,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849308047] [2023-11-23 21:40:08,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:40:08,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:40:08,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:40:08,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:40:08,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:40:08,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849308047] [2023-11-23 21:40:08,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849308047] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:40:08,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:40:08,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 21:40:08,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867040095] [2023-11-23 21:40:08,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:40:08,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 21:40:08,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:40:08,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 21:40:08,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 21:40:08,693 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-23 21:40:08,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 53 transitions, 207 flow. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:40:08,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:40:08,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-23 21:40:08,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:40:13,505 INFO L124 PetriNetUnfolderBase]: 27504/40264 cut-off events. [2023-11-23 21:40:13,505 INFO L125 PetriNetUnfolderBase]: For 38550/40068 co-relation queries the response was YES. [2023-11-23 21:40:13,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99145 conditions, 40264 events. 27504/40264 cut-off events. For 38550/40068 co-relation queries the response was YES. Maximal size of possible extension queue 1935. Compared 290004 event pairs, 4611 based on Foata normal form. 1226/39855 useless extension candidates. Maximal degree in co-relation 99121. Up to 22502 conditions per place. [2023-11-23 21:40:13,857 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 57 selfloop transitions, 6 changer transitions 0/87 dead transitions. [2023-11-23 21:40:13,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 87 transitions, 427 flow [2023-11-23 21:40:13,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 21:40:13,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-23 21:40:13,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 194 transitions. [2023-11-23 21:40:13,859 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7238805970149254 [2023-11-23 21:40:13,859 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 194 transitions. [2023-11-23 21:40:13,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 194 transitions. [2023-11-23 21:40:13,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:40:13,859 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 194 transitions. [2023-11-23 21:40:13,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 48.5) internal successors, (194), 4 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:40:13,861 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:40:13,861 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:40:13,861 INFO L175 Difference]: Start difference. First operand has 79 places, 53 transitions, 207 flow. Second operand 4 states and 194 transitions. [2023-11-23 21:40:13,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 87 transitions, 427 flow [2023-11-23 21:40:14,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 87 transitions, 411 flow, removed 7 selfloop flow, removed 5 redundant places. [2023-11-23 21:40:14,239 INFO L231 Difference]: Finished difference. Result has 73 places, 58 transitions, 237 flow [2023-11-23 21:40:14,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=237, PETRI_PLACES=73, PETRI_TRANSITIONS=58} [2023-11-23 21:40:14,240 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -1 predicate places. [2023-11-23 21:40:14,240 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 58 transitions, 237 flow [2023-11-23 21:40:14,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:40:14,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:40:14,241 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:40:14,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-23 21:40:14,241 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-23 21:40:14,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:40:14,241 INFO L85 PathProgramCache]: Analyzing trace with hash 503865664, now seen corresponding path program 1 times [2023-11-23 21:40:14,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:40:14,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473482245] [2023-11-23 21:40:14,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:40:14,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:40:14,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:40:14,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:40:14,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:40:14,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473482245] [2023-11-23 21:40:14,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473482245] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:40:14,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:40:14,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 21:40:14,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942000595] [2023-11-23 21:40:14,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:40:14,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:40:14,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:40:14,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:40:14,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:40:14,583 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-23 21:40:14,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 58 transitions, 237 flow. Second operand has 5 states, 5 states have (on average 36.4) internal successors, (182), 5 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:40:14,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:40:14,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-23 21:40:14,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:40:18,197 INFO L124 PetriNetUnfolderBase]: 21503/31457 cut-off events. [2023-11-23 21:40:18,197 INFO L125 PetriNetUnfolderBase]: For 23792/24907 co-relation queries the response was YES. [2023-11-23 21:40:18,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82183 conditions, 31457 events. 21503/31457 cut-off events. For 23792/24907 co-relation queries the response was YES. Maximal size of possible extension queue 1488. Compared 217689 event pairs, 2521 based on Foata normal form. 1088/31214 useless extension candidates. Maximal degree in co-relation 82160. Up to 12025 conditions per place. [2023-11-23 21:40:18,558 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 74 selfloop transitions, 10 changer transitions 0/108 dead transitions. [2023-11-23 21:40:18,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 108 transitions, 564 flow [2023-11-23 21:40:18,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 21:40:18,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-23 21:40:18,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 247 transitions. [2023-11-23 21:40:18,561 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7373134328358208 [2023-11-23 21:40:18,561 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 247 transitions. [2023-11-23 21:40:18,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 247 transitions. [2023-11-23 21:40:18,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:40:18,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 247 transitions. [2023-11-23 21:40:18,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 49.4) internal successors, (247), 5 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:40:18,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:40:18,564 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:40:18,564 INFO L175 Difference]: Start difference. First operand has 73 places, 58 transitions, 237 flow. Second operand 5 states and 247 transitions. [2023-11-23 21:40:18,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 108 transitions, 564 flow [2023-11-23 21:40:18,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 108 transitions, 561 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-23 21:40:18,573 INFO L231 Difference]: Finished difference. Result has 78 places, 63 transitions, 302 flow [2023-11-23 21:40:18,573 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=302, PETRI_PLACES=78, PETRI_TRANSITIONS=63} [2023-11-23 21:40:18,574 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 4 predicate places. [2023-11-23 21:40:18,574 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 63 transitions, 302 flow [2023-11-23 21:40:18,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.4) internal successors, (182), 5 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:40:18,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:40:18,575 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:40:18,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-23 21:40:18,575 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-23 21:40:18,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:40:18,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1723246457, now seen corresponding path program 1 times [2023-11-23 21:40:18,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:40:18,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876621198] [2023-11-23 21:40:18,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:40:18,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:40:18,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:40:18,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:40:18,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:40:18,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876621198] [2023-11-23 21:40:18,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876621198] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:40:18,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:40:18,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:40:18,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297687759] [2023-11-23 21:40:18,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:40:18,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:40:18,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:40:18,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:40:18,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:40:18,981 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-23 21:40:18,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 63 transitions, 302 flow. Second operand has 6 states, 6 states have (on average 36.333333333333336) internal successors, (218), 6 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:40:18,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:40:18,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-23 21:40:18,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:40:21,950 INFO L124 PetriNetUnfolderBase]: 16371/23601 cut-off events. [2023-11-23 21:40:21,950 INFO L125 PetriNetUnfolderBase]: For 31708/32654 co-relation queries the response was YES. [2023-11-23 21:40:22,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68543 conditions, 23601 events. 16371/23601 cut-off events. For 31708/32654 co-relation queries the response was YES. Maximal size of possible extension queue 1241. Compared 153515 event pairs, 1597 based on Foata normal form. 680/23084 useless extension candidates. Maximal degree in co-relation 68517. Up to 7960 conditions per place. [2023-11-23 21:40:22,079 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 89 selfloop transitions, 14 changer transitions 0/127 dead transitions. [2023-11-23 21:40:22,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 127 transitions, 725 flow [2023-11-23 21:40:22,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:40:22,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-23 21:40:22,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 298 transitions. [2023-11-23 21:40:22,088 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7412935323383084 [2023-11-23 21:40:22,089 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 298 transitions. [2023-11-23 21:40:22,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 298 transitions. [2023-11-23 21:40:22,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:40:22,089 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 298 transitions. [2023-11-23 21:40:22,091 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 49.666666666666664) internal successors, (298), 6 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:40:22,093 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:40:22,093 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:40:22,093 INFO L175 Difference]: Start difference. First operand has 78 places, 63 transitions, 302 flow. Second operand 6 states and 298 transitions. [2023-11-23 21:40:22,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 127 transitions, 725 flow [2023-11-23 21:40:22,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 127 transitions, 709 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-23 21:40:22,113 INFO L231 Difference]: Finished difference. Result has 83 places, 68 transitions, 372 flow [2023-11-23 21:40:22,113 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=372, PETRI_PLACES=83, PETRI_TRANSITIONS=68} [2023-11-23 21:40:22,114 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 9 predicate places. [2023-11-23 21:40:22,115 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 68 transitions, 372 flow [2023-11-23 21:40:22,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.333333333333336) internal successors, (218), 6 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:40:22,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:40:22,115 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:40:22,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-23 21:40:22,116 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-23 21:40:22,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:40:22,116 INFO L85 PathProgramCache]: Analyzing trace with hash -45171071, now seen corresponding path program 1 times [2023-11-23 21:40:22,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:40:22,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043349951] [2023-11-23 21:40:22,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:40:22,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:40:22,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:40:22,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:40:22,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:40:22,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043349951] [2023-11-23 21:40:22,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043349951] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:40:22,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:40:22,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 21:40:22,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135447631] [2023-11-23 21:40:22,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:40:22,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:40:22,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:40:22,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:40:22,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:40:22,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 67 [2023-11-23 21:40:22,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 68 transitions, 372 flow. Second operand has 6 states, 6 states have (on average 37.5) internal successors, (225), 6 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:40:22,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:40:22,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 67 [2023-11-23 21:40:22,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:40:26,286 INFO L124 PetriNetUnfolderBase]: 15424/25530 cut-off events. [2023-11-23 21:40:26,286 INFO L125 PetriNetUnfolderBase]: For 42835/47494 co-relation queries the response was YES. [2023-11-23 21:40:26,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74337 conditions, 25530 events. 15424/25530 cut-off events. For 42835/47494 co-relation queries the response was YES. Maximal size of possible extension queue 1590. Compared 215324 event pairs, 5974 based on Foata normal form. 629/23600 useless extension candidates. Maximal degree in co-relation 74309. Up to 10176 conditions per place. [2023-11-23 21:40:26,457 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 65 selfloop transitions, 3 changer transitions 20/128 dead transitions. [2023-11-23 21:40:26,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 128 transitions, 774 flow [2023-11-23 21:40:26,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:40:26,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-23 21:40:26,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 288 transitions. [2023-11-23 21:40:26,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7164179104477612 [2023-11-23 21:40:26,460 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 288 transitions. [2023-11-23 21:40:26,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 288 transitions. [2023-11-23 21:40:26,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:40:26,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 288 transitions. [2023-11-23 21:40:26,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 48.0) internal successors, (288), 6 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:40:26,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:40:26,463 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:40:26,463 INFO L175 Difference]: Start difference. First operand has 83 places, 68 transitions, 372 flow. Second operand 6 states and 288 transitions. [2023-11-23 21:40:26,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 128 transitions, 774 flow [2023-11-23 21:40:26,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 128 transitions, 743 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-11-23 21:40:26,735 INFO L231 Difference]: Finished difference. Result has 89 places, 70 transitions, 376 flow [2023-11-23 21:40:26,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=376, PETRI_PLACES=89, PETRI_TRANSITIONS=70} [2023-11-23 21:40:26,736 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 15 predicate places. [2023-11-23 21:40:26,736 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 70 transitions, 376 flow [2023-11-23 21:40:26,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.5) internal successors, (225), 6 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:40:26,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:40:26,737 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:40:26,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-23 21:40:26,737 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-23 21:40:26,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:40:26,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1445560451, now seen corresponding path program 2 times [2023-11-23 21:40:26,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:40:26,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124045265] [2023-11-23 21:40:26,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:40:26,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:40:26,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:40:27,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:40:27,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:40:27,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124045265] [2023-11-23 21:40:27,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124045265] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:40:27,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:40:27,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 21:40:27,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858820346] [2023-11-23 21:40:27,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:40:27,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 21:40:27,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:40:27,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 21:40:27,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-23 21:40:27,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-23 21:40:27,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 70 transitions, 376 flow. Second operand has 7 states, 7 states have (on average 38.714285714285715) internal successors, (271), 7 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:40:27,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:40:27,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-23 21:40:27,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:40:29,180 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse10 (= (mod v_~b$r_buff1_thd4~0_66 256) 0)) (.cse7 (= (mod v_~b$r_buff0_thd4~0_68 256) 0))) (let ((.cse8 (not .cse7)) (.cse1 (and (= (mod v_~b$w_buff1_used~0_127 256) 0) .cse7)) (.cse3 (and .cse10 .cse7)) (.cse11 (= (mod v_~b$w_buff0_used~0_138 256) 0))) (let ((.cse4 (or .cse1 .cse3 .cse11)) (.cse5 (and .cse8 (not .cse11))) (.cse6 (= (mod v_~b$w_buff1_used~0_126 256) 0)) (.cse2 (= (mod v_~b$w_buff0_used~0_137 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~b$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~b$w_buff1_used~0_127 0)) v_~b$w_buff1_used~0_126) (= v_~b$flush_delayed~0_33 0) (= (ite .cse0 v_~b$w_buff0_used~0_138 (ite .cse4 v_~b$w_buff0_used~0_138 (ite .cse5 0 v_~b$w_buff0_used~0_138))) v_~b$w_buff0_used~0_137) (= v_~b$w_buff1~0_44 v_~b$w_buff1~0_43) (= v_~b$w_buff0~0_53 v_~b$w_buff0~0_52) (= v_~b$mem_tmp~0_20 v_~b~0_73) (= (ite .cse0 v_~b$r_buff0_thd4~0_68 (ite (or (and .cse6 .cse7) .cse2 .cse3) v_~b$r_buff0_thd4~0_68 (ite (and .cse8 (not .cse2)) 0 v_~b$r_buff0_thd4~0_68))) v_~b$r_buff0_thd4~0_67) (= (ite .cse4 v_~b~0_73 (ite .cse5 v_~b$w_buff0~0_53 v_~b$w_buff1~0_44)) v_~__unbuffered_p3_EBX~0_18) (= v_~b$r_buff1_thd4~0_65 (ite .cse0 v_~b$r_buff1_thd4~0_66 (ite (let ((.cse9 (= (mod v_~b$r_buff0_thd4~0_67 256) 0))) (or (and .cse6 .cse9) .cse2 (and .cse10 .cse9))) v_~b$r_buff1_thd4~0_66 0))) (= v_~b~0_72 (ite .cse0 v_~b$mem_tmp~0_20 v_~__unbuffered_p3_EBX~0_18)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_138, ~b~0=v_~b~0_73, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_127, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_66, ~b$w_buff1~0=v_~b$w_buff1~0_44, ~b$w_buff0~0=v_~b$w_buff0~0_53, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_68} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~b$flush_delayed~0=v_~b$flush_delayed~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_137, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~b~0=v_~b~0_72, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_126, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_65, ~b$w_buff1~0=v_~b$w_buff1~0_43, ~b$w_buff0~0=v_~b$w_buff0~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_67} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork3_#t~nondet3, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~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][66], [Black: 190#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), Black: 186#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork1InUse, 66#L815true, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, Black: 136#(and (<= ~z~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 205#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 132#(<= ~z~0 0), P3Thread1of1ForFork3InUse, Black: 199#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 138#(and (<= ~z~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 147#true, 226#true, Black: 211#(= ~x~0 1), Black: 220#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1)), 23#L847true, Black: 218#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), Black: 162#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 70#L795true, Black: 160#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 149#(= ~__unbuffered_p3_EAX~0 0), Black: 150#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 125#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1131~0#1.base| 0) |ULTIMATE.start_main_~#t1132~0#1.base| 0) |ULTIMATE.start_main_~#t1130~0#1.base| 0) |ULTIMATE.start_main_~#t1129~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1131~0#1.base| |ULTIMATE.start_main_~#t1130~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1129~0#1.base| |ULTIMATE.start_main_~#t1132~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1130~0#1.base| |ULTIMATE.start_main_~#t1129~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1130~0#1.base| |ULTIMATE.start_main_~#t1132~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1131~0#1.base| |ULTIMATE.start_main_~#t1132~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1131~0#1.base| |ULTIMATE.start_main_~#t1129~0#1.base|))), Black: 176#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 28#L879true, 13#L768true, 216#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 178#(and (<= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)))]) [2023-11-23 21:40:29,180 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-11-23 21:40:29,180 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-23 21:40:29,181 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-23 21:40:29,181 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-23 21:40:29,884 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse10 (= (mod v_~b$r_buff1_thd4~0_66 256) 0)) (.cse7 (= (mod v_~b$r_buff0_thd4~0_68 256) 0))) (let ((.cse8 (not .cse7)) (.cse1 (and (= (mod v_~b$w_buff1_used~0_127 256) 0) .cse7)) (.cse3 (and .cse10 .cse7)) (.cse11 (= (mod v_~b$w_buff0_used~0_138 256) 0))) (let ((.cse4 (or .cse1 .cse3 .cse11)) (.cse5 (and .cse8 (not .cse11))) (.cse6 (= (mod v_~b$w_buff1_used~0_126 256) 0)) (.cse2 (= (mod v_~b$w_buff0_used~0_137 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~b$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~b$w_buff1_used~0_127 0)) v_~b$w_buff1_used~0_126) (= v_~b$flush_delayed~0_33 0) (= (ite .cse0 v_~b$w_buff0_used~0_138 (ite .cse4 v_~b$w_buff0_used~0_138 (ite .cse5 0 v_~b$w_buff0_used~0_138))) v_~b$w_buff0_used~0_137) (= v_~b$w_buff1~0_44 v_~b$w_buff1~0_43) (= v_~b$w_buff0~0_53 v_~b$w_buff0~0_52) (= v_~b$mem_tmp~0_20 v_~b~0_73) (= (ite .cse0 v_~b$r_buff0_thd4~0_68 (ite (or (and .cse6 .cse7) .cse2 .cse3) v_~b$r_buff0_thd4~0_68 (ite (and .cse8 (not .cse2)) 0 v_~b$r_buff0_thd4~0_68))) v_~b$r_buff0_thd4~0_67) (= (ite .cse4 v_~b~0_73 (ite .cse5 v_~b$w_buff0~0_53 v_~b$w_buff1~0_44)) v_~__unbuffered_p3_EBX~0_18) (= v_~b$r_buff1_thd4~0_65 (ite .cse0 v_~b$r_buff1_thd4~0_66 (ite (let ((.cse9 (= (mod v_~b$r_buff0_thd4~0_67 256) 0))) (or (and .cse6 .cse9) .cse2 (and .cse10 .cse9))) v_~b$r_buff1_thd4~0_66 0))) (= v_~b~0_72 (ite .cse0 v_~b$mem_tmp~0_20 v_~__unbuffered_p3_EBX~0_18)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_138, ~b~0=v_~b~0_73, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_127, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_66, ~b$w_buff1~0=v_~b$w_buff1~0_44, ~b$w_buff0~0=v_~b$w_buff0~0_53, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_68} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~b$flush_delayed~0=v_~b$flush_delayed~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_137, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~b~0=v_~b~0_72, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_126, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_65, ~b$w_buff1~0=v_~b$w_buff1~0_43, ~b$w_buff0~0=v_~b$w_buff0~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_67} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork3_#t~nondet3, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~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][66], [Black: 186#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork1InUse, 66#L815true, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, Black: 136#(and (<= ~z~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 205#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 132#(<= ~z~0 0), P3Thread1of1ForFork3InUse, Black: 199#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 138#(and (<= ~z~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 147#true, 226#true, Black: 211#(= ~x~0 1), Black: 220#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1)), 23#L847true, Black: 218#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), Black: 162#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 160#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 149#(= ~__unbuffered_p3_EAX~0 0), Black: 150#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 125#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1131~0#1.base| 0) |ULTIMATE.start_main_~#t1132~0#1.base| 0) |ULTIMATE.start_main_~#t1130~0#1.base| 0) |ULTIMATE.start_main_~#t1129~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1131~0#1.base| |ULTIMATE.start_main_~#t1130~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1129~0#1.base| |ULTIMATE.start_main_~#t1132~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1130~0#1.base| |ULTIMATE.start_main_~#t1129~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1130~0#1.base| |ULTIMATE.start_main_~#t1132~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1131~0#1.base| |ULTIMATE.start_main_~#t1132~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1131~0#1.base| |ULTIMATE.start_main_~#t1129~0#1.base|))), 203#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 27#P1EXITtrue, Black: 178#(and (<= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 28#L879true, 13#L768true, 176#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 216#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))]) [2023-11-23 21:40:29,885 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-23 21:40:29,885 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-23 21:40:29,885 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-23 21:40:29,885 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-23 21:40:29,904 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse10 (= (mod v_~b$r_buff1_thd4~0_66 256) 0)) (.cse7 (= (mod v_~b$r_buff0_thd4~0_68 256) 0))) (let ((.cse8 (not .cse7)) (.cse1 (and (= (mod v_~b$w_buff1_used~0_127 256) 0) .cse7)) (.cse3 (and .cse10 .cse7)) (.cse11 (= (mod v_~b$w_buff0_used~0_138 256) 0))) (let ((.cse4 (or .cse1 .cse3 .cse11)) (.cse5 (and .cse8 (not .cse11))) (.cse6 (= (mod v_~b$w_buff1_used~0_126 256) 0)) (.cse2 (= (mod v_~b$w_buff0_used~0_137 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~b$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~b$w_buff1_used~0_127 0)) v_~b$w_buff1_used~0_126) (= v_~b$flush_delayed~0_33 0) (= (ite .cse0 v_~b$w_buff0_used~0_138 (ite .cse4 v_~b$w_buff0_used~0_138 (ite .cse5 0 v_~b$w_buff0_used~0_138))) v_~b$w_buff0_used~0_137) (= v_~b$w_buff1~0_44 v_~b$w_buff1~0_43) (= v_~b$w_buff0~0_53 v_~b$w_buff0~0_52) (= v_~b$mem_tmp~0_20 v_~b~0_73) (= (ite .cse0 v_~b$r_buff0_thd4~0_68 (ite (or (and .cse6 .cse7) .cse2 .cse3) v_~b$r_buff0_thd4~0_68 (ite (and .cse8 (not .cse2)) 0 v_~b$r_buff0_thd4~0_68))) v_~b$r_buff0_thd4~0_67) (= (ite .cse4 v_~b~0_73 (ite .cse5 v_~b$w_buff0~0_53 v_~b$w_buff1~0_44)) v_~__unbuffered_p3_EBX~0_18) (= v_~b$r_buff1_thd4~0_65 (ite .cse0 v_~b$r_buff1_thd4~0_66 (ite (let ((.cse9 (= (mod v_~b$r_buff0_thd4~0_67 256) 0))) (or (and .cse6 .cse9) .cse2 (and .cse10 .cse9))) v_~b$r_buff1_thd4~0_66 0))) (= v_~b~0_72 (ite .cse0 v_~b$mem_tmp~0_20 v_~__unbuffered_p3_EBX~0_18)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_138, ~b~0=v_~b~0_73, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_127, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_66, ~b$w_buff1~0=v_~b$w_buff1~0_44, ~b$w_buff0~0=v_~b$w_buff0~0_53, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_68} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~b$flush_delayed~0=v_~b$flush_delayed~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_137, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~b~0=v_~b~0_72, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_126, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_65, ~b$w_buff1~0=v_~b$w_buff1~0_43, ~b$w_buff0~0=v_~b$w_buff0~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_67} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork3_#t~nondet3, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~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][66], [Black: 186#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 20#P2EXITtrue, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, Black: 136#(and (<= ~z~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 205#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 132#(<= ~z~0 0), P3Thread1of1ForFork3InUse, Black: 199#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 138#(and (<= ~z~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 147#true, 226#true, Black: 211#(= ~x~0 1), Black: 220#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1)), 23#L847true, Black: 218#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), Black: 162#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 70#L795true, Black: 160#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 149#(= ~__unbuffered_p3_EAX~0 0), Black: 150#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 125#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1131~0#1.base| 0) |ULTIMATE.start_main_~#t1132~0#1.base| 0) |ULTIMATE.start_main_~#t1130~0#1.base| 0) |ULTIMATE.start_main_~#t1129~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1131~0#1.base| |ULTIMATE.start_main_~#t1130~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1129~0#1.base| |ULTIMATE.start_main_~#t1132~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1130~0#1.base| |ULTIMATE.start_main_~#t1129~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1130~0#1.base| |ULTIMATE.start_main_~#t1132~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1131~0#1.base| |ULTIMATE.start_main_~#t1132~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1131~0#1.base| |ULTIMATE.start_main_~#t1129~0#1.base|))), 203#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), Black: 178#(and (<= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 28#L879true, 13#L768true, 176#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 216#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))]) [2023-11-23 21:40:29,904 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-23 21:40:29,904 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-23 21:40:29,904 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-23 21:40:29,904 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-23 21:40:30,311 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse10 (= (mod v_~b$r_buff1_thd4~0_66 256) 0)) (.cse7 (= (mod v_~b$r_buff0_thd4~0_68 256) 0))) (let ((.cse8 (not .cse7)) (.cse1 (and (= (mod v_~b$w_buff1_used~0_127 256) 0) .cse7)) (.cse3 (and .cse10 .cse7)) (.cse11 (= (mod v_~b$w_buff0_used~0_138 256) 0))) (let ((.cse4 (or .cse1 .cse3 .cse11)) (.cse5 (and .cse8 (not .cse11))) (.cse6 (= (mod v_~b$w_buff1_used~0_126 256) 0)) (.cse2 (= (mod v_~b$w_buff0_used~0_137 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~b$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~b$w_buff1_used~0_127 0)) v_~b$w_buff1_used~0_126) (= v_~b$flush_delayed~0_33 0) (= (ite .cse0 v_~b$w_buff0_used~0_138 (ite .cse4 v_~b$w_buff0_used~0_138 (ite .cse5 0 v_~b$w_buff0_used~0_138))) v_~b$w_buff0_used~0_137) (= v_~b$w_buff1~0_44 v_~b$w_buff1~0_43) (= v_~b$w_buff0~0_53 v_~b$w_buff0~0_52) (= v_~b$mem_tmp~0_20 v_~b~0_73) (= (ite .cse0 v_~b$r_buff0_thd4~0_68 (ite (or (and .cse6 .cse7) .cse2 .cse3) v_~b$r_buff0_thd4~0_68 (ite (and .cse8 (not .cse2)) 0 v_~b$r_buff0_thd4~0_68))) v_~b$r_buff0_thd4~0_67) (= (ite .cse4 v_~b~0_73 (ite .cse5 v_~b$w_buff0~0_53 v_~b$w_buff1~0_44)) v_~__unbuffered_p3_EBX~0_18) (= v_~b$r_buff1_thd4~0_65 (ite .cse0 v_~b$r_buff1_thd4~0_66 (ite (let ((.cse9 (= (mod v_~b$r_buff0_thd4~0_67 256) 0))) (or (and .cse6 .cse9) .cse2 (and .cse10 .cse9))) v_~b$r_buff1_thd4~0_66 0))) (= v_~b~0_72 (ite .cse0 v_~b$mem_tmp~0_20 v_~__unbuffered_p3_EBX~0_18)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_138, ~b~0=v_~b~0_73, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_127, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_66, ~b$w_buff1~0=v_~b$w_buff1~0_44, ~b$w_buff0~0=v_~b$w_buff0~0_53, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_68} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~b$flush_delayed~0=v_~b$flush_delayed~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_137, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~b~0=v_~b~0_72, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_126, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_65, ~b$w_buff1~0=v_~b$w_buff1~0_43, ~b$w_buff0~0=v_~b$w_buff0~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_67} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork3_#t~nondet3, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~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][66], [Black: 186#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork1InUse, 66#L815true, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, Black: 136#(and (<= ~z~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 205#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 132#(<= ~z~0 0), P3Thread1of1ForFork3InUse, Black: 199#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 138#(and (<= ~z~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 147#true, 226#true, Black: 211#(= ~x~0 1), Black: 220#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1)), 23#L847true, Black: 218#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), Black: 162#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 160#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 149#(= ~__unbuffered_p3_EAX~0 0), 36#L881true, Black: 150#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 125#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1131~0#1.base| 0) |ULTIMATE.start_main_~#t1132~0#1.base| 0) |ULTIMATE.start_main_~#t1130~0#1.base| 0) |ULTIMATE.start_main_~#t1129~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1131~0#1.base| |ULTIMATE.start_main_~#t1130~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1129~0#1.base| |ULTIMATE.start_main_~#t1132~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1130~0#1.base| |ULTIMATE.start_main_~#t1129~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1130~0#1.base| |ULTIMATE.start_main_~#t1132~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1131~0#1.base| |ULTIMATE.start_main_~#t1132~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1131~0#1.base| |ULTIMATE.start_main_~#t1129~0#1.base|))), 203#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 27#P1EXITtrue, Black: 178#(and (<= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 13#L768true, 176#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 216#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))]) [2023-11-23 21:40:30,311 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-23 21:40:30,311 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-23 21:40:30,311 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-23 21:40:30,312 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-23 21:40:30,323 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse10 (= (mod v_~b$r_buff1_thd4~0_66 256) 0)) (.cse7 (= (mod v_~b$r_buff0_thd4~0_68 256) 0))) (let ((.cse8 (not .cse7)) (.cse1 (and (= (mod v_~b$w_buff1_used~0_127 256) 0) .cse7)) (.cse3 (and .cse10 .cse7)) (.cse11 (= (mod v_~b$w_buff0_used~0_138 256) 0))) (let ((.cse4 (or .cse1 .cse3 .cse11)) (.cse5 (and .cse8 (not .cse11))) (.cse6 (= (mod v_~b$w_buff1_used~0_126 256) 0)) (.cse2 (= (mod v_~b$w_buff0_used~0_137 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~b$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~b$w_buff1_used~0_127 0)) v_~b$w_buff1_used~0_126) (= v_~b$flush_delayed~0_33 0) (= (ite .cse0 v_~b$w_buff0_used~0_138 (ite .cse4 v_~b$w_buff0_used~0_138 (ite .cse5 0 v_~b$w_buff0_used~0_138))) v_~b$w_buff0_used~0_137) (= v_~b$w_buff1~0_44 v_~b$w_buff1~0_43) (= v_~b$w_buff0~0_53 v_~b$w_buff0~0_52) (= v_~b$mem_tmp~0_20 v_~b~0_73) (= (ite .cse0 v_~b$r_buff0_thd4~0_68 (ite (or (and .cse6 .cse7) .cse2 .cse3) v_~b$r_buff0_thd4~0_68 (ite (and .cse8 (not .cse2)) 0 v_~b$r_buff0_thd4~0_68))) v_~b$r_buff0_thd4~0_67) (= (ite .cse4 v_~b~0_73 (ite .cse5 v_~b$w_buff0~0_53 v_~b$w_buff1~0_44)) v_~__unbuffered_p3_EBX~0_18) (= v_~b$r_buff1_thd4~0_65 (ite .cse0 v_~b$r_buff1_thd4~0_66 (ite (let ((.cse9 (= (mod v_~b$r_buff0_thd4~0_67 256) 0))) (or (and .cse6 .cse9) .cse2 (and .cse10 .cse9))) v_~b$r_buff1_thd4~0_66 0))) (= v_~b~0_72 (ite .cse0 v_~b$mem_tmp~0_20 v_~__unbuffered_p3_EBX~0_18)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_138, ~b~0=v_~b~0_73, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_127, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_66, ~b$w_buff1~0=v_~b$w_buff1~0_44, ~b$w_buff0~0=v_~b$w_buff0~0_53, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_68} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~b$flush_delayed~0=v_~b$flush_delayed~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_137, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~b~0=v_~b~0_72, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_126, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_65, ~b$w_buff1~0=v_~b$w_buff1~0_43, ~b$w_buff0~0=v_~b$w_buff0~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_67} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork3_#t~nondet3, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~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][66], [Black: 190#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 20#P2EXITtrue, 44#L798true, P2Thread1of1ForFork1InUse, 186#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, Black: 136#(and (<= ~z~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 132#(<= ~z~0 0), P3Thread1of1ForFork3InUse, Black: 199#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 138#(and (<= ~z~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 147#true, 226#true, Black: 211#(= ~x~0 1), Black: 220#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1)), 23#L847true, Black: 218#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), 205#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 162#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 160#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 149#(= ~__unbuffered_p3_EAX~0 0), Black: 150#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 125#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1131~0#1.base| 0) |ULTIMATE.start_main_~#t1132~0#1.base| 0) |ULTIMATE.start_main_~#t1130~0#1.base| 0) |ULTIMATE.start_main_~#t1129~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1131~0#1.base| |ULTIMATE.start_main_~#t1130~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1129~0#1.base| |ULTIMATE.start_main_~#t1132~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1130~0#1.base| |ULTIMATE.start_main_~#t1129~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1130~0#1.base| |ULTIMATE.start_main_~#t1132~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1131~0#1.base| |ULTIMATE.start_main_~#t1132~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1131~0#1.base| |ULTIMATE.start_main_~#t1129~0#1.base|))), Black: 178#(and (<= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 28#L879true, 13#L768true, 176#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 216#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))]) [2023-11-23 21:40:30,323 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-23 21:40:30,323 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-23 21:40:30,323 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-23 21:40:30,323 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-23 21:40:30,333 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse10 (= (mod v_~b$r_buff1_thd4~0_66 256) 0)) (.cse7 (= (mod v_~b$r_buff0_thd4~0_68 256) 0))) (let ((.cse8 (not .cse7)) (.cse1 (and (= (mod v_~b$w_buff1_used~0_127 256) 0) .cse7)) (.cse3 (and .cse10 .cse7)) (.cse11 (= (mod v_~b$w_buff0_used~0_138 256) 0))) (let ((.cse4 (or .cse1 .cse3 .cse11)) (.cse5 (and .cse8 (not .cse11))) (.cse6 (= (mod v_~b$w_buff1_used~0_126 256) 0)) (.cse2 (= (mod v_~b$w_buff0_used~0_137 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~b$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~b$w_buff1_used~0_127 0)) v_~b$w_buff1_used~0_126) (= v_~b$flush_delayed~0_33 0) (= (ite .cse0 v_~b$w_buff0_used~0_138 (ite .cse4 v_~b$w_buff0_used~0_138 (ite .cse5 0 v_~b$w_buff0_used~0_138))) v_~b$w_buff0_used~0_137) (= v_~b$w_buff1~0_44 v_~b$w_buff1~0_43) (= v_~b$w_buff0~0_53 v_~b$w_buff0~0_52) (= v_~b$mem_tmp~0_20 v_~b~0_73) (= (ite .cse0 v_~b$r_buff0_thd4~0_68 (ite (or (and .cse6 .cse7) .cse2 .cse3) v_~b$r_buff0_thd4~0_68 (ite (and .cse8 (not .cse2)) 0 v_~b$r_buff0_thd4~0_68))) v_~b$r_buff0_thd4~0_67) (= (ite .cse4 v_~b~0_73 (ite .cse5 v_~b$w_buff0~0_53 v_~b$w_buff1~0_44)) v_~__unbuffered_p3_EBX~0_18) (= v_~b$r_buff1_thd4~0_65 (ite .cse0 v_~b$r_buff1_thd4~0_66 (ite (let ((.cse9 (= (mod v_~b$r_buff0_thd4~0_67 256) 0))) (or (and .cse6 .cse9) .cse2 (and .cse10 .cse9))) v_~b$r_buff1_thd4~0_66 0))) (= v_~b~0_72 (ite .cse0 v_~b$mem_tmp~0_20 v_~__unbuffered_p3_EBX~0_18)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_138, ~b~0=v_~b~0_73, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_127, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_66, ~b$w_buff1~0=v_~b$w_buff1~0_44, ~b$w_buff0~0=v_~b$w_buff0~0_53, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_68} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~b$flush_delayed~0=v_~b$flush_delayed~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_137, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~b~0=v_~b~0_72, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_126, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_65, ~b$w_buff1~0=v_~b$w_buff1~0_43, ~b$w_buff0~0=v_~b$w_buff0~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_67} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork3_#t~nondet3, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~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][66], [Black: 186#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 20#P2EXITtrue, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, Black: 136#(and (<= ~z~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 205#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 132#(<= ~z~0 0), P3Thread1of1ForFork3InUse, Black: 199#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 138#(and (<= ~z~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 147#true, 226#true, Black: 211#(= ~x~0 1), Black: 220#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1)), 23#L847true, Black: 218#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), Black: 162#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 70#L795true, Black: 160#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 149#(= ~__unbuffered_p3_EAX~0 0), 36#L881true, Black: 150#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 125#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1131~0#1.base| 0) |ULTIMATE.start_main_~#t1132~0#1.base| 0) |ULTIMATE.start_main_~#t1130~0#1.base| 0) |ULTIMATE.start_main_~#t1129~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1131~0#1.base| |ULTIMATE.start_main_~#t1130~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1129~0#1.base| |ULTIMATE.start_main_~#t1132~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1130~0#1.base| |ULTIMATE.start_main_~#t1129~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1130~0#1.base| |ULTIMATE.start_main_~#t1132~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1131~0#1.base| |ULTIMATE.start_main_~#t1132~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1131~0#1.base| |ULTIMATE.start_main_~#t1129~0#1.base|))), 203#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), Black: 178#(and (<= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 13#L768true, 176#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 216#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))]) [2023-11-23 21:40:30,333 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-23 21:40:30,333 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-23 21:40:30,333 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-23 21:40:30,333 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-23 21:40:30,825 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse10 (= (mod v_~b$r_buff1_thd4~0_66 256) 0)) (.cse7 (= (mod v_~b$r_buff0_thd4~0_68 256) 0))) (let ((.cse8 (not .cse7)) (.cse1 (and (= (mod v_~b$w_buff1_used~0_127 256) 0) .cse7)) (.cse3 (and .cse10 .cse7)) (.cse11 (= (mod v_~b$w_buff0_used~0_138 256) 0))) (let ((.cse4 (or .cse1 .cse3 .cse11)) (.cse5 (and .cse8 (not .cse11))) (.cse6 (= (mod v_~b$w_buff1_used~0_126 256) 0)) (.cse2 (= (mod v_~b$w_buff0_used~0_137 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~b$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~b$w_buff1_used~0_127 0)) v_~b$w_buff1_used~0_126) (= v_~b$flush_delayed~0_33 0) (= (ite .cse0 v_~b$w_buff0_used~0_138 (ite .cse4 v_~b$w_buff0_used~0_138 (ite .cse5 0 v_~b$w_buff0_used~0_138))) v_~b$w_buff0_used~0_137) (= v_~b$w_buff1~0_44 v_~b$w_buff1~0_43) (= v_~b$w_buff0~0_53 v_~b$w_buff0~0_52) (= v_~b$mem_tmp~0_20 v_~b~0_73) (= (ite .cse0 v_~b$r_buff0_thd4~0_68 (ite (or (and .cse6 .cse7) .cse2 .cse3) v_~b$r_buff0_thd4~0_68 (ite (and .cse8 (not .cse2)) 0 v_~b$r_buff0_thd4~0_68))) v_~b$r_buff0_thd4~0_67) (= (ite .cse4 v_~b~0_73 (ite .cse5 v_~b$w_buff0~0_53 v_~b$w_buff1~0_44)) v_~__unbuffered_p3_EBX~0_18) (= v_~b$r_buff1_thd4~0_65 (ite .cse0 v_~b$r_buff1_thd4~0_66 (ite (let ((.cse9 (= (mod v_~b$r_buff0_thd4~0_67 256) 0))) (or (and .cse6 .cse9) .cse2 (and .cse10 .cse9))) v_~b$r_buff1_thd4~0_66 0))) (= v_~b~0_72 (ite .cse0 v_~b$mem_tmp~0_20 v_~__unbuffered_p3_EBX~0_18)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_138, ~b~0=v_~b~0_73, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_127, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_66, ~b$w_buff1~0=v_~b$w_buff1~0_44, ~b$w_buff0~0=v_~b$w_buff0~0_53, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_68} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~b$flush_delayed~0=v_~b$flush_delayed~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_137, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~b~0=v_~b~0_72, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_126, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_65, ~b$w_buff1~0=v_~b$w_buff1~0_43, ~b$w_buff0~0=v_~b$w_buff0~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_67} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork3_#t~nondet3, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~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][66], [Black: 190#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 20#P2EXITtrue, P2Thread1of1ForFork1InUse, 186#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, Black: 136#(and (<= ~z~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 132#(<= ~z~0 0), P3Thread1of1ForFork3InUse, Black: 199#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 138#(and (<= ~z~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 147#true, 226#true, Black: 211#(= ~x~0 1), Black: 220#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1)), 23#L847true, Black: 218#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), 205#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 162#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 160#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 149#(= ~__unbuffered_p3_EAX~0 0), Black: 150#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 125#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1131~0#1.base| 0) |ULTIMATE.start_main_~#t1132~0#1.base| 0) |ULTIMATE.start_main_~#t1130~0#1.base| 0) |ULTIMATE.start_main_~#t1129~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1131~0#1.base| |ULTIMATE.start_main_~#t1130~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1129~0#1.base| |ULTIMATE.start_main_~#t1132~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1130~0#1.base| |ULTIMATE.start_main_~#t1129~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1130~0#1.base| |ULTIMATE.start_main_~#t1132~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1131~0#1.base| |ULTIMATE.start_main_~#t1132~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1131~0#1.base| |ULTIMATE.start_main_~#t1129~0#1.base|))), 27#P1EXITtrue, Black: 178#(and (<= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 28#L879true, 13#L768true, 176#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 216#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))]) [2023-11-23 21:40:30,825 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-23 21:40:30,825 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-23 21:40:30,825 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-23 21:40:30,825 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-23 21:40:30,842 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse10 (= (mod v_~b$r_buff1_thd4~0_66 256) 0)) (.cse7 (= (mod v_~b$r_buff0_thd4~0_68 256) 0))) (let ((.cse8 (not .cse7)) (.cse1 (and (= (mod v_~b$w_buff1_used~0_127 256) 0) .cse7)) (.cse3 (and .cse10 .cse7)) (.cse11 (= (mod v_~b$w_buff0_used~0_138 256) 0))) (let ((.cse4 (or .cse1 .cse3 .cse11)) (.cse5 (and .cse8 (not .cse11))) (.cse6 (= (mod v_~b$w_buff1_used~0_126 256) 0)) (.cse2 (= (mod v_~b$w_buff0_used~0_137 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~b$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~b$w_buff1_used~0_127 0)) v_~b$w_buff1_used~0_126) (= v_~b$flush_delayed~0_33 0) (= (ite .cse0 v_~b$w_buff0_used~0_138 (ite .cse4 v_~b$w_buff0_used~0_138 (ite .cse5 0 v_~b$w_buff0_used~0_138))) v_~b$w_buff0_used~0_137) (= v_~b$w_buff1~0_44 v_~b$w_buff1~0_43) (= v_~b$w_buff0~0_53 v_~b$w_buff0~0_52) (= v_~b$mem_tmp~0_20 v_~b~0_73) (= (ite .cse0 v_~b$r_buff0_thd4~0_68 (ite (or (and .cse6 .cse7) .cse2 .cse3) v_~b$r_buff0_thd4~0_68 (ite (and .cse8 (not .cse2)) 0 v_~b$r_buff0_thd4~0_68))) v_~b$r_buff0_thd4~0_67) (= (ite .cse4 v_~b~0_73 (ite .cse5 v_~b$w_buff0~0_53 v_~b$w_buff1~0_44)) v_~__unbuffered_p3_EBX~0_18) (= v_~b$r_buff1_thd4~0_65 (ite .cse0 v_~b$r_buff1_thd4~0_66 (ite (let ((.cse9 (= (mod v_~b$r_buff0_thd4~0_67 256) 0))) (or (and .cse6 .cse9) .cse2 (and .cse10 .cse9))) v_~b$r_buff1_thd4~0_66 0))) (= v_~b~0_72 (ite .cse0 v_~b$mem_tmp~0_20 v_~__unbuffered_p3_EBX~0_18)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_138, ~b~0=v_~b~0_73, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_127, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_66, ~b$w_buff1~0=v_~b$w_buff1~0_44, ~b$w_buff0~0=v_~b$w_buff0~0_53, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_68} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~b$flush_delayed~0=v_~b$flush_delayed~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_137, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~b~0=v_~b~0_72, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_126, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_65, ~b$w_buff1~0=v_~b$w_buff1~0_43, ~b$w_buff0~0=v_~b$w_buff0~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_67} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork3_#t~nondet3, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~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][66], [Black: 190#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 20#P2EXITtrue, 44#L798true, P2Thread1of1ForFork1InUse, 186#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, Black: 136#(and (<= ~z~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 132#(<= ~z~0 0), P3Thread1of1ForFork3InUse, Black: 199#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 138#(and (<= ~z~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 147#true, 226#true, Black: 211#(= ~x~0 1), Black: 220#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1)), 23#L847true, Black: 218#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), 205#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 162#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 160#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 149#(= ~__unbuffered_p3_EAX~0 0), 36#L881true, Black: 150#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 125#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1131~0#1.base| 0) |ULTIMATE.start_main_~#t1132~0#1.base| 0) |ULTIMATE.start_main_~#t1130~0#1.base| 0) |ULTIMATE.start_main_~#t1129~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1131~0#1.base| |ULTIMATE.start_main_~#t1130~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1129~0#1.base| |ULTIMATE.start_main_~#t1132~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1130~0#1.base| |ULTIMATE.start_main_~#t1129~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1130~0#1.base| |ULTIMATE.start_main_~#t1132~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1131~0#1.base| |ULTIMATE.start_main_~#t1132~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1131~0#1.base| |ULTIMATE.start_main_~#t1129~0#1.base|))), Black: 178#(and (<= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 13#L768true, 176#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 216#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))]) [2023-11-23 21:40:30,843 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-23 21:40:30,843 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-23 21:40:30,843 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-23 21:40:30,843 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-23 21:40:30,844 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse10 (= (mod v_~b$r_buff1_thd4~0_66 256) 0)) (.cse7 (= (mod v_~b$r_buff0_thd4~0_68 256) 0))) (let ((.cse8 (not .cse7)) (.cse1 (and (= (mod v_~b$w_buff1_used~0_127 256) 0) .cse7)) (.cse3 (and .cse10 .cse7)) (.cse11 (= (mod v_~b$w_buff0_used~0_138 256) 0))) (let ((.cse4 (or .cse1 .cse3 .cse11)) (.cse5 (and .cse8 (not .cse11))) (.cse6 (= (mod v_~b$w_buff1_used~0_126 256) 0)) (.cse2 (= (mod v_~b$w_buff0_used~0_137 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~b$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~b$w_buff1_used~0_127 0)) v_~b$w_buff1_used~0_126) (= v_~b$flush_delayed~0_33 0) (= (ite .cse0 v_~b$w_buff0_used~0_138 (ite .cse4 v_~b$w_buff0_used~0_138 (ite .cse5 0 v_~b$w_buff0_used~0_138))) v_~b$w_buff0_used~0_137) (= v_~b$w_buff1~0_44 v_~b$w_buff1~0_43) (= v_~b$w_buff0~0_53 v_~b$w_buff0~0_52) (= v_~b$mem_tmp~0_20 v_~b~0_73) (= (ite .cse0 v_~b$r_buff0_thd4~0_68 (ite (or (and .cse6 .cse7) .cse2 .cse3) v_~b$r_buff0_thd4~0_68 (ite (and .cse8 (not .cse2)) 0 v_~b$r_buff0_thd4~0_68))) v_~b$r_buff0_thd4~0_67) (= (ite .cse4 v_~b~0_73 (ite .cse5 v_~b$w_buff0~0_53 v_~b$w_buff1~0_44)) v_~__unbuffered_p3_EBX~0_18) (= v_~b$r_buff1_thd4~0_65 (ite .cse0 v_~b$r_buff1_thd4~0_66 (ite (let ((.cse9 (= (mod v_~b$r_buff0_thd4~0_67 256) 0))) (or (and .cse6 .cse9) .cse2 (and .cse10 .cse9))) v_~b$r_buff1_thd4~0_66 0))) (= v_~b~0_72 (ite .cse0 v_~b$mem_tmp~0_20 v_~__unbuffered_p3_EBX~0_18)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_138, ~b~0=v_~b~0_73, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_127, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_66, ~b$w_buff1~0=v_~b$w_buff1~0_44, ~b$w_buff0~0=v_~b$w_buff0~0_53, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_68} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~b$flush_delayed~0=v_~b$flush_delayed~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_137, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~b~0=v_~b~0_72, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_126, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_65, ~b$w_buff1~0=v_~b$w_buff1~0_43, ~b$w_buff0~0=v_~b$w_buff0~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_67} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork3_#t~nondet3, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~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][66], [Black: 190#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 20#P2EXITtrue, 44#L798true, P2Thread1of1ForFork1InUse, 186#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, Black: 136#(and (<= ~z~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 132#(<= ~z~0 0), P3Thread1of1ForFork3InUse, Black: 199#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 138#(and (<= ~z~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 147#true, 226#true, Black: 211#(= ~x~0 1), Black: 220#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1)), 23#L847true, Black: 218#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), 205#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 162#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 160#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 149#(= ~__unbuffered_p3_EAX~0 0), 36#L881true, Black: 150#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 125#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1131~0#1.base| 0) |ULTIMATE.start_main_~#t1132~0#1.base| 0) |ULTIMATE.start_main_~#t1130~0#1.base| 0) |ULTIMATE.start_main_~#t1129~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1131~0#1.base| |ULTIMATE.start_main_~#t1130~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1129~0#1.base| |ULTIMATE.start_main_~#t1132~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1130~0#1.base| |ULTIMATE.start_main_~#t1129~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1130~0#1.base| |ULTIMATE.start_main_~#t1132~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1131~0#1.base| |ULTIMATE.start_main_~#t1132~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1131~0#1.base| |ULTIMATE.start_main_~#t1129~0#1.base|))), Black: 176#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 178#(and (<= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 13#L768true, 216#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))]) [2023-11-23 21:40:30,845 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-23 21:40:30,845 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-23 21:40:30,845 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-23 21:40:30,845 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-23 21:40:31,235 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse10 (= (mod v_~b$r_buff1_thd4~0_66 256) 0)) (.cse7 (= (mod v_~b$r_buff0_thd4~0_68 256) 0))) (let ((.cse8 (not .cse7)) (.cse1 (and (= (mod v_~b$w_buff1_used~0_127 256) 0) .cse7)) (.cse3 (and .cse10 .cse7)) (.cse11 (= (mod v_~b$w_buff0_used~0_138 256) 0))) (let ((.cse4 (or .cse1 .cse3 .cse11)) (.cse5 (and .cse8 (not .cse11))) (.cse6 (= (mod v_~b$w_buff1_used~0_126 256) 0)) (.cse2 (= (mod v_~b$w_buff0_used~0_137 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~b$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~b$w_buff1_used~0_127 0)) v_~b$w_buff1_used~0_126) (= v_~b$flush_delayed~0_33 0) (= (ite .cse0 v_~b$w_buff0_used~0_138 (ite .cse4 v_~b$w_buff0_used~0_138 (ite .cse5 0 v_~b$w_buff0_used~0_138))) v_~b$w_buff0_used~0_137) (= v_~b$w_buff1~0_44 v_~b$w_buff1~0_43) (= v_~b$w_buff0~0_53 v_~b$w_buff0~0_52) (= v_~b$mem_tmp~0_20 v_~b~0_73) (= (ite .cse0 v_~b$r_buff0_thd4~0_68 (ite (or (and .cse6 .cse7) .cse2 .cse3) v_~b$r_buff0_thd4~0_68 (ite (and .cse8 (not .cse2)) 0 v_~b$r_buff0_thd4~0_68))) v_~b$r_buff0_thd4~0_67) (= (ite .cse4 v_~b~0_73 (ite .cse5 v_~b$w_buff0~0_53 v_~b$w_buff1~0_44)) v_~__unbuffered_p3_EBX~0_18) (= v_~b$r_buff1_thd4~0_65 (ite .cse0 v_~b$r_buff1_thd4~0_66 (ite (let ((.cse9 (= (mod v_~b$r_buff0_thd4~0_67 256) 0))) (or (and .cse6 .cse9) .cse2 (and .cse10 .cse9))) v_~b$r_buff1_thd4~0_66 0))) (= v_~b~0_72 (ite .cse0 v_~b$mem_tmp~0_20 v_~__unbuffered_p3_EBX~0_18)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_138, ~b~0=v_~b~0_73, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_127, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_66, ~b$w_buff1~0=v_~b$w_buff1~0_44, ~b$w_buff0~0=v_~b$w_buff0~0_53, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_68} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~b$flush_delayed~0=v_~b$flush_delayed~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_137, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~b~0=v_~b~0_72, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_126, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_65, ~b$w_buff1~0=v_~b$w_buff1~0_43, ~b$w_buff0~0=v_~b$w_buff0~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_67} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork3_#t~nondet3, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~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][66], [Black: 190#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 20#P2EXITtrue, P2Thread1of1ForFork1InUse, 186#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, Black: 136#(and (<= ~z~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 132#(<= ~z~0 0), P3Thread1of1ForFork3InUse, Black: 199#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 138#(and (<= ~z~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 147#true, 226#true, Black: 211#(= ~x~0 1), Black: 220#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1)), 23#L847true, Black: 218#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), 205#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 162#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 160#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 149#(= ~__unbuffered_p3_EAX~0 0), 36#L881true, Black: 150#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 125#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1131~0#1.base| 0) |ULTIMATE.start_main_~#t1132~0#1.base| 0) |ULTIMATE.start_main_~#t1130~0#1.base| 0) |ULTIMATE.start_main_~#t1129~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1131~0#1.base| |ULTIMATE.start_main_~#t1130~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1129~0#1.base| |ULTIMATE.start_main_~#t1132~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1130~0#1.base| |ULTIMATE.start_main_~#t1129~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1130~0#1.base| |ULTIMATE.start_main_~#t1132~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1131~0#1.base| |ULTIMATE.start_main_~#t1132~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1131~0#1.base| |ULTIMATE.start_main_~#t1129~0#1.base|))), 27#P1EXITtrue, Black: 178#(and (<= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 13#L768true, 176#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 216#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))]) [2023-11-23 21:40:31,235 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-23 21:40:31,235 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-23 21:40:31,235 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-23 21:40:31,235 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-23 21:40:31,236 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse10 (= (mod v_~b$r_buff1_thd4~0_66 256) 0)) (.cse7 (= (mod v_~b$r_buff0_thd4~0_68 256) 0))) (let ((.cse8 (not .cse7)) (.cse1 (and (= (mod v_~b$w_buff1_used~0_127 256) 0) .cse7)) (.cse3 (and .cse10 .cse7)) (.cse11 (= (mod v_~b$w_buff0_used~0_138 256) 0))) (let ((.cse4 (or .cse1 .cse3 .cse11)) (.cse5 (and .cse8 (not .cse11))) (.cse6 (= (mod v_~b$w_buff1_used~0_126 256) 0)) (.cse2 (= (mod v_~b$w_buff0_used~0_137 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~b$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~b$w_buff1_used~0_127 0)) v_~b$w_buff1_used~0_126) (= v_~b$flush_delayed~0_33 0) (= (ite .cse0 v_~b$w_buff0_used~0_138 (ite .cse4 v_~b$w_buff0_used~0_138 (ite .cse5 0 v_~b$w_buff0_used~0_138))) v_~b$w_buff0_used~0_137) (= v_~b$w_buff1~0_44 v_~b$w_buff1~0_43) (= v_~b$w_buff0~0_53 v_~b$w_buff0~0_52) (= v_~b$mem_tmp~0_20 v_~b~0_73) (= (ite .cse0 v_~b$r_buff0_thd4~0_68 (ite (or (and .cse6 .cse7) .cse2 .cse3) v_~b$r_buff0_thd4~0_68 (ite (and .cse8 (not .cse2)) 0 v_~b$r_buff0_thd4~0_68))) v_~b$r_buff0_thd4~0_67) (= (ite .cse4 v_~b~0_73 (ite .cse5 v_~b$w_buff0~0_53 v_~b$w_buff1~0_44)) v_~__unbuffered_p3_EBX~0_18) (= v_~b$r_buff1_thd4~0_65 (ite .cse0 v_~b$r_buff1_thd4~0_66 (ite (let ((.cse9 (= (mod v_~b$r_buff0_thd4~0_67 256) 0))) (or (and .cse6 .cse9) .cse2 (and .cse10 .cse9))) v_~b$r_buff1_thd4~0_66 0))) (= v_~b~0_72 (ite .cse0 v_~b$mem_tmp~0_20 v_~__unbuffered_p3_EBX~0_18)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_138, ~b~0=v_~b~0_73, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_127, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_66, ~b$w_buff1~0=v_~b$w_buff1~0_44, ~b$w_buff0~0=v_~b$w_buff0~0_53, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_68} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~b$flush_delayed~0=v_~b$flush_delayed~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_137, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~b~0=v_~b~0_72, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_126, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_65, ~b$w_buff1~0=v_~b$w_buff1~0_43, ~b$w_buff0~0=v_~b$w_buff0~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_67} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork3_#t~nondet3, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~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][66], [Black: 190#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 20#P2EXITtrue, P2Thread1of1ForFork1InUse, 186#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, Black: 136#(and (<= ~z~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 132#(<= ~z~0 0), P3Thread1of1ForFork3InUse, Black: 199#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 138#(and (<= ~z~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 147#true, 226#true, Black: 211#(= ~x~0 1), Black: 220#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1)), 23#L847true, Black: 218#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), 205#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 162#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 160#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 149#(= ~__unbuffered_p3_EAX~0 0), 36#L881true, Black: 150#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 125#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1131~0#1.base| 0) |ULTIMATE.start_main_~#t1132~0#1.base| 0) |ULTIMATE.start_main_~#t1130~0#1.base| 0) |ULTIMATE.start_main_~#t1129~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1131~0#1.base| |ULTIMATE.start_main_~#t1130~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1129~0#1.base| |ULTIMATE.start_main_~#t1132~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1130~0#1.base| |ULTIMATE.start_main_~#t1129~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1130~0#1.base| |ULTIMATE.start_main_~#t1132~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1131~0#1.base| |ULTIMATE.start_main_~#t1132~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1131~0#1.base| |ULTIMATE.start_main_~#t1129~0#1.base|))), 27#P1EXITtrue, Black: 176#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 178#(and (<= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 13#L768true, 216#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1))]) [2023-11-23 21:40:31,236 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-23 21:40:31,236 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-23 21:40:31,236 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-23 21:40:31,236 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-23 21:40:33,672 INFO L124 PetriNetUnfolderBase]: 23284/39803 cut-off events. [2023-11-23 21:40:33,672 INFO L125 PetriNetUnfolderBase]: For 57163/67779 co-relation queries the response was YES. [2023-11-23 21:40:33,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110080 conditions, 39803 events. 23284/39803 cut-off events. For 57163/67779 co-relation queries the response was YES. Maximal size of possible extension queue 2800. Compared 373383 event pairs, 7967 based on Foata normal form. 705/35918 useless extension candidates. Maximal degree in co-relation 110049. Up to 17438 conditions per place. [2023-11-23 21:40:33,975 INFO L140 encePairwiseOnDemand]: 57/67 looper letters, 66 selfloop transitions, 17 changer transitions 18/146 dead transitions. [2023-11-23 21:40:33,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 146 transitions, 856 flow [2023-11-23 21:40:33,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 21:40:33,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-23 21:40:33,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 387 transitions. [2023-11-23 21:40:33,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7220149253731343 [2023-11-23 21:40:33,978 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 387 transitions. [2023-11-23 21:40:33,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 387 transitions. [2023-11-23 21:40:33,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:40:33,979 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 387 transitions. [2023-11-23 21:40:33,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 48.375) internal successors, (387), 8 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:40:33,982 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:40:33,982 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:40:33,982 INFO L175 Difference]: Start difference. First operand has 89 places, 70 transitions, 376 flow. Second operand 8 states and 387 transitions. [2023-11-23 21:40:33,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 146 transitions, 856 flow [2023-11-23 21:40:34,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 146 transitions, 841 flow, removed 7 selfloop flow, removed 3 redundant places. [2023-11-23 21:40:34,450 INFO L231 Difference]: Finished difference. Result has 97 places, 89 transitions, 516 flow [2023-11-23 21:40:34,450 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=516, PETRI_PLACES=97, PETRI_TRANSITIONS=89} [2023-11-23 21:40:34,451 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 23 predicate places. [2023-11-23 21:40:34,451 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 89 transitions, 516 flow [2023-11-23 21:40:34,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 38.714285714285715) internal successors, (271), 7 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:40:34,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:40:34,451 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:40:34,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-23 21:40:34,451 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-23 21:40:34,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:40:34,452 INFO L85 PathProgramCache]: Analyzing trace with hash -2091057001, now seen corresponding path program 3 times [2023-11-23 21:40:34,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:40:34,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055221858] [2023-11-23 21:40:34,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:40:34,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:40:34,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:40:34,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:40:34,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:40:34,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055221858] [2023-11-23 21:40:34,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055221858] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:40:34,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:40:35,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 21:40:35,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429316401] [2023-11-23 21:40:35,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:40:35,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 21:40:35,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:40:35,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 21:40:35,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-23 21:40:35,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-23 21:40:35,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 89 transitions, 516 flow. Second operand has 7 states, 7 states have (on average 36.142857142857146) internal successors, (253), 7 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:40:35,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:40:35,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-23 21:40:35,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand