./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc 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_f8e24005-90aa-4971-ae6d-5e59d19d063c/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e24005-90aa-4971-ae6d-5e59d19d063c/bin/uautomizer-verify-NlZe1sFDwI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e24005-90aa-4971-ae6d-5e59d19d063c/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e24005-90aa-4971-ae6d-5e59d19d063c/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e24005-90aa-4971-ae6d-5e59d19d063c/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e24005-90aa-4971-ae6d-5e59d19d063c/bin/uautomizer-verify-NlZe1sFDwI --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 0b278c8af08551c2e27294e2c5dca8c5bd0f6f00874366f88466c32210c557af --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 21:43:38,608 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 21:43:38,715 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e24005-90aa-4971-ae6d-5e59d19d063c/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-24 21:43:38,725 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 21:43:38,728 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 21:43:38,780 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 21:43:38,781 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 21:43:38,782 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 21:43:38,784 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 21:43:38,792 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 21:43:38,793 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 21:43:38,793 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 21:43:38,794 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 21:43:38,795 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 21:43:38,795 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 21:43:38,796 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 21:43:38,797 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 21:43:38,797 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 21:43:38,797 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 21:43:38,798 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 21:43:38,798 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 21:43:38,800 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 21:43:38,800 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 21:43:38,801 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 21:43:38,801 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 21:43:38,802 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 21:43:38,802 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 21:43:38,803 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 21:43:38,804 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 21:43:38,805 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 21:43:38,805 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 21:43:38,806 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 21:43:38,806 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:43:38,807 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 21:43:38,807 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 21:43:38,807 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 21:43:38,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 21:43:38,808 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 21:43:38,808 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 21:43:38,808 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 21:43:38,809 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 21:43:38,809 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_f8e24005-90aa-4971-ae6d-5e59d19d063c/bin/uautomizer-verify-NlZe1sFDwI/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_f8e24005-90aa-4971-ae6d-5e59d19d063c/bin/uautomizer-verify-NlZe1sFDwI 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 -> 0b278c8af08551c2e27294e2c5dca8c5bd0f6f00874366f88466c32210c557af [2023-11-24 21:43:39,192 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 21:43:39,240 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 21:43:39,244 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 21:43:39,246 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 21:43:39,247 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 21:43:39,248 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e24005-90aa-4971-ae6d-5e59d19d063c/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i [2023-11-24 21:43:42,470 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 21:43:42,876 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 21:43:42,876 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e24005-90aa-4971-ae6d-5e59d19d063c/sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i [2023-11-24 21:43:42,905 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e24005-90aa-4971-ae6d-5e59d19d063c/bin/uautomizer-verify-NlZe1sFDwI/data/bb2acc790/94872195b2d24709a689a82dbaf052a3/FLAGede97ad2f [2023-11-24 21:43:42,920 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e24005-90aa-4971-ae6d-5e59d19d063c/bin/uautomizer-verify-NlZe1sFDwI/data/bb2acc790/94872195b2d24709a689a82dbaf052a3 [2023-11-24 21:43:42,922 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 21:43:42,924 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 21:43:42,925 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 21:43:42,925 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 21:43:42,931 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 21:43:42,932 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:43:42" (1/1) ... [2023-11-24 21:43:42,933 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a5b12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:43:42, skipping insertion in model container [2023-11-24 21:43:42,933 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:43:42" (1/1) ... [2023-11-24 21:43:42,992 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 21:43:43,437 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:43:43,454 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 21:43:43,566 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:43:43,626 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:43:43,626 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:43:43,634 INFO L206 MainTranslator]: Completed translation [2023-11-24 21:43:43,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:43:43 WrapperNode [2023-11-24 21:43:43,636 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 21:43:43,637 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 21:43:43,638 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 21:43:43,638 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 21:43:43,647 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:43:43" (1/1) ... [2023-11-24 21:43:43,689 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:43:43" (1/1) ... [2023-11-24 21:43:43,734 INFO L138 Inliner]: procedures = 177, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 166 [2023-11-24 21:43:43,735 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 21:43:43,735 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 21:43:43,736 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 21:43:43,736 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 21:43:43,748 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:43:43" (1/1) ... [2023-11-24 21:43:43,748 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:43:43" (1/1) ... [2023-11-24 21:43:43,753 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:43:43" (1/1) ... [2023-11-24 21:43:43,773 INFO L175 MemorySlicer]: Split 6 memory accesses to 5 slices as follows [2, 1, 1, 1, 1]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2023-11-24 21:43:43,773 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:43:43" (1/1) ... [2023-11-24 21:43:43,773 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:43:43" (1/1) ... [2023-11-24 21:43:43,801 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:43:43" (1/1) ... [2023-11-24 21:43:43,803 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:43:43" (1/1) ... [2023-11-24 21:43:43,808 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:43:43" (1/1) ... [2023-11-24 21:43:43,815 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:43:43" (1/1) ... [2023-11-24 21:43:43,820 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 21:43:43,832 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 21:43:43,832 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 21:43:43,832 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 21:43:43,833 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:43:43" (1/1) ... [2023-11-24 21:43:43,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:43:43,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e24005-90aa-4971-ae6d-5e59d19d063c/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:43:43,893 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e24005-90aa-4971-ae6d-5e59d19d063c/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-24 21:43:43,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e24005-90aa-4971-ae6d-5e59d19d063c/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-24 21:43:43,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-24 21:43:43,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-24 21:43:43,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-24 21:43:43,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-24 21:43:43,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-24 21:43:43,946 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-24 21:43:43,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 21:43:43,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 21:43:43,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 21:43:43,947 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-24 21:43:43,949 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-24 21:43:43,949 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-24 21:43:43,950 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-24 21:43:43,950 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-24 21:43:43,950 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-24 21:43:43,951 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-24 21:43:43,951 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-24 21:43:43,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-24 21:43:43,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-24 21:43:43,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-24 21:43:43,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-24 21:43:43,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-24 21:43:43,953 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-24 21:43:43,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 21:43:43,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 21:43:43,956 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-24 21:43:44,194 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 21:43:44,196 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 21:43:44,748 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 21:43:45,040 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 21:43:45,040 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-24 21:43:45,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:43:45 BoogieIcfgContainer [2023-11-24 21:43:45,041 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 21:43:45,044 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 21:43:45,045 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 21:43:45,048 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 21:43:45,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 09:43:42" (1/3) ... [2023-11-24 21:43:45,049 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c181f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:43:45, skipping insertion in model container [2023-11-24 21:43:45,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:43:43" (2/3) ... [2023-11-24 21:43:45,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c181f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:43:45, skipping insertion in model container [2023-11-24 21:43:45,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:43:45" (3/3) ... [2023-11-24 21:43:45,052 INFO L112 eAbstractionObserver]: Analyzing ICFG mix029_power.opt_pso.opt_rmo.opt.i [2023-11-24 21:43:45,074 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 21:43:45,075 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-24 21:43:45,075 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 21:43:45,137 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 21:43:45,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 66 transitions, 148 flow [2023-11-24 21:43:45,234 INFO L124 PetriNetUnfolderBase]: 2/62 cut-off events. [2023-11-24 21:43:45,235 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:43:45,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 62 events. 2/62 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 131 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2023-11-24 21:43:45,241 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 66 transitions, 148 flow [2023-11-24 21:43:45,252 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 62 transitions, 136 flow [2023-11-24 21:43:45,269 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 21:43:45,277 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;@3fbbc9c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 21:43:45,277 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-24 21:43:45,285 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-24 21:43:45,285 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-24 21:43:45,285 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:43:45,285 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:43:45,286 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 21:43:45,287 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:43:45,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:43:45,294 INFO L85 PathProgramCache]: Analyzing trace with hash 13540, now seen corresponding path program 1 times [2023-11-24 21:43:45,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:43:45,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386162444] [2023-11-24 21:43:45,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:43:45,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:43:45,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:43:45,720 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-24 21:43:45,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:43:45,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386162444] [2023-11-24 21:43:45,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386162444] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:43:45,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:43:45,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:43:45,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566365565] [2023-11-24 21:43:45,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:43:45,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:43:45,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:43:45,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:43:45,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:43:45,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-24 21:43:45,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 62 transitions, 136 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-24 21:43:45,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:43:45,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-24 21:43:45,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:43:46,905 INFO L124 PetriNetUnfolderBase]: 2178/3812 cut-off events. [2023-11-24 21:43:46,905 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2023-11-24 21:43:46,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6962 conditions, 3812 events. 2178/3812 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 29442 event pairs, 1704 based on Foata normal form. 180/3625 useless extension candidates. Maximal degree in co-relation 6947. Up to 2412 conditions per place. [2023-11-24 21:43:46,962 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 33 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2023-11-24 21:43:46,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 67 transitions, 216 flow [2023-11-24 21:43:46,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:43:46,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:43:46,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-24 21:43:46,981 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7373737373737373 [2023-11-24 21:43:46,982 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-24 21:43:46,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-24 21:43:46,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:43:46,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-24 21:43:46,994 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-24 21:43:46,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 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-24 21:43:47,000 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 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-24 21:43:47,002 INFO L175 Difference]: Start difference. First operand has 73 places, 62 transitions, 136 flow. Second operand 3 states and 146 transitions. [2023-11-24 21:43:47,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 67 transitions, 216 flow [2023-11-24 21:43:47,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 67 transitions, 212 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-24 21:43:47,020 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 128 flow [2023-11-24 21:43:47,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, 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-24 21:43:47,027 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -4 predicate places. [2023-11-24 21:43:47,027 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 128 flow [2023-11-24 21:43:47,028 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-24 21:43:47,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:43:47,028 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 21:43:47,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 21:43:47,029 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:43:47,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:43:47,029 INFO L85 PathProgramCache]: Analyzing trace with hash 13541, now seen corresponding path program 1 times [2023-11-24 21:43:47,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:43:47,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208998135] [2023-11-24 21:43:47,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:43:47,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:43:47,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:43:47,166 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-24 21:43:47,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:43:47,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208998135] [2023-11-24 21:43:47,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208998135] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:43:47,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:43:47,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:43:47,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168081566] [2023-11-24 21:43:47,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:43:47,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:43:47,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:43:47,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:43:47,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:43:47,192 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 66 [2023-11-24 21:43:47,192 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.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-24 21:43:47,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:43:47,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 66 [2023-11-24 21:43:47,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:43:47,983 INFO L124 PetriNetUnfolderBase]: 2178/3811 cut-off events. [2023-11-24 21:43:47,983 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2023-11-24 21:43:47,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7048 conditions, 3811 events. 2178/3811 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 29373 event pairs, 1704 based on Foata normal form. 1/3445 useless extension candidates. Maximal degree in co-relation 7037. Up to 2411 conditions per place. [2023-11-24 21:43:48,101 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 32 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-11-24 21:43:48,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 66 transitions, 212 flow [2023-11-24 21:43:48,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:43:48,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:43:48,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-24 21:43:48,103 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7373737373737373 [2023-11-24 21:43:48,103 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-24 21:43:48,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-24 21:43:48,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:43:48,104 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-24 21:43:48,105 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-24 21:43:48,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 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-24 21:43:48,107 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 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-24 21:43:48,107 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 128 flow. Second operand 3 states and 146 transitions. [2023-11-24 21:43:48,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 66 transitions, 212 flow [2023-11-24 21:43:48,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 66 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:43:48,115 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 126 flow [2023-11-24 21:43:48,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, 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-24 21:43:48,117 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -5 predicate places. [2023-11-24 21:43:48,117 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 126 flow [2023-11-24 21:43:48,117 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-24 21:43:48,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:43:48,118 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:43:48,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 21:43:48,118 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:43:48,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:43:48,119 INFO L85 PathProgramCache]: Analyzing trace with hash 403798867, now seen corresponding path program 1 times [2023-11-24 21:43:48,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:43:48,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451722309] [2023-11-24 21:43:48,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:43:48,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:43:48,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:43:48,179 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-24 21:43:48,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:43:48,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451722309] [2023-11-24 21:43:48,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451722309] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:43:48,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:43:48,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:43:48,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143197322] [2023-11-24 21:43:48,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:43:48,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:43:48,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:43:48,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:43:48,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:43:48,203 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-24 21:43:48,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 126 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-24 21:43:48,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:43:48,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-24 21:43:48,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:43:49,056 INFO L124 PetriNetUnfolderBase]: 2179/3809 cut-off events. [2023-11-24 21:43:49,057 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2023-11-24 21:43:49,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7049 conditions, 3809 events. 2179/3809 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 29467 event pairs, 1704 based on Foata normal form. 0/3446 useless extension candidates. Maximal degree in co-relation 7038. Up to 2411 conditions per place. [2023-11-24 21:43:49,096 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 33 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2023-11-24 21:43:49,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 65 transitions, 212 flow [2023-11-24 21:43:49,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:43:49,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:43:49,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2023-11-24 21:43:49,099 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2023-11-24 21:43:49,099 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 144 transitions. [2023-11-24 21:43:49,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 144 transitions. [2023-11-24 21:43:49,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:43:49,100 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 144 transitions. [2023-11-24 21:43:49,101 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-24 21:43:49,102 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 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-24 21:43:49,102 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 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-24 21:43:49,103 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 126 flow. Second operand 3 states and 144 transitions. [2023-11-24 21:43:49,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 65 transitions, 212 flow [2023-11-24 21:43:49,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 65 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:43:49,111 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 124 flow [2023-11-24 21:43:49,112 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, 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-24 21:43:49,113 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -6 predicate places. [2023-11-24 21:43:49,113 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 124 flow [2023-11-24 21:43:49,113 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-24 21:43:49,113 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:43:49,114 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:43:49,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 21:43:49,114 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:43:49,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:43:49,115 INFO L85 PathProgramCache]: Analyzing trace with hash 403798868, now seen corresponding path program 1 times [2023-11-24 21:43:49,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:43:49,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456887152] [2023-11-24 21:43:49,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:43:49,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:43:49,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:43:49,190 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-24 21:43:49,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:43:49,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456887152] [2023-11-24 21:43:49,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456887152] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:43:49,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:43:49,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:43:49,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507575667] [2023-11-24 21:43:49,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:43:49,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:43:49,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:43:49,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:43:49,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:43:49,226 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 66 [2023-11-24 21:43:49,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 124 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-24 21:43:49,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:43:49,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 66 [2023-11-24 21:43:49,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:43:49,910 INFO L124 PetriNetUnfolderBase]: 2178/3807 cut-off events. [2023-11-24 21:43:49,910 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2023-11-24 21:43:49,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7045 conditions, 3807 events. 2178/3807 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 28968 event pairs, 1442 based on Foata normal form. 2/3447 useless extension candidates. Maximal degree in co-relation 7035. Up to 2408 conditions per place. [2023-11-24 21:43:49,947 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 32 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-11-24 21:43:49,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 64 transitions, 208 flow [2023-11-24 21:43:49,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:43:49,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:43:49,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-24 21:43:49,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7373737373737373 [2023-11-24 21:43:49,949 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-24 21:43:49,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-24 21:43:49,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:43:49,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-24 21:43:49,950 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-24 21:43:49,952 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 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-24 21:43:49,952 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 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-24 21:43:49,952 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 124 flow. Second operand 3 states and 146 transitions. [2023-11-24 21:43:49,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 64 transitions, 208 flow [2023-11-24 21:43:49,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 64 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:43:49,958 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 122 flow [2023-11-24 21:43:49,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, 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=122, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2023-11-24 21:43:49,959 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -7 predicate places. [2023-11-24 21:43:49,959 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 122 flow [2023-11-24 21:43:49,960 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-24 21:43:49,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:43:49,960 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:43:49,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 21:43:49,961 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:43:49,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:43:49,961 INFO L85 PathProgramCache]: Analyzing trace with hash -630924897, now seen corresponding path program 1 times [2023-11-24 21:43:49,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:43:49,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946141160] [2023-11-24 21:43:49,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:43:49,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:43:49,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:43:50,021 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-24 21:43:50,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:43:50,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946141160] [2023-11-24 21:43:50,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946141160] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:43:50,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:43:50,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:43:50,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108540027] [2023-11-24 21:43:50,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:43:50,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:43:50,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:43:50,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:43:50,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:43:50,044 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-24 21:43:50,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 122 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-24 21:43:50,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:43:50,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-24 21:43:50,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:43:50,710 INFO L124 PetriNetUnfolderBase]: 2185/3808 cut-off events. [2023-11-24 21:43:50,710 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2023-11-24 21:43:50,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7059 conditions, 3808 events. 2185/3808 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 29236 event pairs, 1102 based on Foata normal form. 0/3459 useless extension candidates. Maximal degree in co-relation 7049. Up to 2409 conditions per place. [2023-11-24 21:43:50,746 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 33 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-11-24 21:43:50,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 63 transitions, 208 flow [2023-11-24 21:43:50,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:43:50,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:43:50,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2023-11-24 21:43:50,748 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2023-11-24 21:43:50,748 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 144 transitions. [2023-11-24 21:43:50,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 144 transitions. [2023-11-24 21:43:50,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:43:50,749 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 144 transitions. [2023-11-24 21:43:50,749 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-24 21:43:50,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 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-24 21:43:50,751 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 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-24 21:43:50,751 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 122 flow. Second operand 3 states and 144 transitions. [2023-11-24 21:43:50,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 63 transitions, 208 flow [2023-11-24 21:43:50,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 63 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:43:50,756 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 120 flow [2023-11-24 21:43:50,756 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=65, PETRI_TRANSITIONS=54} [2023-11-24 21:43:50,757 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -8 predicate places. [2023-11-24 21:43:50,758 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 120 flow [2023-11-24 21:43:50,758 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-24 21:43:50,758 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:43:50,758 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:43:50,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 21:43:50,759 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:43:50,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:43:50,760 INFO L85 PathProgramCache]: Analyzing trace with hash -630924896, now seen corresponding path program 1 times [2023-11-24 21:43:50,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:43:50,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439367030] [2023-11-24 21:43:50,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:43:50,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:43:50,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:43:50,851 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-24 21:43:50,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:43:50,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439367030] [2023-11-24 21:43:50,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439367030] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:43:50,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:43:50,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:43:50,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907621403] [2023-11-24 21:43:50,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:43:50,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:43:50,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:43:50,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:43:50,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:43:50,871 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 66 [2023-11-24 21:43:50,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 54 transitions, 120 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-24 21:43:50,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:43:50,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 66 [2023-11-24 21:43:50,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:43:51,597 INFO L124 PetriNetUnfolderBase]: 2178/3752 cut-off events. [2023-11-24 21:43:51,597 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2023-11-24 21:43:51,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6994 conditions, 3752 events. 2178/3752 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 27883 event pairs, 1729 based on Foata normal form. 6/3423 useless extension candidates. Maximal degree in co-relation 6984. Up to 2396 conditions per place. [2023-11-24 21:43:51,628 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 32 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-11-24 21:43:51,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 62 transitions, 204 flow [2023-11-24 21:43:51,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:43:51,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:43:51,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-24 21:43:51,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7373737373737373 [2023-11-24 21:43:51,630 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-24 21:43:51,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-24 21:43:51,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:43:51,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-24 21:43:51,631 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-24 21:43:51,632 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 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-24 21:43:51,633 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 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-24 21:43:51,633 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 120 flow. Second operand 3 states and 146 transitions. [2023-11-24 21:43:51,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 62 transitions, 204 flow [2023-11-24 21:43:51,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 62 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:43:51,638 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 118 flow [2023-11-24 21:43:51,638 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, 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-24 21:43:51,639 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -9 predicate places. [2023-11-24 21:43:51,639 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 118 flow [2023-11-24 21:43:51,640 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-24 21:43:51,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:43:51,640 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:43:51,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-24 21:43:51,641 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:43:51,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:43:51,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1106289211, now seen corresponding path program 1 times [2023-11-24 21:43:51,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:43:51,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916362783] [2023-11-24 21:43:51,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:43:51,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:43:51,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:43:51,722 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-24 21:43:51,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:43:51,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916362783] [2023-11-24 21:43:51,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916362783] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:43:51,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:43:51,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:43:51,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976187199] [2023-11-24 21:43:51,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:43:51,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:43:51,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:43:51,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:43:51,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:43:51,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-24 21:43:51,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 118 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-24 21:43:51,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:43:51,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-24 21:43:51,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:43:52,369 INFO L124 PetriNetUnfolderBase]: 2237/3806 cut-off events. [2023-11-24 21:43:52,369 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2023-11-24 21:43:52,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7137 conditions, 3806 events. 2237/3806 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 28649 event pairs, 1180 based on Foata normal form. 0/3517 useless extension candidates. Maximal degree in co-relation 7127. Up to 2407 conditions per place. [2023-11-24 21:43:52,409 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 33 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-11-24 21:43:52,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 61 transitions, 204 flow [2023-11-24 21:43:52,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:43:52,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:43:52,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2023-11-24 21:43:52,414 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2023-11-24 21:43:52,415 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 144 transitions. [2023-11-24 21:43:52,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 144 transitions. [2023-11-24 21:43:52,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:43:52,415 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 144 transitions. [2023-11-24 21:43:52,416 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-24 21:43:52,417 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 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-24 21:43:52,418 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 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-24 21:43:52,418 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 118 flow. Second operand 3 states and 144 transitions. [2023-11-24 21:43:52,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 61 transitions, 204 flow [2023-11-24 21:43:52,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 61 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:43:52,426 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 116 flow [2023-11-24 21:43:52,426 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, 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-24 21:43:52,428 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -10 predicate places. [2023-11-24 21:43:52,428 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 116 flow [2023-11-24 21:43:52,428 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-24 21:43:52,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:43:52,429 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:43:52,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-24 21:43:52,429 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:43:52,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:43:52,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1106289210, now seen corresponding path program 1 times [2023-11-24 21:43:52,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:43:52,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813610333] [2023-11-24 21:43:52,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:43:52,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:43:52,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:43:52,563 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-24 21:43:52,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:43:52,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813610333] [2023-11-24 21:43:52,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813610333] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:43:52,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:43:52,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:43:52,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765805402] [2023-11-24 21:43:52,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:43:52,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:43:52,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:43:52,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:43:52,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:43:52,583 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 66 [2023-11-24 21:43:52,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 116 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-24 21:43:52,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:43:52,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 66 [2023-11-24 21:43:52,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:43:53,168 INFO L124 PetriNetUnfolderBase]: 2178/3621 cut-off events. [2023-11-24 21:43:53,168 INFO L125 PetriNetUnfolderBase]: For 114/114 co-relation queries the response was YES. [2023-11-24 21:43:53,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6887 conditions, 3621 events. 2178/3621 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 27544 event pairs, 1156 based on Foata normal form. 30/3402 useless extension candidates. Maximal degree in co-relation 6877. Up to 2318 conditions per place. [2023-11-24 21:43:53,209 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 32 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-24 21:43:53,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 60 transitions, 200 flow [2023-11-24 21:43:53,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:43:53,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:43:53,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-24 21:43:53,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7373737373737373 [2023-11-24 21:43:53,213 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-24 21:43:53,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-24 21:43:53,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:43:53,213 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-24 21:43:53,214 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-24 21:43:53,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 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-24 21:43:53,215 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 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-24 21:43:53,215 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 116 flow. Second operand 3 states and 146 transitions. [2023-11-24 21:43:53,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 60 transitions, 200 flow [2023-11-24 21:43:53,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 60 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:43:53,219 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 114 flow [2023-11-24 21:43:53,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, 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-24 21:43:53,223 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -11 predicate places. [2023-11-24 21:43:53,223 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 114 flow [2023-11-24 21:43:53,223 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-24 21:43:53,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:43:53,223 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:43:53,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-24 21:43:53,224 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:43:53,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:43:53,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1106286955, now seen corresponding path program 1 times [2023-11-24 21:43:53,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:43:53,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825107376] [2023-11-24 21:43:53,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:43:53,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:43:53,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:43:53,347 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-24 21:43:53,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:43:53,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825107376] [2023-11-24 21:43:53,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825107376] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:43:53,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:43:53,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:43:53,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345409782] [2023-11-24 21:43:53,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:43:53,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:43:53,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:43:53,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:43:53,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:43:53,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 66 [2023-11-24 21:43:53,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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-24 21:43:53,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:43:53,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 66 [2023-11-24 21:43:53,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:43:53,843 INFO L124 PetriNetUnfolderBase]: 1711/2872 cut-off events. [2023-11-24 21:43:53,844 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2023-11-24 21:43:53,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5461 conditions, 2872 events. 1711/2872 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 20079 event pairs, 526 based on Foata normal form. 0/2827 useless extension candidates. Maximal degree in co-relation 5451. Up to 1924 conditions per place. [2023-11-24 21:43:53,873 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 35 selfloop transitions, 2 changer transitions 2/65 dead transitions. [2023-11-24 21:43:53,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 65 transitions, 226 flow [2023-11-24 21:43:53,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:43:53,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:43:53,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 154 transitions. [2023-11-24 21:43:53,874 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7777777777777778 [2023-11-24 21:43:53,874 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 154 transitions. [2023-11-24 21:43:53,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 154 transitions. [2023-11-24 21:43:53,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:43:53,875 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 154 transitions. [2023-11-24 21:43:53,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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-24 21:43:53,876 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 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-24 21:43:53,877 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 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-24 21:43:53,877 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 154 transitions. [2023-11-24 21:43:53,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 65 transitions, 226 flow [2023-11-24 21:43:53,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 65 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:43:53,879 INFO L231 Difference]: Finished difference. Result has 61 places, 49 transitions, 110 flow [2023-11-24 21:43:53,879 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, 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=110, PETRI_PLACES=61, PETRI_TRANSITIONS=49} [2023-11-24 21:43:53,881 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -12 predicate places. [2023-11-24 21:43:53,881 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 110 flow [2023-11-24 21:43:53,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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-24 21:43:53,881 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:43:53,881 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-24 21:43:53,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-24 21:43:53,882 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:43:53,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:43:53,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1500678094, now seen corresponding path program 1 times [2023-11-24 21:43:53,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:43:53,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325367845] [2023-11-24 21:43:53,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:43:53,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:43:53,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:43:54,861 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-24 21:43:54,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:43:54,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325367845] [2023-11-24 21:43:54,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325367845] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:43:54,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:43:54,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 21:43:54,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691493474] [2023-11-24 21:43:54,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:43:54,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-24 21:43:54,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:43:54,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-24 21:43:54,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-24 21:43:55,063 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 66 [2023-11-24 21:43:55,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 110 flow. Second operand has 8 states, 8 states have (on average 35.0) internal successors, (280), 8 states have internal predecessors, (280), 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-24 21:43:55,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:43:55,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 66 [2023-11-24 21:43:55,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:43:55,785 INFO L124 PetriNetUnfolderBase]: 1532/2587 cut-off events. [2023-11-24 21:43:55,785 INFO L125 PetriNetUnfolderBase]: For 156/156 co-relation queries the response was YES. [2023-11-24 21:43:55,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4992 conditions, 2587 events. 1532/2587 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 19066 event pairs, 686 based on Foata normal form. 72/2597 useless extension candidates. Maximal degree in co-relation 4981. Up to 1828 conditions per place. [2023-11-24 21:43:55,812 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 29 selfloop transitions, 4 changer transitions 9/66 dead transitions. [2023-11-24 21:43:55,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 66 transitions, 232 flow [2023-11-24 21:43:55,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 21:43:55,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-24 21:43:55,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 274 transitions. [2023-11-24 21:43:55,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5930735930735931 [2023-11-24 21:43:55,815 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 274 transitions. [2023-11-24 21:43:55,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 274 transitions. [2023-11-24 21:43:55,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:43:55,816 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 274 transitions. [2023-11-24 21:43:55,817 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 39.142857142857146) internal successors, (274), 7 states have internal predecessors, (274), 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-24 21:43:55,819 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 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-24 21:43:55,819 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 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-24 21:43:55,819 INFO L175 Difference]: Start difference. First operand has 61 places, 49 transitions, 110 flow. Second operand 7 states and 274 transitions. [2023-11-24 21:43:55,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 66 transitions, 232 flow [2023-11-24 21:43:55,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 66 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:43:55,822 INFO L231 Difference]: Finished difference. Result has 63 places, 47 transitions, 110 flow [2023-11-24 21:43:55,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=110, PETRI_PLACES=63, PETRI_TRANSITIONS=47} [2023-11-24 21:43:55,823 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -10 predicate places. [2023-11-24 21:43:55,824 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 47 transitions, 110 flow [2023-11-24 21:43:55,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 35.0) internal successors, (280), 8 states have internal predecessors, (280), 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-24 21:43:55,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:43:55,824 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-24 21:43:55,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-24 21:43:55,825 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:43:55,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:43:55,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1500679310, now seen corresponding path program 1 times [2023-11-24 21:43:55,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:43:55,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308656005] [2023-11-24 21:43:55,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:43:55,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:43:55,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:43:57,402 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-24 21:43:57,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:43:57,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308656005] [2023-11-24 21:43:57,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308656005] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:43:57,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:43:57,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:43:57,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851747421] [2023-11-24 21:43:57,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:43:57,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:43:57,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:43:57,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:43:57,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:43:57,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2023-11-24 21:43:57,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 47 transitions, 110 flow. Second operand has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:43:57,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:43:57,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2023-11-24 21:43:57,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:43:59,964 INFO L124 PetriNetUnfolderBase]: 9945/14440 cut-off events. [2023-11-24 21:43:59,964 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2023-11-24 21:44:00,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28167 conditions, 14440 events. 9945/14440 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 835. Compared 100800 event pairs, 1190 based on Foata normal form. 0/14132 useless extension candidates. Maximal degree in co-relation 28156. Up to 7490 conditions per place. [2023-11-24 21:44:00,058 INFO L140 encePairwiseOnDemand]: 52/66 looper letters, 44 selfloop transitions, 12 changer transitions 92/167 dead transitions. [2023-11-24 21:44:00,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 167 transitions, 654 flow [2023-11-24 21:44:00,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 21:44:00,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-24 21:44:00,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 535 transitions. [2023-11-24 21:44:00,061 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6755050505050505 [2023-11-24 21:44:00,061 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 535 transitions. [2023-11-24 21:44:00,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 535 transitions. [2023-11-24 21:44:00,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:44:00,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 535 transitions. [2023-11-24 21:44:00,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 44.583333333333336) internal successors, (535), 12 states have internal predecessors, (535), 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-24 21:44:00,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 66.0) internal successors, (858), 13 states have internal predecessors, (858), 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-24 21:44:00,067 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 66.0) internal successors, (858), 13 states have internal predecessors, (858), 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-24 21:44:00,067 INFO L175 Difference]: Start difference. First operand has 63 places, 47 transitions, 110 flow. Second operand 12 states and 535 transitions. [2023-11-24 21:44:00,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 167 transitions, 654 flow [2023-11-24 21:44:00,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 167 transitions, 645 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-24 21:44:00,071 INFO L231 Difference]: Finished difference. Result has 77 places, 56 transitions, 226 flow [2023-11-24 21:44:00,071 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=226, PETRI_PLACES=77, PETRI_TRANSITIONS=56} [2023-11-24 21:44:00,072 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 4 predicate places. [2023-11-24 21:44:00,072 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 56 transitions, 226 flow [2023-11-24 21:44:00,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:00,073 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:44:00,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, 1, 1] [2023-11-24 21:44:00,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-24 21:44:00,073 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:44:00,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:44:00,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1512089811, now seen corresponding path program 1 times [2023-11-24 21:44:00,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:44:00,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849632046] [2023-11-24 21:44:00,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:44:00,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:44:00,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:44:00,306 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-24 21:44:00,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:44:00,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849632046] [2023-11-24 21:44:00,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849632046] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:44:00,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:44:00,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:44:00,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107183455] [2023-11-24 21:44:00,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:44:00,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:44:00,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:44:00,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:44:00,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:44:00,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-24 21:44:00,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 56 transitions, 226 flow. Second operand has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 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-24 21:44:00,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:44:00,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-24 21:44:00,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:44:01,609 INFO L124 PetriNetUnfolderBase]: 5718/8974 cut-off events. [2023-11-24 21:44:01,610 INFO L125 PetriNetUnfolderBase]: For 18006/18787 co-relation queries the response was YES. [2023-11-24 21:44:01,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32247 conditions, 8974 events. 5718/8974 cut-off events. For 18006/18787 co-relation queries the response was YES. Maximal size of possible extension queue 547. Compared 64779 event pairs, 1593 based on Foata normal form. 424/9094 useless extension candidates. Maximal degree in co-relation 32227. Up to 4342 conditions per place. [2023-11-24 21:44:01,717 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 45 selfloop transitions, 5 changer transitions 35/113 dead transitions. [2023-11-24 21:44:01,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 113 transitions, 685 flow [2023-11-24 21:44:01,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 21:44:01,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-24 21:44:01,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 319 transitions. [2023-11-24 21:44:01,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6904761904761905 [2023-11-24 21:44:01,720 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 319 transitions. [2023-11-24 21:44:01,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 319 transitions. [2023-11-24 21:44:01,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:44:01,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 319 transitions. [2023-11-24 21:44:01,722 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 45.57142857142857) internal successors, (319), 7 states have internal predecessors, (319), 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-24 21:44:01,723 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 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-24 21:44:01,723 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 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-24 21:44:01,723 INFO L175 Difference]: Start difference. First operand has 77 places, 56 transitions, 226 flow. Second operand 7 states and 319 transitions. [2023-11-24 21:44:01,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 113 transitions, 685 flow [2023-11-24 21:44:01,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 113 transitions, 629 flow, removed 28 selfloop flow, removed 5 redundant places. [2023-11-24 21:44:01,993 INFO L231 Difference]: Finished difference. Result has 74 places, 58 transitions, 243 flow [2023-11-24 21:44:01,994 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=243, PETRI_PLACES=74, PETRI_TRANSITIONS=58} [2023-11-24 21:44:01,995 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 1 predicate places. [2023-11-24 21:44:01,995 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 58 transitions, 243 flow [2023-11-24 21:44:01,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 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-24 21:44:01,995 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:44:01,996 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:44:01,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-24 21:44:01,996 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:44:01,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:44:01,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1751025309, now seen corresponding path program 1 times [2023-11-24 21:44:01,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:44:01,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296407399] [2023-11-24 21:44:01,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:44:01,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:44:02,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:44:02,529 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-24 21:44:02,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:44:02,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296407399] [2023-11-24 21:44:02,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296407399] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:44:02,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:44:02,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:44:02,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517412945] [2023-11-24 21:44:02,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:44:02,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:44:02,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:44:02,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:44:02,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:44:02,536 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-24 21:44:02,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 58 transitions, 243 flow. Second operand has 6 states, 6 states have (on average 38.333333333333336) internal successors, (230), 6 states have internal predecessors, (230), 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-24 21:44:02,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:44:02,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-24 21:44:02,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:44:03,770 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([379] L858-->L864: Formula: (let ((.cse4 (not (= (mod v_~y$w_buff0_used~0_135 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd0~0_56 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_54 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff0_used~0_136 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_121 256) 0)) .cse3)) (.cse0 (and .cse4 .cse5))) (and (= (ite .cse0 0 v_~y$r_buff0_thd0~0_54) v_~y$r_buff0_thd0~0_53) (= (ite .cse1 0 v_~y$w_buff0_used~0_136) v_~y$w_buff0_used~0_135) (= v_~y~0_77 (ite .cse1 v_~y$w_buff0~0_69 (ite .cse2 v_~y$w_buff1~0_54 v_~y~0_78))) (= v_~y$w_buff1_used~0_120 (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_121)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_120 256) 0)) .cse3) (and (not (= (mod v_~y$r_buff0_thd0~0_53 256) 0)) .cse4)) 0 v_~y$r_buff1_thd0~0_56) v_~y$r_buff1_thd0~0_55)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_136, ~y$w_buff1~0=v_~y$w_buff1~0_54, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_54, ~y$w_buff0~0=v_~y$w_buff0~0_69, ~y~0=v_~y~0_78, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_56, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_121} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_135, ~y$w_buff1~0=v_~y$w_buff1~0_54, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_53, ~y$w_buff0~0=v_~y$w_buff0~0_69, ~y~0=v_~y~0_77, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_55, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_120} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0][57], [170#true, 33#P1EXITtrue, Black: 156#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), 2#L796true, Black: 161#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 159#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 14#L822true, 122#(and (not (= |ULTIMATE.start_main_~#t776~0#1.base| |ULTIMATE.start_main_~#t775~0#1.base|)) (not (= |ULTIMATE.start_main_~#t774~0#1.base| |ULTIMATE.start_main_~#t773~0#1.base|)) (not (= |ULTIMATE.start_main_~#t774~0#1.base| |ULTIMATE.start_main_~#t775~0#1.base|)) (not (= |ULTIMATE.start_main_~#t773~0#1.base| |ULTIMATE.start_main_~#t775~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t776~0#1.base| 0) |ULTIMATE.start_main_~#t773~0#1.base| 0) |ULTIMATE.start_main_~#t774~0#1.base| 0) |ULTIMATE.start_main_~#t775~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t773~0#1.base| |ULTIMATE.start_main_~#t776~0#1.base|)) (not (= |ULTIMATE.start_main_~#t774~0#1.base| |ULTIMATE.start_main_~#t776~0#1.base|))), Black: 155#(= ~__unbuffered_p3_EAX~0 0), P1Thread1of1ForFork0InUse, Black: 163#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P3Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 153#true, P2Thread1of1ForFork3InUse, 125#true, Black: 140#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 138#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 128#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 127#(= ~z~0 0), 31#L754true, 45#L864true]) [2023-11-24 21:44:03,770 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-24 21:44:03,770 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-24 21:44:03,770 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-24 21:44:03,770 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-24 21:44:03,771 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([456] L822-->L829: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd4~0_28 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_30 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_88 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_79 256) 0))))) (and (= (ite .cse0 v_~y$w_buff0~0_29 (ite .cse1 v_~y$w_buff1~0_20 v_~y~0_30)) v_~y~0_29) (= v_~y$w_buff0_used~0_87 (ite .cse0 0 v_~y$w_buff0_used~0_88)) (= (ite .cse2 0 v_~y$r_buff0_thd4~0_30) v_~y$r_buff0_thd4~0_29) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_78 256) 0))) (and .cse4 (not (= (mod v_~y$r_buff0_thd4~0_29 256) 0)))) 0 v_~y$r_buff1_thd4~0_28) v_~y$r_buff1_thd4~0_27) (= v_~y$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_79))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_30, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_88, ~y$w_buff1~0=v_~y$w_buff1~0_20, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_30, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_79} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_29, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_87, ~y$w_buff1~0=v_~y$w_buff1~0_20, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_29, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_78} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][53], [170#true, 33#P1EXITtrue, Black: 156#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), 2#L796true, Black: 161#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 159#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 122#(and (not (= |ULTIMATE.start_main_~#t776~0#1.base| |ULTIMATE.start_main_~#t775~0#1.base|)) (not (= |ULTIMATE.start_main_~#t774~0#1.base| |ULTIMATE.start_main_~#t773~0#1.base|)) (not (= |ULTIMATE.start_main_~#t774~0#1.base| |ULTIMATE.start_main_~#t775~0#1.base|)) (not (= |ULTIMATE.start_main_~#t773~0#1.base| |ULTIMATE.start_main_~#t775~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t776~0#1.base| 0) |ULTIMATE.start_main_~#t773~0#1.base| 0) |ULTIMATE.start_main_~#t774~0#1.base| 0) |ULTIMATE.start_main_~#t775~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t773~0#1.base| |ULTIMATE.start_main_~#t776~0#1.base|)) (not (= |ULTIMATE.start_main_~#t774~0#1.base| |ULTIMATE.start_main_~#t776~0#1.base|))), Black: 155#(= ~__unbuffered_p3_EAX~0 0), P1Thread1of1ForFork0InUse, Black: 163#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P3Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 153#true, P2Thread1of1ForFork3InUse, 125#true, 51#L829true, Black: 140#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 138#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 128#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 127#(= ~z~0 0), 31#L754true, 11#L858true]) [2023-11-24 21:44:03,771 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-24 21:44:03,771 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-24 21:44:03,771 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-24 21:44:03,771 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-24 21:44:04,374 INFO L124 PetriNetUnfolderBase]: 7334/11599 cut-off events. [2023-11-24 21:44:04,374 INFO L125 PetriNetUnfolderBase]: For 16016/17047 co-relation queries the response was YES. [2023-11-24 21:44:04,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37405 conditions, 11599 events. 7334/11599 cut-off events. For 16016/17047 co-relation queries the response was YES. Maximal size of possible extension queue 688. Compared 84871 event pairs, 2965 based on Foata normal form. 463/11470 useless extension candidates. Maximal degree in co-relation 37383. Up to 6762 conditions per place. [2023-11-24 21:44:04,537 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 38 selfloop transitions, 3 changer transitions 40/110 dead transitions. [2023-11-24 21:44:04,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 110 transitions, 626 flow [2023-11-24 21:44:04,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 21:44:04,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-24 21:44:04,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 320 transitions. [2023-11-24 21:44:04,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6926406926406926 [2023-11-24 21:44:04,540 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 320 transitions. [2023-11-24 21:44:04,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 320 transitions. [2023-11-24 21:44:04,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:44:04,540 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 320 transitions. [2023-11-24 21:44:04,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 45.714285714285715) internal successors, (320), 7 states have internal predecessors, (320), 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-24 21:44:04,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 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-24 21:44:04,543 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 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-24 21:44:04,543 INFO L175 Difference]: Start difference. First operand has 74 places, 58 transitions, 243 flow. Second operand 7 states and 320 transitions. [2023-11-24 21:44:04,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 110 transitions, 626 flow [2023-11-24 21:44:04,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 110 transitions, 611 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-11-24 21:44:04,716 INFO L231 Difference]: Finished difference. Result has 80 places, 60 transitions, 275 flow [2023-11-24 21:44:04,716 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=275, PETRI_PLACES=80, PETRI_TRANSITIONS=60} [2023-11-24 21:44:04,717 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 7 predicate places. [2023-11-24 21:44:04,717 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 60 transitions, 275 flow [2023-11-24 21:44:04,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.333333333333336) internal successors, (230), 6 states have internal predecessors, (230), 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-24 21:44:04,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:44:04,717 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] [2023-11-24 21:44:04,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-24 21:44:04,718 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:44:04,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:44:04,718 INFO L85 PathProgramCache]: Analyzing trace with hash -118595973, now seen corresponding path program 1 times [2023-11-24 21:44:04,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:44:04,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389561933] [2023-11-24 21:44:04,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:44:04,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:44:04,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:44:05,433 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-24 21:44:05,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:44:05,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389561933] [2023-11-24 21:44:05,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389561933] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:44:05,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:44:05,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 21:44:05,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507448370] [2023-11-24 21:44:05,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:44:05,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 21:44:05,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:44:05,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 21:44:05,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-24 21:44:05,447 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-24 21:44:05,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 60 transitions, 275 flow. Second operand has 7 states, 7 states have (on average 38.142857142857146) internal successors, (267), 7 states have internal predecessors, (267), 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-24 21:44:05,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:44:05,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-24 21:44:05,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:44:06,835 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([379] L858-->L864: Formula: (let ((.cse4 (not (= (mod v_~y$w_buff0_used~0_135 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd0~0_56 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_54 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff0_used~0_136 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_121 256) 0)) .cse3)) (.cse0 (and .cse4 .cse5))) (and (= (ite .cse0 0 v_~y$r_buff0_thd0~0_54) v_~y$r_buff0_thd0~0_53) (= (ite .cse1 0 v_~y$w_buff0_used~0_136) v_~y$w_buff0_used~0_135) (= v_~y~0_77 (ite .cse1 v_~y$w_buff0~0_69 (ite .cse2 v_~y$w_buff1~0_54 v_~y~0_78))) (= v_~y$w_buff1_used~0_120 (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_121)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_120 256) 0)) .cse3) (and (not (= (mod v_~y$r_buff0_thd0~0_53 256) 0)) .cse4)) 0 v_~y$r_buff1_thd0~0_56) v_~y$r_buff1_thd0~0_55)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_136, ~y$w_buff1~0=v_~y$w_buff1~0_54, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_54, ~y$w_buff0~0=v_~y$w_buff0~0_69, ~y~0=v_~y~0_78, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_56, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_121} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_135, ~y$w_buff1~0=v_~y$w_buff1~0_54, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_53, ~y$w_buff0~0=v_~y$w_buff0~0_69, ~y~0=v_~y~0_77, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_55, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_120} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0][67], [170#true, 33#P1EXITtrue, 2#L796true, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, P2Thread1of1ForFork3InUse, Black: 140#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 138#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 128#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 127#(= ~z~0 0), 45#L864true, 188#true, Black: 161#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 159#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 122#(and (not (= |ULTIMATE.start_main_~#t776~0#1.base| |ULTIMATE.start_main_~#t775~0#1.base|)) (not (= |ULTIMATE.start_main_~#t774~0#1.base| |ULTIMATE.start_main_~#t773~0#1.base|)) (not (= |ULTIMATE.start_main_~#t774~0#1.base| |ULTIMATE.start_main_~#t775~0#1.base|)) (not (= |ULTIMATE.start_main_~#t773~0#1.base| |ULTIMATE.start_main_~#t775~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t776~0#1.base| 0) |ULTIMATE.start_main_~#t773~0#1.base| 0) |ULTIMATE.start_main_~#t774~0#1.base| 0) |ULTIMATE.start_main_~#t775~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t773~0#1.base| |ULTIMATE.start_main_~#t776~0#1.base|)) (not (= |ULTIMATE.start_main_~#t774~0#1.base| |ULTIMATE.start_main_~#t776~0#1.base|))), 14#L822true, Black: 155#(= ~__unbuffered_p3_EAX~0 0), 125#true, Black: 177#(and (= ~y$w_buff1~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 172#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 179#(and (= ~y$w_buff1~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y$w_buff0~0 0)), 31#L754true, Black: 181#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 174#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))]) [2023-11-24 21:44:06,835 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-24 21:44:06,835 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-24 21:44:06,835 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-24 21:44:06,835 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-24 21:44:06,836 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([456] L822-->L829: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd4~0_28 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_30 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_88 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_79 256) 0))))) (and (= (ite .cse0 v_~y$w_buff0~0_29 (ite .cse1 v_~y$w_buff1~0_20 v_~y~0_30)) v_~y~0_29) (= v_~y$w_buff0_used~0_87 (ite .cse0 0 v_~y$w_buff0_used~0_88)) (= (ite .cse2 0 v_~y$r_buff0_thd4~0_30) v_~y$r_buff0_thd4~0_29) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_78 256) 0))) (and .cse4 (not (= (mod v_~y$r_buff0_thd4~0_29 256) 0)))) 0 v_~y$r_buff1_thd4~0_28) v_~y$r_buff1_thd4~0_27) (= v_~y$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_79))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_30, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_88, ~y$w_buff1~0=v_~y$w_buff1~0_20, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_30, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_79} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_29, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_87, ~y$w_buff1~0=v_~y$w_buff1~0_20, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_29, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_78} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][63], [170#true, 33#P1EXITtrue, 2#L796true, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, P2Thread1of1ForFork3InUse, Black: 140#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 51#L829true, Black: 138#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 128#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 127#(= ~z~0 0), 188#true, Black: 161#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 159#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 122#(and (not (= |ULTIMATE.start_main_~#t776~0#1.base| |ULTIMATE.start_main_~#t775~0#1.base|)) (not (= |ULTIMATE.start_main_~#t774~0#1.base| |ULTIMATE.start_main_~#t773~0#1.base|)) (not (= |ULTIMATE.start_main_~#t774~0#1.base| |ULTIMATE.start_main_~#t775~0#1.base|)) (not (= |ULTIMATE.start_main_~#t773~0#1.base| |ULTIMATE.start_main_~#t775~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t776~0#1.base| 0) |ULTIMATE.start_main_~#t773~0#1.base| 0) |ULTIMATE.start_main_~#t774~0#1.base| 0) |ULTIMATE.start_main_~#t775~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t773~0#1.base| |ULTIMATE.start_main_~#t776~0#1.base|)) (not (= |ULTIMATE.start_main_~#t774~0#1.base| |ULTIMATE.start_main_~#t776~0#1.base|))), Black: 155#(= ~__unbuffered_p3_EAX~0 0), 125#true, Black: 177#(and (= ~y$w_buff1~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 172#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 179#(and (= ~y$w_buff1~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y$w_buff0~0 0)), 31#L754true, Black: 181#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 11#L858true, Black: 174#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))]) [2023-11-24 21:44:06,836 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-24 21:44:06,836 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-24 21:44:06,836 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-24 21:44:06,836 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-24 21:44:07,513 INFO L124 PetriNetUnfolderBase]: 7201/11444 cut-off events. [2023-11-24 21:44:07,514 INFO L125 PetriNetUnfolderBase]: For 22452/23514 co-relation queries the response was YES. [2023-11-24 21:44:07,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40167 conditions, 11444 events. 7201/11444 cut-off events. For 22452/23514 co-relation queries the response was YES. Maximal size of possible extension queue 678. Compared 84260 event pairs, 2690 based on Foata normal form. 439/11327 useless extension candidates. Maximal degree in co-relation 40141. Up to 6512 conditions per place. [2023-11-24 21:44:07,630 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 60 selfloop transitions, 15 changer transitions 21/125 dead transitions. [2023-11-24 21:44:07,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 125 transitions, 808 flow [2023-11-24 21:44:07,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 21:44:07,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-24 21:44:07,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 364 transitions. [2023-11-24 21:44:07,633 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6893939393939394 [2023-11-24 21:44:07,633 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 364 transitions. [2023-11-24 21:44:07,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 364 transitions. [2023-11-24 21:44:07,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:44:07,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 364 transitions. [2023-11-24 21:44:07,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 45.5) internal successors, (364), 8 states have internal predecessors, (364), 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-24 21:44:07,636 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 66.0) internal successors, (594), 9 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:07,637 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 66.0) internal successors, (594), 9 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:07,637 INFO L175 Difference]: Start difference. First operand has 80 places, 60 transitions, 275 flow. Second operand 8 states and 364 transitions. [2023-11-24 21:44:07,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 125 transitions, 808 flow [2023-11-24 21:44:07,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 125 transitions, 791 flow, removed 7 selfloop flow, removed 3 redundant places. [2023-11-24 21:44:07,838 INFO L231 Difference]: Finished difference. Result has 85 places, 72 transitions, 458 flow [2023-11-24 21:44:07,839 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=458, PETRI_PLACES=85, PETRI_TRANSITIONS=72} [2023-11-24 21:44:07,839 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 12 predicate places. [2023-11-24 21:44:07,840 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 72 transitions, 458 flow [2023-11-24 21:44:07,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 38.142857142857146) internal successors, (267), 7 states have internal predecessors, (267), 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-24 21:44:07,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:44:07,840 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] [2023-11-24 21:44:07,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-24 21:44:07,841 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:44:07,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:44:07,841 INFO L85 PathProgramCache]: Analyzing trace with hash 2137963771, now seen corresponding path program 1 times [2023-11-24 21:44:07,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:44:07,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291773768] [2023-11-24 21:44:07,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:44:07,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:44:07,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:44:08,259 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-24 21:44:08,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:44:08,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291773768] [2023-11-24 21:44:08,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291773768] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:44:08,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:44:08,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:44:08,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549914801] [2023-11-24 21:44:08,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:44:08,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:44:08,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:44:08,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:44:08,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:44:08,265 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-24 21:44:08,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 72 transitions, 458 flow. Second operand has 6 states, 6 states have (on average 38.5) internal successors, (231), 6 states have internal predecessors, (231), 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-24 21:44:08,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:44:08,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-24 21:44:08,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:44:09,226 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([379] L858-->L864: Formula: (let ((.cse4 (not (= (mod v_~y$w_buff0_used~0_135 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd0~0_56 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_54 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff0_used~0_136 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_121 256) 0)) .cse3)) (.cse0 (and .cse4 .cse5))) (and (= (ite .cse0 0 v_~y$r_buff0_thd0~0_54) v_~y$r_buff0_thd0~0_53) (= (ite .cse1 0 v_~y$w_buff0_used~0_136) v_~y$w_buff0_used~0_135) (= v_~y~0_77 (ite .cse1 v_~y$w_buff0~0_69 (ite .cse2 v_~y$w_buff1~0_54 v_~y~0_78))) (= v_~y$w_buff1_used~0_120 (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_121)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_120 256) 0)) .cse3) (and (not (= (mod v_~y$r_buff0_thd0~0_53 256) 0)) .cse4)) 0 v_~y$r_buff1_thd0~0_56) v_~y$r_buff1_thd0~0_55)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_136, ~y$w_buff1~0=v_~y$w_buff1~0_54, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_54, ~y$w_buff0~0=v_~y$w_buff0~0_69, ~y~0=v_~y~0_78, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_56, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_121} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_135, ~y$w_buff1~0=v_~y$w_buff1~0_54, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_53, ~y$w_buff0~0=v_~y$w_buff0~0_69, ~y~0=v_~y~0_77, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_55, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_120} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0][69], [2#L796true, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, Black: 200#(and (= ~y$r_buff0_thd0~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 0 ~y$r_buff1_thd0~0)), P2Thread1of1ForFork3InUse, Black: 193#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 198#(and (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= 0 ~y$r_buff1_thd0~0)), 211#true, Black: 202#(and (= ~y$r_buff0_thd0~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 0 ~y$r_buff1_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 140#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 204#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 138#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 128#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 127#(= ~z~0 0), 58#L776true, 45#L864true, 188#true, Black: 161#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 159#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 122#(and (not (= |ULTIMATE.start_main_~#t776~0#1.base| |ULTIMATE.start_main_~#t775~0#1.base|)) (not (= |ULTIMATE.start_main_~#t774~0#1.base| |ULTIMATE.start_main_~#t773~0#1.base|)) (not (= |ULTIMATE.start_main_~#t774~0#1.base| |ULTIMATE.start_main_~#t775~0#1.base|)) (not (= |ULTIMATE.start_main_~#t773~0#1.base| |ULTIMATE.start_main_~#t775~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t776~0#1.base| 0) |ULTIMATE.start_main_~#t773~0#1.base| 0) |ULTIMATE.start_main_~#t774~0#1.base| 0) |ULTIMATE.start_main_~#t775~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t773~0#1.base| |ULTIMATE.start_main_~#t776~0#1.base|)) (not (= |ULTIMATE.start_main_~#t774~0#1.base| |ULTIMATE.start_main_~#t776~0#1.base|))), 14#L822true, Black: 155#(= ~__unbuffered_p3_EAX~0 0), 125#true, Black: 177#(and (= ~y$w_buff1~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 172#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 31#L754true, Black: 179#(and (= ~y$w_buff1~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y$w_buff0~0 0))]) [2023-11-24 21:44:09,226 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-11-24 21:44:09,226 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-24 21:44:09,226 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-24 21:44:09,226 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-24 21:44:09,227 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([456] L822-->L829: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd4~0_28 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_30 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_88 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_79 256) 0))))) (and (= (ite .cse0 v_~y$w_buff0~0_29 (ite .cse1 v_~y$w_buff1~0_20 v_~y~0_30)) v_~y~0_29) (= v_~y$w_buff0_used~0_87 (ite .cse0 0 v_~y$w_buff0_used~0_88)) (= (ite .cse2 0 v_~y$r_buff0_thd4~0_30) v_~y$r_buff0_thd4~0_29) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_78 256) 0))) (and .cse4 (not (= (mod v_~y$r_buff0_thd4~0_29 256) 0)))) 0 v_~y$r_buff1_thd4~0_28) v_~y$r_buff1_thd4~0_27) (= v_~y$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_79))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_30, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_88, ~y$w_buff1~0=v_~y$w_buff1~0_20, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_30, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_79} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_29, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_87, ~y$w_buff1~0=v_~y$w_buff1~0_20, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_29, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_78} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][67], [2#L796true, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, P2Thread1of1ForFork3InUse, Black: 200#(and (= ~y$r_buff0_thd0~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 0 ~y$r_buff1_thd0~0)), Black: 193#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 198#(and (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= 0 ~y$r_buff1_thd0~0)), 211#true, 51#L829true, Black: 140#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 202#(and (= ~y$r_buff0_thd0~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 0 ~y$r_buff1_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 204#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 138#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 128#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 127#(= ~z~0 0), 58#L776true, 188#true, Black: 161#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 159#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 122#(and (not (= |ULTIMATE.start_main_~#t776~0#1.base| |ULTIMATE.start_main_~#t775~0#1.base|)) (not (= |ULTIMATE.start_main_~#t774~0#1.base| |ULTIMATE.start_main_~#t773~0#1.base|)) (not (= |ULTIMATE.start_main_~#t774~0#1.base| |ULTIMATE.start_main_~#t775~0#1.base|)) (not (= |ULTIMATE.start_main_~#t773~0#1.base| |ULTIMATE.start_main_~#t775~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t776~0#1.base| 0) |ULTIMATE.start_main_~#t773~0#1.base| 0) |ULTIMATE.start_main_~#t774~0#1.base| 0) |ULTIMATE.start_main_~#t775~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t773~0#1.base| |ULTIMATE.start_main_~#t776~0#1.base|)) (not (= |ULTIMATE.start_main_~#t774~0#1.base| |ULTIMATE.start_main_~#t776~0#1.base|))), Black: 155#(= ~__unbuffered_p3_EAX~0 0), 125#true, Black: 177#(and (= ~y$w_buff1~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 172#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 31#L754true, Black: 179#(and (= ~y$w_buff1~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y$w_buff0~0 0)), 11#L858true]) [2023-11-24 21:44:09,227 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-11-24 21:44:09,227 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-24 21:44:09,227 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-24 21:44:09,227 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-24 21:44:09,553 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([379] L858-->L864: Formula: (let ((.cse4 (not (= (mod v_~y$w_buff0_used~0_135 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd0~0_56 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_54 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff0_used~0_136 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_121 256) 0)) .cse3)) (.cse0 (and .cse4 .cse5))) (and (= (ite .cse0 0 v_~y$r_buff0_thd0~0_54) v_~y$r_buff0_thd0~0_53) (= (ite .cse1 0 v_~y$w_buff0_used~0_136) v_~y$w_buff0_used~0_135) (= v_~y~0_77 (ite .cse1 v_~y$w_buff0~0_69 (ite .cse2 v_~y$w_buff1~0_54 v_~y~0_78))) (= v_~y$w_buff1_used~0_120 (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_121)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_120 256) 0)) .cse3) (and (not (= (mod v_~y$r_buff0_thd0~0_53 256) 0)) .cse4)) 0 v_~y$r_buff1_thd0~0_56) v_~y$r_buff1_thd0~0_55)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_136, ~y$w_buff1~0=v_~y$w_buff1~0_54, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_54, ~y$w_buff0~0=v_~y$w_buff0~0_69, ~y~0=v_~y~0_78, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_56, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_121} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_135, ~y$w_buff1~0=v_~y$w_buff1~0_54, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_53, ~y$w_buff0~0=v_~y$w_buff0~0_69, ~y~0=v_~y~0_77, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_55, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_120} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0][69], [33#P1EXITtrue, 2#L796true, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, Black: 200#(and (= ~y$r_buff0_thd0~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 0 ~y$r_buff1_thd0~0)), P2Thread1of1ForFork3InUse, Black: 193#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 198#(and (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= 0 ~y$r_buff1_thd0~0)), 211#true, Black: 202#(and (= ~y$r_buff0_thd0~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 0 ~y$r_buff1_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 140#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 204#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 138#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 128#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 127#(= ~z~0 0), 45#L864true, 188#true, Black: 161#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 159#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 122#(and (not (= |ULTIMATE.start_main_~#t776~0#1.base| |ULTIMATE.start_main_~#t775~0#1.base|)) (not (= |ULTIMATE.start_main_~#t774~0#1.base| |ULTIMATE.start_main_~#t773~0#1.base|)) (not (= |ULTIMATE.start_main_~#t774~0#1.base| |ULTIMATE.start_main_~#t775~0#1.base|)) (not (= |ULTIMATE.start_main_~#t773~0#1.base| |ULTIMATE.start_main_~#t775~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t776~0#1.base| 0) |ULTIMATE.start_main_~#t773~0#1.base| 0) |ULTIMATE.start_main_~#t774~0#1.base| 0) |ULTIMATE.start_main_~#t775~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t773~0#1.base| |ULTIMATE.start_main_~#t776~0#1.base|)) (not (= |ULTIMATE.start_main_~#t774~0#1.base| |ULTIMATE.start_main_~#t776~0#1.base|))), 14#L822true, Black: 155#(= ~__unbuffered_p3_EAX~0 0), 125#true, Black: 177#(and (= ~y$w_buff1~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 172#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 31#L754true, Black: 179#(and (= ~y$w_buff1~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y$w_buff0~0 0))]) [2023-11-24 21:44:09,553 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-24 21:44:09,554 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-24 21:44:09,554 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-24 21:44:09,554 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-24 21:44:09,554 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([456] L822-->L829: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd4~0_28 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_30 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_88 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_79 256) 0))))) (and (= (ite .cse0 v_~y$w_buff0~0_29 (ite .cse1 v_~y$w_buff1~0_20 v_~y~0_30)) v_~y~0_29) (= v_~y$w_buff0_used~0_87 (ite .cse0 0 v_~y$w_buff0_used~0_88)) (= (ite .cse2 0 v_~y$r_buff0_thd4~0_30) v_~y$r_buff0_thd4~0_29) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_78 256) 0))) (and .cse4 (not (= (mod v_~y$r_buff0_thd4~0_29 256) 0)))) 0 v_~y$r_buff1_thd4~0_28) v_~y$r_buff1_thd4~0_27) (= v_~y$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_79))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_30, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_88, ~y$w_buff1~0=v_~y$w_buff1~0_20, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_30, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_79} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_29, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_87, ~y$w_buff1~0=v_~y$w_buff1~0_20, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_29, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_78} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][67], [33#P1EXITtrue, 2#L796true, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, P2Thread1of1ForFork3InUse, Black: 200#(and (= ~y$r_buff0_thd0~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 0 ~y$r_buff1_thd0~0)), Black: 193#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 198#(and (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= 0 ~y$r_buff1_thd0~0)), 211#true, 51#L829true, Black: 140#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 202#(and (= ~y$r_buff0_thd0~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 0 ~y$r_buff1_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 204#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 138#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 128#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 127#(= ~z~0 0), 188#true, Black: 161#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 159#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 122#(and (not (= |ULTIMATE.start_main_~#t776~0#1.base| |ULTIMATE.start_main_~#t775~0#1.base|)) (not (= |ULTIMATE.start_main_~#t774~0#1.base| |ULTIMATE.start_main_~#t773~0#1.base|)) (not (= |ULTIMATE.start_main_~#t774~0#1.base| |ULTIMATE.start_main_~#t775~0#1.base|)) (not (= |ULTIMATE.start_main_~#t773~0#1.base| |ULTIMATE.start_main_~#t775~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t776~0#1.base| 0) |ULTIMATE.start_main_~#t773~0#1.base| 0) |ULTIMATE.start_main_~#t774~0#1.base| 0) |ULTIMATE.start_main_~#t775~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t773~0#1.base| |ULTIMATE.start_main_~#t776~0#1.base|)) (not (= |ULTIMATE.start_main_~#t774~0#1.base| |ULTIMATE.start_main_~#t776~0#1.base|))), Black: 155#(= ~__unbuffered_p3_EAX~0 0), 125#true, Black: 177#(and (= ~y$w_buff1~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 172#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 31#L754true, Black: 179#(and (= ~y$w_buff1~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y$w_buff0~0 0)), 11#L858true]) [2023-11-24 21:44:09,554 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-24 21:44:09,554 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-24 21:44:09,555 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-24 21:44:09,555 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-24 21:44:10,343 INFO L124 PetriNetUnfolderBase]: 7328/11679 cut-off events. [2023-11-24 21:44:10,343 INFO L125 PetriNetUnfolderBase]: For 45586/46791 co-relation queries the response was YES. [2023-11-24 21:44:10,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48388 conditions, 11679 events. 7328/11679 cut-off events. For 45586/46791 co-relation queries the response was YES. Maximal size of possible extension queue 691. Compared 85959 event pairs, 1953 based on Foata normal form. 398/11517 useless extension candidates. Maximal degree in co-relation 48358. Up to 6353 conditions per place. [2023-11-24 21:44:10,483 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 60 selfloop transitions, 8 changer transitions 40/137 dead transitions. [2023-11-24 21:44:10,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 137 transitions, 1118 flow [2023-11-24 21:44:10,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 21:44:10,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-24 21:44:10,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 368 transitions. [2023-11-24 21:44:10,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.696969696969697 [2023-11-24 21:44:10,486 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 368 transitions. [2023-11-24 21:44:10,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 368 transitions. [2023-11-24 21:44:10,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:44:10,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 368 transitions. [2023-11-24 21:44:10,488 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-24 21:44:10,489 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 66.0) internal successors, (594), 9 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:10,490 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 66.0) internal successors, (594), 9 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:10,490 INFO L175 Difference]: Start difference. First operand has 85 places, 72 transitions, 458 flow. Second operand 8 states and 368 transitions. [2023-11-24 21:44:10,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 137 transitions, 1118 flow [2023-11-24 21:44:10,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 137 transitions, 1075 flow, removed 17 selfloop flow, removed 3 redundant places. [2023-11-24 21:44:10,625 INFO L231 Difference]: Finished difference. Result has 94 places, 76 transitions, 500 flow [2023-11-24 21:44:10,626 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=500, PETRI_PLACES=94, PETRI_TRANSITIONS=76} [2023-11-24 21:44:10,626 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 21 predicate places. [2023-11-24 21:44:10,627 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 76 transitions, 500 flow [2023-11-24 21:44:10,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.5) internal successors, (231), 6 states have internal predecessors, (231), 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-24 21:44:10,627 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:44:10,627 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] [2023-11-24 21:44:10,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-24 21:44:10,628 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:44:10,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:44:10,628 INFO L85 PathProgramCache]: Analyzing trace with hash -827609945, now seen corresponding path program 2 times [2023-11-24 21:44:10,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:44:10,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730084699] [2023-11-24 21:44:10,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:44:10,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:44:10,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:44:11,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-24 21:44:11,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:44:11,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730084699] [2023-11-24 21:44:11,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730084699] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:44:11,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:44:11,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 21:44:11,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813475963] [2023-11-24 21:44:11,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:44:11,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 21:44:11,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:44:11,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 21:44:11,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-24 21:44:11,052 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-24 21:44:11,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 76 transitions, 500 flow. Second operand has 7 states, 7 states have (on average 38.142857142857146) internal successors, (267), 7 states have internal predecessors, (267), 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-24 21:44:11,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:44:11,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-24 21:44:11,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:44:12,114 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([379] L858-->L864: Formula: (let ((.cse4 (not (= (mod v_~y$w_buff0_used~0_135 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd0~0_56 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_54 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff0_used~0_136 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_121 256) 0)) .cse3)) (.cse0 (and .cse4 .cse5))) (and (= (ite .cse0 0 v_~y$r_buff0_thd0~0_54) v_~y$r_buff0_thd0~0_53) (= (ite .cse1 0 v_~y$w_buff0_used~0_136) v_~y$w_buff0_used~0_135) (= v_~y~0_77 (ite .cse1 v_~y$w_buff0~0_69 (ite .cse2 v_~y$w_buff1~0_54 v_~y~0_78))) (= v_~y$w_buff1_used~0_120 (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_121)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_120 256) 0)) .cse3) (and (not (= (mod v_~y$r_buff0_thd0~0_53 256) 0)) .cse4)) 0 v_~y$r_buff1_thd0~0_56) v_~y$r_buff1_thd0~0_55)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_136, ~y$w_buff1~0=v_~y$w_buff1~0_54, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_54, ~y$w_buff0~0=v_~y$w_buff0~0_69, ~y~0=v_~y~0_78, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_56, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_121} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_135, ~y$w_buff1~0=v_~y$w_buff1~0_54, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_53, ~y$w_buff0~0=v_~y$w_buff0~0_69, ~y~0=v_~y~0_77, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_55, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_120} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0][69], [2#L796true, 229#true, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, Black: 200#(and (= ~y$r_buff0_thd0~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 0 ~y$r_buff1_thd0~0)), P2Thread1of1ForFork3InUse, Black: 198#(and (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= 0 ~y$r_buff1_thd0~0)), 211#true, Black: 140#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 202#(and (= ~y$r_buff0_thd0~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 0 ~y$r_buff1_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 138#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 128#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 127#(= ~z~0 0), 45#L864true, 58#L776true, 188#true, Black: 214#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), Black: 220#(and (= ~y$w_buff1~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y$w_buff0~0 0)), Black: 218#(and (= ~y$w_buff1~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y$w_buff0~0 0)), Black: 215#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 222#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 161#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 159#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 14#L822true, 122#(and (not (= |ULTIMATE.start_main_~#t776~0#1.base| |ULTIMATE.start_main_~#t775~0#1.base|)) (not (= |ULTIMATE.start_main_~#t774~0#1.base| |ULTIMATE.start_main_~#t773~0#1.base|)) (not (= |ULTIMATE.start_main_~#t774~0#1.base| |ULTIMATE.start_main_~#t775~0#1.base|)) (not (= |ULTIMATE.start_main_~#t773~0#1.base| |ULTIMATE.start_main_~#t775~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t776~0#1.base| 0) |ULTIMATE.start_main_~#t773~0#1.base| 0) |ULTIMATE.start_main_~#t774~0#1.base| 0) |ULTIMATE.start_main_~#t775~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t773~0#1.base| |ULTIMATE.start_main_~#t776~0#1.base|)) (not (= |ULTIMATE.start_main_~#t774~0#1.base| |ULTIMATE.start_main_~#t776~0#1.base|))), Black: 155#(= ~__unbuffered_p3_EAX~0 0), 125#true, Black: 177#(and (= ~y$w_buff1~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 172#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 179#(and (= ~y$w_buff1~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y$w_buff0~0 0)), 31#L754true]) [2023-11-24 21:44:12,115 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-11-24 21:44:12,115 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-24 21:44:12,115 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-24 21:44:12,115 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-24 21:44:12,116 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([456] L822-->L829: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd4~0_28 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_30 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_88 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_79 256) 0))))) (and (= (ite .cse0 v_~y$w_buff0~0_29 (ite .cse1 v_~y$w_buff1~0_20 v_~y~0_30)) v_~y~0_29) (= v_~y$w_buff0_used~0_87 (ite .cse0 0 v_~y$w_buff0_used~0_88)) (= (ite .cse2 0 v_~y$r_buff0_thd4~0_30) v_~y$r_buff0_thd4~0_29) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_78 256) 0))) (and .cse4 (not (= (mod v_~y$r_buff0_thd4~0_29 256) 0)))) 0 v_~y$r_buff1_thd4~0_28) v_~y$r_buff1_thd4~0_27) (= v_~y$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_79))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_30, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_88, ~y$w_buff1~0=v_~y$w_buff1~0_20, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_30, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_79} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_29, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_87, ~y$w_buff1~0=v_~y$w_buff1~0_20, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_29, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_78} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][67], [2#L796true, 229#true, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, Black: 200#(and (= ~y$r_buff0_thd0~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 0 ~y$r_buff1_thd0~0)), P2Thread1of1ForFork3InUse, Black: 198#(and (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= 0 ~y$r_buff1_thd0~0)), 211#true, 51#L829true, Black: 140#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 202#(and (= ~y$r_buff0_thd0~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 0 ~y$r_buff1_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 138#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 128#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 127#(= ~z~0 0), 58#L776true, 188#true, Black: 214#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), Black: 220#(and (= ~y$w_buff1~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y$w_buff0~0 0)), Black: 218#(and (= ~y$w_buff1~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y$w_buff0~0 0)), Black: 215#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 222#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 161#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 159#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 122#(and (not (= |ULTIMATE.start_main_~#t776~0#1.base| |ULTIMATE.start_main_~#t775~0#1.base|)) (not (= |ULTIMATE.start_main_~#t774~0#1.base| |ULTIMATE.start_main_~#t773~0#1.base|)) (not (= |ULTIMATE.start_main_~#t774~0#1.base| |ULTIMATE.start_main_~#t775~0#1.base|)) (not (= |ULTIMATE.start_main_~#t773~0#1.base| |ULTIMATE.start_main_~#t775~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t776~0#1.base| 0) |ULTIMATE.start_main_~#t773~0#1.base| 0) |ULTIMATE.start_main_~#t774~0#1.base| 0) |ULTIMATE.start_main_~#t775~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t773~0#1.base| |ULTIMATE.start_main_~#t776~0#1.base|)) (not (= |ULTIMATE.start_main_~#t774~0#1.base| |ULTIMATE.start_main_~#t776~0#1.base|))), Black: 155#(= ~__unbuffered_p3_EAX~0 0), 125#true, Black: 177#(and (= ~y$w_buff1~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 172#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 179#(and (= ~y$w_buff1~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y$w_buff0~0 0)), 31#L754true, 11#L858true]) [2023-11-24 21:44:12,116 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-11-24 21:44:12,116 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-24 21:44:12,117 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-24 21:44:12,117 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-24 21:44:12,407 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([379] L858-->L864: Formula: (let ((.cse4 (not (= (mod v_~y$w_buff0_used~0_135 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd0~0_56 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_54 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff0_used~0_136 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_121 256) 0)) .cse3)) (.cse0 (and .cse4 .cse5))) (and (= (ite .cse0 0 v_~y$r_buff0_thd0~0_54) v_~y$r_buff0_thd0~0_53) (= (ite .cse1 0 v_~y$w_buff0_used~0_136) v_~y$w_buff0_used~0_135) (= v_~y~0_77 (ite .cse1 v_~y$w_buff0~0_69 (ite .cse2 v_~y$w_buff1~0_54 v_~y~0_78))) (= v_~y$w_buff1_used~0_120 (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_121)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_120 256) 0)) .cse3) (and (not (= (mod v_~y$r_buff0_thd0~0_53 256) 0)) .cse4)) 0 v_~y$r_buff1_thd0~0_56) v_~y$r_buff1_thd0~0_55)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_136, ~y$w_buff1~0=v_~y$w_buff1~0_54, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_54, ~y$w_buff0~0=v_~y$w_buff0~0_69, ~y~0=v_~y~0_78, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_56, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_121} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_135, ~y$w_buff1~0=v_~y$w_buff1~0_54, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_53, ~y$w_buff0~0=v_~y$w_buff0~0_69, ~y~0=v_~y~0_77, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_55, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_120} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0][69], [33#P1EXITtrue, 2#L796true, 229#true, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, Black: 200#(and (= ~y$r_buff0_thd0~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 0 ~y$r_buff1_thd0~0)), P2Thread1of1ForFork3InUse, Black: 198#(and (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= 0 ~y$r_buff1_thd0~0)), 211#true, Black: 202#(and (= ~y$r_buff0_thd0~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 0 ~y$r_buff1_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 140#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 138#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 128#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 127#(= ~z~0 0), 45#L864true, 188#true, Black: 214#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), Black: 220#(and (= ~y$w_buff1~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y$w_buff0~0 0)), Black: 218#(and (= ~y$w_buff1~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y$w_buff0~0 0)), Black: 215#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 222#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 161#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 159#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 14#L822true, 122#(and (not (= |ULTIMATE.start_main_~#t776~0#1.base| |ULTIMATE.start_main_~#t775~0#1.base|)) (not (= |ULTIMATE.start_main_~#t774~0#1.base| |ULTIMATE.start_main_~#t773~0#1.base|)) (not (= |ULTIMATE.start_main_~#t774~0#1.base| |ULTIMATE.start_main_~#t775~0#1.base|)) (not (= |ULTIMATE.start_main_~#t773~0#1.base| |ULTIMATE.start_main_~#t775~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t776~0#1.base| 0) |ULTIMATE.start_main_~#t773~0#1.base| 0) |ULTIMATE.start_main_~#t774~0#1.base| 0) |ULTIMATE.start_main_~#t775~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t773~0#1.base| |ULTIMATE.start_main_~#t776~0#1.base|)) (not (= |ULTIMATE.start_main_~#t774~0#1.base| |ULTIMATE.start_main_~#t776~0#1.base|))), Black: 155#(= ~__unbuffered_p3_EAX~0 0), 125#true, Black: 177#(and (= ~y$w_buff1~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 172#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 179#(and (= ~y$w_buff1~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y$w_buff0~0 0)), 31#L754true]) [2023-11-24 21:44:12,407 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-24 21:44:12,408 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-24 21:44:12,408 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-24 21:44:12,408 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-24 21:44:12,409 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([456] L822-->L829: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd4~0_28 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_30 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_88 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_79 256) 0))))) (and (= (ite .cse0 v_~y$w_buff0~0_29 (ite .cse1 v_~y$w_buff1~0_20 v_~y~0_30)) v_~y~0_29) (= v_~y$w_buff0_used~0_87 (ite .cse0 0 v_~y$w_buff0_used~0_88)) (= (ite .cse2 0 v_~y$r_buff0_thd4~0_30) v_~y$r_buff0_thd4~0_29) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_78 256) 0))) (and .cse4 (not (= (mod v_~y$r_buff0_thd4~0_29 256) 0)))) 0 v_~y$r_buff1_thd4~0_28) v_~y$r_buff1_thd4~0_27) (= v_~y$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_79))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_30, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_88, ~y$w_buff1~0=v_~y$w_buff1~0_20, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_30, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_79} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_29, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_87, ~y$w_buff1~0=v_~y$w_buff1~0_20, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_29, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_78} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][67], [33#P1EXITtrue, 2#L796true, 229#true, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, P2Thread1of1ForFork3InUse, Black: 200#(and (= ~y$r_buff0_thd0~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 0 ~y$r_buff1_thd0~0)), 211#true, Black: 198#(and (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= 0 ~y$r_buff1_thd0~0)), 51#L829true, Black: 140#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 202#(and (= ~y$r_buff0_thd0~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 0 ~y$r_buff1_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 138#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 128#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 127#(= ~z~0 0), 188#true, Black: 214#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), Black: 220#(and (= ~y$w_buff1~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y$w_buff0~0 0)), Black: 218#(and (= ~y$w_buff1~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y$w_buff0~0 0)), Black: 215#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 222#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 161#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 159#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 122#(and (not (= |ULTIMATE.start_main_~#t776~0#1.base| |ULTIMATE.start_main_~#t775~0#1.base|)) (not (= |ULTIMATE.start_main_~#t774~0#1.base| |ULTIMATE.start_main_~#t773~0#1.base|)) (not (= |ULTIMATE.start_main_~#t774~0#1.base| |ULTIMATE.start_main_~#t775~0#1.base|)) (not (= |ULTIMATE.start_main_~#t773~0#1.base| |ULTIMATE.start_main_~#t775~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t776~0#1.base| 0) |ULTIMATE.start_main_~#t773~0#1.base| 0) |ULTIMATE.start_main_~#t774~0#1.base| 0) |ULTIMATE.start_main_~#t775~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t773~0#1.base| |ULTIMATE.start_main_~#t776~0#1.base|)) (not (= |ULTIMATE.start_main_~#t774~0#1.base| |ULTIMATE.start_main_~#t776~0#1.base|))), Black: 155#(= ~__unbuffered_p3_EAX~0 0), 125#true, Black: 177#(and (= ~y$w_buff1~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 172#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 179#(and (= ~y$w_buff1~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y$w_buff0~0 0)), 31#L754true, 11#L858true]) [2023-11-24 21:44:12,409 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-24 21:44:12,409 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-24 21:44:12,409 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-24 21:44:12,409 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-24 21:44:13,216 INFO L124 PetriNetUnfolderBase]: 6995/11133 cut-off events. [2023-11-24 21:44:13,216 INFO L125 PetriNetUnfolderBase]: For 54400/55931 co-relation queries the response was YES. [2023-11-24 21:44:13,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49180 conditions, 11133 events. 6995/11133 cut-off events. For 54400/55931 co-relation queries the response was YES. Maximal size of possible extension queue 646. Compared 80985 event pairs, 1800 based on Foata normal form. 462/11039 useless extension candidates. Maximal degree in co-relation 49146. Up to 6226 conditions per place. [2023-11-24 21:44:13,317 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 57 selfloop transitions, 8 changer transitions 38/132 dead transitions. [2023-11-24 21:44:13,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 132 transitions, 1098 flow [2023-11-24 21:44:13,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 21:44:13,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-24 21:44:13,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 365 transitions. [2023-11-24 21:44:13,319 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6912878787878788 [2023-11-24 21:44:13,320 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 365 transitions. [2023-11-24 21:44:13,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 365 transitions. [2023-11-24 21:44:13,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:44:13,320 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 365 transitions. [2023-11-24 21:44:13,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 45.625) internal successors, (365), 8 states have internal predecessors, (365), 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-24 21:44:13,323 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 66.0) internal successors, (594), 9 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:13,324 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 66.0) internal successors, (594), 9 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:13,324 INFO L175 Difference]: Start difference. First operand has 94 places, 76 transitions, 500 flow. Second operand 8 states and 365 transitions. [2023-11-24 21:44:13,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 132 transitions, 1098 flow [2023-11-24 21:44:13,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 132 transitions, 1046 flow, removed 23 selfloop flow, removed 5 redundant places. [2023-11-24 21:44:13,549 INFO L231 Difference]: Finished difference. Result has 97 places, 76 transitions, 509 flow [2023-11-24 21:44:13,550 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=509, PETRI_PLACES=97, PETRI_TRANSITIONS=76} [2023-11-24 21:44:13,550 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 24 predicate places. [2023-11-24 21:44:13,550 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 76 transitions, 509 flow [2023-11-24 21:44:13,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 38.142857142857146) internal successors, (267), 7 states have internal predecessors, (267), 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-24 21:44:13,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:44:13,551 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-24 21:44:13,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-24 21:44:13,552 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:44:13,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:44:13,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1804431936, now seen corresponding path program 1 times [2023-11-24 21:44:13,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:44:13,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922805249] [2023-11-24 21:44:13,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:44:13,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:44:13,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:44:13,729 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-24 21:44:13,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:44:13,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922805249] [2023-11-24 21:44:13,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922805249] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:44:13,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:44:13,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:44:13,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250316939] [2023-11-24 21:44:13,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:44:13,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:44:13,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:44:13,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:44:13,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:44:13,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 66 [2023-11-24 21:44:13,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 76 transitions, 509 flow. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 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-24 21:44:13,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:44:13,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 66 [2023-11-24 21:44:13,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:44:16,658 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([456] L822-->L829: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd4~0_28 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_30 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_88 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_79 256) 0))))) (and (= (ite .cse0 v_~y$w_buff0~0_29 (ite .cse1 v_~y$w_buff1~0_20 v_~y~0_30)) v_~y~0_29) (= v_~y$w_buff0_used~0_87 (ite .cse0 0 v_~y$w_buff0_used~0_88)) (= (ite .cse2 0 v_~y$r_buff0_thd4~0_30) v_~y$r_buff0_thd4~0_29) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_78 256) 0))) (and .cse4 (not (= (mod v_~y$r_buff0_thd4~0_29 256) 0)))) 0 v_~y$r_buff1_thd4~0_28) v_~y$r_buff1_thd4~0_27) (= v_~y$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_79))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_30, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_88, ~y$w_buff1~0=v_~y$w_buff1~0_20, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_30, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_79} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_29, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_87, ~y$w_buff1~0=v_~y$w_buff1~0_20, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_29, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_78} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][88], [33#P1EXITtrue, 251#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 229#true, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, Black: 200#(and (= ~y$r_buff0_thd0~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 0 ~y$r_buff1_thd0~0)), P2Thread1of1ForFork3InUse, 65#L856true, Black: 198#(and (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= 0 ~y$r_buff1_thd0~0)), Black: 140#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 202#(and (= ~y$r_buff0_thd0~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 0 ~y$r_buff1_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 51#L829true, Black: 138#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 128#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 127#(= ~z~0 0), 188#true, Black: 214#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), Black: 161#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 159#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 122#(and (not (= |ULTIMATE.start_main_~#t776~0#1.base| |ULTIMATE.start_main_~#t775~0#1.base|)) (not (= |ULTIMATE.start_main_~#t774~0#1.base| |ULTIMATE.start_main_~#t773~0#1.base|)) (not (= |ULTIMATE.start_main_~#t774~0#1.base| |ULTIMATE.start_main_~#t775~0#1.base|)) (not (= |ULTIMATE.start_main_~#t773~0#1.base| |ULTIMATE.start_main_~#t775~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t776~0#1.base| 0) |ULTIMATE.start_main_~#t773~0#1.base| 0) |ULTIMATE.start_main_~#t774~0#1.base| 0) |ULTIMATE.start_main_~#t775~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t773~0#1.base| |ULTIMATE.start_main_~#t776~0#1.base|)) (not (= |ULTIMATE.start_main_~#t774~0#1.base| |ULTIMATE.start_main_~#t776~0#1.base|))), Black: 155#(= ~__unbuffered_p3_EAX~0 0), 41#L809true, 125#true, Black: 241#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 233#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0)), Black: 234#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 239#(and (= ~y$w_buff1~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (= ~y~0 0) (= ~y~0 1)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y$w_buff0~0 0)), Black: 237#(and (= ~y$w_buff1~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (= ~y~0 0) (= ~y~0 1)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y$w_buff0~0 0)), Black: 177#(and (= ~y$w_buff1~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 172#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 179#(and (= ~y$w_buff1~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y$w_buff0~0 0)), 31#L754true]) [2023-11-24 21:44:16,658 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-24 21:44:16,658 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:44:16,659 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:44:16,659 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:44:16,948 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([456] L822-->L829: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd4~0_28 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_30 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_88 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_79 256) 0))))) (and (= (ite .cse0 v_~y$w_buff0~0_29 (ite .cse1 v_~y$w_buff1~0_20 v_~y~0_30)) v_~y~0_29) (= v_~y$w_buff0_used~0_87 (ite .cse0 0 v_~y$w_buff0_used~0_88)) (= (ite .cse2 0 v_~y$r_buff0_thd4~0_30) v_~y$r_buff0_thd4~0_29) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_78 256) 0))) (and .cse4 (not (= (mod v_~y$r_buff0_thd4~0_29 256) 0)))) 0 v_~y$r_buff1_thd4~0_28) v_~y$r_buff1_thd4~0_27) (= v_~y$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_79))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_30, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_88, ~y$w_buff1~0=v_~y$w_buff1~0_20, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_30, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_79} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_29, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_87, ~y$w_buff1~0=v_~y$w_buff1~0_20, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_29, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_78} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][88], [60#P2EXITtrue, 33#P1EXITtrue, 251#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 229#true, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, Black: 200#(and (= ~y$r_buff0_thd0~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 0 ~y$r_buff1_thd0~0)), P2Thread1of1ForFork3InUse, 65#L856true, Black: 198#(and (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= 0 ~y$r_buff1_thd0~0)), 51#L829true, Black: 140#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 202#(and (= ~y$r_buff0_thd0~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 0 ~y$r_buff1_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 138#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 128#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 127#(= ~z~0 0), 188#true, Black: 214#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), Black: 161#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 159#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 122#(and (not (= |ULTIMATE.start_main_~#t776~0#1.base| |ULTIMATE.start_main_~#t775~0#1.base|)) (not (= |ULTIMATE.start_main_~#t774~0#1.base| |ULTIMATE.start_main_~#t773~0#1.base|)) (not (= |ULTIMATE.start_main_~#t774~0#1.base| |ULTIMATE.start_main_~#t775~0#1.base|)) (not (= |ULTIMATE.start_main_~#t773~0#1.base| |ULTIMATE.start_main_~#t775~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t776~0#1.base| 0) |ULTIMATE.start_main_~#t773~0#1.base| 0) |ULTIMATE.start_main_~#t774~0#1.base| 0) |ULTIMATE.start_main_~#t775~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t773~0#1.base| |ULTIMATE.start_main_~#t776~0#1.base|)) (not (= |ULTIMATE.start_main_~#t774~0#1.base| |ULTIMATE.start_main_~#t776~0#1.base|))), Black: 155#(= ~__unbuffered_p3_EAX~0 0), 125#true, Black: 241#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 233#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0)), Black: 234#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 239#(and (= ~y$w_buff1~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (= ~y~0 0) (= ~y~0 1)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y$w_buff0~0 0)), Black: 237#(and (= ~y$w_buff1~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (= ~y~0 0) (= ~y~0 1)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y$w_buff0~0 0)), Black: 177#(and (= ~y$w_buff1~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 172#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 179#(and (= ~y$w_buff1~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y$w_buff0~0 0)), 31#L754true]) [2023-11-24 21:44:16,949 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-24 21:44:16,949 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 21:44:16,949 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 21:44:16,949 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 21:44:18,352 INFO L124 PetriNetUnfolderBase]: 16701/24200 cut-off events. [2023-11-24 21:44:18,352 INFO L125 PetriNetUnfolderBase]: For 112685/118385 co-relation queries the response was YES. [2023-11-24 21:44:18,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97244 conditions, 24200 events. 16701/24200 cut-off events. For 112685/118385 co-relation queries the response was YES. Maximal size of possible extension queue 1111. Compared 161413 event pairs, 2792 based on Foata normal form. 1596/24398 useless extension candidates. Maximal degree in co-relation 97208. Up to 13436 conditions per place. [2023-11-24 21:44:18,723 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 91 selfloop transitions, 6 changer transitions 0/126 dead transitions. [2023-11-24 21:44:18,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 126 transitions, 1068 flow [2023-11-24 21:44:18,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:44:18,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 21:44:18,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 189 transitions. [2023-11-24 21:44:18,725 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7159090909090909 [2023-11-24 21:44:18,725 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 189 transitions. [2023-11-24 21:44:18,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 189 transitions. [2023-11-24 21:44:18,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:44:18,726 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 189 transitions. [2023-11-24 21:44:18,727 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 47.25) internal successors, (189), 4 states have internal predecessors, (189), 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-24 21:44:18,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 66.0) internal successors, (330), 5 states have internal predecessors, (330), 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-24 21:44:18,728 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 66.0) internal successors, (330), 5 states have internal predecessors, (330), 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-24 21:44:18,728 INFO L175 Difference]: Start difference. First operand has 97 places, 76 transitions, 509 flow. Second operand 4 states and 189 transitions. [2023-11-24 21:44:18,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 126 transitions, 1068 flow [2023-11-24 21:44:19,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 126 transitions, 1000 flow, removed 16 selfloop flow, removed 8 redundant places. [2023-11-24 21:44:19,252 INFO L231 Difference]: Finished difference. Result has 90 places, 81 transitions, 511 flow [2023-11-24 21:44:19,253 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=511, PETRI_PLACES=90, PETRI_TRANSITIONS=81} [2023-11-24 21:44:19,253 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 17 predicate places. [2023-11-24 21:44:19,253 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 81 transitions, 511 flow [2023-11-24 21:44:19,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 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-24 21:44:19,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:44:19,254 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:44:19,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-24 21:44:19,254 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:44:19,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:44:19,255 INFO L85 PathProgramCache]: Analyzing trace with hash -494264600, now seen corresponding path program 1 times [2023-11-24 21:44:19,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:44:19,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350004821] [2023-11-24 21:44:19,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:44:19,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:44:19,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:44:19,486 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-24 21:44:19,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:44:19,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350004821] [2023-11-24 21:44:19,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350004821] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:44:19,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:44:19,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:44:19,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894071634] [2023-11-24 21:44:19,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:44:19,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:44:19,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:44:19,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:44:19,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:44:19,496 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 66 [2023-11-24 21:44:19,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 81 transitions, 511 flow. Second operand has 5 states, 5 states have (on average 36.6) internal successors, (183), 5 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:19,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:44:19,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 66 [2023-11-24 21:44:19,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:44:21,289 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([456] L822-->L829: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd4~0_28 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_30 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_88 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_79 256) 0))))) (and (= (ite .cse0 v_~y$w_buff0~0_29 (ite .cse1 v_~y$w_buff1~0_20 v_~y~0_30)) v_~y~0_29) (= v_~y$w_buff0_used~0_87 (ite .cse0 0 v_~y$w_buff0_used~0_88)) (= (ite .cse2 0 v_~y$r_buff0_thd4~0_30) v_~y$r_buff0_thd4~0_29) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_78 256) 0))) (and .cse4 (not (= (mod v_~y$r_buff0_thd4~0_29 256) 0)))) 0 v_~y$r_buff1_thd4~0_28) v_~y$r_buff1_thd4~0_27) (= v_~y$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_79))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_30, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_88, ~y$w_buff1~0=v_~y$w_buff1~0_20, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_30, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_79} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_29, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_87, ~y$w_buff1~0=v_~y$w_buff1~0_20, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_29, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_78} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][112], [33#P1EXITtrue, 251#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, P2Thread1of1ForFork3InUse, Black: 200#(and (= ~y$r_buff0_thd0~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 0 ~y$r_buff1_thd0~0)), 65#L856true, Black: 198#(and (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= 0 ~y$r_buff1_thd0~0)), 51#L829true, Black: 140#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 202#(and (= ~y$r_buff0_thd0~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 0 ~y$r_buff1_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 138#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 128#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 127#(= ~z~0 0), 188#true, 261#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 214#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), Black: 161#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 159#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 122#(and (not (= |ULTIMATE.start_main_~#t776~0#1.base| |ULTIMATE.start_main_~#t775~0#1.base|)) (not (= |ULTIMATE.start_main_~#t774~0#1.base| |ULTIMATE.start_main_~#t773~0#1.base|)) (not (= |ULTIMATE.start_main_~#t774~0#1.base| |ULTIMATE.start_main_~#t775~0#1.base|)) (not (= |ULTIMATE.start_main_~#t773~0#1.base| |ULTIMATE.start_main_~#t775~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t776~0#1.base| 0) |ULTIMATE.start_main_~#t773~0#1.base| 0) |ULTIMATE.start_main_~#t774~0#1.base| 0) |ULTIMATE.start_main_~#t775~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t773~0#1.base| |ULTIMATE.start_main_~#t776~0#1.base|)) (not (= |ULTIMATE.start_main_~#t774~0#1.base| |ULTIMATE.start_main_~#t776~0#1.base|))), 41#L809true, Black: 155#(= ~__unbuffered_p3_EAX~0 0), 125#true, Black: 233#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0)), Black: 177#(and (= ~y$w_buff1~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 172#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 31#L754true, Black: 253#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0))]) [2023-11-24 21:44:21,289 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-24 21:44:21,289 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:44:21,290 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:44:21,290 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:44:21,571 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([456] L822-->L829: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd4~0_28 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_30 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_88 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_79 256) 0))))) (and (= (ite .cse0 v_~y$w_buff0~0_29 (ite .cse1 v_~y$w_buff1~0_20 v_~y~0_30)) v_~y~0_29) (= v_~y$w_buff0_used~0_87 (ite .cse0 0 v_~y$w_buff0_used~0_88)) (= (ite .cse2 0 v_~y$r_buff0_thd4~0_30) v_~y$r_buff0_thd4~0_29) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_78 256) 0))) (and .cse4 (not (= (mod v_~y$r_buff0_thd4~0_29 256) 0)))) 0 v_~y$r_buff1_thd4~0_28) v_~y$r_buff1_thd4~0_27) (= v_~y$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_79))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_30, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_88, ~y$w_buff1~0=v_~y$w_buff1~0_20, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_30, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_79} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_29, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_87, ~y$w_buff1~0=v_~y$w_buff1~0_20, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_29, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_78} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][112], [60#P2EXITtrue, 33#P1EXITtrue, 251#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, Black: 200#(and (= ~y$r_buff0_thd0~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 0 ~y$r_buff1_thd0~0)), P2Thread1of1ForFork3InUse, Black: 198#(and (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= 0 ~y$r_buff1_thd0~0)), 65#L856true, 51#L829true, Black: 140#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 202#(and (= ~y$r_buff0_thd0~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 0 ~y$r_buff1_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 138#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 128#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 127#(= ~z~0 0), 188#true, 261#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 214#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), Black: 161#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 159#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 122#(and (not (= |ULTIMATE.start_main_~#t776~0#1.base| |ULTIMATE.start_main_~#t775~0#1.base|)) (not (= |ULTIMATE.start_main_~#t774~0#1.base| |ULTIMATE.start_main_~#t773~0#1.base|)) (not (= |ULTIMATE.start_main_~#t774~0#1.base| |ULTIMATE.start_main_~#t775~0#1.base|)) (not (= |ULTIMATE.start_main_~#t773~0#1.base| |ULTIMATE.start_main_~#t775~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t776~0#1.base| 0) |ULTIMATE.start_main_~#t773~0#1.base| 0) |ULTIMATE.start_main_~#t774~0#1.base| 0) |ULTIMATE.start_main_~#t775~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t773~0#1.base| |ULTIMATE.start_main_~#t776~0#1.base|)) (not (= |ULTIMATE.start_main_~#t774~0#1.base| |ULTIMATE.start_main_~#t776~0#1.base|))), Black: 155#(= ~__unbuffered_p3_EAX~0 0), 125#true, Black: 233#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0)), Black: 177#(and (= ~y$w_buff1~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 172#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 31#L754true, Black: 253#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0))]) [2023-11-24 21:44:21,571 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-24 21:44:21,571 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 21:44:21,571 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 21:44:21,571 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 21:44:22,413 INFO L124 PetriNetUnfolderBase]: 13018/19143 cut-off events. [2023-11-24 21:44:22,413 INFO L125 PetriNetUnfolderBase]: For 82215/88311 co-relation queries the response was YES. [2023-11-24 21:44:22,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77606 conditions, 19143 events. 13018/19143 cut-off events. For 82215/88311 co-relation queries the response was YES. Maximal size of possible extension queue 817. Compared 125488 event pairs, 1426 based on Foata normal form. 1397/19381 useless extension candidates. Maximal degree in co-relation 77573. Up to 7513 conditions per place. [2023-11-24 21:44:22,591 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 105 selfloop transitions, 10 changer transitions 0/142 dead transitions. [2023-11-24 21:44:22,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 142 transitions, 1149 flow [2023-11-24 21:44:22,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:44:22,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 21:44:22,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 240 transitions. [2023-11-24 21:44:22,593 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2023-11-24 21:44:22,593 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 240 transitions. [2023-11-24 21:44:22,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 240 transitions. [2023-11-24 21:44:22,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:44:22,594 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 240 transitions. [2023-11-24 21:44:22,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 48.0) internal successors, (240), 5 states have internal predecessors, (240), 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-24 21:44:22,596 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 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-24 21:44:22,596 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 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-24 21:44:22,596 INFO L175 Difference]: Start difference. First operand has 90 places, 81 transitions, 511 flow. Second operand 5 states and 240 transitions. [2023-11-24 21:44:22,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 142 transitions, 1149 flow [2023-11-24 21:44:22,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 142 transitions, 1129 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-24 21:44:22,674 INFO L231 Difference]: Finished difference. Result has 90 places, 79 transitions, 507 flow [2023-11-24 21:44:22,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=507, PETRI_PLACES=90, PETRI_TRANSITIONS=79} [2023-11-24 21:44:22,674 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 17 predicate places. [2023-11-24 21:44:22,675 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 79 transitions, 507 flow [2023-11-24 21:44:22,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.6) internal successors, (183), 5 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:22,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:44:22,675 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] [2023-11-24 21:44:22,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-24 21:44:22,675 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:44:22,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:44:22,676 INFO L85 PathProgramCache]: Analyzing trace with hash 654145760, now seen corresponding path program 1 times [2023-11-24 21:44:22,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:44:22,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141539954] [2023-11-24 21:44:22,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:44:22,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:44:22,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:44:22,919 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-24 21:44:22,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:44:22,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141539954] [2023-11-24 21:44:22,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141539954] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:44:22,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:44:22,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:44:22,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314380876] [2023-11-24 21:44:22,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:44:22,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:44:22,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:44:22,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:44:22,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:44:22,929 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 66 [2023-11-24 21:44:22,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 79 transitions, 507 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-24 21:44:22,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:44:22,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 66 [2023-11-24 21:44:22,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:44:24,988 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([456] L822-->L829: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd4~0_28 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_30 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_88 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_79 256) 0))))) (and (= (ite .cse0 v_~y$w_buff0~0_29 (ite .cse1 v_~y$w_buff1~0_20 v_~y~0_30)) v_~y~0_29) (= v_~y$w_buff0_used~0_87 (ite .cse0 0 v_~y$w_buff0_used~0_88)) (= (ite .cse2 0 v_~y$r_buff0_thd4~0_30) v_~y$r_buff0_thd4~0_29) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_78 256) 0))) (and .cse4 (not (= (mod v_~y$r_buff0_thd4~0_29 256) 0)))) 0 v_~y$r_buff1_thd4~0_28) v_~y$r_buff1_thd4~0_27) (= v_~y$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_79))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_30, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_88, ~y$w_buff1~0=v_~y$w_buff1~0_20, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_30, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_79} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_29, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_87, ~y$w_buff1~0=v_~y$w_buff1~0_20, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_29, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_78} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][109], [33#P1EXITtrue, 251#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, Black: 265#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork2InUse, P2Thread1of1ForFork3InUse, Black: 200#(and (= ~y$r_buff0_thd0~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 0 ~y$r_buff1_thd0~0)), Black: 198#(and (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= 0 ~y$r_buff1_thd0~0)), 65#L856true, 51#L829true, Black: 140#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 202#(and (= ~y$r_buff0_thd0~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 0 ~y$r_buff1_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 138#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 128#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 127#(= ~z~0 0), 280#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 261#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 214#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), Black: 161#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 159#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 122#(and (not (= |ULTIMATE.start_main_~#t776~0#1.base| |ULTIMATE.start_main_~#t775~0#1.base|)) (not (= |ULTIMATE.start_main_~#t774~0#1.base| |ULTIMATE.start_main_~#t773~0#1.base|)) (not (= |ULTIMATE.start_main_~#t774~0#1.base| |ULTIMATE.start_main_~#t775~0#1.base|)) (not (= |ULTIMATE.start_main_~#t773~0#1.base| |ULTIMATE.start_main_~#t775~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t776~0#1.base| 0) |ULTIMATE.start_main_~#t773~0#1.base| 0) |ULTIMATE.start_main_~#t774~0#1.base| 0) |ULTIMATE.start_main_~#t775~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t773~0#1.base| |ULTIMATE.start_main_~#t776~0#1.base|)) (not (= |ULTIMATE.start_main_~#t774~0#1.base| |ULTIMATE.start_main_~#t776~0#1.base|))), 41#L809true, Black: 155#(= ~__unbuffered_p3_EAX~0 0), 125#true, Black: 233#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0)), Black: 177#(and (= ~y$w_buff1~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 172#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 31#L754true, Black: 253#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0))]) [2023-11-24 21:44:24,989 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-24 21:44:24,989 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:44:24,989 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:44:24,989 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:44:25,082 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([456] L822-->L829: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd4~0_28 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_30 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_88 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_79 256) 0))))) (and (= (ite .cse0 v_~y$w_buff0~0_29 (ite .cse1 v_~y$w_buff1~0_20 v_~y~0_30)) v_~y~0_29) (= v_~y$w_buff0_used~0_87 (ite .cse0 0 v_~y$w_buff0_used~0_88)) (= (ite .cse2 0 v_~y$r_buff0_thd4~0_30) v_~y$r_buff0_thd4~0_29) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_78 256) 0))) (and .cse4 (not (= (mod v_~y$r_buff0_thd4~0_29 256) 0)))) 0 v_~y$r_buff1_thd4~0_28) v_~y$r_buff1_thd4~0_27) (= v_~y$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_79))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_30, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_88, ~y$w_buff1~0=v_~y$w_buff1~0_20, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_30, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_79} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_29, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_87, ~y$w_buff1~0=v_~y$w_buff1~0_20, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_29, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_78} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][109], [60#P2EXITtrue, 33#P1EXITtrue, 251#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, Black: 265#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork2InUse, P2Thread1of1ForFork3InUse, Black: 200#(and (= ~y$r_buff0_thd0~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 0 ~y$r_buff1_thd0~0)), 65#L856true, Black: 198#(and (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= 0 ~y$r_buff1_thd0~0)), 51#L829true, Black: 140#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 202#(and (= ~y$r_buff0_thd0~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 0 ~y$r_buff1_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 138#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 128#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 127#(= ~z~0 0), 280#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 261#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 214#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), Black: 161#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 159#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 122#(and (not (= |ULTIMATE.start_main_~#t776~0#1.base| |ULTIMATE.start_main_~#t775~0#1.base|)) (not (= |ULTIMATE.start_main_~#t774~0#1.base| |ULTIMATE.start_main_~#t773~0#1.base|)) (not (= |ULTIMATE.start_main_~#t774~0#1.base| |ULTIMATE.start_main_~#t775~0#1.base|)) (not (= |ULTIMATE.start_main_~#t773~0#1.base| |ULTIMATE.start_main_~#t775~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t776~0#1.base| 0) |ULTIMATE.start_main_~#t773~0#1.base| 0) |ULTIMATE.start_main_~#t774~0#1.base| 0) |ULTIMATE.start_main_~#t775~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t773~0#1.base| |ULTIMATE.start_main_~#t776~0#1.base|)) (not (= |ULTIMATE.start_main_~#t774~0#1.base| |ULTIMATE.start_main_~#t776~0#1.base|))), Black: 155#(= ~__unbuffered_p3_EAX~0 0), 125#true, Black: 233#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0)), Black: 177#(and (= ~y$w_buff1~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 172#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 31#L754true, Black: 253#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0))]) [2023-11-24 21:44:25,082 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-24 21:44:25,082 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 21:44:25,082 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 21:44:25,082 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 21:44:25,625 INFO L124 PetriNetUnfolderBase]: 9682/14259 cut-off events. [2023-11-24 21:44:25,625 INFO L125 PetriNetUnfolderBase]: For 74993/81611 co-relation queries the response was YES. [2023-11-24 21:44:25,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61740 conditions, 14259 events. 9682/14259 cut-off events. For 74993/81611 co-relation queries the response was YES. Maximal size of possible extension queue 716. Compared 89658 event pairs, 918 based on Foata normal form. 1057/14255 useless extension candidates. Maximal degree in co-relation 61705. Up to 4788 conditions per place. [2023-11-24 21:44:25,777 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 108 selfloop transitions, 14 changer transitions 2/151 dead transitions. [2023-11-24 21:44:25,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 151 transitions, 1242 flow [2023-11-24 21:44:25,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 21:44:25,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-24 21:44:25,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 289 transitions. [2023-11-24 21:44:25,779 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7297979797979798 [2023-11-24 21:44:25,779 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 289 transitions. [2023-11-24 21:44:25,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 289 transitions. [2023-11-24 21:44:25,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:44:25,780 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 289 transitions. [2023-11-24 21:44:25,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 48.166666666666664) internal successors, (289), 6 states have internal predecessors, (289), 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-24 21:44:25,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 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-24 21:44:25,782 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 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-24 21:44:25,783 INFO L175 Difference]: Start difference. First operand has 90 places, 79 transitions, 507 flow. Second operand 6 states and 289 transitions. [2023-11-24 21:44:25,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 151 transitions, 1242 flow [2023-11-24 21:44:25,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 151 transitions, 1217 flow, removed 7 selfloop flow, removed 3 redundant places. [2023-11-24 21:44:25,834 INFO L231 Difference]: Finished difference. Result has 94 places, 81 transitions, 538 flow [2023-11-24 21:44:25,834 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=538, PETRI_PLACES=94, PETRI_TRANSITIONS=81} [2023-11-24 21:44:25,835 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 21 predicate places. [2023-11-24 21:44:25,835 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 81 transitions, 538 flow [2023-11-24 21:44:25,835 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-24 21:44:25,835 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:44:25,835 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] [2023-11-24 21:44:25,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-24 21:44:25,836 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:44:25,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:44:25,836 INFO L85 PathProgramCache]: Analyzing trace with hash -397338837, now seen corresponding path program 1 times [2023-11-24 21:44:25,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:44:25,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366739976] [2023-11-24 21:44:25,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:44:25,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:44:25,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:44:27,163 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-24 21:44:27,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:44:27,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366739976] [2023-11-24 21:44:27,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366739976] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:44:27,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:44:27,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-24 21:44:27,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15808294] [2023-11-24 21:44:27,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:44:27,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 21:44:27,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:44:27,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 21:44:27,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-24 21:44:27,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 66 [2023-11-24 21:44:27,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 81 transitions, 538 flow. Second operand has 7 states, 7 states have (on average 34.285714285714285) internal successors, (240), 7 states have internal predecessors, (240), 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-24 21:44:27,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:44:27,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 66 [2023-11-24 21:44:27,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand