./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d5061ac-75ec-42d0-a982-38427c2d614f/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d5061ac-75ec-42d0-a982-38427c2d614f/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d5061ac-75ec-42d0-a982-38427c2d614f/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d5061ac-75ec-42d0-a982-38427c2d614f/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d5061ac-75ec-42d0-a982-38427c2d614f/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d5061ac-75ec-42d0-a982-38427c2d614f/bin/uautomizer-verify-VRDe98Ueme --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8943650a21e052edc6a6af145da55799620df509a78c8e503eca6167eaa2f8fc --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 12:01:25,803 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 12:01:25,923 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d5061ac-75ec-42d0-a982-38427c2d614f/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-26 12:01:25,930 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 12:01:25,931 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 12:01:25,989 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 12:01:25,991 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 12:01:25,992 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 12:01:25,993 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 12:01:25,998 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 12:01:25,998 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 12:01:25,999 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 12:01:26,000 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 12:01:26,002 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 12:01:26,003 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 12:01:26,003 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 12:01:26,004 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 12:01:26,004 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 12:01:26,005 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 12:01:26,005 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 12:01:26,006 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-26 12:01:26,006 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-26 12:01:26,007 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-26 12:01:26,007 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 12:01:26,008 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-26 12:01:26,008 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 12:01:26,009 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 12:01:26,027 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 12:01:26,028 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 12:01:26,029 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 12:01:26,030 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 12:01:26,030 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 12:01:26,031 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 12:01:26,031 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 12:01:26,031 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 12:01:26,032 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 12:01:26,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 12:01:26,032 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 12:01:26,033 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 12:01:26,033 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 12:01:26,033 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 12:01:26,034 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_0d5061ac-75ec-42d0-a982-38427c2d614f/bin/uautomizer-verify-VRDe98Ueme/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d5061ac-75ec-42d0-a982-38427c2d614f/bin/uautomizer-verify-VRDe98Ueme Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8943650a21e052edc6a6af145da55799620df509a78c8e503eca6167eaa2f8fc [2023-11-26 12:01:26,344 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 12:01:26,380 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 12:01:26,383 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 12:01:26,385 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 12:01:26,386 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 12:01:26,387 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d5061ac-75ec-42d0-a982-38427c2d614f/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i [2023-11-26 12:01:29,622 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 12:01:29,917 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 12:01:29,917 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d5061ac-75ec-42d0-a982-38427c2d614f/sv-benchmarks/c/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i [2023-11-26 12:01:29,939 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d5061ac-75ec-42d0-a982-38427c2d614f/bin/uautomizer-verify-VRDe98Ueme/data/0b51c6b97/2b5a2784b4a24a3f80233dc591675d1d/FLAGda525f645 [2023-11-26 12:01:29,956 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d5061ac-75ec-42d0-a982-38427c2d614f/bin/uautomizer-verify-VRDe98Ueme/data/0b51c6b97/2b5a2784b4a24a3f80233dc591675d1d [2023-11-26 12:01:29,958 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 12:01:29,960 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 12:01:29,962 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 12:01:29,962 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 12:01:29,968 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 12:01:29,969 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:01:29" (1/1) ... [2023-11-26 12:01:29,970 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7419c5b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:29, skipping insertion in model container [2023-11-26 12:01:29,971 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:01:29" (1/1) ... [2023-11-26 12:01:30,027 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 12:01:30,605 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:01:30,629 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 12:01:30,715 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:01:30,758 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 12:01:30,759 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 12:01:30,768 INFO L206 MainTranslator]: Completed translation [2023-11-26 12:01:30,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:30 WrapperNode [2023-11-26 12:01:30,769 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 12:01:30,770 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 12:01:30,770 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 12:01:30,770 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 12:01:30,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:30" (1/1) ... [2023-11-26 12:01:30,803 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:30" (1/1) ... [2023-11-26 12:01:30,851 INFO L138 Inliner]: procedures = 177, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 149 [2023-11-26 12:01:30,852 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 12:01:30,853 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 12:01:30,853 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 12:01:30,853 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 12:01:30,867 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:30" (1/1) ... [2023-11-26 12:01:30,868 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:30" (1/1) ... [2023-11-26 12:01:30,873 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:30" (1/1) ... [2023-11-26 12:01:30,898 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-26 12:01:30,898 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:30" (1/1) ... [2023-11-26 12:01:30,899 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:30" (1/1) ... [2023-11-26 12:01:30,914 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:30" (1/1) ... [2023-11-26 12:01:30,917 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:30" (1/1) ... [2023-11-26 12:01:30,943 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:30" (1/1) ... [2023-11-26 12:01:30,946 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:30" (1/1) ... [2023-11-26 12:01:30,952 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 12:01:30,953 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 12:01:30,953 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 12:01:30,953 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 12:01:30,954 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:30" (1/1) ... [2023-11-26 12:01:30,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 12:01:30,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d5061ac-75ec-42d0-a982-38427c2d614f/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:01:31,029 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d5061ac-75ec-42d0-a982-38427c2d614f/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 12:01:31,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d5061ac-75ec-42d0-a982-38427c2d614f/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 12:01:31,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-26 12:01:31,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-26 12:01:31,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-26 12:01:31,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-26 12:01:31,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-26 12:01:31,085 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-26 12:01:31,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 12:01:31,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 12:01:31,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 12:01:31,086 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-26 12:01:31,088 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-26 12:01:31,089 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-26 12:01:31,090 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-26 12:01:31,090 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-26 12:01:31,090 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-26 12:01:31,090 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-26 12:01:31,090 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-26 12:01:31,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 12:01:31,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-26 12:01:31,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-26 12:01:31,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-26 12:01:31,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-26 12:01:31,093 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-26 12:01:31,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 12:01:31,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 12:01:31,096 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-26 12:01:31,335 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 12:01:31,346 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 12:01:31,874 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 12:01:32,146 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 12:01:32,146 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-26 12:01:32,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:01:32 BoogieIcfgContainer [2023-11-26 12:01:32,150 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 12:01:32,153 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 12:01:32,154 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 12:01:32,157 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 12:01:32,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:01:29" (1/3) ... [2023-11-26 12:01:32,159 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bb425bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:01:32, skipping insertion in model container [2023-11-26 12:01:32,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:30" (2/3) ... [2023-11-26 12:01:32,159 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bb425bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:01:32, skipping insertion in model container [2023-11-26 12:01:32,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:01:32" (3/3) ... [2023-11-26 12:01:32,161 INFO L112 eAbstractionObserver]: Analyzing ICFG mix021_power.oepc_pso.oepc_rmo.oepc.i [2023-11-26 12:01:32,186 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 12:01:32,186 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-26 12:01:32,187 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 12:01:32,284 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 12:01:32,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 66 transitions, 148 flow [2023-11-26 12:01:32,370 INFO L124 PetriNetUnfolderBase]: 2/62 cut-off events. [2023-11-26 12:01:32,371 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 12:01:32,375 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 5. Compared 125 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-26 12:01:32,376 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 66 transitions, 148 flow [2023-11-26 12:01:32,382 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 62 transitions, 136 flow [2023-11-26 12:01:32,401 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 12:01:32,411 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;@1fc75614, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 12:01:32,411 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-26 12:01:32,418 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 12:01:32,419 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-26 12:01:32,419 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 12:01:32,419 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:01:32,420 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-26 12:01:32,421 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 12:01:32,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:32,433 INFO L85 PathProgramCache]: Analyzing trace with hash 14227, now seen corresponding path program 1 times [2023-11-26 12:01:32,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:32,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987112295] [2023-11-26 12:01:32,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:32,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:32,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:32,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:01:32,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:01:32,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987112295] [2023-11-26 12:01:32,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987112295] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:01:32,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:01:32,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 12:01:32,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233214635] [2023-11-26 12:01:32,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:01:32,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:01:32,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:01:32,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:01:32,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:01:32,858 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2023-11-26 12:01:32,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 62 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:01:32,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:01:32,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2023-11-26 12:01:32,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:01:34,843 INFO L124 PetriNetUnfolderBase]: 4217/7238 cut-off events. [2023-11-26 12:01:34,844 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2023-11-26 12:01:34,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13165 conditions, 7238 events. 4217/7238 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 53851 event pairs, 3179 based on Foata normal form. 360/6962 useless extension candidates. Maximal degree in co-relation 13150. Up to 4391 conditions per place. [2023-11-26 12:01:34,960 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 36 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2023-11-26 12:01:34,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 69 transitions, 226 flow [2023-11-26 12:01:34,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:01:34,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:01:34,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-26 12:01:34,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7373737373737373 [2023-11-26 12:01:34,980 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-26 12:01:34,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-26 12:01:34,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:01:34,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-26 12:01:34,990 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-26 12:01:34,995 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-26 12:01:34,996 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-26 12:01:34,998 INFO L175 Difference]: Start difference. First operand has 73 places, 62 transitions, 136 flow. Second operand 3 states and 146 transitions. [2023-11-26 12:01:35,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 69 transitions, 226 flow [2023-11-26 12:01:35,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 69 transitions, 222 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-26 12:01:35,012 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 128 flow [2023-11-26 12:01:35,015 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-26 12:01:35,020 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -4 predicate places. [2023-11-26 12:01:35,021 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 128 flow [2023-11-26 12:01:35,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:01:35,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:01:35,022 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-26 12:01:35,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 12:01:35,023 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 12:01:35,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:35,024 INFO L85 PathProgramCache]: Analyzing trace with hash 14228, now seen corresponding path program 1 times [2023-11-26 12:01:35,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:35,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846040233] [2023-11-26 12:01:35,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:35,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:35,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:35,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:01:35,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:01:35,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846040233] [2023-11-26 12:01:35,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846040233] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:01:35,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:01:35,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 12:01:35,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492720166] [2023-11-26 12:01:35,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:01:35,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:01:35,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:01:35,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:01:35,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:01:35,212 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-26 12:01:35,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 128 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-26 12:01:35,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:01:35,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-26 12:01:35,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:01:36,820 INFO L124 PetriNetUnfolderBase]: 4217/7237 cut-off events. [2023-11-26 12:01:36,820 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2023-11-26 12:01:36,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13341 conditions, 7237 events. 4217/7237 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 53803 event pairs, 3179 based on Foata normal form. 1/6602 useless extension candidates. Maximal degree in co-relation 13330. Up to 4390 conditions per place. [2023-11-26 12:01:36,916 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 35 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-11-26 12:01:36,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 68 transitions, 222 flow [2023-11-26 12:01:36,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:01:36,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:01:36,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-26 12:01:36,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7373737373737373 [2023-11-26 12:01:36,926 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-26 12:01:36,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-26 12:01:36,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:01:36,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-26 12:01:36,937 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-26 12:01:36,939 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-26 12:01:36,939 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-26 12:01:36,940 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 128 flow. Second operand 3 states and 146 transitions. [2023-11-26 12:01:36,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 68 transitions, 222 flow [2023-11-26 12:01:36,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 68 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:01:36,959 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 126 flow [2023-11-26 12:01:36,960 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-26 12:01:36,966 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -5 predicate places. [2023-11-26 12:01:36,966 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 126 flow [2023-11-26 12:01:36,967 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-26 12:01:36,967 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:01:36,967 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 12:01:36,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 12:01:36,968 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 12:01:36,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:36,979 INFO L85 PathProgramCache]: Analyzing trace with hash 424276393, now seen corresponding path program 1 times [2023-11-26 12:01:36,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:36,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976571137] [2023-11-26 12:01:36,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:36,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:37,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:37,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:01:37,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:01:37,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976571137] [2023-11-26 12:01:37,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976571137] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:01:37,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:01:37,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 12:01:37,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637122480] [2023-11-26 12:01:37,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:01:37,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:01:37,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:01:37,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:01:37,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:01:37,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 66 [2023-11-26 12:01:37,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:01:37,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:01:37,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 66 [2023-11-26 12:01:37,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:01:38,427 INFO L124 PetriNetUnfolderBase]: 3311/5478 cut-off events. [2023-11-26 12:01:38,427 INFO L125 PetriNetUnfolderBase]: For 144/144 co-relation queries the response was YES. [2023-11-26 12:01:38,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10300 conditions, 5478 events. 3311/5478 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 39268 event pairs, 593 based on Foata normal form. 0/5401 useless extension candidates. Maximal degree in co-relation 10289. Up to 3661 conditions per place. [2023-11-26 12:01:38,501 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 41 selfloop transitions, 2 changer transitions 2/76 dead transitions. [2023-11-26 12:01:38,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 76 transitions, 262 flow [2023-11-26 12:01:38,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:01:38,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:01:38,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 157 transitions. [2023-11-26 12:01:38,506 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7929292929292929 [2023-11-26 12:01:38,506 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 157 transitions. [2023-11-26 12:01:38,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 157 transitions. [2023-11-26 12:01:38,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:01:38,507 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 157 transitions. [2023-11-26 12:01:38,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:01:38,509 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-26 12:01:38,509 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-26 12:01:38,510 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 126 flow. Second operand 3 states and 157 transitions. [2023-11-26 12:01:38,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 76 transitions, 262 flow [2023-11-26 12:01:38,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 76 transitions, 256 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:01:38,515 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 122 flow [2023-11-26 12:01:38,515 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=122, PETRI_PLACES=67, PETRI_TRANSITIONS=55} [2023-11-26 12:01:38,516 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -6 predicate places. [2023-11-26 12:01:38,516 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 122 flow [2023-11-26 12:01:38,517 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-26 12:01:38,517 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:01:38,517 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 12:01:38,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 12:01:38,518 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 12:01:38,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:38,518 INFO L85 PathProgramCache]: Analyzing trace with hash 424275281, now seen corresponding path program 1 times [2023-11-26 12:01:38,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:38,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560239825] [2023-11-26 12:01:38,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:38,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:38,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:38,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:01:38,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:01:38,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560239825] [2023-11-26 12:01:38,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560239825] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:01:38,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:01:38,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:01:38,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461062931] [2023-11-26 12:01:38,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:01:38,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:01:38,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:01:38,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:01:38,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:01:38,589 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2023-11-26 12:01:38,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:01:38,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:01:38,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2023-11-26 12:01:38,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:01:39,451 INFO L124 PetriNetUnfolderBase]: 2906/5175 cut-off events. [2023-11-26 12:01:39,451 INFO L125 PetriNetUnfolderBase]: For 279/279 co-relation queries the response was YES. [2023-11-26 12:01:39,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9587 conditions, 5175 events. 2906/5175 cut-off events. For 279/279 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 37785 event pairs, 1880 based on Foata normal form. 0/4927 useless extension candidates. Maximal degree in co-relation 9576. Up to 3466 conditions per place. [2023-11-26 12:01:39,560 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 33 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-11-26 12:01:39,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 64 transitions, 212 flow [2023-11-26 12:01:39,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:01:39,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:01:39,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2023-11-26 12:01:39,565 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7121212121212122 [2023-11-26 12:01:39,566 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 141 transitions. [2023-11-26 12:01:39,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 141 transitions. [2023-11-26 12:01:39,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:01:39,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 141 transitions. [2023-11-26 12:01:39,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:01:39,568 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-26 12:01:39,569 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-26 12:01:39,569 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 122 flow. Second operand 3 states and 141 transitions. [2023-11-26 12:01:39,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 64 transitions, 212 flow [2023-11-26 12:01:39,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 64 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:01:39,572 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 120 flow [2023-11-26 12:01:39,572 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-26 12:01:39,573 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -8 predicate places. [2023-11-26 12:01:39,573 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 120 flow [2023-11-26 12:01:39,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:01:39,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:01:39,574 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 12:01:39,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 12:01:39,575 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 12:01:39,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:39,575 INFO L85 PathProgramCache]: Analyzing trace with hash 424275282, now seen corresponding path program 1 times [2023-11-26 12:01:39,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:39,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044347991] [2023-11-26 12:01:39,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:39,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:39,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:39,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:01:39,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:01:39,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044347991] [2023-11-26 12:01:39,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044347991] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:01:39,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:01:39,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:01:39,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402314631] [2023-11-26 12:01:39,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:01:39,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:01:39,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:01:39,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:01:39,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:01:39,668 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-26 12:01:39,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 54 transitions, 120 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-26 12:01:39,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:01:39,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-26 12:01:39,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:01:40,566 INFO L124 PetriNetUnfolderBase]: 2903/5168 cut-off events. [2023-11-26 12:01:40,567 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2023-11-26 12:01:40,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9441 conditions, 5168 events. 2903/5168 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 37758 event pairs, 1880 based on Foata normal form. 4/4924 useless extension candidates. Maximal degree in co-relation 9431. Up to 3459 conditions per place. [2023-11-26 12:01:40,625 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 32 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-11-26 12:01:40,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 63 transitions, 206 flow [2023-11-26 12:01:40,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:01:40,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:01:40,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2023-11-26 12:01:40,628 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-26 12:01:40,628 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 143 transitions. [2023-11-26 12:01:40,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 143 transitions. [2023-11-26 12:01:40,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:01:40,629 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 143 transitions. [2023-11-26 12:01:40,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:01:40,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-26 12:01:40,632 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-26 12:01:40,633 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 120 flow. Second operand 3 states and 143 transitions. [2023-11-26 12:01:40,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 63 transitions, 206 flow [2023-11-26 12:01:40,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 63 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:01:40,641 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 118 flow [2023-11-26 12:01:40,641 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-26 12:01:40,645 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -9 predicate places. [2023-11-26 12:01:40,645 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 118 flow [2023-11-26 12:01:40,646 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-26 12:01:40,646 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:01:40,646 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:01:40,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 12:01:40,647 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 12:01:40,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:40,648 INFO L85 PathProgramCache]: Analyzing trace with hash -503420956, now seen corresponding path program 1 times [2023-11-26 12:01:40,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:40,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659646573] [2023-11-26 12:01:40,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:40,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:40,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:40,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:01:40,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:01:40,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659646573] [2023-11-26 12:01:40,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659646573] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:01:40,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:01:40,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:01:40,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29958219] [2023-11-26 12:01:40,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:01:40,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:01:40,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:01:40,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:01:40,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:01:40,802 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2023-11-26 12:01:40,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:01:40,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:01:40,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2023-11-26 12:01:40,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:01:42,001 INFO L124 PetriNetUnfolderBase]: 2920/5121 cut-off events. [2023-11-26 12:01:42,001 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2023-11-26 12:01:42,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9423 conditions, 5121 events. 2920/5121 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 36957 event pairs, 1892 based on Foata normal form. 0/4895 useless extension candidates. Maximal degree in co-relation 9413. Up to 3460 conditions per place. [2023-11-26 12:01:42,066 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 33 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-11-26 12:01:42,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 62 transitions, 206 flow [2023-11-26 12:01:42,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:01:42,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:01:42,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2023-11-26 12:01:42,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7121212121212122 [2023-11-26 12:01:42,069 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 141 transitions. [2023-11-26 12:01:42,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 141 transitions. [2023-11-26 12:01:42,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:01:42,070 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 141 transitions. [2023-11-26 12:01:42,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:01:42,072 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-26 12:01:42,073 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-26 12:01:42,073 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 118 flow. Second operand 3 states and 141 transitions. [2023-11-26 12:01:42,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 62 transitions, 206 flow [2023-11-26 12:01:42,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 62 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:01:42,079 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 116 flow [2023-11-26 12:01:42,080 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-26 12:01:42,083 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -10 predicate places. [2023-11-26 12:01:42,084 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 116 flow [2023-11-26 12:01:42,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:01:42,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:01:42,085 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:01:42,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 12:01:42,085 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 12:01:42,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:42,087 INFO L85 PathProgramCache]: Analyzing trace with hash -503420955, now seen corresponding path program 1 times [2023-11-26 12:01:42,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:42,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965189548] [2023-11-26 12:01:42,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:42,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:42,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:42,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:01:42,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:01:42,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965189548] [2023-11-26 12:01:42,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965189548] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:01:42,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:01:42,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:01:42,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966533406] [2023-11-26 12:01:42,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:01:42,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:01:42,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:01:42,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:01:42,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:01:42,261 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-26 12:01:42,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:01:42,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:01:42,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-26 12:01:42,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:01:43,079 INFO L124 PetriNetUnfolderBase]: 2903/5092 cut-off events. [2023-11-26 12:01:43,079 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-26 12:01:43,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9373 conditions, 5092 events. 2903/5092 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 36910 event pairs, 1884 based on Foata normal form. 12/4886 useless extension candidates. Maximal degree in co-relation 9363. Up to 3431 conditions per place. [2023-11-26 12:01:43,130 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 32 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-11-26 12:01:43,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 61 transitions, 202 flow [2023-11-26 12:01:43,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:01:43,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:01:43,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2023-11-26 12:01:43,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-26 12:01:43,132 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 143 transitions. [2023-11-26 12:01:43,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 143 transitions. [2023-11-26 12:01:43,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:01:43,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 143 transitions. [2023-11-26 12:01:43,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:01:43,135 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-26 12:01:43,135 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-26 12:01:43,136 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 116 flow. Second operand 3 states and 143 transitions. [2023-11-26 12:01:43,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 61 transitions, 202 flow [2023-11-26 12:01:43,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 61 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:01:43,140 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 114 flow [2023-11-26 12:01:43,141 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-26 12:01:43,142 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -11 predicate places. [2023-11-26 12:01:43,142 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 114 flow [2023-11-26 12:01:43,142 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-26 12:01:43,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:01:43,143 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:01:43,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 12:01:43,143 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 12:01:43,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:43,144 INFO L85 PathProgramCache]: Analyzing trace with hash 612531236, now seen corresponding path program 1 times [2023-11-26 12:01:43,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:43,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692678958] [2023-11-26 12:01:43,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:43,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:43,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:43,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:01:43,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:01:43,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692678958] [2023-11-26 12:01:43,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692678958] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:01:43,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:01:43,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:01:43,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429429000] [2023-11-26 12:01:43,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:01:43,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:01:43,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:01:43,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:01:43,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:01:43,250 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2023-11-26 12:01:43,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 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-26 12:01:43,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:01:43,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2023-11-26 12:01:43,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:01:44,058 INFO L124 PetriNetUnfolderBase]: 2978/5123 cut-off events. [2023-11-26 12:01:44,058 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-26 12:01:44,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9515 conditions, 5123 events. 2978/5123 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 36550 event pairs, 1424 based on Foata normal form. 0/4969 useless extension candidates. Maximal degree in co-relation 9505. Up to 3426 conditions per place. [2023-11-26 12:01:44,099 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 33 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-26 12:01:44,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 60 transitions, 202 flow [2023-11-26 12:01:44,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:01:44,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:01:44,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2023-11-26 12:01:44,101 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7121212121212122 [2023-11-26 12:01:44,101 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 141 transitions. [2023-11-26 12:01:44,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 141 transitions. [2023-11-26 12:01:44,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:01:44,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 141 transitions. [2023-11-26 12:01:44,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:01:44,103 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-26 12:01:44,104 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-26 12:01:44,104 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 141 transitions. [2023-11-26 12:01:44,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 60 transitions, 202 flow [2023-11-26 12:01:44,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 60 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:01:44,107 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 112 flow [2023-11-26 12:01:44,107 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=112, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2023-11-26 12:01:44,108 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -12 predicate places. [2023-11-26 12:01:44,108 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 112 flow [2023-11-26 12:01:44,109 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-26 12:01:44,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:01:44,109 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:01:44,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 12:01:44,109 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 12:01:44,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:44,110 INFO L85 PathProgramCache]: Analyzing trace with hash 612531237, now seen corresponding path program 1 times [2023-11-26 12:01:44,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:44,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162580452] [2023-11-26 12:01:44,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:44,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:44,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:44,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:01:44,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:01:44,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162580452] [2023-11-26 12:01:44,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162580452] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:01:44,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:01:44,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:01:44,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179691562] [2023-11-26 12:01:44,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:01:44,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:01:44,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:01:44,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:01:44,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:01:44,210 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-26 12:01:44,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 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-26 12:01:44,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:01:44,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-26 12:01:44,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:01:44,904 INFO L124 PetriNetUnfolderBase]: 2903/5072 cut-off events. [2023-11-26 12:01:44,905 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2023-11-26 12:01:44,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9377 conditions, 5072 events. 2903/5072 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 36419 event pairs, 920 based on Foata normal form. 36/4990 useless extension candidates. Maximal degree in co-relation 9367. Up to 3315 conditions per place. [2023-11-26 12:01:44,954 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 32 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-11-26 12:01:44,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 59 transitions, 198 flow [2023-11-26 12:01:44,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:01:44,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:01:44,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2023-11-26 12:01:44,958 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-26 12:01:44,958 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 143 transitions. [2023-11-26 12:01:44,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 143 transitions. [2023-11-26 12:01:44,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:01:44,959 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 143 transitions. [2023-11-26 12:01:44,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:01:44,960 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-26 12:01:44,961 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-26 12:01:44,961 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 3 states and 143 transitions. [2023-11-26 12:01:44,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 59 transitions, 198 flow [2023-11-26 12:01:44,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 59 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:01:44,964 INFO L231 Difference]: Finished difference. Result has 60 places, 49 transitions, 110 flow [2023-11-26 12:01:44,964 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=60, PETRI_TRANSITIONS=49} [2023-11-26 12:01:44,966 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -13 predicate places. [2023-11-26 12:01:44,966 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 49 transitions, 110 flow [2023-11-26 12:01:44,967 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-26 12:01:44,967 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:01:44,967 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:01:44,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 12:01:44,967 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 12:01:44,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:44,968 INFO L85 PathProgramCache]: Analyzing trace with hash -136945484, now seen corresponding path program 1 times [2023-11-26 12:01:44,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:44,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457964138] [2023-11-26 12:01:44,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:44,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:45,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:46,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:01:46,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:01:46,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457964138] [2023-11-26 12:01:46,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457964138] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:01:46,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:01:46,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-26 12:01:46,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928305915] [2023-11-26 12:01:46,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:01:46,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-26 12:01:46,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:01:46,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-26 12:01:46,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-26 12:01:46,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 66 [2023-11-26 12:01:46,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 110 flow. Second operand has 10 states, 10 states have (on average 34.7) internal successors, (347), 10 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:01:46,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:01:46,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 66 [2023-11-26 12:01:46,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:01:47,993 INFO L124 PetriNetUnfolderBase]: 3664/5602 cut-off events. [2023-11-26 12:01:47,993 INFO L125 PetriNetUnfolderBase]: For 204/204 co-relation queries the response was YES. [2023-11-26 12:01:48,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10972 conditions, 5602 events. 3664/5602 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 35715 event pairs, 152 based on Foata normal form. 180/5742 useless extension candidates. Maximal degree in co-relation 10962. Up to 3384 conditions per place. [2023-11-26 12:01:48,043 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 48 selfloop transitions, 5 changer transitions 13/87 dead transitions. [2023-11-26 12:01:48,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 87 transitions, 320 flow [2023-11-26 12:01:48,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 12:01:48,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-26 12:01:48,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 331 transitions. [2023-11-26 12:01:48,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6268939393939394 [2023-11-26 12:01:48,047 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 331 transitions. [2023-11-26 12:01:48,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 331 transitions. [2023-11-26 12:01:48,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:01:48,048 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 331 transitions. [2023-11-26 12:01:48,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 41.375) internal successors, (331), 8 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:01:48,051 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-26 12:01:48,052 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-26 12:01:48,052 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 110 flow. Second operand 8 states and 331 transitions. [2023-11-26 12:01:48,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 87 transitions, 320 flow [2023-11-26 12:01:48,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 87 transitions, 314 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:01:48,056 INFO L231 Difference]: Finished difference. Result has 64 places, 47 transitions, 112 flow [2023-11-26 12:01:48,056 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=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=112, PETRI_PLACES=64, PETRI_TRANSITIONS=47} [2023-11-26 12:01:48,057 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -9 predicate places. [2023-11-26 12:01:48,057 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 47 transitions, 112 flow [2023-11-26 12:01:48,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 34.7) internal successors, (347), 10 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:01:48,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:01:48,058 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:01:48,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 12:01:48,059 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 12:01:48,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:48,059 INFO L85 PathProgramCache]: Analyzing trace with hash -136943829, now seen corresponding path program 1 times [2023-11-26 12:01:48,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:48,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616342508] [2023-11-26 12:01:48,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:48,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:48,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:48,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:01:48,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:01:48,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616342508] [2023-11-26 12:01:48,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616342508] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:01:48,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:01:48,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 12:01:48,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757719938] [2023-11-26 12:01:48,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:01:48,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 12:01:48,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:01:48,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 12:01:48,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 12:01:48,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 66 [2023-11-26 12:01:48,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 47 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:01:48,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:01:48,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 66 [2023-11-26 12:01:48,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:01:54,816 INFO L124 PetriNetUnfolderBase]: 38109/54867 cut-off events. [2023-11-26 12:01:54,817 INFO L125 PetriNetUnfolderBase]: For 2541/2541 co-relation queries the response was YES. [2023-11-26 12:01:54,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108952 conditions, 54867 events. 38109/54867 cut-off events. For 2541/2541 co-relation queries the response was YES. Maximal size of possible extension queue 2336. Compared 399132 event pairs, 8776 based on Foata normal form. 0/53587 useless extension candidates. Maximal degree in co-relation 108941. Up to 19638 conditions per place. [2023-11-26 12:01:55,131 INFO L140 encePairwiseOnDemand]: 54/66 looper letters, 47 selfloop transitions, 8 changer transitions 103/174 dead transitions. [2023-11-26 12:01:55,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 174 transitions, 704 flow [2023-11-26 12:01:55,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 12:01:55,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-26 12:01:55,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 421 transitions. [2023-11-26 12:01:55,135 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7087542087542088 [2023-11-26 12:01:55,135 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 421 transitions. [2023-11-26 12:01:55,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 421 transitions. [2023-11-26 12:01:55,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:01:55,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 421 transitions. [2023-11-26 12:01:55,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 46.77777777777778) internal successors, (421), 9 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:01:55,141 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 66.0) internal successors, (660), 10 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:01:55,141 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 66.0) internal successors, (660), 10 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:01:55,142 INFO L175 Difference]: Start difference. First operand has 64 places, 47 transitions, 112 flow. Second operand 9 states and 421 transitions. [2023-11-26 12:01:55,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 174 transitions, 704 flow [2023-11-26 12:01:55,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 174 transitions, 684 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-26 12:01:55,149 INFO L231 Difference]: Finished difference. Result has 73 places, 53 transitions, 214 flow [2023-11-26 12:01:55,149 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=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=214, PETRI_PLACES=73, PETRI_TRANSITIONS=53} [2023-11-26 12:01:55,150 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 0 predicate places. [2023-11-26 12:01:55,150 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 53 transitions, 214 flow [2023-11-26 12:01:55,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:01:55,151 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:01:55,151 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:01:55,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 12:01:55,152 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 12:01:55,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:55,152 INFO L85 PathProgramCache]: Analyzing trace with hash -703129142, now seen corresponding path program 1 times [2023-11-26 12:01:55,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:55,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841425489] [2023-11-26 12:01:55,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:55,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:55,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:55,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:01:55,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:01:55,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841425489] [2023-11-26 12:01:55,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841425489] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:01:55,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:01:55,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 12:01:55,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037117272] [2023-11-26 12:01:55,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:01:55,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 12:01:55,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:01:55,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 12:01:55,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 12:01:55,479 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2023-11-26 12:01:55,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 53 transitions, 214 flow. Second operand has 5 states, 5 states have (on average 36.8) internal successors, (184), 5 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:01:55,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:01:55,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2023-11-26 12:01:55,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:02:00,291 INFO L124 PetriNetUnfolderBase]: 21191/33979 cut-off events. [2023-11-26 12:02:00,291 INFO L125 PetriNetUnfolderBase]: For 33935/36805 co-relation queries the response was YES. [2023-11-26 12:02:00,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90567 conditions, 33979 events. 21191/33979 cut-off events. For 33935/36805 co-relation queries the response was YES. Maximal size of possible extension queue 1638. Compared 282555 event pairs, 5394 based on Foata normal form. 1246/34161 useless extension candidates. Maximal degree in co-relation 90548. Up to 18528 conditions per place. [2023-11-26 12:02:00,536 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 34 selfloop transitions, 3 changer transitions 43/106 dead transitions. [2023-11-26 12:02:00,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 106 transitions, 542 flow [2023-11-26 12:02:00,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 12:02:00,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-26 12:02:00,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 314 transitions. [2023-11-26 12:02:00,539 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6796536796536796 [2023-11-26 12:02:00,539 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 314 transitions. [2023-11-26 12:02:00,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 314 transitions. [2023-11-26 12:02:00,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:02:00,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 314 transitions. [2023-11-26 12:02:00,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 44.857142857142854) internal successors, (314), 7 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:00,549 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-26 12:02:00,549 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-26 12:02:00,549 INFO L175 Difference]: Start difference. First operand has 73 places, 53 transitions, 214 flow. Second operand 7 states and 314 transitions. [2023-11-26 12:02:00,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 106 transitions, 542 flow [2023-11-26 12:02:00,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 106 transitions, 496 flow, removed 11 selfloop flow, removed 4 redundant places. [2023-11-26 12:02:00,670 INFO L231 Difference]: Finished difference. Result has 73 places, 53 transitions, 203 flow [2023-11-26 12:02:00,671 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=203, PETRI_PLACES=73, PETRI_TRANSITIONS=53} [2023-11-26 12:02:00,671 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 0 predicate places. [2023-11-26 12:02:00,672 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 53 transitions, 203 flow [2023-11-26 12:02:00,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.8) internal successors, (184), 5 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:00,672 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:02:00,672 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:02:00,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-26 12:02:00,673 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 12:02:00,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:00,673 INFO L85 PathProgramCache]: Analyzing trace with hash 330041774, now seen corresponding path program 1 times [2023-11-26 12:02:00,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:00,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126654338] [2023-11-26 12:02:00,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:00,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:00,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:00,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:00,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:00,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126654338] [2023-11-26 12:02:00,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126654338] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:00,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:00,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 12:02:00,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480868194] [2023-11-26 12:02:00,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:00,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 12:02:00,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:00,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 12:02:00,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 12:02:00,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 66 [2023-11-26 12:02:00,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 53 transitions, 203 flow. Second operand has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:00,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:02:00,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 66 [2023-11-26 12:02:00,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:02:03,015 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([445] L764-->L771: Formula: (let ((.cse3 (not (= (mod v_~a$r_buff1_thd1~0_20 256) 0))) (.cse4 (not (= (mod v_~a$w_buff0_used~0_71 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_35 256) 0)))) (let ((.cse1 (and .cse4 .cse5)) (.cse0 (and (not (= (mod v_~a$w_buff0_used~0_72 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~a$w_buff1_used~0_57 256) 0)) .cse3))) (and (= v_~a$w_buff0_used~0_71 (ite .cse0 0 v_~a$w_buff0_used~0_72)) (= (ite (or .cse1 .cse2) 0 v_~a$w_buff1_used~0_57) v_~a$w_buff1_used~0_56) (= v_~a$r_buff0_thd1~0_34 (ite .cse1 0 v_~a$r_buff0_thd1~0_35)) (= v_~a~0_22 (ite .cse0 v_~a$w_buff0~0_22 (ite .cse2 v_~a$w_buff1~0_15 v_~a~0_23))) (= (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_56 256) 0))) (and (not (= (mod v_~a$r_buff0_thd1~0_34 256) 0)) .cse4)) 0 v_~a$r_buff1_thd1~0_20) v_~a$r_buff1_thd1~0_19)))) InVars {~a~0=v_~a~0_23, ~a$w_buff1~0=v_~a$w_buff1~0_15, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_20, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_72, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_35, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_57} OutVars{~a~0=v_~a~0_22, ~a$w_buff1~0=v_~a$w_buff1~0_15, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_19, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_71, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_34, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_56} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][35], [30#L876true, Black: 154#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 157#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 153#(= ~__unbuffered_p3_EAX~0 0), Black: 159#(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))), 63#L791true, P1Thread1of1ForFork1InUse, 53#L771true, P2Thread1of1ForFork0InUse, 62#L824true, 151#true, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, Black: 139#(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: 132#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 137#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~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))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t556~0#1.base| 0) |ULTIMATE.start_main_~#t553~0#1.base| 0) |ULTIMATE.start_main_~#t554~0#1.base| 0) |ULTIMATE.start_main_~#t555~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t555~0#1.base|)) (not (= |ULTIMATE.start_main_~#t554~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|))), Black: 135#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 129#true, 35#L811true, 168#true]) [2023-11-26 12:02:03,015 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-26 12:02:03,015 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-26 12:02:03,015 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-26 12:02:03,015 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-26 12:02:03,016 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([463] L824-->L840: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse6 (not .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse2 (and .cse5 .cse8)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_125 256) 0) .cse5))) (let ((.cse9 (or .cse12 .cse2 .cse3)) (.cse10 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_124 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse9 v_~a~0_74 (ite .cse10 v_~a$w_buff0~0_55 v_~a$w_buff1~0_48)))) (and (= v_~a$flush_delayed~0_23 0) (= v_~a$w_buff0~0_54 v_~a$w_buff0~0_55) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= (ite .cse0 v_~a$w_buff1_used~0_125 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_125 0)) v_~a$w_buff1_used~0_124) (= (ite .cse0 v_~a$r_buff0_thd4~0_62 (ite (or .cse1 (and .cse4 .cse5) .cse2) v_~a$r_buff0_thd4~0_62 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_62))) v_~a$r_buff0_thd4~0_61) (= v_~a$r_buff1_thd4~0_59 (ite .cse0 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or .cse1 (and .cse7 .cse8) (and .cse7 .cse4))) v_~a$r_buff1_thd4~0_60 0))) (= v_~a$w_buff0_used~0_137 (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse9 v_~a$w_buff0_used~0_138 (ite .cse10 0 v_~a$w_buff0_used~0_138)))) (= v_~a~0_74 v_~a$mem_tmp~0_18) (= .cse11 v_~__unbuffered_p3_EBX~0_10) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_18 .cse11))))))) InVars {~a~0=v_~a~0_74, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_55, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_125, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_54, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_124, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][62], [30#L876true, Black: 154#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 157#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 29#L764true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), Black: 159#(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))), 63#L791true, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 151#true, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, Black: 139#(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: 132#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 137#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~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))), Black: 131#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t556~0#1.base| 0) |ULTIMATE.start_main_~#t553~0#1.base| 0) |ULTIMATE.start_main_~#t554~0#1.base| 0) |ULTIMATE.start_main_~#t555~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t555~0#1.base|)) (not (= |ULTIMATE.start_main_~#t554~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|))), Black: 135#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 35#L811true, 46#L840true, 168#true]) [2023-11-26 12:02:03,016 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-26 12:02:03,016 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-26 12:02:03,016 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-26 12:02:03,016 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-26 12:02:03,290 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([445] L764-->L771: Formula: (let ((.cse3 (not (= (mod v_~a$r_buff1_thd1~0_20 256) 0))) (.cse4 (not (= (mod v_~a$w_buff0_used~0_71 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_35 256) 0)))) (let ((.cse1 (and .cse4 .cse5)) (.cse0 (and (not (= (mod v_~a$w_buff0_used~0_72 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~a$w_buff1_used~0_57 256) 0)) .cse3))) (and (= v_~a$w_buff0_used~0_71 (ite .cse0 0 v_~a$w_buff0_used~0_72)) (= (ite (or .cse1 .cse2) 0 v_~a$w_buff1_used~0_57) v_~a$w_buff1_used~0_56) (= v_~a$r_buff0_thd1~0_34 (ite .cse1 0 v_~a$r_buff0_thd1~0_35)) (= v_~a~0_22 (ite .cse0 v_~a$w_buff0~0_22 (ite .cse2 v_~a$w_buff1~0_15 v_~a~0_23))) (= (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_56 256) 0))) (and (not (= (mod v_~a$r_buff0_thd1~0_34 256) 0)) .cse4)) 0 v_~a$r_buff1_thd1~0_20) v_~a$r_buff1_thd1~0_19)))) InVars {~a~0=v_~a~0_23, ~a$w_buff1~0=v_~a$w_buff1~0_15, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_20, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_72, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_35, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_57} OutVars{~a~0=v_~a~0_22, ~a$w_buff1~0=v_~a$w_buff1~0_15, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_19, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_71, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_34, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_56} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][35], [Black: 154#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 157#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 44#L882true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), Black: 159#(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))), 63#L791true, P1Thread1of1ForFork1InUse, 62#L824true, 53#L771true, P2Thread1of1ForFork0InUse, 151#true, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, Black: 139#(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: 132#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 137#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~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))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t556~0#1.base| 0) |ULTIMATE.start_main_~#t553~0#1.base| 0) |ULTIMATE.start_main_~#t554~0#1.base| 0) |ULTIMATE.start_main_~#t555~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t555~0#1.base|)) (not (= |ULTIMATE.start_main_~#t554~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|))), Black: 135#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 129#true, 35#L811true, 168#true]) [2023-11-26 12:02:03,290 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-26 12:02:03,290 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-26 12:02:03,290 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-26 12:02:03,290 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-26 12:02:03,291 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([463] L824-->L840: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse6 (not .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse2 (and .cse5 .cse8)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_125 256) 0) .cse5))) (let ((.cse9 (or .cse12 .cse2 .cse3)) (.cse10 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_124 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse9 v_~a~0_74 (ite .cse10 v_~a$w_buff0~0_55 v_~a$w_buff1~0_48)))) (and (= v_~a$flush_delayed~0_23 0) (= v_~a$w_buff0~0_54 v_~a$w_buff0~0_55) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= (ite .cse0 v_~a$w_buff1_used~0_125 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_125 0)) v_~a$w_buff1_used~0_124) (= (ite .cse0 v_~a$r_buff0_thd4~0_62 (ite (or .cse1 (and .cse4 .cse5) .cse2) v_~a$r_buff0_thd4~0_62 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_62))) v_~a$r_buff0_thd4~0_61) (= v_~a$r_buff1_thd4~0_59 (ite .cse0 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or .cse1 (and .cse7 .cse8) (and .cse7 .cse4))) v_~a$r_buff1_thd4~0_60 0))) (= v_~a$w_buff0_used~0_137 (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse9 v_~a$w_buff0_used~0_138 (ite .cse10 0 v_~a$w_buff0_used~0_138)))) (= v_~a~0_74 v_~a$mem_tmp~0_18) (= .cse11 v_~__unbuffered_p3_EBX~0_10) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_18 .cse11))))))) InVars {~a~0=v_~a~0_74, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_55, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_125, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_54, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_124, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][62], [Black: 154#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 157#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 44#L882true, 29#L764true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), Black: 159#(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))), 63#L791true, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 151#true, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, Black: 139#(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: 132#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 137#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~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))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t556~0#1.base| 0) |ULTIMATE.start_main_~#t553~0#1.base| 0) |ULTIMATE.start_main_~#t554~0#1.base| 0) |ULTIMATE.start_main_~#t555~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t555~0#1.base|)) (not (= |ULTIMATE.start_main_~#t554~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|))), Black: 131#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 135#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 35#L811true, 46#L840true, 168#true]) [2023-11-26 12:02:03,291 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-26 12:02:03,291 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-26 12:02:03,291 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-26 12:02:03,291 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-26 12:02:03,812 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([445] L764-->L771: Formula: (let ((.cse3 (not (= (mod v_~a$r_buff1_thd1~0_20 256) 0))) (.cse4 (not (= (mod v_~a$w_buff0_used~0_71 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_35 256) 0)))) (let ((.cse1 (and .cse4 .cse5)) (.cse0 (and (not (= (mod v_~a$w_buff0_used~0_72 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~a$w_buff1_used~0_57 256) 0)) .cse3))) (and (= v_~a$w_buff0_used~0_71 (ite .cse0 0 v_~a$w_buff0_used~0_72)) (= (ite (or .cse1 .cse2) 0 v_~a$w_buff1_used~0_57) v_~a$w_buff1_used~0_56) (= v_~a$r_buff0_thd1~0_34 (ite .cse1 0 v_~a$r_buff0_thd1~0_35)) (= v_~a~0_22 (ite .cse0 v_~a$w_buff0~0_22 (ite .cse2 v_~a$w_buff1~0_15 v_~a~0_23))) (= (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_56 256) 0))) (and (not (= (mod v_~a$r_buff0_thd1~0_34 256) 0)) .cse4)) 0 v_~a$r_buff1_thd1~0_20) v_~a$r_buff1_thd1~0_19)))) InVars {~a~0=v_~a~0_23, ~a$w_buff1~0=v_~a$w_buff1~0_15, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_20, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_72, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_35, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_57} OutVars{~a~0=v_~a~0_22, ~a$w_buff1~0=v_~a$w_buff1~0_15, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_19, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_71, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_34, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_56} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][35], [30#L876true, Black: 154#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 157#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 153#(= ~__unbuffered_p3_EAX~0 0), Black: 159#(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))), P1Thread1of1ForFork1InUse, 53#L771true, P2Thread1of1ForFork0InUse, 62#L824true, 151#true, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, Black: 139#(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: 132#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 137#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~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))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t556~0#1.base| 0) |ULTIMATE.start_main_~#t553~0#1.base| 0) |ULTIMATE.start_main_~#t554~0#1.base| 0) |ULTIMATE.start_main_~#t555~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t555~0#1.base|)) (not (= |ULTIMATE.start_main_~#t554~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|))), Black: 135#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 129#true, 35#L811true, 31#P1EXITtrue, 168#true]) [2023-11-26 12:02:03,812 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-26 12:02:03,813 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-26 12:02:03,813 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-26 12:02:03,813 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-26 12:02:03,813 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([463] L824-->L840: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse6 (not .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse2 (and .cse5 .cse8)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_125 256) 0) .cse5))) (let ((.cse9 (or .cse12 .cse2 .cse3)) (.cse10 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_124 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse9 v_~a~0_74 (ite .cse10 v_~a$w_buff0~0_55 v_~a$w_buff1~0_48)))) (and (= v_~a$flush_delayed~0_23 0) (= v_~a$w_buff0~0_54 v_~a$w_buff0~0_55) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= (ite .cse0 v_~a$w_buff1_used~0_125 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_125 0)) v_~a$w_buff1_used~0_124) (= (ite .cse0 v_~a$r_buff0_thd4~0_62 (ite (or .cse1 (and .cse4 .cse5) .cse2) v_~a$r_buff0_thd4~0_62 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_62))) v_~a$r_buff0_thd4~0_61) (= v_~a$r_buff1_thd4~0_59 (ite .cse0 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or .cse1 (and .cse7 .cse8) (and .cse7 .cse4))) v_~a$r_buff1_thd4~0_60 0))) (= v_~a$w_buff0_used~0_137 (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse9 v_~a$w_buff0_used~0_138 (ite .cse10 0 v_~a$w_buff0_used~0_138)))) (= v_~a~0_74 v_~a$mem_tmp~0_18) (= .cse11 v_~__unbuffered_p3_EBX~0_10) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_18 .cse11))))))) InVars {~a~0=v_~a~0_74, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_55, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_125, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_54, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_124, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][62], [30#L876true, Black: 154#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 157#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 29#L764true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), Black: 159#(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))), P1Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 151#true, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, Black: 139#(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: 132#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 137#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~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))), Black: 131#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t556~0#1.base| 0) |ULTIMATE.start_main_~#t553~0#1.base| 0) |ULTIMATE.start_main_~#t554~0#1.base| 0) |ULTIMATE.start_main_~#t555~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t555~0#1.base|)) (not (= |ULTIMATE.start_main_~#t554~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|))), Black: 135#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 35#L811true, 31#P1EXITtrue, 46#L840true, 168#true]) [2023-11-26 12:02:03,814 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-26 12:02:03,814 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-26 12:02:03,814 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-26 12:02:03,814 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-26 12:02:03,816 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([445] L764-->L771: Formula: (let ((.cse3 (not (= (mod v_~a$r_buff1_thd1~0_20 256) 0))) (.cse4 (not (= (mod v_~a$w_buff0_used~0_71 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_35 256) 0)))) (let ((.cse1 (and .cse4 .cse5)) (.cse0 (and (not (= (mod v_~a$w_buff0_used~0_72 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~a$w_buff1_used~0_57 256) 0)) .cse3))) (and (= v_~a$w_buff0_used~0_71 (ite .cse0 0 v_~a$w_buff0_used~0_72)) (= (ite (or .cse1 .cse2) 0 v_~a$w_buff1_used~0_57) v_~a$w_buff1_used~0_56) (= v_~a$r_buff0_thd1~0_34 (ite .cse1 0 v_~a$r_buff0_thd1~0_35)) (= v_~a~0_22 (ite .cse0 v_~a$w_buff0~0_22 (ite .cse2 v_~a$w_buff1~0_15 v_~a~0_23))) (= (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_56 256) 0))) (and (not (= (mod v_~a$r_buff0_thd1~0_34 256) 0)) .cse4)) 0 v_~a$r_buff1_thd1~0_20) v_~a$r_buff1_thd1~0_19)))) InVars {~a~0=v_~a~0_23, ~a$w_buff1~0=v_~a$w_buff1~0_15, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_20, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_72, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_35, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_57} OutVars{~a~0=v_~a~0_22, ~a$w_buff1~0=v_~a$w_buff1~0_15, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_19, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_71, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_34, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_56} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][35], [30#L876true, Black: 154#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 157#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 153#(= ~__unbuffered_p3_EAX~0 0), Black: 159#(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))), 63#L791true, P1Thread1of1ForFork1InUse, 53#L771true, 66#P2EXITtrue, P2Thread1of1ForFork0InUse, 62#L824true, 151#true, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, Black: 139#(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: 132#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 137#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~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))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t556~0#1.base| 0) |ULTIMATE.start_main_~#t553~0#1.base| 0) |ULTIMATE.start_main_~#t554~0#1.base| 0) |ULTIMATE.start_main_~#t555~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t555~0#1.base|)) (not (= |ULTIMATE.start_main_~#t554~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|))), Black: 135#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 129#true, 168#true]) [2023-11-26 12:02:03,816 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-26 12:02:03,816 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-26 12:02:03,816 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-26 12:02:03,816 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-26 12:02:03,817 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([463] L824-->L840: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse6 (not .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse2 (and .cse5 .cse8)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_125 256) 0) .cse5))) (let ((.cse9 (or .cse12 .cse2 .cse3)) (.cse10 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_124 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse9 v_~a~0_74 (ite .cse10 v_~a$w_buff0~0_55 v_~a$w_buff1~0_48)))) (and (= v_~a$flush_delayed~0_23 0) (= v_~a$w_buff0~0_54 v_~a$w_buff0~0_55) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= (ite .cse0 v_~a$w_buff1_used~0_125 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_125 0)) v_~a$w_buff1_used~0_124) (= (ite .cse0 v_~a$r_buff0_thd4~0_62 (ite (or .cse1 (and .cse4 .cse5) .cse2) v_~a$r_buff0_thd4~0_62 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_62))) v_~a$r_buff0_thd4~0_61) (= v_~a$r_buff1_thd4~0_59 (ite .cse0 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or .cse1 (and .cse7 .cse8) (and .cse7 .cse4))) v_~a$r_buff1_thd4~0_60 0))) (= v_~a$w_buff0_used~0_137 (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse9 v_~a$w_buff0_used~0_138 (ite .cse10 0 v_~a$w_buff0_used~0_138)))) (= v_~a~0_74 v_~a$mem_tmp~0_18) (= .cse11 v_~__unbuffered_p3_EBX~0_10) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_18 .cse11))))))) InVars {~a~0=v_~a~0_74, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_55, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_125, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_54, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_124, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][62], [30#L876true, Black: 154#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 157#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 29#L764true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), Black: 159#(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))), 63#L791true, P1Thread1of1ForFork1InUse, 66#P2EXITtrue, P2Thread1of1ForFork0InUse, 151#true, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, Black: 139#(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: 132#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 137#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~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))), Black: 131#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t556~0#1.base| 0) |ULTIMATE.start_main_~#t553~0#1.base| 0) |ULTIMATE.start_main_~#t554~0#1.base| 0) |ULTIMATE.start_main_~#t555~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t555~0#1.base|)) (not (= |ULTIMATE.start_main_~#t554~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|))), Black: 135#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 46#L840true, 168#true]) [2023-11-26 12:02:03,818 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-26 12:02:03,818 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-26 12:02:03,818 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-26 12:02:03,818 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-26 12:02:04,264 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([445] L764-->L771: Formula: (let ((.cse3 (not (= (mod v_~a$r_buff1_thd1~0_20 256) 0))) (.cse4 (not (= (mod v_~a$w_buff0_used~0_71 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_35 256) 0)))) (let ((.cse1 (and .cse4 .cse5)) (.cse0 (and (not (= (mod v_~a$w_buff0_used~0_72 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~a$w_buff1_used~0_57 256) 0)) .cse3))) (and (= v_~a$w_buff0_used~0_71 (ite .cse0 0 v_~a$w_buff0_used~0_72)) (= (ite (or .cse1 .cse2) 0 v_~a$w_buff1_used~0_57) v_~a$w_buff1_used~0_56) (= v_~a$r_buff0_thd1~0_34 (ite .cse1 0 v_~a$r_buff0_thd1~0_35)) (= v_~a~0_22 (ite .cse0 v_~a$w_buff0~0_22 (ite .cse2 v_~a$w_buff1~0_15 v_~a~0_23))) (= (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_56 256) 0))) (and (not (= (mod v_~a$r_buff0_thd1~0_34 256) 0)) .cse4)) 0 v_~a$r_buff1_thd1~0_20) v_~a$r_buff1_thd1~0_19)))) InVars {~a~0=v_~a~0_23, ~a$w_buff1~0=v_~a$w_buff1~0_15, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_20, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_72, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_35, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_57} OutVars{~a~0=v_~a~0_22, ~a$w_buff1~0=v_~a$w_buff1~0_15, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_19, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_71, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_34, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_56} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][35], [Black: 154#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 157#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 44#L882true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), Black: 159#(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))), P1Thread1of1ForFork1InUse, 62#L824true, 53#L771true, P2Thread1of1ForFork0InUse, 151#true, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, Black: 139#(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: 132#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 137#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~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))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t556~0#1.base| 0) |ULTIMATE.start_main_~#t553~0#1.base| 0) |ULTIMATE.start_main_~#t554~0#1.base| 0) |ULTIMATE.start_main_~#t555~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t555~0#1.base|)) (not (= |ULTIMATE.start_main_~#t554~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|))), Black: 135#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 129#true, 35#L811true, 31#P1EXITtrue, 168#true]) [2023-11-26 12:02:04,264 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-26 12:02:04,264 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-26 12:02:04,265 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-26 12:02:04,265 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-26 12:02:04,265 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([463] L824-->L840: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse6 (not .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse2 (and .cse5 .cse8)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_125 256) 0) .cse5))) (let ((.cse9 (or .cse12 .cse2 .cse3)) (.cse10 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_124 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse9 v_~a~0_74 (ite .cse10 v_~a$w_buff0~0_55 v_~a$w_buff1~0_48)))) (and (= v_~a$flush_delayed~0_23 0) (= v_~a$w_buff0~0_54 v_~a$w_buff0~0_55) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= (ite .cse0 v_~a$w_buff1_used~0_125 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_125 0)) v_~a$w_buff1_used~0_124) (= (ite .cse0 v_~a$r_buff0_thd4~0_62 (ite (or .cse1 (and .cse4 .cse5) .cse2) v_~a$r_buff0_thd4~0_62 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_62))) v_~a$r_buff0_thd4~0_61) (= v_~a$r_buff1_thd4~0_59 (ite .cse0 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or .cse1 (and .cse7 .cse8) (and .cse7 .cse4))) v_~a$r_buff1_thd4~0_60 0))) (= v_~a$w_buff0_used~0_137 (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse9 v_~a$w_buff0_used~0_138 (ite .cse10 0 v_~a$w_buff0_used~0_138)))) (= v_~a~0_74 v_~a$mem_tmp~0_18) (= .cse11 v_~__unbuffered_p3_EBX~0_10) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_18 .cse11))))))) InVars {~a~0=v_~a~0_74, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_55, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_125, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_54, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_124, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][62], [Black: 154#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 157#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 44#L882true, 29#L764true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), Black: 159#(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))), P1Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 151#true, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, Black: 139#(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: 132#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 137#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~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))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t556~0#1.base| 0) |ULTIMATE.start_main_~#t553~0#1.base| 0) |ULTIMATE.start_main_~#t554~0#1.base| 0) |ULTIMATE.start_main_~#t555~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t555~0#1.base|)) (not (= |ULTIMATE.start_main_~#t554~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|))), Black: 131#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 135#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 35#L811true, 31#P1EXITtrue, 46#L840true, 168#true]) [2023-11-26 12:02:04,265 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-26 12:02:04,266 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-26 12:02:04,266 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-26 12:02:04,266 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-26 12:02:04,268 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([445] L764-->L771: Formula: (let ((.cse3 (not (= (mod v_~a$r_buff1_thd1~0_20 256) 0))) (.cse4 (not (= (mod v_~a$w_buff0_used~0_71 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_35 256) 0)))) (let ((.cse1 (and .cse4 .cse5)) (.cse0 (and (not (= (mod v_~a$w_buff0_used~0_72 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~a$w_buff1_used~0_57 256) 0)) .cse3))) (and (= v_~a$w_buff0_used~0_71 (ite .cse0 0 v_~a$w_buff0_used~0_72)) (= (ite (or .cse1 .cse2) 0 v_~a$w_buff1_used~0_57) v_~a$w_buff1_used~0_56) (= v_~a$r_buff0_thd1~0_34 (ite .cse1 0 v_~a$r_buff0_thd1~0_35)) (= v_~a~0_22 (ite .cse0 v_~a$w_buff0~0_22 (ite .cse2 v_~a$w_buff1~0_15 v_~a~0_23))) (= (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_56 256) 0))) (and (not (= (mod v_~a$r_buff0_thd1~0_34 256) 0)) .cse4)) 0 v_~a$r_buff1_thd1~0_20) v_~a$r_buff1_thd1~0_19)))) InVars {~a~0=v_~a~0_23, ~a$w_buff1~0=v_~a$w_buff1~0_15, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_20, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_72, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_35, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_57} OutVars{~a~0=v_~a~0_22, ~a$w_buff1~0=v_~a$w_buff1~0_15, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_19, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_71, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_34, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_56} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][35], [Black: 154#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 157#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 44#L882true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), Black: 159#(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))), 63#L791true, P1Thread1of1ForFork1InUse, 53#L771true, 62#L824true, 66#P2EXITtrue, P2Thread1of1ForFork0InUse, 151#true, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, Black: 139#(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: 132#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 137#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~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))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t556~0#1.base| 0) |ULTIMATE.start_main_~#t553~0#1.base| 0) |ULTIMATE.start_main_~#t554~0#1.base| 0) |ULTIMATE.start_main_~#t555~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t555~0#1.base|)) (not (= |ULTIMATE.start_main_~#t554~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|))), Black: 135#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 129#true, 168#true]) [2023-11-26 12:02:04,268 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-26 12:02:04,268 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-26 12:02:04,268 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-26 12:02:04,268 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-26 12:02:04,269 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([463] L824-->L840: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse6 (not .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse2 (and .cse5 .cse8)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_125 256) 0) .cse5))) (let ((.cse9 (or .cse12 .cse2 .cse3)) (.cse10 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_124 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse9 v_~a~0_74 (ite .cse10 v_~a$w_buff0~0_55 v_~a$w_buff1~0_48)))) (and (= v_~a$flush_delayed~0_23 0) (= v_~a$w_buff0~0_54 v_~a$w_buff0~0_55) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= (ite .cse0 v_~a$w_buff1_used~0_125 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_125 0)) v_~a$w_buff1_used~0_124) (= (ite .cse0 v_~a$r_buff0_thd4~0_62 (ite (or .cse1 (and .cse4 .cse5) .cse2) v_~a$r_buff0_thd4~0_62 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_62))) v_~a$r_buff0_thd4~0_61) (= v_~a$r_buff1_thd4~0_59 (ite .cse0 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or .cse1 (and .cse7 .cse8) (and .cse7 .cse4))) v_~a$r_buff1_thd4~0_60 0))) (= v_~a$w_buff0_used~0_137 (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse9 v_~a$w_buff0_used~0_138 (ite .cse10 0 v_~a$w_buff0_used~0_138)))) (= v_~a~0_74 v_~a$mem_tmp~0_18) (= .cse11 v_~__unbuffered_p3_EBX~0_10) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_18 .cse11))))))) InVars {~a~0=v_~a~0_74, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_55, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_125, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_54, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_124, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][62], [Black: 154#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 157#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 44#L882true, 29#L764true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), Black: 159#(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))), 63#L791true, P1Thread1of1ForFork1InUse, 66#P2EXITtrue, P2Thread1of1ForFork0InUse, 151#true, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, Black: 139#(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: 132#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 137#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~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))), Black: 131#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t556~0#1.base| 0) |ULTIMATE.start_main_~#t553~0#1.base| 0) |ULTIMATE.start_main_~#t554~0#1.base| 0) |ULTIMATE.start_main_~#t555~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t555~0#1.base|)) (not (= |ULTIMATE.start_main_~#t554~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|))), Black: 135#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 46#L840true, 168#true]) [2023-11-26 12:02:04,269 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-26 12:02:04,269 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-26 12:02:04,269 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-26 12:02:04,269 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-26 12:02:04,628 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([445] L764-->L771: Formula: (let ((.cse3 (not (= (mod v_~a$r_buff1_thd1~0_20 256) 0))) (.cse4 (not (= (mod v_~a$w_buff0_used~0_71 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_35 256) 0)))) (let ((.cse1 (and .cse4 .cse5)) (.cse0 (and (not (= (mod v_~a$w_buff0_used~0_72 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~a$w_buff1_used~0_57 256) 0)) .cse3))) (and (= v_~a$w_buff0_used~0_71 (ite .cse0 0 v_~a$w_buff0_used~0_72)) (= (ite (or .cse1 .cse2) 0 v_~a$w_buff1_used~0_57) v_~a$w_buff1_used~0_56) (= v_~a$r_buff0_thd1~0_34 (ite .cse1 0 v_~a$r_buff0_thd1~0_35)) (= v_~a~0_22 (ite .cse0 v_~a$w_buff0~0_22 (ite .cse2 v_~a$w_buff1~0_15 v_~a~0_23))) (= (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_56 256) 0))) (and (not (= (mod v_~a$r_buff0_thd1~0_34 256) 0)) .cse4)) 0 v_~a$r_buff1_thd1~0_20) v_~a$r_buff1_thd1~0_19)))) InVars {~a~0=v_~a~0_23, ~a$w_buff1~0=v_~a$w_buff1~0_15, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_20, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_72, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_35, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_57} OutVars{~a~0=v_~a~0_22, ~a$w_buff1~0=v_~a$w_buff1~0_15, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_19, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_71, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_34, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_56} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][35], [30#L876true, Black: 154#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 157#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 153#(= ~__unbuffered_p3_EAX~0 0), Black: 159#(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))), P1Thread1of1ForFork1InUse, 66#P2EXITtrue, 53#L771true, P2Thread1of1ForFork0InUse, 62#L824true, 151#true, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, Black: 139#(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: 132#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 137#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~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))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t556~0#1.base| 0) |ULTIMATE.start_main_~#t553~0#1.base| 0) |ULTIMATE.start_main_~#t554~0#1.base| 0) |ULTIMATE.start_main_~#t555~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t555~0#1.base|)) (not (= |ULTIMATE.start_main_~#t554~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|))), Black: 135#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 129#true, 31#P1EXITtrue, 168#true]) [2023-11-26 12:02:04,629 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-26 12:02:04,632 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-26 12:02:04,632 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-26 12:02:04,632 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-26 12:02:04,633 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([463] L824-->L840: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse6 (not .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse2 (and .cse5 .cse8)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_125 256) 0) .cse5))) (let ((.cse9 (or .cse12 .cse2 .cse3)) (.cse10 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_124 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse9 v_~a~0_74 (ite .cse10 v_~a$w_buff0~0_55 v_~a$w_buff1~0_48)))) (and (= v_~a$flush_delayed~0_23 0) (= v_~a$w_buff0~0_54 v_~a$w_buff0~0_55) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= (ite .cse0 v_~a$w_buff1_used~0_125 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_125 0)) v_~a$w_buff1_used~0_124) (= (ite .cse0 v_~a$r_buff0_thd4~0_62 (ite (or .cse1 (and .cse4 .cse5) .cse2) v_~a$r_buff0_thd4~0_62 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_62))) v_~a$r_buff0_thd4~0_61) (= v_~a$r_buff1_thd4~0_59 (ite .cse0 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or .cse1 (and .cse7 .cse8) (and .cse7 .cse4))) v_~a$r_buff1_thd4~0_60 0))) (= v_~a$w_buff0_used~0_137 (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse9 v_~a$w_buff0_used~0_138 (ite .cse10 0 v_~a$w_buff0_used~0_138)))) (= v_~a~0_74 v_~a$mem_tmp~0_18) (= .cse11 v_~__unbuffered_p3_EBX~0_10) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_18 .cse11))))))) InVars {~a~0=v_~a~0_74, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_55, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_125, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_54, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_124, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][62], [30#L876true, Black: 154#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 157#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 29#L764true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), Black: 159#(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))), P1Thread1of1ForFork1InUse, 66#P2EXITtrue, P2Thread1of1ForFork0InUse, 151#true, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, Black: 139#(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: 132#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 137#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~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))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t556~0#1.base| 0) |ULTIMATE.start_main_~#t553~0#1.base| 0) |ULTIMATE.start_main_~#t554~0#1.base| 0) |ULTIMATE.start_main_~#t555~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t555~0#1.base|)) (not (= |ULTIMATE.start_main_~#t554~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|))), Black: 131#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 135#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 31#P1EXITtrue, 46#L840true, 168#true]) [2023-11-26 12:02:04,633 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-26 12:02:04,633 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-26 12:02:04,634 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-26 12:02:04,634 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-26 12:02:05,077 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([445] L764-->L771: Formula: (let ((.cse3 (not (= (mod v_~a$r_buff1_thd1~0_20 256) 0))) (.cse4 (not (= (mod v_~a$w_buff0_used~0_71 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_35 256) 0)))) (let ((.cse1 (and .cse4 .cse5)) (.cse0 (and (not (= (mod v_~a$w_buff0_used~0_72 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~a$w_buff1_used~0_57 256) 0)) .cse3))) (and (= v_~a$w_buff0_used~0_71 (ite .cse0 0 v_~a$w_buff0_used~0_72)) (= (ite (or .cse1 .cse2) 0 v_~a$w_buff1_used~0_57) v_~a$w_buff1_used~0_56) (= v_~a$r_buff0_thd1~0_34 (ite .cse1 0 v_~a$r_buff0_thd1~0_35)) (= v_~a~0_22 (ite .cse0 v_~a$w_buff0~0_22 (ite .cse2 v_~a$w_buff1~0_15 v_~a~0_23))) (= (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_56 256) 0))) (and (not (= (mod v_~a$r_buff0_thd1~0_34 256) 0)) .cse4)) 0 v_~a$r_buff1_thd1~0_20) v_~a$r_buff1_thd1~0_19)))) InVars {~a~0=v_~a~0_23, ~a$w_buff1~0=v_~a$w_buff1~0_15, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_20, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_72, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_35, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_57} OutVars{~a~0=v_~a~0_22, ~a$w_buff1~0=v_~a$w_buff1~0_15, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_19, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_71, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_34, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_56} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][35], [Black: 154#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 157#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 44#L882true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), Black: 159#(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))), P1Thread1of1ForFork1InUse, 62#L824true, 53#L771true, 66#P2EXITtrue, P2Thread1of1ForFork0InUse, 151#true, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, Black: 139#(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: 132#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 137#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~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))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t556~0#1.base| 0) |ULTIMATE.start_main_~#t553~0#1.base| 0) |ULTIMATE.start_main_~#t554~0#1.base| 0) |ULTIMATE.start_main_~#t555~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t555~0#1.base|)) (not (= |ULTIMATE.start_main_~#t554~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|))), Black: 135#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 129#true, 31#P1EXITtrue, 168#true]) [2023-11-26 12:02:05,077 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-26 12:02:05,077 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-26 12:02:05,077 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-26 12:02:05,077 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-26 12:02:05,077 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([463] L824-->L840: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse6 (not .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse2 (and .cse5 .cse8)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_125 256) 0) .cse5))) (let ((.cse9 (or .cse12 .cse2 .cse3)) (.cse10 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_124 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse9 v_~a~0_74 (ite .cse10 v_~a$w_buff0~0_55 v_~a$w_buff1~0_48)))) (and (= v_~a$flush_delayed~0_23 0) (= v_~a$w_buff0~0_54 v_~a$w_buff0~0_55) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= (ite .cse0 v_~a$w_buff1_used~0_125 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_125 0)) v_~a$w_buff1_used~0_124) (= (ite .cse0 v_~a$r_buff0_thd4~0_62 (ite (or .cse1 (and .cse4 .cse5) .cse2) v_~a$r_buff0_thd4~0_62 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_62))) v_~a$r_buff0_thd4~0_61) (= v_~a$r_buff1_thd4~0_59 (ite .cse0 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or .cse1 (and .cse7 .cse8) (and .cse7 .cse4))) v_~a$r_buff1_thd4~0_60 0))) (= v_~a$w_buff0_used~0_137 (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse9 v_~a$w_buff0_used~0_138 (ite .cse10 0 v_~a$w_buff0_used~0_138)))) (= v_~a~0_74 v_~a$mem_tmp~0_18) (= .cse11 v_~__unbuffered_p3_EBX~0_10) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_18 .cse11))))))) InVars {~a~0=v_~a~0_74, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_55, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_125, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_54, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_124, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][62], [Black: 154#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 157#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 44#L882true, 29#L764true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), Black: 159#(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))), P1Thread1of1ForFork1InUse, 66#P2EXITtrue, P2Thread1of1ForFork0InUse, 151#true, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, Black: 139#(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: 132#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 137#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~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))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t556~0#1.base| 0) |ULTIMATE.start_main_~#t553~0#1.base| 0) |ULTIMATE.start_main_~#t554~0#1.base| 0) |ULTIMATE.start_main_~#t555~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t555~0#1.base|)) (not (= |ULTIMATE.start_main_~#t554~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t554~0#1.base|)) (not (= |ULTIMATE.start_main_~#t556~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|)) (not (= |ULTIMATE.start_main_~#t555~0#1.base| |ULTIMATE.start_main_~#t553~0#1.base|))), Black: 131#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 135#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 31#P1EXITtrue, 168#true, 46#L840true]) [2023-11-26 12:02:05,078 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-26 12:02:05,078 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-26 12:02:05,078 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-26 12:02:05,078 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-26 12:02:05,597 INFO L124 PetriNetUnfolderBase]: 21368/33788 cut-off events. [2023-11-26 12:02:05,597 INFO L125 PetriNetUnfolderBase]: For 46474/47081 co-relation queries the response was YES. [2023-11-26 12:02:05,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90608 conditions, 33788 events. 21368/33788 cut-off events. For 46474/47081 co-relation queries the response was YES. Maximal size of possible extension queue 1573. Compared 275026 event pairs, 6010 based on Foata normal form. 1059/34053 useless extension candidates. Maximal degree in co-relation 90586. Up to 21541 conditions per place. [2023-11-26 12:02:05,998 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 42 selfloop transitions, 5 changer transitions 55/126 dead transitions. [2023-11-26 12:02:05,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 126 transitions, 697 flow [2023-11-26 12:02:05,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 12:02:05,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-26 12:02:06,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 317 transitions. [2023-11-26 12:02:06,001 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6861471861471862 [2023-11-26 12:02:06,001 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 317 transitions. [2023-11-26 12:02:06,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 317 transitions. [2023-11-26 12:02:06,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:02:06,002 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 317 transitions. [2023-11-26 12:02:06,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 45.285714285714285) internal successors, (317), 7 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:06,006 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-26 12:02:06,006 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-26 12:02:06,007 INFO L175 Difference]: Start difference. First operand has 73 places, 53 transitions, 203 flow. Second operand 7 states and 317 transitions. [2023-11-26 12:02:06,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 126 transitions, 697 flow [2023-11-26 12:02:06,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 126 transitions, 675 flow, removed 8 selfloop flow, removed 6 redundant places. [2023-11-26 12:02:06,760 INFO L231 Difference]: Finished difference. Result has 74 places, 57 transitions, 262 flow [2023-11-26 12:02:06,760 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=262, PETRI_PLACES=74, PETRI_TRANSITIONS=57} [2023-11-26 12:02:06,761 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 1 predicate places. [2023-11-26 12:02:06,761 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 57 transitions, 262 flow [2023-11-26 12:02:06,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:06,761 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:02:06,761 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-26 12:02:06,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-26 12:02:06,762 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 12:02:06,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:06,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1669374097, now seen corresponding path program 1 times [2023-11-26 12:02:06,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:06,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739171921] [2023-11-26 12:02:06,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:06,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:06,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:06,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:06,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:06,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739171921] [2023-11-26 12:02:06,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739171921] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:06,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:06,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 12:02:06,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852067838] [2023-11-26 12:02:06,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:06,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 12:02:06,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:06,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 12:02:06,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-26 12:02:07,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 66 [2023-11-26 12:02:07,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 57 transitions, 262 flow. Second operand has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:07,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:02:07,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 66 [2023-11-26 12:02:07,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:02:12,589 INFO L124 PetriNetUnfolderBase]: 24537/35948 cut-off events. [2023-11-26 12:02:12,589 INFO L125 PetriNetUnfolderBase]: For 67513/67591 co-relation queries the response was YES. [2023-11-26 12:02:12,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109286 conditions, 35948 events. 24537/35948 cut-off events. For 67513/67591 co-relation queries the response was YES. Maximal size of possible extension queue 1402. Compared 252408 event pairs, 5195 based on Foata normal form. 725/36630 useless extension candidates. Maximal degree in co-relation 109263. Up to 16062 conditions per place. [2023-11-26 12:02:12,880 INFO L140 encePairwiseOnDemand]: 55/66 looper letters, 69 selfloop transitions, 14 changer transitions 78/177 dead transitions. [2023-11-26 12:02:12,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 177 transitions, 1078 flow [2023-11-26 12:02:12,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-26 12:02:12,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-26 12:02:12,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 446 transitions. [2023-11-26 12:02:12,885 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6757575757575758 [2023-11-26 12:02:12,886 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 446 transitions. [2023-11-26 12:02:12,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 446 transitions. [2023-11-26 12:02:12,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:02:12,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 446 transitions. [2023-11-26 12:02:12,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 44.6) internal successors, (446), 10 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:12,890 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 66.0) internal successors, (726), 11 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:12,891 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 66.0) internal successors, (726), 11 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:12,891 INFO L175 Difference]: Start difference. First operand has 74 places, 57 transitions, 262 flow. Second operand 10 states and 446 transitions. [2023-11-26 12:02:12,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 177 transitions, 1078 flow [2023-11-26 12:02:13,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 177 transitions, 1057 flow, removed 7 selfloop flow, removed 3 redundant places. [2023-11-26 12:02:13,255 INFO L231 Difference]: Finished difference. Result has 84 places, 63 transitions, 359 flow [2023-11-26 12:02:13,256 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=359, PETRI_PLACES=84, PETRI_TRANSITIONS=63} [2023-11-26 12:02:13,256 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 11 predicate places. [2023-11-26 12:02:13,257 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 63 transitions, 359 flow [2023-11-26 12:02:13,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:13,257 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:02:13,257 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-26 12:02:13,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-26 12:02:13,257 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 12:02:13,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:13,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1387293187, now seen corresponding path program 1 times [2023-11-26 12:02:13,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:13,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036884220] [2023-11-26 12:02:13,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:13,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:13,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:13,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:13,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:13,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036884220] [2023-11-26 12:02:13,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036884220] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:13,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:13,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 12:02:13,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442840471] [2023-11-26 12:02:13,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:13,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 12:02:13,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:13,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 12:02:13,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-26 12:02:13,510 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 66 [2023-11-26 12:02:13,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 63 transitions, 359 flow. Second operand has 6 states, 6 states have (on average 31.833333333333332) internal successors, (191), 6 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:13,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:02:13,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 66 [2023-11-26 12:02:13,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand