./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread/singleton_with-uninit-problems.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_5becdf56-7463-4c2c-a06a-7985f38396d3/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5becdf56-7463-4c2c-a06a-7985f38396d3/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_5becdf56-7463-4c2c-a06a-7985f38396d3/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5becdf56-7463-4c2c-a06a-7985f38396d3/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread/singleton_with-uninit-problems.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5becdf56-7463-4c2c-a06a-7985f38396d3/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_5becdf56-7463-4c2c-a06a-7985f38396d3/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 9556b3eb7217f056a72a299bf0514e64606a248fa454b59dcc03e4a2e74c7c90 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 10:40:48,627 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 10:40:48,700 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5becdf56-7463-4c2c-a06a-7985f38396d3/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-26 10:40:48,707 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 10:40:48,707 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 10:40:48,736 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 10:40:48,736 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 10:40:48,737 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 10:40:48,738 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 10:40:48,739 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 10:40:48,739 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 10:40:48,740 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 10:40:48,741 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 10:40:48,741 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 10:40:48,742 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 10:40:48,743 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 10:40:48,743 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 10:40:48,743 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 10:40:48,744 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 10:40:48,744 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 10:40:48,745 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-26 10:40:48,746 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-26 10:40:48,746 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-26 10:40:48,746 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 10:40:48,747 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-26 10:40:48,747 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 10:40:48,748 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 10:40:48,748 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 10:40:48,771 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 10:40:48,772 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 10:40:48,772 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 10:40:48,772 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 10:40:48,773 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:40:48,773 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 10:40:48,774 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 10:40:48,774 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 10:40:48,774 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 10:40:48,775 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 10:40:48,775 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 10:40:48,776 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 10:40:48,776 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 10:40:48,776 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_5becdf56-7463-4c2c-a06a-7985f38396d3/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_5becdf56-7463-4c2c-a06a-7985f38396d3/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 -> 9556b3eb7217f056a72a299bf0514e64606a248fa454b59dcc03e4a2e74c7c90 [2023-11-26 10:40:49,109 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 10:40:49,142 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 10:40:49,145 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 10:40:49,147 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 10:40:49,147 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 10:40:49,148 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5becdf56-7463-4c2c-a06a-7985f38396d3/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread/singleton_with-uninit-problems.i [2023-11-26 10:40:52,277 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 10:40:52,647 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 10:40:52,653 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5becdf56-7463-4c2c-a06a-7985f38396d3/sv-benchmarks/c/pthread/singleton_with-uninit-problems.i [2023-11-26 10:40:52,674 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5becdf56-7463-4c2c-a06a-7985f38396d3/bin/uautomizer-verify-VRDe98Ueme/data/052eec0a1/f5525ead48b24b278db0a49a8a29a9ad/FLAG4fe32cf62 [2023-11-26 10:40:52,688 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5becdf56-7463-4c2c-a06a-7985f38396d3/bin/uautomizer-verify-VRDe98Ueme/data/052eec0a1/f5525ead48b24b278db0a49a8a29a9ad [2023-11-26 10:40:52,691 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 10:40:52,693 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 10:40:52,694 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 10:40:52,694 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 10:40:52,700 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 10:40:52,701 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:40:52" (1/1) ... [2023-11-26 10:40:52,702 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60986564 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:40:52, skipping insertion in model container [2023-11-26 10:40:52,702 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:40:52" (1/1) ... [2023-11-26 10:40:52,775 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 10:40:53,506 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:40:53,518 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 10:40:53,579 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:40:53,672 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 10:40:53,672 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 10:40:53,680 INFO L206 MainTranslator]: Completed translation [2023-11-26 10:40:53,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:40:53 WrapperNode [2023-11-26 10:40:53,682 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 10:40:53,683 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 10:40:53,684 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 10:40:53,684 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 10:40:53,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:40:53" (1/1) ... [2023-11-26 10:40:53,734 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:40:53" (1/1) ... [2023-11-26 10:40:53,766 INFO L138 Inliner]: procedures = 324, calls = 53, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 43 [2023-11-26 10:40:53,767 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 10:40:53,768 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 10:40:53,768 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 10:40:53,769 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 10:40:53,781 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:40:53" (1/1) ... [2023-11-26 10:40:53,782 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:40:53" (1/1) ... [2023-11-26 10:40:53,796 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:40:53" (1/1) ... [2023-11-26 10:40:53,817 INFO L175 MemorySlicer]: Split 18 memory accesses to 8 slices as follows [2, 4, 2, 2, 2, 2, 2, 2]. 22 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0, 0, 0]. The 8 writes are split as follows [0, 2, 1, 1, 1, 1, 1, 1]. [2023-11-26 10:40:53,818 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:40:53" (1/1) ... [2023-11-26 10:40:53,818 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:40:53" (1/1) ... [2023-11-26 10:40:53,842 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:40:53" (1/1) ... [2023-11-26 10:40:53,850 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:40:53" (1/1) ... [2023-11-26 10:40:53,863 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:40:53" (1/1) ... [2023-11-26 10:40:53,865 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:40:53" (1/1) ... [2023-11-26 10:40:53,869 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 10:40:53,870 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 10:40:53,870 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 10:40:53,870 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 10:40:53,880 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:40:53" (1/1) ... [2023-11-26 10:40:53,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:40:53,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5becdf56-7463-4c2c-a06a-7985f38396d3/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:40:53,914 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5becdf56-7463-4c2c-a06a-7985f38396d3/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 10:40:53,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5becdf56-7463-4c2c-a06a-7985f38396d3/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 10:40:53,953 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-26 10:40:53,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 10:40:53,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 10:40:53,954 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-26 10:40:53,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-26 10:40:53,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-26 10:40:53,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-26 10:40:53,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-26 10:40:53,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-26 10:40:53,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-11-26 10:40:53,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-11-26 10:40:53,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2023-11-26 10:40:53,958 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2023-11-26 10:40:53,958 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2023-11-26 10:40:53,958 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-26 10:40:53,958 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-26 10:40:53,958 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-26 10:40:53,959 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-26 10:40:53,959 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-26 10:40:53,960 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-26 10:40:53,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-26 10:40:53,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-26 10:40:53,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-26 10:40:53,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-26 10:40:53,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-26 10:40:53,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-11-26 10:40:53,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-11-26 10:40:53,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2023-11-26 10:40:53,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-26 10:40:53,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 10:40:53,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 10:40:53,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-26 10:40:53,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-26 10:40:53,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-26 10:40:53,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-26 10:40:53,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-11-26 10:40:53,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-11-26 10:40:53,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2023-11-26 10:40:53,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 10:40:53,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 10:40:53,965 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 10:40:54,203 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 10:40:54,206 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 10:40:54,556 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 10:40:54,703 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 10:40:54,704 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-26 10:40:54,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:40:54 BoogieIcfgContainer [2023-11-26 10:40:54,704 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 10:40:54,707 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 10:40:54,707 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 10:40:54,710 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 10:40:54,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 10:40:52" (1/3) ... [2023-11-26 10:40:54,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c653b35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:40:54, skipping insertion in model container [2023-11-26 10:40:54,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:40:53" (2/3) ... [2023-11-26 10:40:54,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c653b35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:40:54, skipping insertion in model container [2023-11-26 10:40:54,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:40:54" (3/3) ... [2023-11-26 10:40:54,719 INFO L112 eAbstractionObserver]: Analyzing ICFG singleton_with-uninit-problems.i [2023-11-26 10:40:54,738 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 10:40:54,738 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2023-11-26 10:40:54,738 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 10:40:54,891 INFO L144 ThreadInstanceAdder]: Constructed 21 joinOtherThreadTransitions. [2023-11-26 10:40:54,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 170 places, 162 transitions, 421 flow [2023-11-26 10:40:55,007 INFO L124 PetriNetUnfolderBase]: 8/107 cut-off events. [2023-11-26 10:40:55,008 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-26 10:40:55,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 107 events. 8/107 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 191 event pairs, 0 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 107. Up to 3 conditions per place. [2023-11-26 10:40:55,012 INFO L82 GeneralOperation]: Start removeDead. Operand has 170 places, 162 transitions, 421 flow [2023-11-26 10:40:55,035 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 106 transitions, 263 flow [2023-11-26 10:40:55,046 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 10:40:55,054 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;@66bd4bf1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 10:40:55,054 INFO L358 AbstractCegarLoop]: Starting to check reachability of 73 error locations. [2023-11-26 10:40:55,058 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 10:40:55,058 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-26 10:40:55,058 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 10:40:55,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:40:55,059 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-26 10:40:55,059 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-11-26 10:40:55,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:40:55,068 INFO L85 PathProgramCache]: Analyzing trace with hash 10354, now seen corresponding path program 1 times [2023-11-26 10:40:55,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:40:55,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499720842] [2023-11-26 10:40:55,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:40:55,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:40:55,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:40:55,329 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 10:40:55,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:40:55,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499720842] [2023-11-26 10:40:55,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499720842] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:40:55,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:40:55,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 10:40:55,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080697037] [2023-11-26 10:40:55,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:40:55,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:40:55,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:40:55,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:40:55,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:40:55,542 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 164 [2023-11-26 10:40:55,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 106 transitions, 263 flow. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states 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 10:40:55,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:40:55,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 164 [2023-11-26 10:40:55,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:00,337 INFO L124 PetriNetUnfolderBase]: 17148/29861 cut-off events. [2023-11-26 10:41:00,337 INFO L125 PetriNetUnfolderBase]: For 1889/1895 co-relation queries the response was YES. [2023-11-26 10:41:00,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54093 conditions, 29861 events. 17148/29861 cut-off events. For 1889/1895 co-relation queries the response was YES. Maximal size of possible extension queue 2312. Compared 271559 event pairs, 16673 based on Foata normal form. 4/17162 useless extension candidates. Maximal degree in co-relation 54029. Up to 22324 conditions per place. [2023-11-26 10:41:00,695 INFO L140 encePairwiseOnDemand]: 156/164 looper letters, 56 selfloop transitions, 4 changer transitions 0/110 dead transitions. [2023-11-26 10:41:00,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 110 transitions, 394 flow [2023-11-26 10:41:00,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:41:00,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:41:00,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 327 transitions. [2023-11-26 10:41:00,716 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6646341463414634 [2023-11-26 10:41:00,717 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 327 transitions. [2023-11-26 10:41:00,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 327 transitions. [2023-11-26 10:41:00,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:00,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 327 transitions. [2023-11-26 10:41:00,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states 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 10:41:00,735 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states 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 10:41:00,736 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states 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 10:41:00,738 INFO L175 Difference]: Start difference. First operand has 117 places, 106 transitions, 263 flow. Second operand 3 states and 327 transitions. [2023-11-26 10:41:00,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 110 transitions, 394 flow [2023-11-26 10:41:01,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 110 transitions, 358 flow, removed 0 selfloop flow, removed 12 redundant places. [2023-11-26 10:41:01,129 INFO L231 Difference]: Finished difference. Result has 107 places, 104 transitions, 247 flow [2023-11-26 10:41:01,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=247, PETRI_PLACES=107, PETRI_TRANSITIONS=104} [2023-11-26 10:41:01,136 INFO L281 CegarLoopForPetriNet]: 117 programPoint places, -10 predicate places. [2023-11-26 10:41:01,137 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 104 transitions, 247 flow [2023-11-26 10:41:01,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states 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 10:41:01,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:01,138 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-26 10:41:01,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 10:41:01,139 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-11-26 10:41:01,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:01,142 INFO L85 PathProgramCache]: Analyzing trace with hash 10355, now seen corresponding path program 1 times [2023-11-26 10:41:01,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:01,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771995014] [2023-11-26 10:41:01,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:01,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:01,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:01,337 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 10:41:01,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:01,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771995014] [2023-11-26 10:41:01,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771995014] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:01,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:01,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 10:41:01,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218716523] [2023-11-26 10:41:01,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:01,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:41:01,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:01,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:41:01,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:41:01,470 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 164 [2023-11-26 10:41:01,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 104 transitions, 247 flow. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states 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 10:41:01,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:01,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 164 [2023-11-26 10:41:01,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:05,005 INFO L124 PetriNetUnfolderBase]: 17144/29850 cut-off events. [2023-11-26 10:41:05,006 INFO L125 PetriNetUnfolderBase]: For 480/485 co-relation queries the response was YES. [2023-11-26 10:41:05,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52670 conditions, 29850 events. 17144/29850 cut-off events. For 480/485 co-relation queries the response was YES. Maximal size of possible extension queue 2415. Compared 271993 event pairs, 14946 based on Foata normal form. 7/17156 useless extension candidates. Maximal degree in co-relation 52589. Up to 22315 conditions per place. [2023-11-26 10:41:05,262 INFO L140 encePairwiseOnDemand]: 160/164 looper letters, 51 selfloop transitions, 2 changer transitions 0/105 dead transitions. [2023-11-26 10:41:05,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 105 transitions, 355 flow [2023-11-26 10:41:05,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:41:05,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:41:05,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2023-11-26 10:41:05,272 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6524390243902439 [2023-11-26 10:41:05,272 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 321 transitions. [2023-11-26 10:41:05,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 321 transitions. [2023-11-26 10:41:05,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:05,273 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 321 transitions. [2023-11-26 10:41:05,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states 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 10:41:05,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states 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 10:41:05,279 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states 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 10:41:05,279 INFO L175 Difference]: Start difference. First operand has 107 places, 104 transitions, 247 flow. Second operand 3 states and 321 transitions. [2023-11-26 10:41:05,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 105 transitions, 355 flow [2023-11-26 10:41:05,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 105 transitions, 347 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:41:05,286 INFO L231 Difference]: Finished difference. Result has 107 places, 103 transitions, 245 flow [2023-11-26 10:41:05,286 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=245, PETRI_PLACES=107, PETRI_TRANSITIONS=103} [2023-11-26 10:41:05,287 INFO L281 CegarLoopForPetriNet]: 117 programPoint places, -10 predicate places. [2023-11-26 10:41:05,288 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 103 transitions, 245 flow [2023-11-26 10:41:05,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states 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 10:41:05,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:05,288 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 10:41:05,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 10:41:05,289 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-11-26 10:41:05,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:05,290 INFO L85 PathProgramCache]: Analyzing trace with hash 308853602, now seen corresponding path program 1 times [2023-11-26 10:41:05,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:05,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357050931] [2023-11-26 10:41:05,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:05,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:05,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:05,595 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 10:41:05,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:05,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357050931] [2023-11-26 10:41:05,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357050931] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:05,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:05,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:41:05,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481788454] [2023-11-26 10:41:05,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:05,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:41:05,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:05,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:41:05,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:41:05,708 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 164 [2023-11-26 10:41:05,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 103 transitions, 245 flow. Second operand has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states 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 10:41:05,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:05,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 164 [2023-11-26 10:41:05,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:07,786 INFO L124 PetriNetUnfolderBase]: 10864/19355 cut-off events. [2023-11-26 10:41:07,787 INFO L125 PetriNetUnfolderBase]: For 319/321 co-relation queries the response was YES. [2023-11-26 10:41:07,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34031 conditions, 19355 events. 10864/19355 cut-off events. For 319/321 co-relation queries the response was YES. Maximal size of possible extension queue 1739. Compared 171380 event pairs, 8821 based on Foata normal form. 0/10889 useless extension candidates. Maximal degree in co-relation 33956. Up to 14312 conditions per place. [2023-11-26 10:41:07,965 INFO L140 encePairwiseOnDemand]: 160/164 looper letters, 51 selfloop transitions, 2 changer transitions 0/102 dead transitions. [2023-11-26 10:41:07,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 102 transitions, 349 flow [2023-11-26 10:41:07,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:41:07,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:41:07,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 315 transitions. [2023-11-26 10:41:07,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6402439024390244 [2023-11-26 10:41:07,968 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 315 transitions. [2023-11-26 10:41:07,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 315 transitions. [2023-11-26 10:41:07,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:07,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 315 transitions. [2023-11-26 10:41:07,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states 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 10:41:07,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states 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 10:41:07,972 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states 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 10:41:07,973 INFO L175 Difference]: Start difference. First operand has 107 places, 103 transitions, 245 flow. Second operand 3 states and 315 transitions. [2023-11-26 10:41:07,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 102 transitions, 349 flow [2023-11-26 10:41:07,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 102 transitions, 345 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:41:07,977 INFO L231 Difference]: Finished difference. Result has 105 places, 101 transitions, 241 flow [2023-11-26 10:41:07,978 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=241, PETRI_PLACES=105, PETRI_TRANSITIONS=101} [2023-11-26 10:41:07,979 INFO L281 CegarLoopForPetriNet]: 117 programPoint places, -12 predicate places. [2023-11-26 10:41:07,979 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 101 transitions, 241 flow [2023-11-26 10:41:07,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states 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 10:41:07,980 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:07,980 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 10:41:07,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 10:41:07,981 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-11-26 10:41:07,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:07,981 INFO L85 PathProgramCache]: Analyzing trace with hash 308853603, now seen corresponding path program 1 times [2023-11-26 10:41:07,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:07,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897421471] [2023-11-26 10:41:07,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:07,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:08,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:08,180 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 10:41:08,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:08,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897421471] [2023-11-26 10:41:08,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897421471] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:08,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:08,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:41:08,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014305127] [2023-11-26 10:41:08,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:08,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:41:08,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:08,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:41:08,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:41:08,283 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 164 [2023-11-26 10:41:08,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 101 transitions, 241 flow. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:08,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:08,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 164 [2023-11-26 10:41:08,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:10,110 INFO L124 PetriNetUnfolderBase]: 10860/19348 cut-off events. [2023-11-26 10:41:10,111 INFO L125 PetriNetUnfolderBase]: For 321/324 co-relation queries the response was YES. [2023-11-26 10:41:10,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34013 conditions, 19348 events. 10860/19348 cut-off events. For 321/324 co-relation queries the response was YES. Maximal size of possible extension queue 1743. Compared 171500 event pairs, 10538 based on Foata normal form. 5/10887 useless extension candidates. Maximal degree in co-relation 33948. Up to 14315 conditions per place. [2023-11-26 10:41:10,296 INFO L140 encePairwiseOnDemand]: 160/164 looper letters, 51 selfloop transitions, 2 changer transitions 0/102 dead transitions. [2023-11-26 10:41:10,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 102 transitions, 349 flow [2023-11-26 10:41:10,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:41:10,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:41:10,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2023-11-26 10:41:10,299 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6524390243902439 [2023-11-26 10:41:10,299 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 321 transitions. [2023-11-26 10:41:10,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 321 transitions. [2023-11-26 10:41:10,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:10,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 321 transitions. [2023-11-26 10:41:10,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states 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 10:41:10,304 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states 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 10:41:10,305 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states 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 10:41:10,305 INFO L175 Difference]: Start difference. First operand has 105 places, 101 transitions, 241 flow. Second operand 3 states and 321 transitions. [2023-11-26 10:41:10,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 102 transitions, 349 flow [2023-11-26 10:41:10,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 102 transitions, 345 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:41:10,311 INFO L231 Difference]: Finished difference. Result has 105 places, 100 transitions, 243 flow [2023-11-26 10:41:10,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=243, PETRI_PLACES=105, PETRI_TRANSITIONS=100} [2023-11-26 10:41:10,318 INFO L281 CegarLoopForPetriNet]: 117 programPoint places, -12 predicate places. [2023-11-26 10:41:10,318 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 100 transitions, 243 flow [2023-11-26 10:41:10,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:10,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:10,319 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:41:10,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 10:41:10,320 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-11-26 10:41:10,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:10,322 INFO L85 PathProgramCache]: Analyzing trace with hash -273228743, now seen corresponding path program 1 times [2023-11-26 10:41:10,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:10,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174230706] [2023-11-26 10:41:10,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:10,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:10,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:10,915 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 10:41:10,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:10,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174230706] [2023-11-26 10:41:10,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174230706] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:10,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:10,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 10:41:10,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522863314] [2023-11-26 10:41:10,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:10,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:41:10,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:10,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:41:10,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:41:11,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 164 [2023-11-26 10:41:11,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 100 transitions, 243 flow. Second operand has 6 states, 6 states have (on average 84.5) internal successors, (507), 6 states have internal predecessors, (507), 0 states have call successors, (0), 0 states 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 10:41:11,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:11,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 164 [2023-11-26 10:41:11,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:14,010 INFO L124 PetriNetUnfolderBase]: 17148/29854 cut-off events. [2023-11-26 10:41:14,010 INFO L125 PetriNetUnfolderBase]: For 3925/3931 co-relation queries the response was YES. [2023-11-26 10:41:14,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54424 conditions, 29854 events. 17148/29854 cut-off events. For 3925/3931 co-relation queries the response was YES. Maximal size of possible extension queue 2419. Compared 271940 event pairs, 13227 based on Foata normal form. 1721/18881 useless extension candidates. Maximal degree in co-relation 33937. Up to 22313 conditions per place. [2023-11-26 10:41:14,222 INFO L140 encePairwiseOnDemand]: 158/164 looper letters, 56 selfloop transitions, 6 changer transitions 0/107 dead transitions. [2023-11-26 10:41:14,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 107 transitions, 382 flow [2023-11-26 10:41:14,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 10:41:14,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 10:41:14,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2023-11-26 10:41:14,225 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5841463414634146 [2023-11-26 10:41:14,225 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 479 transitions. [2023-11-26 10:41:14,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 479 transitions. [2023-11-26 10:41:14,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:14,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 479 transitions. [2023-11-26 10:41:14,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 95.8) internal successors, (479), 5 states have internal predecessors, (479), 0 states have call successors, (0), 0 states 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 10:41:14,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 164.0) internal successors, (984), 6 states have internal predecessors, (984), 0 states have call successors, (0), 0 states 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 10:41:14,232 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 164.0) internal successors, (984), 6 states have internal predecessors, (984), 0 states have call successors, (0), 0 states 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 10:41:14,232 INFO L175 Difference]: Start difference. First operand has 105 places, 100 transitions, 243 flow. Second operand 5 states and 479 transitions. [2023-11-26 10:41:14,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 107 transitions, 382 flow [2023-11-26 10:41:14,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 107 transitions, 376 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-26 10:41:14,237 INFO L231 Difference]: Finished difference. Result has 105 places, 99 transitions, 245 flow [2023-11-26 10:41:14,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=245, PETRI_PLACES=105, PETRI_TRANSITIONS=99} [2023-11-26 10:41:14,238 INFO L281 CegarLoopForPetriNet]: 117 programPoint places, -12 predicate places. [2023-11-26 10:41:14,238 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 99 transitions, 245 flow [2023-11-26 10:41:14,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 84.5) internal successors, (507), 6 states have internal predecessors, (507), 0 states have call successors, (0), 0 states 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 10:41:14,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:14,239 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:41:14,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 10:41:14,240 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-11-26 10:41:14,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:14,241 INFO L85 PathProgramCache]: Analyzing trace with hash -273270938, now seen corresponding path program 1 times [2023-11-26 10:41:14,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:14,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537862943] [2023-11-26 10:41:14,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:14,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:14,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:14,357 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 10:41:14,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:14,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537862943] [2023-11-26 10:41:14,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537862943] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:14,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:14,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 10:41:14,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098898095] [2023-11-26 10:41:14,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:14,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:41:14,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:14,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:41:14,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:41:14,573 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 164 [2023-11-26 10:41:14,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 99 transitions, 245 flow. Second operand has 5 states, 5 states have (on average 86.6) internal successors, (433), 5 states have internal predecessors, (433), 0 states have call successors, (0), 0 states 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 10:41:14,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:14,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 164 [2023-11-26 10:41:14,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:16,737 INFO L124 PetriNetUnfolderBase]: 10864/19348 cut-off events. [2023-11-26 10:41:16,738 INFO L125 PetriNetUnfolderBase]: For 326/328 co-relation queries the response was YES. [2023-11-26 10:41:16,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34023 conditions, 19348 events. 10864/19348 cut-off events. For 326/328 co-relation queries the response was YES. Maximal size of possible extension queue 1763. Compared 171672 event pairs, 8821 based on Foata normal form. 2/10885 useless extension candidates. Maximal degree in co-relation 33944. Up to 14312 conditions per place. [2023-11-26 10:41:16,886 INFO L140 encePairwiseOnDemand]: 161/164 looper letters, 51 selfloop transitions, 2 changer transitions 0/99 dead transitions. [2023-11-26 10:41:16,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 99 transitions, 349 flow [2023-11-26 10:41:16,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:41:16,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:41:16,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 308 transitions. [2023-11-26 10:41:16,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6260162601626016 [2023-11-26 10:41:16,889 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 308 transitions. [2023-11-26 10:41:16,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 308 transitions. [2023-11-26 10:41:16,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:16,889 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 308 transitions. [2023-11-26 10:41:16,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states 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 10:41:16,893 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states 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 10:41:16,893 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states 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 10:41:16,893 INFO L175 Difference]: Start difference. First operand has 105 places, 99 transitions, 245 flow. Second operand 3 states and 308 transitions. [2023-11-26 10:41:16,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 99 transitions, 349 flow [2023-11-26 10:41:16,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 99 transitions, 342 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-26 10:41:16,897 INFO L231 Difference]: Finished difference. Result has 103 places, 98 transitions, 238 flow [2023-11-26 10:41:16,897 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=238, PETRI_PLACES=103, PETRI_TRANSITIONS=98} [2023-11-26 10:41:16,898 INFO L281 CegarLoopForPetriNet]: 117 programPoint places, -14 predicate places. [2023-11-26 10:41:16,899 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 98 transitions, 238 flow [2023-11-26 10:41:16,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.6) internal successors, (433), 5 states have internal predecessors, (433), 0 states have call successors, (0), 0 states 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 10:41:16,899 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:16,899 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:41:16,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 10:41:16,900 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-11-26 10:41:16,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:16,900 INFO L85 PathProgramCache]: Analyzing trace with hash -2051096857, now seen corresponding path program 1 times [2023-11-26 10:41:16,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:16,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985756986] [2023-11-26 10:41:16,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:16,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:16,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:17,091 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 10:41:17,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:17,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985756986] [2023-11-26 10:41:17,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985756986] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:17,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:17,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:41:17,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140797169] [2023-11-26 10:41:17,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:17,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:41:17,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:17,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:41:17,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:41:17,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 164 [2023-11-26 10:41:17,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 98 transitions, 238 flow. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:17,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:17,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 164 [2023-11-26 10:41:17,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:18,926 INFO L124 PetriNetUnfolderBase]: 15485/23463 cut-off events. [2023-11-26 10:41:18,927 INFO L125 PetriNetUnfolderBase]: For 129/131 co-relation queries the response was YES. [2023-11-26 10:41:18,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43999 conditions, 23463 events. 15485/23463 cut-off events. For 129/131 co-relation queries the response was YES. Maximal size of possible extension queue 1706. Compared 169702 event pairs, 12819 based on Foata normal form. 0/14890 useless extension candidates. Maximal degree in co-relation 43920. Up to 20179 conditions per place. [2023-11-26 10:41:19,064 INFO L140 encePairwiseOnDemand]: 160/164 looper letters, 51 selfloop transitions, 2 changer transitions 0/97 dead transitions. [2023-11-26 10:41:19,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 97 transitions, 342 flow [2023-11-26 10:41:19,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:41:19,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:41:19,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 315 transitions. [2023-11-26 10:41:19,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6402439024390244 [2023-11-26 10:41:19,069 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 315 transitions. [2023-11-26 10:41:19,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 315 transitions. [2023-11-26 10:41:19,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:19,070 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 315 transitions. [2023-11-26 10:41:19,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states 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 10:41:19,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states 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 10:41:19,074 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states 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 10:41:19,074 INFO L175 Difference]: Start difference. First operand has 103 places, 98 transitions, 238 flow. Second operand 3 states and 315 transitions. [2023-11-26 10:41:19,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 97 transitions, 342 flow [2023-11-26 10:41:19,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 97 transitions, 338 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:41:19,078 INFO L231 Difference]: Finished difference. Result has 101 places, 96 transitions, 234 flow [2023-11-26 10:41:19,079 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=101, PETRI_TRANSITIONS=96} [2023-11-26 10:41:19,080 INFO L281 CegarLoopForPetriNet]: 117 programPoint places, -16 predicate places. [2023-11-26 10:41:19,080 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 96 transitions, 234 flow [2023-11-26 10:41:19,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:19,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:19,081 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:41:19,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 10:41:19,081 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-11-26 10:41:19,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:19,082 INFO L85 PathProgramCache]: Analyzing trace with hash -2091314706, now seen corresponding path program 1 times [2023-11-26 10:41:19,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:19,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196848589] [2023-11-26 10:41:19,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:19,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:19,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:19,300 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 10:41:19,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:19,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196848589] [2023-11-26 10:41:19,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196848589] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:19,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:19,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 10:41:19,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475145232] [2023-11-26 10:41:19,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:19,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:41:19,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:19,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:41:19,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:41:19,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 164 [2023-11-26 10:41:19,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 96 transitions, 234 flow. Second operand has 4 states, 4 states have (on average 91.25) internal successors, (365), 4 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:19,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:19,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 164 [2023-11-26 10:41:19,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:20,937 INFO L124 PetriNetUnfolderBase]: 10859/17337 cut-off events. [2023-11-26 10:41:20,937 INFO L125 PetriNetUnfolderBase]: For 328/332 co-relation queries the response was YES. [2023-11-26 10:41:20,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31995 conditions, 17337 events. 10859/17337 cut-off events. For 328/332 co-relation queries the response was YES. Maximal size of possible extension queue 1245. Compared 129713 event pairs, 8819 based on Foata normal form. 1252/12128 useless extension candidates. Maximal degree in co-relation 31916. Up to 14301 conditions per place. [2023-11-26 10:41:21,054 INFO L140 encePairwiseOnDemand]: 160/164 looper letters, 49 selfloop transitions, 2 changer transitions 0/95 dead transitions. [2023-11-26 10:41:21,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 95 transitions, 334 flow [2023-11-26 10:41:21,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:41:21,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:41:21,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 319 transitions. [2023-11-26 10:41:21,057 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6483739837398373 [2023-11-26 10:41:21,058 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 319 transitions. [2023-11-26 10:41:21,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 319 transitions. [2023-11-26 10:41:21,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:21,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 319 transitions. [2023-11-26 10:41:21,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:21,062 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states 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 10:41:21,063 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states 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 10:41:21,063 INFO L175 Difference]: Start difference. First operand has 101 places, 96 transitions, 234 flow. Second operand 3 states and 319 transitions. [2023-11-26 10:41:21,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 95 transitions, 334 flow [2023-11-26 10:41:21,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 95 transitions, 330 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:41:21,067 INFO L231 Difference]: Finished difference. Result has 99 places, 94 transitions, 230 flow [2023-11-26 10:41:21,068 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=230, PETRI_PLACES=99, PETRI_TRANSITIONS=94} [2023-11-26 10:41:21,069 INFO L281 CegarLoopForPetriNet]: 117 programPoint places, -18 predicate places. [2023-11-26 10:41:21,069 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 94 transitions, 230 flow [2023-11-26 10:41:21,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.25) internal successors, (365), 4 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:21,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:21,070 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:41:21,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 10:41:21,071 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-11-26 10:41:21,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:21,072 INFO L85 PathProgramCache]: Analyzing trace with hash 439563373, now seen corresponding path program 1 times [2023-11-26 10:41:21,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:21,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869723111] [2023-11-26 10:41:21,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:21,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:21,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:21,251 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 10:41:21,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:21,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869723111] [2023-11-26 10:41:21,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869723111] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:21,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:21,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:41:21,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427200168] [2023-11-26 10:41:21,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:21,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:41:21,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:21,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:41:21,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:41:21,342 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 164 [2023-11-26 10:41:21,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 94 transitions, 230 flow. Second operand has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states 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 10:41:21,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:21,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 164 [2023-11-26 10:41:21,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:22,429 INFO L124 PetriNetUnfolderBase]: 11597/17967 cut-off events. [2023-11-26 10:41:22,430 INFO L125 PetriNetUnfolderBase]: For 288/290 co-relation queries the response was YES. [2023-11-26 10:41:22,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33623 conditions, 17967 events. 11597/17967 cut-off events. For 288/290 co-relation queries the response was YES. Maximal size of possible extension queue 1253. Compared 129511 event pairs, 9427 based on Foata normal form. 0/11556 useless extension candidates. Maximal degree in co-relation 33544. Up to 15299 conditions per place. [2023-11-26 10:41:22,545 INFO L140 encePairwiseOnDemand]: 160/164 looper letters, 51 selfloop transitions, 2 changer transitions 0/93 dead transitions. [2023-11-26 10:41:22,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 93 transitions, 334 flow [2023-11-26 10:41:22,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:41:22,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:41:22,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 315 transitions. [2023-11-26 10:41:22,548 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6402439024390244 [2023-11-26 10:41:22,548 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 315 transitions. [2023-11-26 10:41:22,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 315 transitions. [2023-11-26 10:41:22,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:22,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 315 transitions. [2023-11-26 10:41:22,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states 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 10:41:22,552 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states 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 10:41:22,553 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states 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 10:41:22,553 INFO L175 Difference]: Start difference. First operand has 99 places, 94 transitions, 230 flow. Second operand 3 states and 315 transitions. [2023-11-26 10:41:22,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 93 transitions, 334 flow [2023-11-26 10:41:22,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 93 transitions, 330 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:41:22,561 INFO L231 Difference]: Finished difference. Result has 97 places, 92 transitions, 226 flow [2023-11-26 10:41:22,562 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=97, PETRI_TRANSITIONS=92} [2023-11-26 10:41:22,563 INFO L281 CegarLoopForPetriNet]: 117 programPoint places, -20 predicate places. [2023-11-26 10:41:22,563 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 92 transitions, 226 flow [2023-11-26 10:41:22,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states 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 10:41:22,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:22,564 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:41:22,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 10:41:22,564 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-11-26 10:41:22,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:22,565 INFO L85 PathProgramCache]: Analyzing trace with hash 439563374, now seen corresponding path program 1 times [2023-11-26 10:41:22,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:22,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569615859] [2023-11-26 10:41:22,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:22,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:22,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:22,794 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 10:41:22,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:22,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569615859] [2023-11-26 10:41:22,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569615859] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:22,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:22,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 10:41:22,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809058966] [2023-11-26 10:41:22,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:22,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:41:22,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:22,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:41:22,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:41:22,933 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 164 [2023-11-26 10:41:22,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 92 transitions, 226 flow. Second operand has 4 states, 4 states have (on average 91.75) internal successors, (367), 4 states have internal predecessors, (367), 0 states have call successors, (0), 0 states 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 10:41:22,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:22,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 164 [2023-11-26 10:41:22,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:24,183 INFO L124 PetriNetUnfolderBase]: 10859/16921 cut-off events. [2023-11-26 10:41:24,183 INFO L125 PetriNetUnfolderBase]: For 329/333 co-relation queries the response was YES. [2023-11-26 10:41:24,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31579 conditions, 16921 events. 10859/16921 cut-off events. For 329/333 co-relation queries the response was YES. Maximal size of possible extension queue 1243. Compared 122721 event pairs, 8819 based on Foata normal form. 210/11086 useless extension candidates. Maximal degree in co-relation 31500. Up to 14301 conditions per place. [2023-11-26 10:41:24,283 INFO L140 encePairwiseOnDemand]: 160/164 looper letters, 49 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2023-11-26 10:41:24,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 91 transitions, 326 flow [2023-11-26 10:41:24,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:41:24,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:41:24,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 319 transitions. [2023-11-26 10:41:24,286 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6483739837398373 [2023-11-26 10:41:24,286 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 319 transitions. [2023-11-26 10:41:24,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 319 transitions. [2023-11-26 10:41:24,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:24,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 319 transitions. [2023-11-26 10:41:24,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:24,290 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states 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 10:41:24,290 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states 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 10:41:24,290 INFO L175 Difference]: Start difference. First operand has 97 places, 92 transitions, 226 flow. Second operand 3 states and 319 transitions. [2023-11-26 10:41:24,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 91 transitions, 326 flow [2023-11-26 10:41:24,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 91 transitions, 322 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:41:24,294 INFO L231 Difference]: Finished difference. Result has 95 places, 90 transitions, 222 flow [2023-11-26 10:41:24,294 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=222, PETRI_PLACES=95, PETRI_TRANSITIONS=90} [2023-11-26 10:41:24,295 INFO L281 CegarLoopForPetriNet]: 117 programPoint places, -22 predicate places. [2023-11-26 10:41:24,295 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 90 transitions, 222 flow [2023-11-26 10:41:24,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.75) internal successors, (367), 4 states have internal predecessors, (367), 0 states have call successors, (0), 0 states 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 10:41:24,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:24,296 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:41:24,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 10:41:24,297 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-11-26 10:41:24,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:24,297 INFO L85 PathProgramCache]: Analyzing trace with hash 439564716, now seen corresponding path program 1 times [2023-11-26 10:41:24,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:24,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119141778] [2023-11-26 10:41:24,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:24,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:24,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:24,357 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 10:41:24,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:24,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119141778] [2023-11-26 10:41:24,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119141778] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:24,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:24,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:41:24,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764539434] [2023-11-26 10:41:24,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:24,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:41:24,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:24,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:41:24,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:41:24,444 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 164 [2023-11-26 10:41:24,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 90 transitions, 222 flow. Second operand has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states 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 10:41:24,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:24,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 164 [2023-11-26 10:41:24,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:24,970 INFO L124 PetriNetUnfolderBase]: 4538/7317 cut-off events. [2023-11-26 10:41:24,970 INFO L125 PetriNetUnfolderBase]: For 186/190 co-relation queries the response was YES. [2023-11-26 10:41:24,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13614 conditions, 7317 events. 4538/7317 cut-off events. For 186/190 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 47616 event pairs, 3592 based on Foata normal form. 2/5397 useless extension candidates. Maximal degree in co-relation 13531. Up to 6077 conditions per place. [2023-11-26 10:41:25,013 INFO L140 encePairwiseOnDemand]: 155/164 looper letters, 44 selfloop transitions, 5 changer transitions 0/87 dead transitions. [2023-11-26 10:41:25,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 87 transitions, 314 flow [2023-11-26 10:41:25,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:41:25,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:41:25,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 320 transitions. [2023-11-26 10:41:25,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6504065040650406 [2023-11-26 10:41:25,016 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 320 transitions. [2023-11-26 10:41:25,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 320 transitions. [2023-11-26 10:41:25,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:25,016 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 320 transitions. [2023-11-26 10:41:25,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:25,018 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states 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 10:41:25,019 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states 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 10:41:25,019 INFO L175 Difference]: Start difference. First operand has 95 places, 90 transitions, 222 flow. Second operand 3 states and 320 transitions. [2023-11-26 10:41:25,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 87 transitions, 314 flow [2023-11-26 10:41:25,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 87 transitions, 310 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:41:25,022 INFO L231 Difference]: Finished difference. Result has 90 places, 85 transitions, 218 flow [2023-11-26 10:41:25,023 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=218, PETRI_PLACES=90, PETRI_TRANSITIONS=85} [2023-11-26 10:41:25,024 INFO L281 CegarLoopForPetriNet]: 117 programPoint places, -27 predicate places. [2023-11-26 10:41:25,024 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 85 transitions, 218 flow [2023-11-26 10:41:25,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states 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 10:41:25,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:25,025 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:41:25,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 10:41:25,025 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-11-26 10:41:25,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:25,026 INFO L85 PathProgramCache]: Analyzing trace with hash 439564717, now seen corresponding path program 1 times [2023-11-26 10:41:25,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:25,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818844876] [2023-11-26 10:41:25,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:25,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:25,118 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 10:41:25,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:25,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818844876] [2023-11-26 10:41:25,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818844876] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:25,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:25,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:41:25,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352459945] [2023-11-26 10:41:25,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:25,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:41:25,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:25,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:41:25,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:41:25,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 164 [2023-11-26 10:41:25,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 85 transitions, 218 flow. Second operand has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states 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 10:41:25,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:25,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 164 [2023-11-26 10:41:25,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:25,464 INFO L124 PetriNetUnfolderBase]: 1487/2547 cut-off events. [2023-11-26 10:41:25,464 INFO L125 PetriNetUnfolderBase]: For 103/107 co-relation queries the response was YES. [2023-11-26 10:41:25,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4735 conditions, 2547 events. 1487/2547 cut-off events. For 103/107 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 13683 event pairs, 1115 based on Foata normal form. 4/2290 useless extension candidates. Maximal degree in co-relation 4658. Up to 2064 conditions per place. [2023-11-26 10:41:25,478 INFO L140 encePairwiseOnDemand]: 157/164 looper letters, 43 selfloop transitions, 1 changer transitions 0/81 dead transitions. [2023-11-26 10:41:25,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 81 transitions, 298 flow [2023-11-26 10:41:25,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:41:25,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:41:25,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 316 transitions. [2023-11-26 10:41:25,481 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6422764227642277 [2023-11-26 10:41:25,481 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 316 transitions. [2023-11-26 10:41:25,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 316 transitions. [2023-11-26 10:41:25,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:25,482 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 316 transitions. [2023-11-26 10:41:25,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states 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 10:41:25,484 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states 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 10:41:25,484 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states 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 10:41:25,485 INFO L175 Difference]: Start difference. First operand has 90 places, 85 transitions, 218 flow. Second operand 3 states and 316 transitions. [2023-11-26 10:41:25,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 81 transitions, 298 flow [2023-11-26 10:41:25,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 81 transitions, 288 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:41:25,488 INFO L231 Difference]: Finished difference. Result has 84 places, 79 transitions, 198 flow [2023-11-26 10:41:25,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=84, PETRI_TRANSITIONS=79} [2023-11-26 10:41:25,489 INFO L281 CegarLoopForPetriNet]: 117 programPoint places, -33 predicate places. [2023-11-26 10:41:25,489 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 79 transitions, 198 flow [2023-11-26 10:41:25,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states 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 10:41:25,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:25,490 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:41:25,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-26 10:41:25,491 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-11-26 10:41:25,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:25,491 INFO L85 PathProgramCache]: Analyzing trace with hash 672306057, now seen corresponding path program 1 times [2023-11-26 10:41:25,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:25,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607820730] [2023-11-26 10:41:25,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:25,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:25,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:25,672 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 10:41:25,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:25,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607820730] [2023-11-26 10:41:25,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607820730] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:25,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:25,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:41:25,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752049213] [2023-11-26 10:41:25,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:25,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:41:25,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:25,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:41:25,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:41:25,760 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 164 [2023-11-26 10:41:25,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 79 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:25,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:25,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 164 [2023-11-26 10:41:25,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:26,052 INFO L124 PetriNetUnfolderBase]: 1553/2615 cut-off events. [2023-11-26 10:41:26,053 INFO L125 PetriNetUnfolderBase]: For 88/90 co-relation queries the response was YES. [2023-11-26 10:41:26,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4898 conditions, 2615 events. 1553/2615 cut-off events. For 88/90 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 13866 event pairs, 1163 based on Foata normal form. 0/2394 useless extension candidates. Maximal degree in co-relation 4828. Up to 2159 conditions per place. [2023-11-26 10:41:26,066 INFO L140 encePairwiseOnDemand]: 160/164 looper letters, 43 selfloop transitions, 2 changer transitions 0/78 dead transitions. [2023-11-26 10:41:26,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 78 transitions, 286 flow [2023-11-26 10:41:26,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:41:26,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:41:26,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 307 transitions. [2023-11-26 10:41:26,070 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6239837398373984 [2023-11-26 10:41:26,070 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 307 transitions. [2023-11-26 10:41:26,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 307 transitions. [2023-11-26 10:41:26,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:26,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 307 transitions. [2023-11-26 10:41:26,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states 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 10:41:26,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states 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 10:41:26,074 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states 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 10:41:26,074 INFO L175 Difference]: Start difference. First operand has 84 places, 79 transitions, 198 flow. Second operand 3 states and 307 transitions. [2023-11-26 10:41:26,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 78 transitions, 286 flow [2023-11-26 10:41:26,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 78 transitions, 285 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 10:41:26,078 INFO L231 Difference]: Finished difference. Result has 83 places, 77 transitions, 197 flow [2023-11-26 10:41:26,078 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=197, PETRI_PLACES=83, PETRI_TRANSITIONS=77} [2023-11-26 10:41:26,079 INFO L281 CegarLoopForPetriNet]: 117 programPoint places, -34 predicate places. [2023-11-26 10:41:26,079 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 77 transitions, 197 flow [2023-11-26 10:41:26,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:26,080 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:26,080 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:41:26,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-26 10:41:26,081 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-11-26 10:41:26,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:26,081 INFO L85 PathProgramCache]: Analyzing trace with hash -322434544, now seen corresponding path program 1 times [2023-11-26 10:41:26,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:26,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056028321] [2023-11-26 10:41:26,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:26,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:26,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:41:26,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:26,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056028321] [2023-11-26 10:41:26,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056028321] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:26,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:26,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 10:41:26,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215197327] [2023-11-26 10:41:26,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:26,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:41:26,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:26,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:41:26,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:41:26,492 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 164 [2023-11-26 10:41:26,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 77 transitions, 197 flow. Second operand has 4 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 0 states have call successors, (0), 0 states 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 10:41:26,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:26,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 164 [2023-11-26 10:41:26,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:26,878 INFO L124 PetriNetUnfolderBase]: 1487/2499 cut-off events. [2023-11-26 10:41:26,878 INFO L125 PetriNetUnfolderBase]: For 97/101 co-relation queries the response was YES. [2023-11-26 10:41:26,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4685 conditions, 2499 events. 1487/2499 cut-off events. For 97/101 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 13212 event pairs, 1115 based on Foata normal form. 30/2316 useless extension candidates. Maximal degree in co-relation 4612. Up to 2057 conditions per place. [2023-11-26 10:41:26,897 INFO L140 encePairwiseOnDemand]: 160/164 looper letters, 41 selfloop transitions, 2 changer transitions 0/76 dead transitions. [2023-11-26 10:41:26,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 76 transitions, 281 flow [2023-11-26 10:41:26,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:41:26,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:41:26,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 311 transitions. [2023-11-26 10:41:26,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6321138211382114 [2023-11-26 10:41:26,900 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 311 transitions. [2023-11-26 10:41:26,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 311 transitions. [2023-11-26 10:41:26,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:26,901 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 311 transitions. [2023-11-26 10:41:26,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states 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 10:41:26,904 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states 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 10:41:26,905 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states 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 10:41:26,905 INFO L175 Difference]: Start difference. First operand has 83 places, 77 transitions, 197 flow. Second operand 3 states and 311 transitions. [2023-11-26 10:41:26,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 76 transitions, 281 flow [2023-11-26 10:41:26,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 76 transitions, 277 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:41:26,909 INFO L231 Difference]: Finished difference. Result has 81 places, 75 transitions, 193 flow [2023-11-26 10:41:26,909 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=193, PETRI_PLACES=81, PETRI_TRANSITIONS=75} [2023-11-26 10:41:26,910 INFO L281 CegarLoopForPetriNet]: 117 programPoint places, -36 predicate places. [2023-11-26 10:41:26,910 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 75 transitions, 193 flow [2023-11-26 10:41:26,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 0 states have call successors, (0), 0 states 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 10:41:26,911 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:26,911 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 10:41:26,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-26 10:41:26,912 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-11-26 10:41:26,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:26,912 INFO L85 PathProgramCache]: Analyzing trace with hash -2100248240, now seen corresponding path program 1 times [2023-11-26 10:41:26,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:26,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332473063] [2023-11-26 10:41:26,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:26,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:26,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:27,104 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 10:41:27,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:27,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332473063] [2023-11-26 10:41:27,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332473063] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:27,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:27,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 10:41:27,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312529535] [2023-11-26 10:41:27,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:27,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:41:27,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:27,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:41:27,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:41:27,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 164 [2023-11-26 10:41:27,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 75 transitions, 193 flow. Second operand has 4 states, 4 states have (on average 92.75) internal successors, (371), 4 states have internal predecessors, (371), 0 states have call successors, (0), 0 states 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 10:41:27,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:27,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 164 [2023-11-26 10:41:27,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:27,590 INFO L124 PetriNetUnfolderBase]: 1487/2459 cut-off events. [2023-11-26 10:41:27,590 INFO L125 PetriNetUnfolderBase]: For 97/101 co-relation queries the response was YES. [2023-11-26 10:41:27,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4645 conditions, 2459 events. 1487/2459 cut-off events. For 97/101 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 12741 event pairs, 1115 based on Foata normal form. 58/2344 useless extension candidates. Maximal degree in co-relation 4572. Up to 2057 conditions per place. [2023-11-26 10:41:27,603 INFO L140 encePairwiseOnDemand]: 160/164 looper letters, 41 selfloop transitions, 2 changer transitions 0/74 dead transitions. [2023-11-26 10:41:27,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 74 transitions, 277 flow [2023-11-26 10:41:27,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:41:27,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:41:27,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 311 transitions. [2023-11-26 10:41:27,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6321138211382114 [2023-11-26 10:41:27,605 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 311 transitions. [2023-11-26 10:41:27,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 311 transitions. [2023-11-26 10:41:27,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:27,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 311 transitions. [2023-11-26 10:41:27,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states 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 10:41:27,613 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states 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 10:41:27,614 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states 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 10:41:27,614 INFO L175 Difference]: Start difference. First operand has 81 places, 75 transitions, 193 flow. Second operand 3 states and 311 transitions. [2023-11-26 10:41:27,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 74 transitions, 277 flow [2023-11-26 10:41:27,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 74 transitions, 273 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:41:27,618 INFO L231 Difference]: Finished difference. Result has 79 places, 73 transitions, 189 flow [2023-11-26 10:41:27,618 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=189, PETRI_PLACES=79, PETRI_TRANSITIONS=73} [2023-11-26 10:41:27,619 INFO L281 CegarLoopForPetriNet]: 117 programPoint places, -38 predicate places. [2023-11-26 10:41:27,619 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 73 transitions, 189 flow [2023-11-26 10:41:27,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.75) internal successors, (371), 4 states have internal predecessors, (371), 0 states have call successors, (0), 0 states 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 10:41:27,620 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:27,620 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 10:41:27,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-26 10:41:27,621 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-11-26 10:41:27,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:27,621 INFO L85 PathProgramCache]: Analyzing trace with hash -2100248241, now seen corresponding path program 1 times [2023-11-26 10:41:27,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:27,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223746204] [2023-11-26 10:41:27,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:27,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:27,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:27,761 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 10:41:27,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:27,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223746204] [2023-11-26 10:41:27,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223746204] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:27,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:27,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:41:27,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580450564] [2023-11-26 10:41:27,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:27,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:41:27,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:27,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:41:27,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:41:27,860 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 164 [2023-11-26 10:41:27,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 73 transitions, 189 flow. Second operand has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states 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 10:41:27,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:27,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 164 [2023-11-26 10:41:27,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:28,155 INFO L124 PetriNetUnfolderBase]: 1629/2581 cut-off events. [2023-11-26 10:41:28,155 INFO L125 PetriNetUnfolderBase]: For 95/97 co-relation queries the response was YES. [2023-11-26 10:41:28,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4969 conditions, 2581 events. 1629/2581 cut-off events. For 95/97 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 12810 event pairs, 1227 based on Foata normal form. 0/2446 useless extension candidates. Maximal degree in co-relation 4896. Up to 2259 conditions per place. [2023-11-26 10:41:28,169 INFO L140 encePairwiseOnDemand]: 160/164 looper letters, 43 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2023-11-26 10:41:28,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 72 transitions, 277 flow [2023-11-26 10:41:28,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:41:28,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:41:28,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 307 transitions. [2023-11-26 10:41:28,172 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6239837398373984 [2023-11-26 10:41:28,172 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 307 transitions. [2023-11-26 10:41:28,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 307 transitions. [2023-11-26 10:41:28,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:28,173 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 307 transitions. [2023-11-26 10:41:28,174 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states 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 10:41:28,176 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states 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 10:41:28,177 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states 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 10:41:28,177 INFO L175 Difference]: Start difference. First operand has 79 places, 73 transitions, 189 flow. Second operand 3 states and 307 transitions. [2023-11-26 10:41:28,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 72 transitions, 277 flow [2023-11-26 10:41:28,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 72 transitions, 273 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:41:28,180 INFO L231 Difference]: Finished difference. Result has 77 places, 71 transitions, 185 flow [2023-11-26 10:41:28,181 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=185, PETRI_PLACES=77, PETRI_TRANSITIONS=71} [2023-11-26 10:41:28,182 INFO L281 CegarLoopForPetriNet]: 117 programPoint places, -40 predicate places. [2023-11-26 10:41:28,182 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 71 transitions, 185 flow [2023-11-26 10:41:28,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states 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 10:41:28,183 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:28,183 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:41:28,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-26 10:41:28,184 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-11-26 10:41:28,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:28,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1840134273, now seen corresponding path program 1 times [2023-11-26 10:41:28,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:28,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432501994] [2023-11-26 10:41:28,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:28,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:28,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:29,023 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 10:41:29,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:29,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432501994] [2023-11-26 10:41:29,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432501994] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:29,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:29,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 10:41:29,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826659108] [2023-11-26 10:41:29,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:29,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-26 10:41:29,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:29,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-26 10:41:29,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-26 10:41:29,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 164 [2023-11-26 10:41:29,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 71 transitions, 185 flow. Second operand has 8 states, 8 states have (on average 89.0) internal successors, (712), 8 states have internal predecessors, (712), 0 states have call successors, (0), 0 states 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 10:41:29,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:29,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 164 [2023-11-26 10:41:29,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:30,024 INFO L124 PetriNetUnfolderBase]: 2372/3752 cut-off events. [2023-11-26 10:41:30,024 INFO L125 PetriNetUnfolderBase]: For 427/433 co-relation queries the response was YES. [2023-11-26 10:41:30,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7445 conditions, 3752 events. 2372/3752 cut-off events. For 427/433 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 20045 event pairs, 1669 based on Foata normal form. 4/3557 useless extension candidates. Maximal degree in co-relation 4533. Up to 3214 conditions per place. [2023-11-26 10:41:30,044 INFO L140 encePairwiseOnDemand]: 158/164 looper letters, 45 selfloop transitions, 6 changer transitions 0/75 dead transitions. [2023-11-26 10:41:30,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 75 transitions, 297 flow [2023-11-26 10:41:30,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 10:41:30,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 10:41:30,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2023-11-26 10:41:30,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5792682926829268 [2023-11-26 10:41:30,048 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 475 transitions. [2023-11-26 10:41:30,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 475 transitions. [2023-11-26 10:41:30,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:30,048 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 475 transitions. [2023-11-26 10:41:30,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 0 states have call successors, (0), 0 states 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 10:41:30,052 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 164.0) internal successors, (984), 6 states have internal predecessors, (984), 0 states have call successors, (0), 0 states 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 10:41:30,053 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 164.0) internal successors, (984), 6 states have internal predecessors, (984), 0 states have call successors, (0), 0 states 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 10:41:30,053 INFO L175 Difference]: Start difference. First operand has 77 places, 71 transitions, 185 flow. Second operand 5 states and 475 transitions. [2023-11-26 10:41:30,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 75 transitions, 297 flow [2023-11-26 10:41:30,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 75 transitions, 287 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-11-26 10:41:30,058 INFO L231 Difference]: Finished difference. Result has 77 places, 70 transitions, 183 flow [2023-11-26 10:41:30,058 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=183, PETRI_PLACES=77, PETRI_TRANSITIONS=70} [2023-11-26 10:41:30,059 INFO L281 CegarLoopForPetriNet]: 117 programPoint places, -40 predicate places. [2023-11-26 10:41:30,059 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 70 transitions, 183 flow [2023-11-26 10:41:30,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 89.0) internal successors, (712), 8 states have internal predecessors, (712), 0 states have call successors, (0), 0 states 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 10:41:30,060 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:30,060 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:41:30,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-26 10:41:30,061 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-11-26 10:41:30,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:30,062 INFO L85 PathProgramCache]: Analyzing trace with hash 973902833, now seen corresponding path program 1 times [2023-11-26 10:41:30,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:30,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85572562] [2023-11-26 10:41:30,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:30,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:30,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:30,836 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 10:41:30,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:30,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85572562] [2023-11-26 10:41:30,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85572562] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:30,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:30,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:41:30,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181709304] [2023-11-26 10:41:30,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:30,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:41:30,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:30,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:41:30,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:41:31,235 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 164 [2023-11-26 10:41:31,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 70 transitions, 183 flow. Second operand has 6 states, 6 states have (on average 94.33333333333333) internal successors, (566), 6 states have internal predecessors, (566), 0 states have call successors, (0), 0 states 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 10:41:31,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:31,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 164 [2023-11-26 10:41:31,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:31,677 INFO L124 PetriNetUnfolderBase]: 1487/2416 cut-off events. [2023-11-26 10:41:31,678 INFO L125 PetriNetUnfolderBase]: For 101/105 co-relation queries the response was YES. [2023-11-26 10:41:31,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4602 conditions, 2416 events. 1487/2416 cut-off events. For 101/105 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 12252 event pairs, 1112 based on Foata normal form. 2/2285 useless extension candidates. Maximal degree in co-relation 4536. Up to 2048 conditions per place. [2023-11-26 10:41:31,695 INFO L140 encePairwiseOnDemand]: 159/164 looper letters, 41 selfloop transitions, 5 changer transitions 0/73 dead transitions. [2023-11-26 10:41:31,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 73 transitions, 281 flow [2023-11-26 10:41:31,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 10:41:31,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 10:41:31,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 491 transitions. [2023-11-26 10:41:31,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.598780487804878 [2023-11-26 10:41:31,699 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 491 transitions. [2023-11-26 10:41:31,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 491 transitions. [2023-11-26 10:41:31,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:31,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 491 transitions. [2023-11-26 10:41:31,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 98.2) internal successors, (491), 5 states have internal predecessors, (491), 0 states have call successors, (0), 0 states 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 10:41:31,705 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 164.0) internal successors, (984), 6 states have internal predecessors, (984), 0 states have call successors, (0), 0 states 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 10:41:31,706 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 164.0) internal successors, (984), 6 states have internal predecessors, (984), 0 states have call successors, (0), 0 states 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 10:41:31,706 INFO L175 Difference]: Start difference. First operand has 77 places, 70 transitions, 183 flow. Second operand 5 states and 491 transitions. [2023-11-26 10:41:31,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 73 transitions, 281 flow [2023-11-26 10:41:31,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 73 transitions, 269 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-26 10:41:31,709 INFO L231 Difference]: Finished difference. Result has 76 places, 69 transitions, 179 flow [2023-11-26 10:41:31,710 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=179, PETRI_PLACES=76, PETRI_TRANSITIONS=69} [2023-11-26 10:41:31,711 INFO L281 CegarLoopForPetriNet]: 117 programPoint places, -41 predicate places. [2023-11-26 10:41:31,711 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 69 transitions, 179 flow [2023-11-26 10:41:31,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.33333333333333) internal successors, (566), 6 states have internal predecessors, (566), 0 states have call successors, (0), 0 states 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 10:41:31,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:31,712 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:41:31,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-26 10:41:31,712 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-11-26 10:41:31,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:31,713 INFO L85 PathProgramCache]: Analyzing trace with hash 990812728, now seen corresponding path program 1 times [2023-11-26 10:41:31,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:31,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264383636] [2023-11-26 10:41:31,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:31,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:31,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:41:31,814 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 10:41:31,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:41:31,929 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 10:41:31,929 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 10:41:31,930 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (72 of 73 remaining) [2023-11-26 10:41:31,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 73 remaining) [2023-11-26 10:41:31,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 73 remaining) [2023-11-26 10:41:31,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 73 remaining) [2023-11-26 10:41:31,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 73 remaining) [2023-11-26 10:41:31,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 73 remaining) [2023-11-26 10:41:31,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 73 remaining) [2023-11-26 10:41:31,935 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 73 remaining) [2023-11-26 10:41:31,935 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 73 remaining) [2023-11-26 10:41:31,935 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 73 remaining) [2023-11-26 10:41:31,935 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 73 remaining) [2023-11-26 10:41:31,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 73 remaining) [2023-11-26 10:41:31,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 73 remaining) [2023-11-26 10:41:31,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 73 remaining) [2023-11-26 10:41:31,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 73 remaining) [2023-11-26 10:41:31,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 73 remaining) [2023-11-26 10:41:31,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 73 remaining) [2023-11-26 10:41:31,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 73 remaining) [2023-11-26 10:41:31,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 73 remaining) [2023-11-26 10:41:31,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 73 remaining) [2023-11-26 10:41:31,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 73 remaining) [2023-11-26 10:41:31,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (51 of 73 remaining) [2023-11-26 10:41:31,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 73 remaining) [2023-11-26 10:41:31,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 73 remaining) [2023-11-26 10:41:31,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 73 remaining) [2023-11-26 10:41:31,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (47 of 73 remaining) [2023-11-26 10:41:31,940 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 73 remaining) [2023-11-26 10:41:31,940 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 73 remaining) [2023-11-26 10:41:31,940 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 73 remaining) [2023-11-26 10:41:31,940 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 73 remaining) [2023-11-26 10:41:31,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 73 remaining) [2023-11-26 10:41:31,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 73 remaining) [2023-11-26 10:41:31,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 73 remaining) [2023-11-26 10:41:31,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 73 remaining) [2023-11-26 10:41:31,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 73 remaining) [2023-11-26 10:41:31,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 73 remaining) [2023-11-26 10:41:31,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 73 remaining) [2023-11-26 10:41:31,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 73 remaining) [2023-11-26 10:41:31,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (34 of 73 remaining) [2023-11-26 10:41:31,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 73 remaining) [2023-11-26 10:41:31,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 73 remaining) [2023-11-26 10:41:31,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 73 remaining) [2023-11-26 10:41:31,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 73 remaining) [2023-11-26 10:41:31,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 73 remaining) [2023-11-26 10:41:31,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 73 remaining) [2023-11-26 10:41:31,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 73 remaining) [2023-11-26 10:41:31,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 73 remaining) [2023-11-26 10:41:31,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 73 remaining) [2023-11-26 10:41:31,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 73 remaining) [2023-11-26 10:41:31,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 73 remaining) [2023-11-26 10:41:31,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 73 remaining) [2023-11-26 10:41:31,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 73 remaining) [2023-11-26 10:41:31,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 73 remaining) [2023-11-26 10:41:31,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 73 remaining) [2023-11-26 10:41:31,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 73 remaining) [2023-11-26 10:41:31,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 73 remaining) [2023-11-26 10:41:31,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 73 remaining) [2023-11-26 10:41:31,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 73 remaining) [2023-11-26 10:41:31,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 73 remaining) [2023-11-26 10:41:31,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 73 remaining) [2023-11-26 10:41:31,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork4Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 73 remaining) [2023-11-26 10:41:31,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork4Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 73 remaining) [2023-11-26 10:41:31,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork4Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 73 remaining) [2023-11-26 10:41:31,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork4Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 73 remaining) [2023-11-26 10:41:31,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork4Err10INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 73 remaining) [2023-11-26 10:41:31,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 73 remaining) [2023-11-26 10:41:31,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 73 remaining) [2023-11-26 10:41:31,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 73 remaining) [2023-11-26 10:41:31,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 73 remaining) [2023-11-26 10:41:31,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 73 remaining) [2023-11-26 10:41:31,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 73 remaining) [2023-11-26 10:41:31,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 73 remaining) [2023-11-26 10:41:31,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 73 remaining) [2023-11-26 10:41:31,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-26 10:41:31,952 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:41:31,961 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-26 10:41:31,962 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 10:41:32,096 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre20 could not be translated [2023-11-26 10:41:32,098 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-26 10:41:32,099 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem7 could not be translated [2023-11-26 10:41:32,100 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem7 could not be translated [2023-11-26 10:41:32,101 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre8 could not be translated [2023-11-26 10:41:32,101 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre8 could not be translated [2023-11-26 10:41:32,102 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre10 could not be translated [2023-11-26 10:41:32,115 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre10 could not be translated [2023-11-26 10:41:32,116 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre12 could not be translated [2023-11-26 10:41:32,117 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre12 could not be translated [2023-11-26 10:41:32,118 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre14 could not be translated [2023-11-26 10:41:32,119 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre14 could not be translated [2023-11-26 10:41:32,120 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated [2023-11-26 10:41:32,121 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated [2023-11-26 10:41:32,122 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem17 could not be translated [2023-11-26 10:41:32,123 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem17 could not be translated [2023-11-26 10:41:32,124 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem18 could not be translated [2023-11-26 10:41:32,125 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem18 could not be translated [2023-11-26 10:41:32,126 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem19 could not be translated [2023-11-26 10:41:32,128 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem19 could not be translated [2023-11-26 10:41:32,135 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem22 could not be translated [2023-11-26 10:41:32,142 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short25 could not be translated [2023-11-26 10:41:32,143 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem23 could not be translated [2023-11-26 10:41:32,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 10:41:32 BasicIcfg [2023-11-26 10:41:32,158 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 10:41:32,158 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 10:41:32,159 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 10:41:32,159 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 10:41:32,160 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:40:54" (3/4) ... [2023-11-26 10:41:32,162 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-26 10:41:32,164 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 10:41:32,165 INFO L158 Benchmark]: Toolchain (without parser) took 39471.72ms. Allocated memory was 148.9MB in the beginning and 11.2GB in the end (delta: 11.0GB). Free memory was 118.5MB in the beginning and 7.2GB in the end (delta: -7.1GB). Peak memory consumption was 3.9GB. Max. memory is 16.1GB. [2023-11-26 10:41:32,165 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 117.4MB. Free memory is still 87.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 10:41:32,165 INFO L158 Benchmark]: CACSL2BoogieTranslator took 987.79ms. Allocated memory is still 148.9MB. Free memory was 118.5MB in the beginning and 84.7MB in the end (delta: 33.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2023-11-26 10:41:32,166 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.73ms. Allocated memory is still 148.9MB. Free memory was 84.7MB in the beginning and 82.1MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 10:41:32,166 INFO L158 Benchmark]: Boogie Preprocessor took 101.12ms. Allocated memory is still 148.9MB. Free memory was 82.1MB in the beginning and 79.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 10:41:32,167 INFO L158 Benchmark]: RCFGBuilder took 834.60ms. Allocated memory is still 148.9MB. Free memory was 79.2MB in the beginning and 92.6MB in the end (delta: -13.4MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2023-11-26 10:41:32,167 INFO L158 Benchmark]: TraceAbstraction took 37451.10ms. Allocated memory was 148.9MB in the beginning and 11.2GB in the end (delta: 11.0GB). Free memory was 91.8MB in the beginning and 7.2GB in the end (delta: -7.1GB). Peak memory consumption was 3.9GB. Max. memory is 16.1GB. [2023-11-26 10:41:32,168 INFO L158 Benchmark]: Witness Printer took 5.36ms. Allocated memory is still 11.2GB. Free memory is still 7.2GB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 10:41:32,170 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 117.4MB. Free memory is still 87.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 987.79ms. Allocated memory is still 148.9MB. Free memory was 118.5MB in the beginning and 84.7MB in the end (delta: 33.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.73ms. Allocated memory is still 148.9MB. Free memory was 84.7MB in the beginning and 82.1MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 101.12ms. Allocated memory is still 148.9MB. Free memory was 82.1MB in the beginning and 79.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 834.60ms. Allocated memory is still 148.9MB. Free memory was 79.2MB in the beginning and 92.6MB in the end (delta: -13.4MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. * TraceAbstraction took 37451.10ms. Allocated memory was 148.9MB in the beginning and 11.2GB in the end (delta: 11.0GB). Free memory was 91.8MB in the beginning and 7.2GB in the end (delta: -7.1GB). Peak memory consumption was 3.9GB. Max. memory is 16.1GB. * Witness Printer took 5.36ms. Allocated memory is still 11.2GB. Free memory is still 7.2GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre20 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre8 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre8 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre12 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre12 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre14 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre14 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem19 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem19 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem22 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short25 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem23 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1159]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1159. Possible FailurePath: [L1124] 0 char *v; [L1161] 0 pthread_t t; [L1162] FCALL, FORK 0 pthread_create(&t, 0, thread0, 0) VAL [arg={0:0}, t={6:0}, v={0:0}] [L1163] 0 \read(t) VAL [arg={0:0}, v={0:0}] [L1146] 1 pthread_t t1, t2, t3, t4, t5; [L1147] FCALL, FORK 1 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, t1={8:0}, t2={5:0}, t3={7:0}, t4={9:0}, t5={10:0}, v={0:0}] [L1127] 2 v = malloc(sizeof(char)) [L1128] 2 return 0; [L1148] 1 \read(t1) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={8:0}, t2={5:0}, t3={7:0}, t4={9:0}, t5={10:0}, v={3:0}] [L1148] FCALL, JOIN 2 pthread_join(t1, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={8:0}, t2={5:0}, t3={7:0}, t4={9:0}, t5={10:0}, v={3:0}] [L1149] FCALL, FORK 1 pthread_create(&t2, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={8:0}, t2={5:0}, t3={7:0}, t4={9:0}, t5={10:0}, v={3:0}] [L1133] 3 v[0] = 'X' VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={8:0}, t2={5:0}, t3={7:0}, t4={9:0}, t5={10:0}, v={3:0}] [L1150] FCALL, FORK 1 pthread_create(&t3, 0, thread3, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={8:0}, t2={5:0}, t3={7:0}, t4={9:0}, t5={10:0}, v={3:0}] [L1140] 4 v[0] = 'Y' VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={8:0}, t2={5:0}, t3={7:0}, t4={9:0}, t5={10:0}, v={3:0}] [L1135] 3 return 0; [L1151] FCALL, FORK 1 pthread_create(&t4, 0, thread2, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={8:0}, t2={5:0}, t3={7:0}, t4={9:0}, t5={10:0}, v={3:0}] [L1133] 5 v[0] = 'X' VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={8:0}, t2={5:0}, t3={7:0}, t4={9:0}, t5={10:0}, v={3:0}] [L1142] 4 return 0; [L1152] FCALL, FORK 1 pthread_create(&t5, 0, thread2, 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={8:0}, t2={5:0}, t3={7:0}, t4={9:0}, t5={10:0}, v={3:0}] [L1133] 6 v[0] = 'X' VAL [\result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={8:0}, t2={5:0}, t3={7:0}, t4={9:0}, t5={10:0}, v={3:0}] [L1135] 5 return 0; [L1153] 1 \read(t2) VAL [\result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={8:0}, t2={5:0}, t3={7:0}, t4={9:0}, t5={10:0}, v={3:0}] [L1153] FCALL, JOIN 3 pthread_join(t2, 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={8:0}, t2={5:0}, t3={7:0}, t4={9:0}, t5={10:0}, v={3:0}] [L1154] 1 \read(t3) VAL [\result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={8:0}, t2={5:0}, t3={7:0}, t4={9:0}, t5={10:0}, v={3:0}] [L1154] FCALL, JOIN 4 pthread_join(t3, 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={8:0}, t2={5:0}, t3={7:0}, t4={9:0}, t5={10:0}, v={3:0}] [L1155] 1 \read(t4) VAL [\result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={8:0}, t2={5:0}, t3={7:0}, t4={9:0}, t5={10:0}, v={3:0}] [L1155] FCALL, JOIN 5 pthread_join(t4, 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={8:0}, t2={5:0}, t3={7:0}, t4={9:0}, t5={10:0}, v={3:0}] [L1135] 6 return 0; [L1156] 1 \read(t5) VAL [\result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={8:0}, t2={5:0}, t3={7:0}, t4={9:0}, t5={10:0}, v={3:0}] [L1156] FCALL, JOIN 6 pthread_join(t5, 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={8:0}, t2={5:0}, t3={7:0}, t4={9:0}, t5={10:0}, v={3:0}] [L1157] 1 return 0; [L1157] 1 return 0; [L1157] 1 return 0; [L1157] 1 return 0; [L1157] 1 return 0; [L1157] 1 return 0; [L1163] FCALL, JOIN 1 pthread_join(t, 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t={6:0}, v={3:0}] [L1164] EXPR 0 v[0] [L1164] EXPR 0 v[0] == 'X' || v[0] == 'Y' VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t={6:0}, v={3:0}] [L1164] EXPR 0 v[0] == 'X' || v[0] == 'Y' VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, v={3:0}] [L1164] CALL 0 __VERIFIER_assert(v[0] == 'X' || v[0] == 'Y') [L1123] COND FALSE 0 !(!expression) VAL [\old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, v={3:0}] [L1164] RET 0 __VERIFIER_assert(v[0] == 'X' || v[0] == 'Y') [L1165] 0 return 0; [L1165] 0 return 0; VAL [\result=0, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, v={3:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1150]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1147]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1152]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1149]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1151]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 20]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1162]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1150]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1147]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1151]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1152]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1149]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 11 procedures, 183 locations, 73 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 37.0s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 31.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4024 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2376 mSDsluCounter, 444 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 211 mSDsCounter, 72 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4134 IncrementalHoareTripleChecker+Invalid, 4206 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 72 mSolverCounterUnsat, 233 mSDtfsCounter, 4134 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=263occurred in iteration=0, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 352 NumberOfCodeBlocks, 352 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 277 ConstructedInterpolants, 0 QuantifiedInterpolants, 3516 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-26 10:41:32,204 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5becdf56-7463-4c2c-a06a-7985f38396d3/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5becdf56-7463-4c2c-a06a-7985f38396d3/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5becdf56-7463-4c2c-a06a-7985f38396d3/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_5becdf56-7463-4c2c-a06a-7985f38396d3/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5becdf56-7463-4c2c-a06a-7985f38396d3/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread/singleton_with-uninit-problems.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5becdf56-7463-4c2c-a06a-7985f38396d3/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5becdf56-7463-4c2c-a06a-7985f38396d3/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 9556b3eb7217f056a72a299bf0514e64606a248fa454b59dcc03e4a2e74c7c90 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 10:41:35,500 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 10:41:35,635 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5becdf56-7463-4c2c-a06a-7985f38396d3/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-26 10:41:35,656 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 10:41:35,657 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 10:41:35,716 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 10:41:35,717 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 10:41:35,718 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 10:41:35,719 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 10:41:35,724 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 10:41:35,725 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 10:41:35,725 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 10:41:35,726 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 10:41:35,728 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 10:41:35,728 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 10:41:35,729 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 10:41:35,729 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 10:41:35,730 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 10:41:35,730 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 10:41:35,732 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 10:41:35,732 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-26 10:41:35,733 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-26 10:41:35,733 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-26 10:41:35,734 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 10:41:35,734 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-26 10:41:35,735 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-26 10:41:35,735 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-26 10:41:35,736 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 10:41:35,736 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 10:41:35,736 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 10:41:35,739 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 10:41:35,739 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 10:41:35,739 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 10:41:35,740 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 10:41:35,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:41:35,740 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 10:41:35,741 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 10:41:35,742 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-26 10:41:35,742 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-26 10:41:35,742 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 10:41:35,742 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 10:41:35,743 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 10:41:35,743 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 10:41:35,743 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-26 10:41:35,744 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_5becdf56-7463-4c2c-a06a-7985f38396d3/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_5becdf56-7463-4c2c-a06a-7985f38396d3/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 -> 9556b3eb7217f056a72a299bf0514e64606a248fa454b59dcc03e4a2e74c7c90 [2023-11-26 10:41:36,187 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 10:41:36,208 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 10:41:36,211 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 10:41:36,212 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 10:41:36,213 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 10:41:36,214 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5becdf56-7463-4c2c-a06a-7985f38396d3/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread/singleton_with-uninit-problems.i