./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4297916e-1103-434e-ae55-2979fa86b6e8/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4297916e-1103-434e-ae55-2979fa86b6e8/bin/uautomizer-verify-NlZe1sFDwI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4297916e-1103-434e-ae55-2979fa86b6e8/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4297916e-1103-434e-ae55-2979fa86b6e8/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4297916e-1103-434e-ae55-2979fa86b6e8/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4297916e-1103-434e-ae55-2979fa86b6e8/bin/uautomizer-verify-NlZe1sFDwI --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b046eb92ec2f4af5c767436762d7e86376926c2222092f8f03ea795d781fd943 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 21:44:10,971 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 21:44:11,113 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4297916e-1103-434e-ae55-2979fa86b6e8/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-24 21:44:11,122 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 21:44:11,122 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 21:44:11,173 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 21:44:11,174 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 21:44:11,175 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 21:44:11,176 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 21:44:11,183 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 21:44:11,183 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 21:44:11,184 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 21:44:11,185 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 21:44:11,188 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 21:44:11,188 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 21:44:11,189 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 21:44:11,189 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 21:44:11,190 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 21:44:11,191 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 21:44:11,191 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 21:44:11,192 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 21:44:11,192 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 21:44:11,193 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 21:44:11,194 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 21:44:11,194 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 21:44:11,195 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 21:44:11,195 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 21:44:11,196 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 21:44:11,197 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 21:44:11,198 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 21:44:11,199 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 21:44:11,200 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 21:44:11,200 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:44:11,201 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 21:44:11,201 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 21:44:11,201 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 21:44:11,202 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 21:44:11,202 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 21:44:11,202 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 21:44:11,202 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 21:44:11,203 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 21:44:11,203 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_4297916e-1103-434e-ae55-2979fa86b6e8/bin/uautomizer-verify-NlZe1sFDwI/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4297916e-1103-434e-ae55-2979fa86b6e8/bin/uautomizer-verify-NlZe1sFDwI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b046eb92ec2f4af5c767436762d7e86376926c2222092f8f03ea795d781fd943 [2023-11-24 21:44:11,597 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 21:44:11,634 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 21:44:11,637 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 21:44:11,638 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 21:44:11,639 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 21:44:11,641 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4297916e-1103-434e-ae55-2979fa86b6e8/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-24 21:44:15,346 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 21:44:15,754 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 21:44:15,755 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4297916e-1103-434e-ae55-2979fa86b6e8/sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-24 21:44:15,777 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4297916e-1103-434e-ae55-2979fa86b6e8/bin/uautomizer-verify-NlZe1sFDwI/data/686160db9/3dea6326d04e427e97fd7f60f9be7b37/FLAGeaccc4aab [2023-11-24 21:44:15,797 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4297916e-1103-434e-ae55-2979fa86b6e8/bin/uautomizer-verify-NlZe1sFDwI/data/686160db9/3dea6326d04e427e97fd7f60f9be7b37 [2023-11-24 21:44:15,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 21:44:15,802 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 21:44:15,804 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 21:44:15,804 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 21:44:15,816 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 21:44:15,817 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:44:15" (1/1) ... [2023-11-24 21:44:15,819 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4748bf44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:44:15, skipping insertion in model container [2023-11-24 21:44:15,819 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:44:15" (1/1) ... [2023-11-24 21:44:15,919 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 21:44:16,630 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:44:16,656 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 21:44:16,778 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:44:16,820 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:44:16,821 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:44:16,829 INFO L206 MainTranslator]: Completed translation [2023-11-24 21:44:16,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:44:16 WrapperNode [2023-11-24 21:44:16,830 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 21:44:16,832 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 21:44:16,838 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 21:44:16,838 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 21:44:16,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:44:16" (1/1) ... [2023-11-24 21:44:16,872 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:44:16" (1/1) ... [2023-11-24 21:44:16,914 INFO L138 Inliner]: procedures = 176, calls = 53, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 148 [2023-11-24 21:44:16,914 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 21:44:16,915 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 21:44:16,915 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 21:44:16,916 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 21:44:16,932 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:44:16" (1/1) ... [2023-11-24 21:44:16,932 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:44:16" (1/1) ... [2023-11-24 21:44:16,938 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:44:16" (1/1) ... [2023-11-24 21:44:16,962 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2023-11-24 21:44:16,963 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:44:16" (1/1) ... [2023-11-24 21:44:16,963 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:44:16" (1/1) ... [2023-11-24 21:44:16,979 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:44:16" (1/1) ... [2023-11-24 21:44:16,982 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:44:16" (1/1) ... [2023-11-24 21:44:16,986 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:44:16" (1/1) ... [2023-11-24 21:44:16,989 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:44:16" (1/1) ... [2023-11-24 21:44:16,995 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 21:44:16,996 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 21:44:16,996 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 21:44:16,997 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 21:44:16,998 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:44:16" (1/1) ... [2023-11-24 21:44:17,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:44:17,026 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4297916e-1103-434e-ae55-2979fa86b6e8/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:44:17,043 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4297916e-1103-434e-ae55-2979fa86b6e8/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-24 21:44:17,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4297916e-1103-434e-ae55-2979fa86b6e8/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-24 21:44:17,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-24 21:44:17,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-24 21:44:17,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-24 21:44:17,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-24 21:44:17,092 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-24 21:44:17,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 21:44:17,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 21:44:17,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 21:44:17,094 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-24 21:44:17,094 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-24 21:44:17,094 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-24 21:44:17,094 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-24 21:44:17,095 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-24 21:44:17,095 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-24 21:44:17,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-24 21:44:17,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-24 21:44:17,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-24 21:44:17,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-24 21:44:17,096 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-24 21:44:17,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 21:44:17,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 21:44:17,099 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-24 21:44:17,313 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 21:44:17,316 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 21:44:17,838 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 21:44:18,176 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 21:44:18,177 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-24 21:44:18,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:44:18 BoogieIcfgContainer [2023-11-24 21:44:18,178 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 21:44:18,183 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 21:44:18,184 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 21:44:18,188 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 21:44:18,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 09:44:15" (1/3) ... [2023-11-24 21:44:18,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3feb833 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:44:18, skipping insertion in model container [2023-11-24 21:44:18,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:44:16" (2/3) ... [2023-11-24 21:44:18,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3feb833 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:44:18, skipping insertion in model container [2023-11-24 21:44:18,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:44:18" (3/3) ... [2023-11-24 21:44:18,193 INFO L112 eAbstractionObserver]: Analyzing ICFG safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-24 21:44:18,219 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 21:44:18,219 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-24 21:44:18,219 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 21:44:18,307 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 21:44:18,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 52 transitions, 116 flow [2023-11-24 21:44:18,404 INFO L124 PetriNetUnfolderBase]: 2/49 cut-off events. [2023-11-24 21:44:18,404 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:44:18,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 49 events. 2/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 89 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2023-11-24 21:44:18,409 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 52 transitions, 116 flow [2023-11-24 21:44:18,414 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 49 transitions, 107 flow [2023-11-24 21:44:18,427 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 21:44:18,436 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;@7589ae12, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 21:44:18,436 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-24 21:44:18,440 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-24 21:44:18,440 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-24 21:44:18,440 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:44:18,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:44:18,442 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 21:44:18,442 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:44:18,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:44:18,450 INFO L85 PathProgramCache]: Analyzing trace with hash 12212, now seen corresponding path program 1 times [2023-11-24 21:44:18,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:44:18,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897745253] [2023-11-24 21:44:18,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:44:18,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:44:18,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:44:18,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:44:18,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:44:18,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897745253] [2023-11-24 21:44:18,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897745253] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:44:18,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:44:18,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:44:18,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593548724] [2023-11-24 21:44:18,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:44:18,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:44:18,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:44:18,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:44:18,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:44:18,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 52 [2023-11-24 21:44:18,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 107 flow. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:18,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:44:18,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 52 [2023-11-24 21:44:18,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:44:19,436 INFO L124 PetriNetUnfolderBase]: 872/1683 cut-off events. [2023-11-24 21:44:19,436 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-24 21:44:19,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3049 conditions, 1683 events. 872/1683 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 11020 event pairs, 680 based on Foata normal form. 90/1586 useless extension candidates. Maximal degree in co-relation 3035. Up to 1037 conditions per place. [2023-11-24 21:44:19,463 INFO L140 encePairwiseOnDemand]: 47/52 looper letters, 29 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-11-24 21:44:19,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 53 transitions, 177 flow [2023-11-24 21:44:19,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:44:19,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:44:19,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2023-11-24 21:44:19,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6987179487179487 [2023-11-24 21:44:19,480 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 109 transitions. [2023-11-24 21:44:19,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 109 transitions. [2023-11-24 21:44:19,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:44:19,484 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 109 transitions. [2023-11-24 21:44:19,488 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:19,495 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:19,496 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:19,498 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 107 flow. Second operand 3 states and 109 transitions. [2023-11-24 21:44:19,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 53 transitions, 177 flow [2023-11-24 21:44:19,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 174 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-24 21:44:19,512 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 100 flow [2023-11-24 21:44:19,514 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2023-11-24 21:44:19,518 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, -3 predicate places. [2023-11-24 21:44:19,519 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 100 flow [2023-11-24 21:44:19,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:19,519 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:44:19,519 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 21:44:19,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 21:44:19,521 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:44:19,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:44:19,522 INFO L85 PathProgramCache]: Analyzing trace with hash 12213, now seen corresponding path program 1 times [2023-11-24 21:44:19,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:44:19,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481997938] [2023-11-24 21:44:19,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:44:19,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:44:19,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:44:19,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:44:19,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:44:19,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481997938] [2023-11-24 21:44:19,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481997938] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:44:19,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:44:19,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:44:19,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595035298] [2023-11-24 21:44:19,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:44:19,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:44:19,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:44:19,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:44:19,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:44:19,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 52 [2023-11-24 21:44:19,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:19,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:44:19,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 52 [2023-11-24 21:44:19,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:44:20,097 INFO L124 PetriNetUnfolderBase]: 872/1682 cut-off events. [2023-11-24 21:44:20,097 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-11-24 21:44:20,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3091 conditions, 1682 events. 872/1682 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 11052 event pairs, 680 based on Foata normal form. 1/1496 useless extension candidates. Maximal degree in co-relation 3080. Up to 1036 conditions per place. [2023-11-24 21:44:20,115 INFO L140 encePairwiseOnDemand]: 49/52 looper letters, 28 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-11-24 21:44:20,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 52 transitions, 174 flow [2023-11-24 21:44:20,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:44:20,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:44:20,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2023-11-24 21:44:20,118 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6987179487179487 [2023-11-24 21:44:20,118 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 109 transitions. [2023-11-24 21:44:20,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 109 transitions. [2023-11-24 21:44:20,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:44:20,119 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 109 transitions. [2023-11-24 21:44:20,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:20,121 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:20,121 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:20,122 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 100 flow. Second operand 3 states and 109 transitions. [2023-11-24 21:44:20,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 52 transitions, 174 flow [2023-11-24 21:44:20,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 52 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:44:20,127 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 98 flow [2023-11-24 21:44:20,127 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2023-11-24 21:44:20,128 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, -4 predicate places. [2023-11-24 21:44:20,128 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 98 flow [2023-11-24 21:44:20,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:20,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:44:20,129 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:44:20,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 21:44:20,129 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:44:20,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:44:20,130 INFO L85 PathProgramCache]: Analyzing trace with hash 364174073, now seen corresponding path program 1 times [2023-11-24 21:44:20,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:44:20,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679704658] [2023-11-24 21:44:20,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:44:20,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:44:20,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:44:20,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:44:20,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:44:20,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679704658] [2023-11-24 21:44:20,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679704658] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:44:20,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:44:20,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:44:20,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732243841] [2023-11-24 21:44:20,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:44:20,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:44:20,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:44:20,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:44:20,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:44:20,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 52 [2023-11-24 21:44:20,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:20,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:44:20,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 52 [2023-11-24 21:44:20,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:44:20,572 INFO L124 PetriNetUnfolderBase]: 876/1672 cut-off events. [2023-11-24 21:44:20,572 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-11-24 21:44:20,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3090 conditions, 1672 events. 876/1672 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 10861 event pairs, 698 based on Foata normal form. 0/1495 useless extension candidates. Maximal degree in co-relation 3079. Up to 1039 conditions per place. [2023-11-24 21:44:20,637 INFO L140 encePairwiseOnDemand]: 49/52 looper letters, 29 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2023-11-24 21:44:20,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 51 transitions, 174 flow [2023-11-24 21:44:20,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:44:20,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:44:20,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2023-11-24 21:44:20,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6858974358974359 [2023-11-24 21:44:20,644 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 107 transitions. [2023-11-24 21:44:20,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 107 transitions. [2023-11-24 21:44:20,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:44:20,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 107 transitions. [2023-11-24 21:44:20,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:20,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:20,650 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:20,650 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 98 flow. Second operand 3 states and 107 transitions. [2023-11-24 21:44:20,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 51 transitions, 174 flow [2023-11-24 21:44:20,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 51 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:44:20,657 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 96 flow [2023-11-24 21:44:20,657 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2023-11-24 21:44:20,659 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, -5 predicate places. [2023-11-24 21:44:20,659 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 96 flow [2023-11-24 21:44:20,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:20,660 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:44:20,660 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:44:20,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 21:44:20,661 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:44:20,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:44:20,662 INFO L85 PathProgramCache]: Analyzing trace with hash 364174074, now seen corresponding path program 1 times [2023-11-24 21:44:20,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:44:20,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340805070] [2023-11-24 21:44:20,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:44:20,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:44:20,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:44:20,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:44:20,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:44:20,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340805070] [2023-11-24 21:44:20,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340805070] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:44:20,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:44:20,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:44:20,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324929529] [2023-11-24 21:44:20,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:44:20,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:44:20,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:44:20,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:44:20,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:44:20,831 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 52 [2023-11-24 21:44:20,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:20,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:44:20,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 52 [2023-11-24 21:44:20,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:44:21,201 INFO L124 PetriNetUnfolderBase]: 872/1672 cut-off events. [2023-11-24 21:44:21,201 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2023-11-24 21:44:21,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3085 conditions, 1672 events. 872/1672 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 11063 event pairs, 472 based on Foata normal form. 5/1503 useless extension candidates. Maximal degree in co-relation 3075. Up to 1030 conditions per place. [2023-11-24 21:44:21,216 INFO L140 encePairwiseOnDemand]: 49/52 looper letters, 28 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2023-11-24 21:44:21,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 50 transitions, 170 flow [2023-11-24 21:44:21,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:44:21,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:44:21,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2023-11-24 21:44:21,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6987179487179487 [2023-11-24 21:44:21,218 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 109 transitions. [2023-11-24 21:44:21,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 109 transitions. [2023-11-24 21:44:21,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:44:21,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 109 transitions. [2023-11-24 21:44:21,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:21,220 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:21,220 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:21,221 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 96 flow. Second operand 3 states and 109 transitions. [2023-11-24 21:44:21,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 50 transitions, 170 flow [2023-11-24 21:44:21,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 50 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:44:21,223 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 94 flow [2023-11-24 21:44:21,223 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2023-11-24 21:44:21,224 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, -6 predicate places. [2023-11-24 21:44:21,225 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 94 flow [2023-11-24 21:44:21,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:21,225 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:44:21,225 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:44:21,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 21:44:21,226 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:44:21,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:44:21,226 INFO L85 PathProgramCache]: Analyzing trace with hash 364174430, now seen corresponding path program 1 times [2023-11-24 21:44:21,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:44:21,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98736556] [2023-11-24 21:44:21,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:44:21,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:44:21,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:44:21,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:44:21,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:44:21,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98736556] [2023-11-24 21:44:21,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98736556] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:44:21,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:44:21,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:44:21,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203314617] [2023-11-24 21:44:21,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:44:21,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:44:21,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:44:21,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:44:21,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:44:21,337 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 52 [2023-11-24 21:44:21,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:21,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:44:21,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 52 [2023-11-24 21:44:21,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:44:21,612 INFO L124 PetriNetUnfolderBase]: 680/1249 cut-off events. [2023-11-24 21:44:21,613 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2023-11-24 21:44:21,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2363 conditions, 1249 events. 680/1249 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7205 event pairs, 364 based on Foata normal form. 0/1230 useless extension candidates. Maximal degree in co-relation 2353. Up to 844 conditions per place. [2023-11-24 21:44:21,625 INFO L140 encePairwiseOnDemand]: 49/52 looper letters, 33 selfloop transitions, 2 changer transitions 2/57 dead transitions. [2023-11-24 21:44:21,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 57 transitions, 206 flow [2023-11-24 21:44:21,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:44:21,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:44:21,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2023-11-24 21:44:21,626 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7628205128205128 [2023-11-24 21:44:21,627 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 119 transitions. [2023-11-24 21:44:21,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 119 transitions. [2023-11-24 21:44:21,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:44:21,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 119 transitions. [2023-11-24 21:44:21,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:21,629 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:21,630 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:21,630 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 94 flow. Second operand 3 states and 119 transitions. [2023-11-24 21:44:21,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 57 transitions, 206 flow [2023-11-24 21:44:21,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 57 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:44:21,635 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 90 flow [2023-11-24 21:44:21,635 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2023-11-24 21:44:21,638 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, -7 predicate places. [2023-11-24 21:44:21,638 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 90 flow [2023-11-24 21:44:21,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:21,639 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:44:21,639 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:44:21,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 21:44:21,639 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:44:21,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:44:21,643 INFO L85 PathProgramCache]: Analyzing trace with hash 22782836, now seen corresponding path program 1 times [2023-11-24 21:44:21,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:44:21,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732027443] [2023-11-24 21:44:21,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:44:21,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:44:21,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:44:21,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:44:21,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:44:21,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732027443] [2023-11-24 21:44:21,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732027443] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:44:21,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:44:21,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:44:21,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543952267] [2023-11-24 21:44:21,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:44:21,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:44:21,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:44:21,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:44:21,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:44:21,743 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 52 [2023-11-24 21:44:21,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:21,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:44:21,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 52 [2023-11-24 21:44:21,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:44:22,000 INFO L124 PetriNetUnfolderBase]: 622/1215 cut-off events. [2023-11-24 21:44:22,001 INFO L125 PetriNetUnfolderBase]: For 83/83 co-relation queries the response was YES. [2023-11-24 21:44:22,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2291 conditions, 1215 events. 622/1215 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7589 event pairs, 207 based on Foata normal form. 0/1176 useless extension candidates. Maximal degree in co-relation 2280. Up to 811 conditions per place. [2023-11-24 21:44:22,013 INFO L140 encePairwiseOnDemand]: 49/52 looper letters, 26 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2023-11-24 21:44:22,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 46 transitions, 160 flow [2023-11-24 21:44:22,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:44:22,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:44:22,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2023-11-24 21:44:22,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2023-11-24 21:44:22,015 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 104 transitions. [2023-11-24 21:44:22,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 104 transitions. [2023-11-24 21:44:22,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:44:22,016 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 104 transitions. [2023-11-24 21:44:22,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:22,018 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:22,019 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:22,019 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 90 flow. Second operand 3 states and 104 transitions. [2023-11-24 21:44:22,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 46 transitions, 160 flow [2023-11-24 21:44:22,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 46 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:44:22,021 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 88 flow [2023-11-24 21:44:22,021 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2023-11-24 21:44:22,024 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, -9 predicate places. [2023-11-24 21:44:22,025 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 88 flow [2023-11-24 21:44:22,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:22,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:44:22,026 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:44:22,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-24 21:44:22,027 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:44:22,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:44:22,027 INFO L85 PathProgramCache]: Analyzing trace with hash 22782837, now seen corresponding path program 1 times [2023-11-24 21:44:22,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:44:22,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606838424] [2023-11-24 21:44:22,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:44:22,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:44:22,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:44:22,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:44:22,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:44:22,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606838424] [2023-11-24 21:44:22,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606838424] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:44:22,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:44:22,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:44:22,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650677098] [2023-11-24 21:44:22,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:44:22,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:44:22,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:44:22,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:44:22,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:44:22,162 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 52 [2023-11-24 21:44:22,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:22,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:44:22,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 52 [2023-11-24 21:44:22,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:44:22,412 INFO L124 PetriNetUnfolderBase]: 605/1186 cut-off events. [2023-11-24 21:44:22,413 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2023-11-24 21:44:22,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2197 conditions, 1186 events. 605/1186 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7399 event pairs, 207 based on Foata normal form. 12/1159 useless extension candidates. Maximal degree in co-relation 2187. Up to 782 conditions per place. [2023-11-24 21:44:22,424 INFO L140 encePairwiseOnDemand]: 49/52 looper letters, 25 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2023-11-24 21:44:22,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 45 transitions, 154 flow [2023-11-24 21:44:22,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:44:22,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:44:22,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2023-11-24 21:44:22,426 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6794871794871795 [2023-11-24 21:44:22,426 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 106 transitions. [2023-11-24 21:44:22,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 106 transitions. [2023-11-24 21:44:22,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:44:22,426 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 106 transitions. [2023-11-24 21:44:22,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:22,428 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:22,428 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:22,428 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 88 flow. Second operand 3 states and 106 transitions. [2023-11-24 21:44:22,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 45 transitions, 154 flow [2023-11-24 21:44:22,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 45 transitions, 150 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:44:22,431 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 86 flow [2023-11-24 21:44:22,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2023-11-24 21:44:22,432 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, -10 predicate places. [2023-11-24 21:44:22,432 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 86 flow [2023-11-24 21:44:22,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:22,432 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:44:22,432 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-24 21:44:22,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-24 21:44:22,433 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:44:22,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:44:22,433 INFO L85 PathProgramCache]: Analyzing trace with hash -2043650131, now seen corresponding path program 1 times [2023-11-24 21:44:22,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:44:22,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372194458] [2023-11-24 21:44:22,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:44:22,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:44:22,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:44:22,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:44:22,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:44:22,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372194458] [2023-11-24 21:44:22,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372194458] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:44:22,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:44:22,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:44:22,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590800069] [2023-11-24 21:44:22,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:44:22,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 21:44:22,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:44:22,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 21:44:22,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-24 21:44:23,069 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 52 [2023-11-24 21:44:23,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 86 flow. Second operand has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:23,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:44:23,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 52 [2023-11-24 21:44:23,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:44:23,443 INFO L124 PetriNetUnfolderBase]: 608/1149 cut-off events. [2023-11-24 21:44:23,443 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2023-11-24 21:44:23,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2167 conditions, 1149 events. 608/1149 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6860 event pairs, 312 based on Foata normal form. 36/1149 useless extension candidates. Maximal degree in co-relation 2157. Up to 782 conditions per place. [2023-11-24 21:44:23,453 INFO L140 encePairwiseOnDemand]: 47/52 looper letters, 25 selfloop transitions, 3 changer transitions 8/52 dead transitions. [2023-11-24 21:44:23,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 52 transitions, 186 flow [2023-11-24 21:44:23,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 21:44:23,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-24 21:44:23,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 175 transitions. [2023-11-24 21:44:23,455 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5608974358974359 [2023-11-24 21:44:23,456 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 175 transitions. [2023-11-24 21:44:23,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 175 transitions. [2023-11-24 21:44:23,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:44:23,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 175 transitions. [2023-11-24 21:44:23,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:23,458 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 52.0) internal successors, (364), 7 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:23,458 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 52.0) internal successors, (364), 7 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:23,458 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 86 flow. Second operand 6 states and 175 transitions. [2023-11-24 21:44:23,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 52 transitions, 186 flow [2023-11-24 21:44:23,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 52 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:44:23,463 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 84 flow [2023-11-24 21:44:23,463 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=84, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2023-11-24 21:44:23,466 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, -8 predicate places. [2023-11-24 21:44:23,466 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 84 flow [2023-11-24 21:44:23,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:23,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:44:23,467 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-24 21:44:23,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-24 21:44:23,467 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:44:23,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:44:23,468 INFO L85 PathProgramCache]: Analyzing trace with hash -2043648853, now seen corresponding path program 1 times [2023-11-24 21:44:23,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:44:23,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163648069] [2023-11-24 21:44:23,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:44:23,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:44:23,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:44:24,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:44:24,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:44:24,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163648069] [2023-11-24 21:44:24,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163648069] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:44:24,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:44:24,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:44:24,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637791881] [2023-11-24 21:44:24,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:44:24,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:44:24,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:44:24,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:44:24,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:44:24,933 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 52 [2023-11-24 21:44:24,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 84 flow. Second operand has 6 states, 6 states have (on average 25.0) internal successors, (150), 6 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:24,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:44:24,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 52 [2023-11-24 21:44:24,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:44:26,141 INFO L124 PetriNetUnfolderBase]: 2216/3588 cut-off events. [2023-11-24 21:44:26,141 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2023-11-24 21:44:26,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6953 conditions, 3588 events. 2216/3588 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 22519 event pairs, 302 based on Foata normal form. 0/3497 useless extension candidates. Maximal degree in co-relation 6942. Up to 1815 conditions per place. [2023-11-24 21:44:26,168 INFO L140 encePairwiseOnDemand]: 40/52 looper letters, 41 selfloop transitions, 10 changer transitions 72/136 dead transitions. [2023-11-24 21:44:26,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 136 transitions, 546 flow [2023-11-24 21:44:26,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 21:44:26,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-24 21:44:26,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 402 transitions. [2023-11-24 21:44:26,172 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6442307692307693 [2023-11-24 21:44:26,172 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 402 transitions. [2023-11-24 21:44:26,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 402 transitions. [2023-11-24 21:44:26,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:44:26,172 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 402 transitions. [2023-11-24 21:44:26,174 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 33.5) internal successors, (402), 12 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:26,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 52.0) internal successors, (676), 13 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:26,176 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 52.0) internal successors, (676), 13 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:26,176 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 84 flow. Second operand 12 states and 402 transitions. [2023-11-24 21:44:26,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 136 transitions, 546 flow [2023-11-24 21:44:26,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 136 transitions, 535 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-24 21:44:26,181 INFO L231 Difference]: Finished difference. Result has 64 places, 43 transitions, 176 flow [2023-11-24 21:44:26,181 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=176, PETRI_PLACES=64, PETRI_TRANSITIONS=43} [2023-11-24 21:44:26,183 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 7 predicate places. [2023-11-24 21:44:26,183 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 43 transitions, 176 flow [2023-11-24 21:44:26,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.0) internal successors, (150), 6 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:26,183 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:44:26,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] [2023-11-24 21:44:26,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-24 21:44:26,184 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:44:26,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:44:26,184 INFO L85 PathProgramCache]: Analyzing trace with hash -924830114, now seen corresponding path program 1 times [2023-11-24 21:44:26,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:44:26,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863350429] [2023-11-24 21:44:26,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:44:26,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:44:26,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:44:26,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:44:26,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:44:26,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863350429] [2023-11-24 21:44:26,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863350429] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:44:26,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:44:26,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:44:26,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618948684] [2023-11-24 21:44:26,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:44:26,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:44:26,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:44:26,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:44:26,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:44:26,456 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 52 [2023-11-24 21:44:26,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 43 transitions, 176 flow. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:26,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:44:26,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 52 [2023-11-24 21:44:26,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:44:27,049 INFO L124 PetriNetUnfolderBase]: 1343/2375 cut-off events. [2023-11-24 21:44:27,050 INFO L125 PetriNetUnfolderBase]: For 5385/5477 co-relation queries the response was YES. [2023-11-24 21:44:27,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8278 conditions, 2375 events. 1343/2375 cut-off events. For 5385/5477 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 14883 event pairs, 217 based on Foata normal form. 131/2442 useless extension candidates. Maximal degree in co-relation 8258. Up to 1268 conditions per place. [2023-11-24 21:44:27,077 INFO L140 encePairwiseOnDemand]: 47/52 looper letters, 41 selfloop transitions, 8 changer transitions 28/95 dead transitions. [2023-11-24 21:44:27,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 95 transitions, 609 flow [2023-11-24 21:44:27,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 21:44:27,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-24 21:44:27,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 234 transitions. [2023-11-24 21:44:27,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2023-11-24 21:44:27,080 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 234 transitions. [2023-11-24 21:44:27,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 234 transitions. [2023-11-24 21:44:27,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:44:27,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 234 transitions. [2023-11-24 21:44:27,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 33.42857142857143) internal successors, (234), 7 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:27,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 52.0) internal successors, (416), 8 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:27,083 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 52.0) internal successors, (416), 8 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:27,083 INFO L175 Difference]: Start difference. First operand has 64 places, 43 transitions, 176 flow. Second operand 7 states and 234 transitions. [2023-11-24 21:44:27,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 95 transitions, 609 flow [2023-11-24 21:44:27,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 95 transitions, 557 flow, removed 26 selfloop flow, removed 5 redundant places. [2023-11-24 21:44:27,131 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 222 flow [2023-11-24 21:44:27,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=222, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2023-11-24 21:44:27,132 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 2 predicate places. [2023-11-24 21:44:27,132 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 222 flow [2023-11-24 21:44:27,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:27,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:44:27,133 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] [2023-11-24 21:44:27,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-24 21:44:27,133 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:44:27,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:44:27,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1955610615, now seen corresponding path program 1 times [2023-11-24 21:44:27,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:44:27,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667651907] [2023-11-24 21:44:27,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:44:27,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:44:27,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:44:27,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:44:27,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:44:27,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667651907] [2023-11-24 21:44:27,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667651907] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:44:27,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:44:27,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:44:27,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714413882] [2023-11-24 21:44:27,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:44:27,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:44:27,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:44:27,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:44:27,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:44:27,453 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 52 [2023-11-24 21:44:27,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 222 flow. Second operand has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:27,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:44:27,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 52 [2023-11-24 21:44:27,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:44:28,356 INFO L124 PetriNetUnfolderBase]: 2334/3982 cut-off events. [2023-11-24 21:44:28,356 INFO L125 PetriNetUnfolderBase]: For 5093/5101 co-relation queries the response was YES. [2023-11-24 21:44:28,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12630 conditions, 3982 events. 2334/3982 cut-off events. For 5093/5101 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 26194 event pairs, 262 based on Foata normal form. 69/4044 useless extension candidates. Maximal degree in co-relation 12610. Up to 1456 conditions per place. [2023-11-24 21:44:28,388 INFO L140 encePairwiseOnDemand]: 45/52 looper letters, 46 selfloop transitions, 5 changer transitions 61/125 dead transitions. [2023-11-24 21:44:28,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 125 transitions, 797 flow [2023-11-24 21:44:28,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 21:44:28,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-24 21:44:28,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 273 transitions. [2023-11-24 21:44:28,391 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.65625 [2023-11-24 21:44:28,391 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 273 transitions. [2023-11-24 21:44:28,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 273 transitions. [2023-11-24 21:44:28,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:44:28,392 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 273 transitions. [2023-11-24 21:44:28,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 34.125) internal successors, (273), 8 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:28,394 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 52.0) internal successors, (468), 9 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:28,394 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 52.0) internal successors, (468), 9 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:28,395 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 222 flow. Second operand 8 states and 273 transitions. [2023-11-24 21:44:28,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 125 transitions, 797 flow [2023-11-24 21:44:28,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 125 transitions, 797 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-24 21:44:28,405 INFO L231 Difference]: Finished difference. Result has 69 places, 43 transitions, 197 flow [2023-11-24 21:44:28,405 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=197, PETRI_PLACES=69, PETRI_TRANSITIONS=43} [2023-11-24 21:44:28,406 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 12 predicate places. [2023-11-24 21:44:28,406 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 43 transitions, 197 flow [2023-11-24 21:44:28,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:28,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:44:28,407 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] [2023-11-24 21:44:28,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-24 21:44:28,407 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:44:28,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:44:28,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1346693111, now seen corresponding path program 2 times [2023-11-24 21:44:28,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:44:28,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965528021] [2023-11-24 21:44:28,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:44:28,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:44:28,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:44:28,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:44:28,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:44:28,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965528021] [2023-11-24 21:44:28,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965528021] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:44:28,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:44:28,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:44:28,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506940535] [2023-11-24 21:44:28,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:44:28,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:44:28,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:44:28,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:44:28,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:44:28,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 52 [2023-11-24 21:44:28,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 43 transitions, 197 flow. Second operand has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:28,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:44:28,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 52 [2023-11-24 21:44:28,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:44:29,514 INFO L124 PetriNetUnfolderBase]: 1491/2545 cut-off events. [2023-11-24 21:44:29,514 INFO L125 PetriNetUnfolderBase]: For 4319/4397 co-relation queries the response was YES. [2023-11-24 21:44:29,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8346 conditions, 2545 events. 1491/2545 cut-off events. For 4319/4397 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 15384 event pairs, 502 based on Foata normal form. 125/2614 useless extension candidates. Maximal degree in co-relation 8321. Up to 1765 conditions per place. [2023-11-24 21:44:29,539 INFO L140 encePairwiseOnDemand]: 46/52 looper letters, 32 selfloop transitions, 3 changer transitions 33/87 dead transitions. [2023-11-24 21:44:29,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 87 transitions, 520 flow [2023-11-24 21:44:29,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 21:44:29,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-24 21:44:29,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 235 transitions. [2023-11-24 21:44:29,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6456043956043956 [2023-11-24 21:44:29,541 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 235 transitions. [2023-11-24 21:44:29,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 235 transitions. [2023-11-24 21:44:29,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:44:29,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 235 transitions. [2023-11-24 21:44:29,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 33.57142857142857) internal successors, (235), 7 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:29,544 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 52.0) internal successors, (416), 8 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:29,544 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 52.0) internal successors, (416), 8 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:29,544 INFO L175 Difference]: Start difference. First operand has 69 places, 43 transitions, 197 flow. Second operand 7 states and 235 transitions. [2023-11-24 21:44:29,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 87 transitions, 520 flow [2023-11-24 21:44:29,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 87 transitions, 475 flow, removed 13 selfloop flow, removed 10 redundant places. [2023-11-24 21:44:29,571 INFO L231 Difference]: Finished difference. Result has 62 places, 45 transitions, 199 flow [2023-11-24 21:44:29,572 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=199, PETRI_PLACES=62, PETRI_TRANSITIONS=45} [2023-11-24 21:44:29,572 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 5 predicate places. [2023-11-24 21:44:29,573 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 45 transitions, 199 flow [2023-11-24 21:44:29,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:29,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:44:29,573 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:44:29,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-24 21:44:29,574 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:44:29,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:44:29,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1787894132, now seen corresponding path program 1 times [2023-11-24 21:44:29,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:44:29,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350734418] [2023-11-24 21:44:29,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:44:29,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:44:29,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:44:30,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:44:30,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:44:30,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350734418] [2023-11-24 21:44:30,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350734418] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:44:30,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:44:30,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 21:44:30,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233752261] [2023-11-24 21:44:30,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:44:30,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:44:30,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:44:30,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:44:30,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:44:30,710 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 52 [2023-11-24 21:44:30,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 45 transitions, 199 flow. Second operand has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:30,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:44:30,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 52 [2023-11-24 21:44:30,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:44:31,626 INFO L124 PetriNetUnfolderBase]: 1956/3418 cut-off events. [2023-11-24 21:44:31,626 INFO L125 PetriNetUnfolderBase]: For 6286/6310 co-relation queries the response was YES. [2023-11-24 21:44:31,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11624 conditions, 3418 events. 1956/3418 cut-off events. For 6286/6310 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 22405 event pairs, 449 based on Foata normal form. 108/3481 useless extension candidates. Maximal degree in co-relation 11602. Up to 1296 conditions per place. [2023-11-24 21:44:31,660 INFO L140 encePairwiseOnDemand]: 44/52 looper letters, 48 selfloop transitions, 8 changer transitions 29/99 dead transitions. [2023-11-24 21:44:31,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 99 transitions, 629 flow [2023-11-24 21:44:31,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 21:44:31,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-24 21:44:31,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 263 transitions. [2023-11-24 21:44:31,663 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6322115384615384 [2023-11-24 21:44:31,663 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 263 transitions. [2023-11-24 21:44:31,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 263 transitions. [2023-11-24 21:44:31,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:44:31,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 263 transitions. [2023-11-24 21:44:31,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 32.875) internal successors, (263), 8 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-24 21:44:31,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 52.0) internal successors, (468), 9 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:31,666 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 52.0) internal successors, (468), 9 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:31,666 INFO L175 Difference]: Start difference. First operand has 62 places, 45 transitions, 199 flow. Second operand 8 states and 263 transitions. [2023-11-24 21:44:31,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 99 transitions, 629 flow [2023-11-24 21:44:31,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 99 transitions, 613 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-11-24 21:44:31,684 INFO L231 Difference]: Finished difference. Result has 68 places, 48 transitions, 245 flow [2023-11-24 21:44:31,684 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=245, PETRI_PLACES=68, PETRI_TRANSITIONS=48} [2023-11-24 21:44:31,685 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 11 predicate places. [2023-11-24 21:44:31,685 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 48 transitions, 245 flow [2023-11-24 21:44:31,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:31,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:44:31,685 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:44:31,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-24 21:44:31,686 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:44:31,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:44:31,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1484893038, now seen corresponding path program 1 times [2023-11-24 21:44:31,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:44:31,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324112805] [2023-11-24 21:44:31,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:44:31,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:44:31,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:44:32,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:44:32,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:44:32,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324112805] [2023-11-24 21:44:32,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324112805] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:44:32,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:44:32,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:44:32,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972641374] [2023-11-24 21:44:32,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:44:32,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:44:32,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:44:32,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:44:32,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:44:32,045 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 52 [2023-11-24 21:44:32,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 48 transitions, 245 flow. Second operand has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:32,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:44:32,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 52 [2023-11-24 21:44:32,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:44:32,884 INFO L124 PetriNetUnfolderBase]: 1864/3284 cut-off events. [2023-11-24 21:44:32,884 INFO L125 PetriNetUnfolderBase]: For 7382/7446 co-relation queries the response was YES. [2023-11-24 21:44:32,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11643 conditions, 3284 events. 1864/3284 cut-off events. For 7382/7446 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 21480 event pairs, 1022 based on Foata normal form. 104/3325 useless extension candidates. Maximal degree in co-relation 11616. Up to 2258 conditions per place. [2023-11-24 21:44:32,919 INFO L140 encePairwiseOnDemand]: 43/52 looper letters, 40 selfloop transitions, 9 changer transitions 31/100 dead transitions. [2023-11-24 21:44:32,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 100 transitions, 690 flow [2023-11-24 21:44:32,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 21:44:32,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-24 21:44:32,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 269 transitions. [2023-11-24 21:44:32,921 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6466346153846154 [2023-11-24 21:44:32,921 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 269 transitions. [2023-11-24 21:44:32,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 269 transitions. [2023-11-24 21:44:32,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:44:32,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 269 transitions. [2023-11-24 21:44:32,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 33.625) internal successors, (269), 8 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-24 21:44:32,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 52.0) internal successors, (468), 9 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:32,925 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 52.0) internal successors, (468), 9 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:32,925 INFO L175 Difference]: Start difference. First operand has 68 places, 48 transitions, 245 flow. Second operand 8 states and 269 transitions. [2023-11-24 21:44:32,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 100 transitions, 690 flow [2023-11-24 21:44:32,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 100 transitions, 656 flow, removed 13 selfloop flow, removed 5 redundant places. [2023-11-24 21:44:32,958 INFO L231 Difference]: Finished difference. Result has 71 places, 52 transitions, 296 flow [2023-11-24 21:44:32,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=296, PETRI_PLACES=71, PETRI_TRANSITIONS=52} [2023-11-24 21:44:32,959 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 14 predicate places. [2023-11-24 21:44:32,959 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 52 transitions, 296 flow [2023-11-24 21:44:32,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:32,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:44:32,960 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:44:32,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-24 21:44:32,960 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:44:32,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:44:32,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1011261014, now seen corresponding path program 2 times [2023-11-24 21:44:32,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:44:32,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213440340] [2023-11-24 21:44:32,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:44:32,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:44:32,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:44:33,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:44:33,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:44:33,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213440340] [2023-11-24 21:44:33,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213440340] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:44:33,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:44:33,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 21:44:33,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792528793] [2023-11-24 21:44:33,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:44:33,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 21:44:33,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:44:33,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 21:44:33,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-24 21:44:33,974 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 52 [2023-11-24 21:44:33,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 52 transitions, 296 flow. Second operand has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:33,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:44:33,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 52 [2023-11-24 21:44:33,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:44:35,126 INFO L124 PetriNetUnfolderBase]: 2594/4439 cut-off events. [2023-11-24 21:44:35,126 INFO L125 PetriNetUnfolderBase]: For 13015/13029 co-relation queries the response was YES. [2023-11-24 21:44:35,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16985 conditions, 4439 events. 2594/4439 cut-off events. For 13015/13029 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 29410 event pairs, 868 based on Foata normal form. 102/4533 useless extension candidates. Maximal degree in co-relation 16956. Up to 2678 conditions per place. [2023-11-24 21:44:35,177 INFO L140 encePairwiseOnDemand]: 41/52 looper letters, 49 selfloop transitions, 23 changer transitions 53/137 dead transitions. [2023-11-24 21:44:35,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 137 transitions, 1072 flow [2023-11-24 21:44:35,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-24 21:44:35,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-24 21:44:35,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 344 transitions. [2023-11-24 21:44:35,180 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6013986013986014 [2023-11-24 21:44:35,180 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 344 transitions. [2023-11-24 21:44:35,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 344 transitions. [2023-11-24 21:44:35,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:44:35,181 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 344 transitions. [2023-11-24 21:44:35,182 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 31.272727272727273) internal successors, (344), 11 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:35,184 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 52.0) internal successors, (624), 12 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:35,185 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 52.0) internal successors, (624), 12 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:35,185 INFO L175 Difference]: Start difference. First operand has 71 places, 52 transitions, 296 flow. Second operand 11 states and 344 transitions. [2023-11-24 21:44:35,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 137 transitions, 1072 flow [2023-11-24 21:44:35,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 137 transitions, 1003 flow, removed 29 selfloop flow, removed 5 redundant places. [2023-11-24 21:44:35,245 INFO L231 Difference]: Finished difference. Result has 81 places, 63 transitions, 476 flow [2023-11-24 21:44:35,245 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=476, PETRI_PLACES=81, PETRI_TRANSITIONS=63} [2023-11-24 21:44:35,246 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 24 predicate places. [2023-11-24 21:44:35,246 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 63 transitions, 476 flow [2023-11-24 21:44:35,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:35,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:44:35,247 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:44:35,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-24 21:44:35,247 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:44:35,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:44:35,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1844051111, now seen corresponding path program 1 times [2023-11-24 21:44:35,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:44:35,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638480787] [2023-11-24 21:44:35,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:44:35,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:44:35,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:44:35,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:44:35,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:44:35,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638480787] [2023-11-24 21:44:35,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638480787] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:44:35,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:44:35,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:44:35,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637489343] [2023-11-24 21:44:35,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:44:35,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:44:35,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:44:35,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:44:35,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:44:35,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 52 [2023-11-24 21:44:35,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 63 transitions, 476 flow. Second operand has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:35,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:44:35,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 52 [2023-11-24 21:44:35,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:44:36,918 INFO L124 PetriNetUnfolderBase]: 2303/4067 cut-off events. [2023-11-24 21:44:36,918 INFO L125 PetriNetUnfolderBase]: For 26120/26304 co-relation queries the response was YES. [2023-11-24 21:44:36,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19519 conditions, 4067 events. 2303/4067 cut-off events. For 26120/26304 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 27656 event pairs, 752 based on Foata normal form. 271/4261 useless extension candidates. Maximal degree in co-relation 19484. Up to 2670 conditions per place. [2023-11-24 21:44:36,971 INFO L140 encePairwiseOnDemand]: 44/52 looper letters, 51 selfloop transitions, 10 changer transitions 55/139 dead transitions. [2023-11-24 21:44:36,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 139 transitions, 1389 flow [2023-11-24 21:44:36,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 21:44:36,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-24 21:44:36,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 269 transitions. [2023-11-24 21:44:36,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6466346153846154 [2023-11-24 21:44:36,974 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 269 transitions. [2023-11-24 21:44:36,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 269 transitions. [2023-11-24 21:44:36,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:44:36,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 269 transitions. [2023-11-24 21:44:36,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 33.625) internal successors, (269), 8 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-24 21:44:36,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 52.0) internal successors, (468), 9 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:36,978 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 52.0) internal successors, (468), 9 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:36,978 INFO L175 Difference]: Start difference. First operand has 81 places, 63 transitions, 476 flow. Second operand 8 states and 269 transitions. [2023-11-24 21:44:36,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 139 transitions, 1389 flow [2023-11-24 21:44:37,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 139 transitions, 1332 flow, removed 28 selfloop flow, removed 5 redundant places. [2023-11-24 21:44:37,051 INFO L231 Difference]: Finished difference. Result has 82 places, 67 transitions, 578 flow [2023-11-24 21:44:37,051 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=578, PETRI_PLACES=82, PETRI_TRANSITIONS=67} [2023-11-24 21:44:37,052 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 25 predicate places. [2023-11-24 21:44:37,052 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 67 transitions, 578 flow [2023-11-24 21:44:37,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:37,053 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:44:37,053 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:44:37,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-24 21:44:37,053 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:44:37,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:44:37,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1068420074, now seen corresponding path program 1 times [2023-11-24 21:44:37,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:44:37,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767396725] [2023-11-24 21:44:37,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:44:37,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:44:37,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:44:37,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:44:37,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:44:37,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767396725] [2023-11-24 21:44:37,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767396725] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:44:37,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:44:37,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 21:44:37,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495558378] [2023-11-24 21:44:37,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:44:37,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 21:44:37,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:44:37,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 21:44:37,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-24 21:44:37,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 52 [2023-11-24 21:44:37,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 67 transitions, 578 flow. Second operand has 7 states, 7 states have (on average 27.0) internal successors, (189), 7 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:37,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:44:37,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 52 [2023-11-24 21:44:37,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:44:38,480 INFO L124 PetriNetUnfolderBase]: 2030/3616 cut-off events. [2023-11-24 21:44:38,480 INFO L125 PetriNetUnfolderBase]: For 26975/27110 co-relation queries the response was YES. [2023-11-24 21:44:38,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18357 conditions, 3616 events. 2030/3616 cut-off events. For 26975/27110 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 24285 event pairs, 858 based on Foata normal form. 123/3664 useless extension candidates. Maximal degree in co-relation 18320. Up to 2570 conditions per place. [2023-11-24 21:44:38,522 INFO L140 encePairwiseOnDemand]: 44/52 looper letters, 56 selfloop transitions, 11 changer transitions 25/115 dead transitions. [2023-11-24 21:44:38,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 115 transitions, 1188 flow [2023-11-24 21:44:38,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 21:44:38,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-24 21:44:38,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 266 transitions. [2023-11-24 21:44:38,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6394230769230769 [2023-11-24 21:44:38,525 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 266 transitions. [2023-11-24 21:44:38,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 266 transitions. [2023-11-24 21:44:38,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:44:38,526 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 266 transitions. [2023-11-24 21:44:38,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 33.25) internal successors, (266), 8 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:38,528 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 52.0) internal successors, (468), 9 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:38,528 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 52.0) internal successors, (468), 9 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:38,528 INFO L175 Difference]: Start difference. First operand has 82 places, 67 transitions, 578 flow. Second operand 8 states and 266 transitions. [2023-11-24 21:44:38,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 115 transitions, 1188 flow [2023-11-24 21:44:38,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 115 transitions, 1156 flow, removed 10 selfloop flow, removed 4 redundant places. [2023-11-24 21:44:38,573 INFO L231 Difference]: Finished difference. Result has 86 places, 70 transitions, 634 flow [2023-11-24 21:44:38,573 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=634, PETRI_PLACES=86, PETRI_TRANSITIONS=70} [2023-11-24 21:44:38,573 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 29 predicate places. [2023-11-24 21:44:38,574 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 70 transitions, 634 flow [2023-11-24 21:44:38,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.0) internal successors, (189), 7 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:38,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:44:38,574 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:44:38,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-24 21:44:38,575 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:44:38,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:44:38,575 INFO L85 PathProgramCache]: Analyzing trace with hash -2501968, now seen corresponding path program 1 times [2023-11-24 21:44:38,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:44:38,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614365817] [2023-11-24 21:44:38,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:44:38,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:44:38,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:44:39,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:44:39,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:44:39,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614365817] [2023-11-24 21:44:39,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614365817] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:44:39,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:44:39,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 21:44:39,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136726092] [2023-11-24 21:44:39,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:44:39,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 21:44:39,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:44:39,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 21:44:39,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-24 21:44:39,235 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 52 [2023-11-24 21:44:39,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 70 transitions, 634 flow. Second operand has 7 states, 7 states have (on average 27.0) internal successors, (189), 7 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:39,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:44:39,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 52 [2023-11-24 21:44:39,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:44:40,226 INFO L124 PetriNetUnfolderBase]: 2011/3606 cut-off events. [2023-11-24 21:44:40,226 INFO L125 PetriNetUnfolderBase]: For 29817/29942 co-relation queries the response was YES. [2023-11-24 21:44:40,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18700 conditions, 3606 events. 2011/3606 cut-off events. For 29817/29942 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 24293 event pairs, 846 based on Foata normal form. 111/3642 useless extension candidates. Maximal degree in co-relation 18660. Up to 2564 conditions per place. [2023-11-24 21:44:40,267 INFO L140 encePairwiseOnDemand]: 43/52 looper letters, 59 selfloop transitions, 13 changer transitions 30/125 dead transitions. [2023-11-24 21:44:40,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 125 transitions, 1298 flow [2023-11-24 21:44:40,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-24 21:44:40,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-24 21:44:40,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 352 transitions. [2023-11-24 21:44:40,270 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6153846153846154 [2023-11-24 21:44:40,270 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 352 transitions. [2023-11-24 21:44:40,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 352 transitions. [2023-11-24 21:44:40,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:44:40,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 352 transitions. [2023-11-24 21:44:40,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 32.0) internal successors, (352), 11 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:40,274 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 52.0) internal successors, (624), 12 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:40,274 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 52.0) internal successors, (624), 12 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:40,274 INFO L175 Difference]: Start difference. First operand has 86 places, 70 transitions, 634 flow. Second operand 11 states and 352 transitions. [2023-11-24 21:44:40,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 125 transitions, 1298 flow [2023-11-24 21:44:40,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 125 transitions, 1235 flow, removed 26 selfloop flow, removed 5 redundant places. [2023-11-24 21:44:40,338 INFO L231 Difference]: Finished difference. Result has 94 places, 73 transitions, 691 flow [2023-11-24 21:44:40,339 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=596, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=691, PETRI_PLACES=94, PETRI_TRANSITIONS=73} [2023-11-24 21:44:40,339 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 37 predicate places. [2023-11-24 21:44:40,339 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 73 transitions, 691 flow [2023-11-24 21:44:40,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.0) internal successors, (189), 7 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:40,340 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:44:40,340 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:44:40,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-24 21:44:40,340 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:44:40,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:44:40,341 INFO L85 PathProgramCache]: Analyzing trace with hash 227869900, now seen corresponding path program 2 times [2023-11-24 21:44:40,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:44:40,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438513769] [2023-11-24 21:44:40,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:44:40,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:44:40,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:44:40,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:44:40,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:44:40,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438513769] [2023-11-24 21:44:40,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438513769] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:44:40,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:44:40,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 21:44:40,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885455105] [2023-11-24 21:44:40,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:44:40,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 21:44:40,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:44:40,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 21:44:40,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-24 21:44:40,975 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 52 [2023-11-24 21:44:40,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 73 transitions, 691 flow. Second operand has 7 states, 7 states have (on average 27.0) internal successors, (189), 7 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:40,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:44:40,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 52 [2023-11-24 21:44:40,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:44:41,912 INFO L124 PetriNetUnfolderBase]: 1976/3536 cut-off events. [2023-11-24 21:44:41,912 INFO L125 PetriNetUnfolderBase]: For 33799/33924 co-relation queries the response was YES. [2023-11-24 21:44:41,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19163 conditions, 3536 events. 1976/3536 cut-off events. For 33799/33924 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 23658 event pairs, 872 based on Foata normal form. 111/3568 useless extension candidates. Maximal degree in co-relation 19119. Up to 2546 conditions per place. [2023-11-24 21:44:41,948 INFO L140 encePairwiseOnDemand]: 43/52 looper letters, 53 selfloop transitions, 11 changer transitions 25/112 dead transitions. [2023-11-24 21:44:41,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 112 transitions, 1218 flow [2023-11-24 21:44:41,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 21:44:41,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-24 21:44:41,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 262 transitions. [2023-11-24 21:44:41,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6298076923076923 [2023-11-24 21:44:41,950 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 262 transitions. [2023-11-24 21:44:41,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 262 transitions. [2023-11-24 21:44:41,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:44:41,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 262 transitions. [2023-11-24 21:44:41,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 32.75) internal successors, (262), 8 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:41,953 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 52.0) internal successors, (468), 9 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:41,954 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 52.0) internal successors, (468), 9 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:41,954 INFO L175 Difference]: Start difference. First operand has 94 places, 73 transitions, 691 flow. Second operand 8 states and 262 transitions. [2023-11-24 21:44:41,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 112 transitions, 1218 flow [2023-11-24 21:44:42,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 112 transitions, 1154 flow, removed 19 selfloop flow, removed 9 redundant places. [2023-11-24 21:44:42,057 INFO L231 Difference]: Finished difference. Result has 91 places, 73 transitions, 689 flow [2023-11-24 21:44:42,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=647, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=689, PETRI_PLACES=91, PETRI_TRANSITIONS=73} [2023-11-24 21:44:42,057 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 34 predicate places. [2023-11-24 21:44:42,058 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 73 transitions, 689 flow [2023-11-24 21:44:42,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.0) internal successors, (189), 7 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:42,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:44:42,058 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:44:42,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-24 21:44:42,059 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:44:42,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:44:42,059 INFO L85 PathProgramCache]: Analyzing trace with hash -336225917, now seen corresponding path program 1 times [2023-11-24 21:44:42,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:44:42,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856132432] [2023-11-24 21:44:42,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:44:42,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:44:42,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:44:42,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:44:42,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:44:42,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856132432] [2023-11-24 21:44:42,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856132432] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:44:42,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:44:42,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-24 21:44:42,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883444662] [2023-11-24 21:44:42,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:44:42,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-24 21:44:42,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:44:42,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-24 21:44:42,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-24 21:44:42,906 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 52 [2023-11-24 21:44:42,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 73 transitions, 689 flow. Second operand has 8 states, 8 states have (on average 26.75) internal successors, (214), 8 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:42,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:44:42,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 52 [2023-11-24 21:44:42,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:44:43,867 INFO L124 PetriNetUnfolderBase]: 2174/3901 cut-off events. [2023-11-24 21:44:43,867 INFO L125 PetriNetUnfolderBase]: For 34247/34363 co-relation queries the response was YES. [2023-11-24 21:44:43,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20842 conditions, 3901 events. 2174/3901 cut-off events. For 34247/34363 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 26618 event pairs, 638 based on Foata normal form. 159/3984 useless extension candidates. Maximal degree in co-relation 20799. Up to 2587 conditions per place. [2023-11-24 21:44:43,910 INFO L140 encePairwiseOnDemand]: 42/52 looper letters, 67 selfloop transitions, 23 changer transitions 47/160 dead transitions. [2023-11-24 21:44:43,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 160 transitions, 1859 flow [2023-11-24 21:44:43,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-24 21:44:43,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-24 21:44:43,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 358 transitions. [2023-11-24 21:44:43,913 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6258741258741258 [2023-11-24 21:44:43,913 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 358 transitions. [2023-11-24 21:44:43,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 358 transitions. [2023-11-24 21:44:43,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:44:43,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 358 transitions. [2023-11-24 21:44:43,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 32.54545454545455) internal successors, (358), 11 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:43,916 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 52.0) internal successors, (624), 12 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:43,917 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 52.0) internal successors, (624), 12 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:43,917 INFO L175 Difference]: Start difference. First operand has 91 places, 73 transitions, 689 flow. Second operand 11 states and 358 transitions. [2023-11-24 21:44:43,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 160 transitions, 1859 flow [2023-11-24 21:44:43,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 160 transitions, 1777 flow, removed 23 selfloop flow, removed 8 redundant places. [2023-11-24 21:44:43,992 INFO L231 Difference]: Finished difference. Result has 98 places, 90 transitions, 1033 flow [2023-11-24 21:44:43,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1033, PETRI_PLACES=98, PETRI_TRANSITIONS=90} [2023-11-24 21:44:43,993 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 41 predicate places. [2023-11-24 21:44:43,993 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 90 transitions, 1033 flow [2023-11-24 21:44:43,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.75) internal successors, (214), 8 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:43,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:44:43,994 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:44:43,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-24 21:44:43,994 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:44:43,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:44:43,995 INFO L85 PathProgramCache]: Analyzing trace with hash -302675501, now seen corresponding path program 2 times [2023-11-24 21:44:43,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:44:43,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928638285] [2023-11-24 21:44:43,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:44:43,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:44:44,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:44:44,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:44:44,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:44:44,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928638285] [2023-11-24 21:44:44,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928638285] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:44:44,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:44:44,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-24 21:44:44,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385967525] [2023-11-24 21:44:44,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:44:44,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-24 21:44:44,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:44:44,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-24 21:44:44,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-24 21:44:44,787 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 52 [2023-11-24 21:44:44,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 90 transitions, 1033 flow. Second operand has 8 states, 8 states have (on average 26.75) internal successors, (214), 8 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:44,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:44:44,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 52 [2023-11-24 21:44:44,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:44:45,818 INFO L124 PetriNetUnfolderBase]: 1995/3608 cut-off events. [2023-11-24 21:44:45,818 INFO L125 PetriNetUnfolderBase]: For 43581/43688 co-relation queries the response was YES. [2023-11-24 21:44:45,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21490 conditions, 3608 events. 1995/3608 cut-off events. For 43581/43688 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 24563 event pairs, 589 based on Foata normal form. 149/3676 useless extension candidates. Maximal degree in co-relation 21443. Up to 2413 conditions per place. [2023-11-24 21:44:45,859 INFO L140 encePairwiseOnDemand]: 45/52 looper letters, 64 selfloop transitions, 19 changer transitions 39/145 dead transitions. [2023-11-24 21:44:45,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 145 transitions, 1957 flow [2023-11-24 21:44:45,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 21:44:45,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-24 21:44:45,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 265 transitions. [2023-11-24 21:44:45,862 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6370192307692307 [2023-11-24 21:44:45,862 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 265 transitions. [2023-11-24 21:44:45,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 265 transitions. [2023-11-24 21:44:45,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:44:45,863 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 265 transitions. [2023-11-24 21:44:45,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 33.125) internal successors, (265), 8 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-24 21:44:45,867 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 52.0) internal successors, (468), 9 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:45,868 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 52.0) internal successors, (468), 9 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:45,868 INFO L175 Difference]: Start difference. First operand has 98 places, 90 transitions, 1033 flow. Second operand 8 states and 265 transitions. [2023-11-24 21:44:45,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 145 transitions, 1957 flow [2023-11-24 21:44:45,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 145 transitions, 1799 flow, removed 79 selfloop flow, removed 5 redundant places. [2023-11-24 21:44:46,085 INFO L231 Difference]: Finished difference. Result has 99 places, 90 transitions, 1055 flow [2023-11-24 21:44:46,085 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=969, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1055, PETRI_PLACES=99, PETRI_TRANSITIONS=90} [2023-11-24 21:44:46,086 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 42 predicate places. [2023-11-24 21:44:46,086 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 90 transitions, 1055 flow [2023-11-24 21:44:46,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.75) internal successors, (214), 8 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:46,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:44:46,087 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:44:46,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-24 21:44:46,087 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:44:46,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:44:46,087 INFO L85 PathProgramCache]: Analyzing trace with hash 145323388, now seen corresponding path program 1 times [2023-11-24 21:44:46,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:44:46,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704151631] [2023-11-24 21:44:46,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:44:46,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:44:46,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:44:46,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:44:46,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:44:46,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704151631] [2023-11-24 21:44:46,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704151631] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:44:46,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:44:46,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:44:46,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078371943] [2023-11-24 21:44:46,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:44:46,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:44:46,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:44:46,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:44:46,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:44:46,333 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 52 [2023-11-24 21:44:46,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 90 transitions, 1055 flow. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:46,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:44:46,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 52 [2023-11-24 21:44:46,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:44:47,578 INFO L124 PetriNetUnfolderBase]: 4078/6465 cut-off events. [2023-11-24 21:44:47,578 INFO L125 PetriNetUnfolderBase]: For 95223/97307 co-relation queries the response was YES. [2023-11-24 21:44:47,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35859 conditions, 6465 events. 4078/6465 cut-off events. For 95223/97307 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 39717 event pairs, 632 based on Foata normal form. 873/7044 useless extension candidates. Maximal degree in co-relation 35810. Up to 3402 conditions per place. [2023-11-24 21:44:47,629 INFO L140 encePairwiseOnDemand]: 46/52 looper letters, 94 selfloop transitions, 5 changer transitions 15/138 dead transitions. [2023-11-24 21:44:47,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 138 transitions, 1833 flow [2023-11-24 21:44:47,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:44:47,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 21:44:47,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 140 transitions. [2023-11-24 21:44:47,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6730769230769231 [2023-11-24 21:44:47,630 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 140 transitions. [2023-11-24 21:44:47,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 140 transitions. [2023-11-24 21:44:47,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:44:47,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 140 transitions. [2023-11-24 21:44:47,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:47,632 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 52.0) internal successors, (260), 5 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:47,632 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 52.0) internal successors, (260), 5 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:47,632 INFO L175 Difference]: Start difference. First operand has 99 places, 90 transitions, 1055 flow. Second operand 4 states and 140 transitions. [2023-11-24 21:44:47,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 138 transitions, 1833 flow [2023-11-24 21:44:47,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 138 transitions, 1705 flow, removed 42 selfloop flow, removed 9 redundant places. [2023-11-24 21:44:47,766 INFO L231 Difference]: Finished difference. Result has 91 places, 80 transitions, 815 flow [2023-11-24 21:44:47,766 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=820, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=815, PETRI_PLACES=91, PETRI_TRANSITIONS=80} [2023-11-24 21:44:47,767 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 34 predicate places. [2023-11-24 21:44:47,767 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 80 transitions, 815 flow [2023-11-24 21:44:47,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:47,768 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:44:47,768 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:44:47,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-24 21:44:47,768 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:44:47,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:44:47,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1427039418, now seen corresponding path program 1 times [2023-11-24 21:44:47,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:44:47,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918660846] [2023-11-24 21:44:47,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:44:47,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:44:47,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:44:48,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:44:48,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:44:48,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918660846] [2023-11-24 21:44:48,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918660846] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:44:48,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:44:48,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-24 21:44:48,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070096529] [2023-11-24 21:44:48,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:44:48,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 21:44:48,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:44:48,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 21:44:48,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-24 21:44:48,762 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 52 [2023-11-24 21:44:48,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 80 transitions, 815 flow. Second operand has 7 states, 7 states have (on average 25.428571428571427) internal successors, (178), 7 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:48,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:44:48,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 52 [2023-11-24 21:44:48,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:44:50,156 INFO L124 PetriNetUnfolderBase]: 3532/6312 cut-off events. [2023-11-24 21:44:50,157 INFO L125 PetriNetUnfolderBase]: For 54500/55138 co-relation queries the response was YES. [2023-11-24 21:44:50,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32109 conditions, 6312 events. 3532/6312 cut-off events. For 54500/55138 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 47209 event pairs, 935 based on Foata normal form. 225/6271 useless extension candidates. Maximal degree in co-relation 32064. Up to 2008 conditions per place. [2023-11-24 21:44:50,199 INFO L140 encePairwiseOnDemand]: 44/52 looper letters, 67 selfloop transitions, 7 changer transitions 63/159 dead transitions. [2023-11-24 21:44:50,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 159 transitions, 1973 flow [2023-11-24 21:44:50,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 21:44:50,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-24 21:44:50,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 264 transitions. [2023-11-24 21:44:50,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6346153846153846 [2023-11-24 21:44:50,204 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 264 transitions. [2023-11-24 21:44:50,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 264 transitions. [2023-11-24 21:44:50,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:44:50,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 264 transitions. [2023-11-24 21:44:50,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 33.0) internal successors, (264), 8 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:50,211 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 52.0) internal successors, (468), 9 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:50,211 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 52.0) internal successors, (468), 9 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:50,211 INFO L175 Difference]: Start difference. First operand has 91 places, 80 transitions, 815 flow. Second operand 8 states and 264 transitions. [2023-11-24 21:44:50,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 159 transitions, 1973 flow [2023-11-24 21:44:50,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 159 transitions, 1967 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-11-24 21:44:50,292 INFO L231 Difference]: Finished difference. Result has 99 places, 76 transitions, 790 flow [2023-11-24 21:44:50,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=809, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=790, PETRI_PLACES=99, PETRI_TRANSITIONS=76} [2023-11-24 21:44:50,293 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 42 predicate places. [2023-11-24 21:44:50,294 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 76 transitions, 790 flow [2023-11-24 21:44:50,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.428571428571427) internal successors, (178), 7 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:50,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:44:50,294 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:44:50,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-24 21:44:50,295 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:44:50,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:44:50,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1537759926, now seen corresponding path program 2 times [2023-11-24 21:44:50,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:44:50,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164345592] [2023-11-24 21:44:50,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:44:50,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:44:50,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:44:50,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:44:50,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:44:50,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164345592] [2023-11-24 21:44:50,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164345592] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:44:50,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:44:50,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:44:50,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972370871] [2023-11-24 21:44:50,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:44:50,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:44:50,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:44:50,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:44:50,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:44:50,482 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 52 [2023-11-24 21:44:50,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 76 transitions, 790 flow. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:50,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:44:50,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 52 [2023-11-24 21:44:50,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:44:51,360 INFO L124 PetriNetUnfolderBase]: 2534/4159 cut-off events. [2023-11-24 21:44:51,361 INFO L125 PetriNetUnfolderBase]: For 43592/44341 co-relation queries the response was YES. [2023-11-24 21:44:51,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20532 conditions, 4159 events. 2534/4159 cut-off events. For 43592/44341 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 24320 event pairs, 309 based on Foata normal form. 519/4515 useless extension candidates. Maximal degree in co-relation 20484. Up to 1237 conditions per place. [2023-11-24 21:44:51,395 INFO L140 encePairwiseOnDemand]: 46/52 looper letters, 90 selfloop transitions, 8 changer transitions 8/127 dead transitions. [2023-11-24 21:44:51,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 127 transitions, 1501 flow [2023-11-24 21:44:51,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:44:51,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 21:44:51,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 177 transitions. [2023-11-24 21:44:51,398 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6807692307692308 [2023-11-24 21:44:51,398 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 177 transitions. [2023-11-24 21:44:51,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 177 transitions. [2023-11-24 21:44:51,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:44:51,399 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 177 transitions. [2023-11-24 21:44:51,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:51,402 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:51,402 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:51,403 INFO L175 Difference]: Start difference. First operand has 99 places, 76 transitions, 790 flow. Second operand 5 states and 177 transitions. [2023-11-24 21:44:51,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 127 transitions, 1501 flow [2023-11-24 21:44:51,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 127 transitions, 1387 flow, removed 19 selfloop flow, removed 9 redundant places. [2023-11-24 21:44:51,455 INFO L231 Difference]: Finished difference. Result has 92 places, 74 transitions, 703 flow [2023-11-24 21:44:51,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=671, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=703, PETRI_PLACES=92, PETRI_TRANSITIONS=74} [2023-11-24 21:44:51,456 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 35 predicate places. [2023-11-24 21:44:51,456 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 74 transitions, 703 flow [2023-11-24 21:44:51,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:51,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:44:51,457 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:44:51,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-24 21:44:51,457 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:44:51,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:44:51,458 INFO L85 PathProgramCache]: Analyzing trace with hash 360415725, now seen corresponding path program 1 times [2023-11-24 21:44:51,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:44:51,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028353348] [2023-11-24 21:44:51,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:44:51,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:44:51,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:44:51,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:44:51,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:44:51,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028353348] [2023-11-24 21:44:51,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028353348] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:44:51,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:44:51,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:44:51,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610576066] [2023-11-24 21:44:51,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:44:51,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:44:51,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:44:51,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:44:51,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:44:51,765 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 52 [2023-11-24 21:44:51,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 74 transitions, 703 flow. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:51,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:44:51,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 52 [2023-11-24 21:44:51,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:44:52,423 INFO L124 PetriNetUnfolderBase]: 1888/3099 cut-off events. [2023-11-24 21:44:52,423 INFO L125 PetriNetUnfolderBase]: For 31915/32407 co-relation queries the response was YES. [2023-11-24 21:44:52,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16127 conditions, 3099 events. 1888/3099 cut-off events. For 31915/32407 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 17788 event pairs, 301 based on Foata normal form. 321/3264 useless extension candidates. Maximal degree in co-relation 16083. Up to 1140 conditions per place. [2023-11-24 21:44:52,443 INFO L140 encePairwiseOnDemand]: 46/52 looper letters, 59 selfloop transitions, 11 changer transitions 31/116 dead transitions. [2023-11-24 21:44:52,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 116 transitions, 1261 flow [2023-11-24 21:44:52,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 21:44:52,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-24 21:44:52,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 198 transitions. [2023-11-24 21:44:52,445 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6346153846153846 [2023-11-24 21:44:52,445 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 198 transitions. [2023-11-24 21:44:52,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 198 transitions. [2023-11-24 21:44:52,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:44:52,446 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 198 transitions. [2023-11-24 21:44:52,447 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 33.0) internal successors, (198), 6 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:52,448 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 52.0) internal successors, (364), 7 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:52,448 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 52.0) internal successors, (364), 7 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:52,448 INFO L175 Difference]: Start difference. First operand has 92 places, 74 transitions, 703 flow. Second operand 6 states and 198 transitions. [2023-11-24 21:44:52,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 116 transitions, 1261 flow [2023-11-24 21:44:52,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 116 transitions, 1122 flow, removed 56 selfloop flow, removed 4 redundant places. [2023-11-24 21:44:52,484 INFO L231 Difference]: Finished difference. Result has 95 places, 55 transitions, 442 flow [2023-11-24 21:44:52,484 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=442, PETRI_PLACES=95, PETRI_TRANSITIONS=55} [2023-11-24 21:44:52,485 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 38 predicate places. [2023-11-24 21:44:52,485 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 55 transitions, 442 flow [2023-11-24 21:44:52,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:52,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:44:52,485 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:44:52,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-24 21:44:52,486 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:44:52,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:44:52,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1677292463, now seen corresponding path program 1 times [2023-11-24 21:44:52,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:44:52,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208166501] [2023-11-24 21:44:52,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:44:52,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:44:52,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:44:54,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:44:54,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:44:54,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208166501] [2023-11-24 21:44:54,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208166501] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:44:54,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:44:54,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-24 21:44:54,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586945931] [2023-11-24 21:44:54,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:44:54,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-24 21:44:54,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:44:54,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-24 21:44:54,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-11-24 21:44:54,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 52 [2023-11-24 21:44:54,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 55 transitions, 442 flow. Second operand has 11 states, 11 states have (on average 26.545454545454547) internal successors, (292), 11 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:54,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:44:54,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 52 [2023-11-24 21:44:54,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:44:54,568 INFO L124 PetriNetUnfolderBase]: 586/1165 cut-off events. [2023-11-24 21:44:54,568 INFO L125 PetriNetUnfolderBase]: For 8098/8331 co-relation queries the response was YES. [2023-11-24 21:44:54,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4958 conditions, 1165 events. 586/1165 cut-off events. For 8098/8331 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 6596 event pairs, 128 based on Foata normal form. 21/1074 useless extension candidates. Maximal degree in co-relation 4914. Up to 434 conditions per place. [2023-11-24 21:44:54,578 INFO L140 encePairwiseOnDemand]: 45/52 looper letters, 31 selfloop transitions, 4 changer transitions 27/85 dead transitions. [2023-11-24 21:44:54,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 85 transitions, 720 flow [2023-11-24 21:44:54,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 21:44:54,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-24 21:44:54,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 252 transitions. [2023-11-24 21:44:54,580 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6057692307692307 [2023-11-24 21:44:54,580 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 252 transitions. [2023-11-24 21:44:54,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 252 transitions. [2023-11-24 21:44:54,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:44:54,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 252 transitions. [2023-11-24 21:44:54,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 31.5) internal successors, (252), 8 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:54,583 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 52.0) internal successors, (468), 9 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:54,583 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 52.0) internal successors, (468), 9 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:54,583 INFO L175 Difference]: Start difference. First operand has 95 places, 55 transitions, 442 flow. Second operand 8 states and 252 transitions. [2023-11-24 21:44:54,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 85 transitions, 720 flow [2023-11-24 21:44:54,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 85 transitions, 543 flow, removed 61 selfloop flow, removed 24 redundant places. [2023-11-24 21:44:54,602 INFO L231 Difference]: Finished difference. Result has 78 places, 48 transitions, 263 flow [2023-11-24 21:44:54,602 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=263, PETRI_PLACES=78, PETRI_TRANSITIONS=48} [2023-11-24 21:44:54,603 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 21 predicate places. [2023-11-24 21:44:54,603 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 48 transitions, 263 flow [2023-11-24 21:44:54,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 26.545454545454547) internal successors, (292), 11 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:44:54,603 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:44:54,603 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:44:54,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-24 21:44:54,604 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:44:54,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:44:54,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1162357463, now seen corresponding path program 2 times [2023-11-24 21:44:54,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:44:54,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581404527] [2023-11-24 21:44:54,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:44:54,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:44:54,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 21:44:54,650 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 21:44:54,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 21:44:54,724 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-24 21:44:54,724 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-24 21:44:54,725 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-24 21:44:54,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-24 21:44:54,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-24 21:44:54,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-24 21:44:54,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-24 21:44:54,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-24 21:44:54,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-24 21:44:54,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-24 21:44:54,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-24 21:44:54,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-24 21:44:54,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-24 21:44:54,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-24 21:44:54,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-24 21:44:54,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-24 21:44:54,730 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:44:54,736 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-24 21:44:54,736 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-24 21:44:54,810 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-24 21:44:54,812 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-24 21:44:54,814 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-24 21:44:54,834 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-24 21:44:54,837 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-24 21:44:54,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 09:44:54 BasicIcfg [2023-11-24 21:44:54,855 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-24 21:44:54,856 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-24 21:44:54,856 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-24 21:44:54,856 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-24 21:44:54,856 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:44:18" (3/4) ... [2023-11-24 21:44:54,858 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-24 21:44:54,859 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-24 21:44:54,859 INFO L158 Benchmark]: Toolchain (without parser) took 39057.67ms. Allocated memory was 151.0MB in the beginning and 1.1GB in the end (delta: 968.9MB). Free memory was 101.8MB in the beginning and 776.0MB in the end (delta: -674.2MB). Peak memory consumption was 296.3MB. Max. memory is 16.1GB. [2023-11-24 21:44:54,860 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 117.4MB. Free memory is still 68.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 21:44:54,860 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1027.23ms. Allocated memory is still 151.0MB. Free memory was 101.8MB in the beginning and 78.2MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-24 21:44:54,861 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.54ms. Allocated memory is still 151.0MB. Free memory was 78.2MB in the beginning and 75.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 21:44:54,861 INFO L158 Benchmark]: Boogie Preprocessor took 79.84ms. Allocated memory is still 151.0MB. Free memory was 75.6MB in the beginning and 71.9MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-24 21:44:54,861 INFO L158 Benchmark]: RCFGBuilder took 1182.69ms. Allocated memory was 151.0MB in the beginning and 188.7MB in the end (delta: 37.7MB). Free memory was 71.9MB in the beginning and 122.2MB in the end (delta: -50.3MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. [2023-11-24 21:44:54,862 INFO L158 Benchmark]: TraceAbstraction took 36672.26ms. Allocated memory was 188.7MB in the beginning and 1.1GB in the end (delta: 931.1MB). Free memory was 121.1MB in the beginning and 776.0MB in the end (delta: -654.9MB). Peak memory consumption was 276.3MB. Max. memory is 16.1GB. [2023-11-24 21:44:54,862 INFO L158 Benchmark]: Witness Printer took 3.35ms. Allocated memory is still 1.1GB. Free memory is still 776.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 21:44:54,864 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.31ms. Allocated memory is still 117.4MB. Free memory is still 68.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1027.23ms. Allocated memory is still 151.0MB. Free memory was 101.8MB in the beginning and 78.2MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.54ms. Allocated memory is still 151.0MB. Free memory was 78.2MB in the beginning and 75.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.84ms. Allocated memory is still 151.0MB. Free memory was 75.6MB in the beginning and 71.9MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1182.69ms. Allocated memory was 151.0MB in the beginning and 188.7MB in the end (delta: 37.7MB). Free memory was 71.9MB in the beginning and 122.2MB in the end (delta: -50.3MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. * TraceAbstraction took 36672.26ms. Allocated memory was 188.7MB in the beginning and 1.1GB in the end (delta: 931.1MB). Free memory was 121.1MB in the beginning and 776.0MB in the end (delta: -654.9MB). Peak memory consumption was 276.3MB. Max. memory is 16.1GB. * Witness Printer took 3.35ms. Allocated memory is still 1.1GB. Free memory is still 776.0MB. 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~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L813] 0 pthread_t t2177; [L814] FCALL, FORK 0 pthread_create(&t2177, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2177={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L815] 0 pthread_t t2178; [L816] FCALL, FORK 0 pthread_create(&t2178, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2177={5:0}, t2178={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L817] 0 pthread_t t2179; [L818] FCALL, FORK 0 pthread_create(&t2179, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2177={5:0}, t2178={6:0}, t2179={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L739] 1 y$w_buff1 = y$w_buff0 [L740] 1 y$w_buff0 = 2 [L741] 1 y$w_buff1_used = y$w_buff0_used [L742] 1 y$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L744] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L785] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L788] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177={5:0}, t2178={6:0}, t2179={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177={5:0}, t2178={6:0}, t2179={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177={5:0}, t2178={6:0}, t2179={3:0}, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L846] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L17] 0 __assert_fail ("0", "safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 811]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 816]: 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: 818]: 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: 814]: 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 7 procedures, 75 locations, 13 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: 36.4s, OverallIterations: 27, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 22.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1241 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1114 mSDsluCounter, 268 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 215 mSDsCounter, 134 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3695 IncrementalHoareTripleChecker+Invalid, 3829 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 134 mSolverCounterUnsat, 53 mSDtfsCounter, 3695 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 190 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1055occurred in iteration=21, InterpolantAutomatonStates: 173, 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.6s SatisfiabilityAnalysisTime, 12.8s InterpolantComputationTime, 523 NumberOfCodeBlocks, 523 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 465 ConstructedInterpolants, 0 QuantifiedInterpolants, 4641 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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-24 21:44:54,887 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4297916e-1103-434e-ae55-2979fa86b6e8/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...