./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/circular_buffer_ok.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/circular_buffer_ok.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --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 8fcb457b1bed8494a9a3b58e82500f367f4337ac38b5a41a5dad0da896f97e40 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:04:13,464 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:04:13,547 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 20:04:13,552 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:04:13,554 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:04:13,584 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:04:13,585 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:04:13,586 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:04:13,586 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:04:13,587 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:04:13,588 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:04:13,588 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:04:13,589 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:04:13,589 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:04:13,590 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:04:13,590 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:04:13,590 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 20:04:13,591 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:04:13,591 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 20:04:13,591 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:04:13,594 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 20:04:13,595 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 20:04:13,595 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 20:04:13,595 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:04:13,595 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 20:04:13,596 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:04:13,596 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:04:13,596 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 20:04:13,596 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:04:13,597 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:04:13,597 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:04:13,597 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:04:13,597 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:04:13,597 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:04:13,598 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:04:13,598 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:04:13,598 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:04:13,599 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:04:13,599 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:04:13,599 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:04:13,599 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:04:13,600 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:04:13,600 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:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux 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 -> 8fcb457b1bed8494a9a3b58e82500f367f4337ac38b5a41a5dad0da896f97e40 [2024-10-11 20:04:13,858 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:04:13,878 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:04:13,882 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:04:13,884 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:04:13,884 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:04:13,885 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/circular_buffer_ok.i [2024-10-11 20:04:15,283 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:04:15,542 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:04:15,542 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/circular_buffer_ok.i [2024-10-11 20:04:15,556 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c2dfc61a8/81bdca6474854731aa0a2257bddc6cf0/FLAG1ee55d7b1 [2024-10-11 20:04:15,859 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c2dfc61a8/81bdca6474854731aa0a2257bddc6cf0 [2024-10-11 20:04:15,861 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:04:15,863 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:04:15,864 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:04:15,865 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:04:15,871 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:04:15,871 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:04:15" (1/1) ... [2024-10-11 20:04:15,872 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cd51d63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:04:15, skipping insertion in model container [2024-10-11 20:04:15,873 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:04:15" (1/1) ... [2024-10-11 20:04:15,920 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:04:16,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:04:16,340 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:04:16,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:04:16,431 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:04:16,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:04:16 WrapperNode [2024-10-11 20:04:16,432 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:04:16,433 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:04:16,433 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:04:16,434 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:04:16,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:04:16" (1/1) ... [2024-10-11 20:04:16,454 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:04:16" (1/1) ... [2024-10-11 20:04:16,481 INFO L138 Inliner]: procedures = 168, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 142 [2024-10-11 20:04:16,481 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:04:16,482 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:04:16,482 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:04:16,482 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:04:16,493 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:04:16" (1/1) ... [2024-10-11 20:04:16,493 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:04:16" (1/1) ... [2024-10-11 20:04:16,497 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:04:16" (1/1) ... [2024-10-11 20:04:16,518 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 1, 3, 8]. 57 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 1, 0, 8]. The 2 writes are split as follows [0, 0, 2, 0]. [2024-10-11 20:04:16,519 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:04:16" (1/1) ... [2024-10-11 20:04:16,519 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:04:16" (1/1) ... [2024-10-11 20:04:16,530 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:04:16" (1/1) ... [2024-10-11 20:04:16,537 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:04:16" (1/1) ... [2024-10-11 20:04:16,540 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:04:16" (1/1) ... [2024-10-11 20:04:16,541 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:04:16" (1/1) ... [2024-10-11 20:04:16,544 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:04:16,545 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:04:16,546 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:04:16,546 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:04:16,547 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:04:16" (1/1) ... [2024-10-11 20:04:16,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:04:16,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:04:16,582 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 20:04:16,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 20:04:16,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 20:04:16,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 20:04:16,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 20:04:16,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 20:04:16,624 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-10-11 20:04:16,624 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-10-11 20:04:16,624 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-10-11 20:04:16,624 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-10-11 20:04:16,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 20:04:16,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 20:04:16,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 20:04:16,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 20:04:16,625 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-11 20:04:16,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 20:04:16,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 20:04:16,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 20:04:16,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 20:04:16,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-11 20:04:16,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 20:04:16,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 20:04:16,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 20:04:16,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 20:04:16,627 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-11 20:04:16,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:04:16,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:04:16,629 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 20:04:16,771 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:04:16,773 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:04:17,017 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 20:04:17,017 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:04:17,218 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:04:17,218 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 20:04:17,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:04:17 BoogieIcfgContainer [2024-10-11 20:04:17,219 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:04:17,223 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:04:17,223 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:04:17,227 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:04:17,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:04:15" (1/3) ... [2024-10-11 20:04:17,228 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f9959b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:04:17, skipping insertion in model container [2024-10-11 20:04:17,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:04:16" (2/3) ... [2024-10-11 20:04:17,229 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f9959b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:04:17, skipping insertion in model container [2024-10-11 20:04:17,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:04:17" (3/3) ... [2024-10-11 20:04:17,231 INFO L112 eAbstractionObserver]: Analyzing ICFG circular_buffer_ok.i [2024-10-11 20:04:17,246 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:04:17,247 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-10-11 20:04:17,247 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 20:04:17,305 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-11 20:04:17,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 66 transitions, 146 flow [2024-10-11 20:04:17,366 INFO L124 PetriNetUnfolderBase]: 12/64 cut-off events. [2024-10-11 20:04:17,367 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 20:04:17,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 64 events. 12/64 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 192 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2024-10-11 20:04:17,370 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 66 transitions, 146 flow [2024-10-11 20:04:17,374 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 63 transitions, 138 flow [2024-10-11 20:04:17,382 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:04:17,388 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@2b6d118a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:04:17,388 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2024-10-11 20:04:17,400 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 20:04:17,400 INFO L124 PetriNetUnfolderBase]: 1/24 cut-off events. [2024-10-11 20:04:17,400 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 20:04:17,400 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 20:04:17,401 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:04:17,403 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2024-10-11 20:04:17,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:04:17,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1009016803, now seen corresponding path program 1 times [2024-10-11 20:04:17,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:04:17,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695945710] [2024-10-11 20:04:17,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:04:17,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:04:17,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:04:17,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:04:17,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:04:17,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695945710] [2024-10-11 20:04:17,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695945710] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:04:17,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:04:17,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 20:04:17,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111589324] [2024-10-11 20:04:17,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:04:17,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:04:17,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:04:17,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:04:17,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:04:17,920 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 66 [2024-10-11 20:04:17,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 63 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:04:17,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 20:04:17,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 66 [2024-10-11 20:04:17,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 20:04:18,180 INFO L124 PetriNetUnfolderBase]: 571/1079 cut-off events. [2024-10-11 20:04:18,181 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-10-11 20:04:18,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2038 conditions, 1079 events. 571/1079 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5896 event pairs, 438 based on Foata normal form. 150/1116 useless extension candidates. Maximal degree in co-relation 1956. Up to 914 conditions per place. [2024-10-11 20:04:18,198 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 32 selfloop transitions, 1 changer transitions 0/52 dead transitions. [2024-10-11 20:04:18,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 52 transitions, 182 flow [2024-10-11 20:04:18,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:04:18,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 20:04:18,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2024-10-11 20:04:18,211 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5252525252525253 [2024-10-11 20:04:18,214 INFO L175 Difference]: Start difference. First operand has 58 places, 63 transitions, 138 flow. Second operand 3 states and 104 transitions. [2024-10-11 20:04:18,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 52 transitions, 182 flow [2024-10-11 20:04:18,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 52 transitions, 174 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-11 20:04:18,221 INFO L231 Difference]: Finished difference. Result has 51 places, 52 transitions, 110 flow [2024-10-11 20:04:18,224 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=51, PETRI_TRANSITIONS=52} [2024-10-11 20:04:18,228 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, -7 predicate places. [2024-10-11 20:04:18,228 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 52 transitions, 110 flow [2024-10-11 20:04:18,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:04:18,229 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 20:04:18,229 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:04:18,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:04:18,230 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2024-10-11 20:04:18,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:04:18,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1009016804, now seen corresponding path program 1 times [2024-10-11 20:04:18,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:04:18,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043701885] [2024-10-11 20:04:18,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:04:18,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:04:18,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:04:18,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:04:18,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:04:18,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043701885] [2024-10-11 20:04:18,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043701885] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:04:18,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:04:18,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 20:04:18,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998335856] [2024-10-11 20:04:18,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:04:18,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:04:18,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:04:18,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:04:18,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:04:18,521 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 66 [2024-10-11 20:04:18,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 52 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:04:18,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 20:04:18,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 66 [2024-10-11 20:04:18,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 20:04:18,782 INFO L124 PetriNetUnfolderBase]: 1025/1952 cut-off events. [2024-10-11 20:04:18,783 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-11 20:04:18,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3580 conditions, 1952 events. 1025/1952 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 11094 event pairs, 371 based on Foata normal form. 0/1772 useless extension candidates. Maximal degree in co-relation 3574. Up to 901 conditions per place. [2024-10-11 20:04:18,795 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 59 selfloop transitions, 2 changer transitions 0/79 dead transitions. [2024-10-11 20:04:18,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 79 transitions, 289 flow [2024-10-11 20:04:18,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:04:18,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 20:04:18,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2024-10-11 20:04:18,800 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6515151515151515 [2024-10-11 20:04:18,800 INFO L175 Difference]: Start difference. First operand has 51 places, 52 transitions, 110 flow. Second operand 3 states and 129 transitions. [2024-10-11 20:04:18,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 79 transitions, 289 flow [2024-10-11 20:04:18,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 79 transitions, 288 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 20:04:18,806 INFO L231 Difference]: Finished difference. Result has 53 places, 53 transitions, 123 flow [2024-10-11 20:04:18,806 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=123, PETRI_PLACES=53, PETRI_TRANSITIONS=53} [2024-10-11 20:04:18,807 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, -5 predicate places. [2024-10-11 20:04:18,807 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 53 transitions, 123 flow [2024-10-11 20:04:18,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:04:18,808 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 20:04:18,808 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:04:18,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 20:04:18,808 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2024-10-11 20:04:18,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:04:18,809 INFO L85 PathProgramCache]: Analyzing trace with hash -856042773, now seen corresponding path program 1 times [2024-10-11 20:04:18,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:04:18,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715420210] [2024-10-11 20:04:18,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:04:18,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:04:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:04:19,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:04:19,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:04:19,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715420210] [2024-10-11 20:04:19,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715420210] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:04:19,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:04:19,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:04:19,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575643632] [2024-10-11 20:04:19,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:04:19,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:04:19,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:04:19,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:04:19,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:04:19,021 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 66 [2024-10-11 20:04:19,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 53 transitions, 123 flow. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:04:19,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 20:04:19,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 66 [2024-10-11 20:04:19,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 20:04:19,229 INFO L124 PetriNetUnfolderBase]: 1070/1975 cut-off events. [2024-10-11 20:04:19,230 INFO L125 PetriNetUnfolderBase]: For 54/60 co-relation queries the response was YES. [2024-10-11 20:04:19,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3810 conditions, 1975 events. 1070/1975 cut-off events. For 54/60 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 10909 event pairs, 826 based on Foata normal form. 0/1791 useless extension candidates. Maximal degree in co-relation 3802. Up to 1685 conditions per place. [2024-10-11 20:04:19,245 INFO L140 encePairwiseOnDemand]: 64/66 looper letters, 34 selfloop transitions, 1 changer transitions 0/50 dead transitions. [2024-10-11 20:04:19,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 50 transitions, 187 flow [2024-10-11 20:04:19,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:04:19,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 20:04:19,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2024-10-11 20:04:19,247 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.494949494949495 [2024-10-11 20:04:19,247 INFO L175 Difference]: Start difference. First operand has 53 places, 53 transitions, 123 flow. Second operand 3 states and 98 transitions. [2024-10-11 20:04:19,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 50 transitions, 187 flow [2024-10-11 20:04:19,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 50 transitions, 185 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 20:04:19,250 INFO L231 Difference]: Finished difference. Result has 51 places, 50 transitions, 117 flow [2024-10-11 20:04:19,251 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=117, PETRI_PLACES=51, PETRI_TRANSITIONS=50} [2024-10-11 20:04:19,252 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, -7 predicate places. [2024-10-11 20:04:19,253 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 50 transitions, 117 flow [2024-10-11 20:04:19,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:04:19,253 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 20:04:19,253 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:04:19,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 20:04:19,253 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err3ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2024-10-11 20:04:19,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:04:19,254 INFO L85 PathProgramCache]: Analyzing trace with hash -855087443, now seen corresponding path program 1 times [2024-10-11 20:04:19,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:04:19,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871956241] [2024-10-11 20:04:19,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:04:19,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:04:19,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:04:19,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:04:19,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:04:19,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871956241] [2024-10-11 20:04:19,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871956241] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:04:19,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:04:19,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:04:19,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005983526] [2024-10-11 20:04:19,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:04:19,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:04:19,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:04:19,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:04:19,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:04:19,366 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 66 [2024-10-11 20:04:19,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 50 transitions, 117 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) [2024-10-11 20:04:19,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 20:04:19,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 66 [2024-10-11 20:04:19,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 20:04:19,543 INFO L124 PetriNetUnfolderBase]: 739/1424 cut-off events. [2024-10-11 20:04:19,544 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2024-10-11 20:04:19,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2688 conditions, 1424 events. 739/1424 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 7497 event pairs, 204 based on Foata normal form. 23/1360 useless extension candidates. Maximal degree in co-relation 2679. Up to 770 conditions per place. [2024-10-11 20:04:19,553 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 52 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2024-10-11 20:04:19,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 71 transitions, 270 flow [2024-10-11 20:04:19,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:04:19,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 20:04:19,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2024-10-11 20:04:19,555 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6262626262626263 [2024-10-11 20:04:19,555 INFO L175 Difference]: Start difference. First operand has 51 places, 50 transitions, 117 flow. Second operand 3 states and 124 transitions. [2024-10-11 20:04:19,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 71 transitions, 270 flow [2024-10-11 20:04:19,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 71 transitions, 269 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 20:04:19,557 INFO L231 Difference]: Finished difference. Result has 53 places, 50 transitions, 124 flow [2024-10-11 20:04:19,557 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=53, PETRI_TRANSITIONS=50} [2024-10-11 20:04:19,558 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, -5 predicate places. [2024-10-11 20:04:19,558 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 50 transitions, 124 flow [2024-10-11 20:04:19,559 INFO L472 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) [2024-10-11 20:04:19,559 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 20:04:19,559 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:04:19,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 20:04:19,560 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2024-10-11 20:04:19,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:04:19,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1516247104, now seen corresponding path program 1 times [2024-10-11 20:04:19,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:04:19,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532063498] [2024-10-11 20:04:19,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:04:19,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:04:19,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:04:19,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:04:19,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:04:19,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532063498] [2024-10-11 20:04:19,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532063498] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:04:19,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:04:19,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:04:19,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486291551] [2024-10-11 20:04:19,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:04:19,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:04:19,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:04:19,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:04:19,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:04:19,598 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 66 [2024-10-11 20:04:19,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 50 transitions, 124 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) [2024-10-11 20:04:19,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 20:04:19,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 66 [2024-10-11 20:04:19,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 20:04:19,874 INFO L124 PetriNetUnfolderBase]: 1183/2249 cut-off events. [2024-10-11 20:04:19,874 INFO L125 PetriNetUnfolderBase]: For 227/247 co-relation queries the response was YES. [2024-10-11 20:04:19,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4404 conditions, 2249 events. 1183/2249 cut-off events. For 227/247 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 13550 event pairs, 567 based on Foata normal form. 24/2100 useless extension candidates. Maximal degree in co-relation 4393. Up to 1239 conditions per place. [2024-10-11 20:04:19,886 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 56 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2024-10-11 20:04:19,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 75 transitions, 298 flow [2024-10-11 20:04:19,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:04:19,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 20:04:19,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2024-10-11 20:04:19,889 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6414141414141414 [2024-10-11 20:04:19,889 INFO L175 Difference]: Start difference. First operand has 53 places, 50 transitions, 124 flow. Second operand 3 states and 127 transitions. [2024-10-11 20:04:19,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 75 transitions, 298 flow [2024-10-11 20:04:19,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 75 transitions, 292 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 20:04:19,894 INFO L231 Difference]: Finished difference. Result has 54 places, 51 transitions, 132 flow [2024-10-11 20:04:19,894 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=54, PETRI_TRANSITIONS=51} [2024-10-11 20:04:19,897 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, -4 predicate places. [2024-10-11 20:04:19,897 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 51 transitions, 132 flow [2024-10-11 20:04:19,897 INFO L472 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) [2024-10-11 20:04:19,897 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 20:04:19,897 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:04:19,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 20:04:19,898 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2024-10-11 20:04:19,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:04:19,898 INFO L85 PathProgramCache]: Analyzing trace with hash 713990521, now seen corresponding path program 1 times [2024-10-11 20:04:19,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:04:19,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878517662] [2024-10-11 20:04:19,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:04:19,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:04:19,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:04:19,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:04:19,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:04:19,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878517662] [2024-10-11 20:04:19,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878517662] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:04:19,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:04:19,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:04:19,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698218550] [2024-10-11 20:04:19,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:04:19,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:04:19,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:04:19,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:04:19,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:04:19,966 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 66 [2024-10-11 20:04:19,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 51 transitions, 132 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) [2024-10-11 20:04:19,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 20:04:19,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 66 [2024-10-11 20:04:19,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 20:04:20,203 INFO L124 PetriNetUnfolderBase]: 1071/2133 cut-off events. [2024-10-11 20:04:20,204 INFO L125 PetriNetUnfolderBase]: For 202/218 co-relation queries the response was YES. [2024-10-11 20:04:20,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4230 conditions, 2133 events. 1071/2133 cut-off events. For 202/218 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 12138 event pairs, 502 based on Foata normal form. 47/2072 useless extension candidates. Maximal degree in co-relation 4219. Up to 903 conditions per place. [2024-10-11 20:04:20,215 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 53 selfloop transitions, 3 changer transitions 0/73 dead transitions. [2024-10-11 20:04:20,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 73 transitions, 302 flow [2024-10-11 20:04:20,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:04:20,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 20:04:20,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2024-10-11 20:04:20,217 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6212121212121212 [2024-10-11 20:04:20,217 INFO L175 Difference]: Start difference. First operand has 54 places, 51 transitions, 132 flow. Second operand 3 states and 123 transitions. [2024-10-11 20:04:20,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 73 transitions, 302 flow [2024-10-11 20:04:20,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 73 transitions, 299 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 20:04:20,221 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 145 flow [2024-10-11 20:04:20,222 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=145, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2024-10-11 20:04:20,223 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, -2 predicate places. [2024-10-11 20:04:20,223 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 145 flow [2024-10-11 20:04:20,224 INFO L472 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) [2024-10-11 20:04:20,224 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 20:04:20,224 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:04:20,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 20:04:20,224 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err3ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2024-10-11 20:04:20,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:04:20,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1115145714, now seen corresponding path program 1 times [2024-10-11 20:04:20,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:04:20,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712983648] [2024-10-11 20:04:20,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:04:20,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:04:20,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:04:20,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:04:20,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:04:20,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712983648] [2024-10-11 20:04:20,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712983648] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:04:20,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:04:20,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 20:04:20,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557424131] [2024-10-11 20:04:20,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:04:20,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:04:20,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:04:20,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:04:20,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:04:20,371 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 66 [2024-10-11 20:04:20,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 145 flow. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:04:20,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 20:04:20,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 66 [2024-10-11 20:04:20,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 20:04:20,744 INFO L124 PetriNetUnfolderBase]: 1070/2020 cut-off events. [2024-10-11 20:04:20,744 INFO L125 PetriNetUnfolderBase]: For 310/325 co-relation queries the response was YES. [2024-10-11 20:04:20,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4219 conditions, 2020 events. 1070/2020 cut-off events. For 310/325 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 11190 event pairs, 471 based on Foata normal form. 0/1874 useless extension candidates. Maximal degree in co-relation 4206. Up to 1336 conditions per place. [2024-10-11 20:04:20,756 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 87 selfloop transitions, 7 changer transitions 0/110 dead transitions. [2024-10-11 20:04:20,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 110 transitions, 469 flow [2024-10-11 20:04:20,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 20:04:20,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-11 20:04:20,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 247 transitions. [2024-10-11 20:04:20,758 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5346320346320347 [2024-10-11 20:04:20,758 INFO L175 Difference]: Start difference. First operand has 56 places, 52 transitions, 145 flow. Second operand 7 states and 247 transitions. [2024-10-11 20:04:20,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 110 transitions, 469 flow [2024-10-11 20:04:20,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 110 transitions, 464 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 20:04:20,761 INFO L231 Difference]: Finished difference. Result has 65 places, 57 transitions, 187 flow [2024-10-11 20:04:20,762 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=187, PETRI_PLACES=65, PETRI_TRANSITIONS=57} [2024-10-11 20:04:20,762 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 7 predicate places. [2024-10-11 20:04:20,763 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 57 transitions, 187 flow [2024-10-11 20:04:20,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:04:20,763 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 20:04:20,763 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:04:20,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 20:04:20,763 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2024-10-11 20:04:20,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:04:20,764 INFO L85 PathProgramCache]: Analyzing trace with hash 2118554836, now seen corresponding path program 1 times [2024-10-11 20:04:20,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:04:20,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114526585] [2024-10-11 20:04:20,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:04:20,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:04:20,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:04:20,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:04:20,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:04:20,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114526585] [2024-10-11 20:04:20,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114526585] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:04:20,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:04:20,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:04:20,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251093182] [2024-10-11 20:04:20,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:04:20,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:04:20,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:04:20,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:04:20,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:04:20,808 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 66 [2024-10-11 20:04:20,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 57 transitions, 187 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:04:20,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 20:04:20,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 66 [2024-10-11 20:04:20,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 20:04:21,182 INFO L124 PetriNetUnfolderBase]: 1714/3369 cut-off events. [2024-10-11 20:04:21,182 INFO L125 PetriNetUnfolderBase]: For 903/948 co-relation queries the response was YES. [2024-10-11 20:04:21,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7366 conditions, 3369 events. 1714/3369 cut-off events. For 903/948 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 21428 event pairs, 797 based on Foata normal form. 77/3287 useless extension candidates. Maximal degree in co-relation 7349. Up to 1698 conditions per place. [2024-10-11 20:04:21,203 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 69 selfloop transitions, 2 changer transitions 0/89 dead transitions. [2024-10-11 20:04:21,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 89 transitions, 448 flow [2024-10-11 20:04:21,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:04:21,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 20:04:21,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2024-10-11 20:04:21,204 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6414141414141414 [2024-10-11 20:04:21,204 INFO L175 Difference]: Start difference. First operand has 65 places, 57 transitions, 187 flow. Second operand 3 states and 127 transitions. [2024-10-11 20:04:21,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 89 transitions, 448 flow [2024-10-11 20:04:21,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 89 transitions, 436 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 20:04:21,210 INFO L231 Difference]: Finished difference. Result has 66 places, 58 transitions, 193 flow [2024-10-11 20:04:21,210 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=193, PETRI_PLACES=66, PETRI_TRANSITIONS=58} [2024-10-11 20:04:21,211 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 8 predicate places. [2024-10-11 20:04:21,211 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 58 transitions, 193 flow [2024-10-11 20:04:21,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:04:21,211 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 20:04:21,211 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:04:21,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 20:04:21,211 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err3ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2024-10-11 20:04:21,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:04:21,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1577651800, now seen corresponding path program 1 times [2024-10-11 20:04:21,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:04:21,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287244111] [2024-10-11 20:04:21,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:04:21,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:04:21,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:04:21,252 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:04:21,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:04:21,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287244111] [2024-10-11 20:04:21,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287244111] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:04:21,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:04:21,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:04:21,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47531766] [2024-10-11 20:04:21,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:04:21,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:04:21,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:04:21,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:04:21,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:04:21,257 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 66 [2024-10-11 20:04:21,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 58 transitions, 193 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:04:21,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 20:04:21,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 66 [2024-10-11 20:04:21,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 20:04:21,531 INFO L124 PetriNetUnfolderBase]: 1328/2542 cut-off events. [2024-10-11 20:04:21,531 INFO L125 PetriNetUnfolderBase]: For 744/765 co-relation queries the response was YES. [2024-10-11 20:04:21,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5778 conditions, 2542 events. 1328/2542 cut-off events. For 744/765 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 14467 event pairs, 487 based on Foata normal form. 93/2569 useless extension candidates. Maximal degree in co-relation 5760. Up to 1421 conditions per place. [2024-10-11 20:04:21,543 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 54 selfloop transitions, 3 changer transitions 0/74 dead transitions. [2024-10-11 20:04:21,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 74 transitions, 356 flow [2024-10-11 20:04:21,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:04:21,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 20:04:21,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2024-10-11 20:04:21,544 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5808080808080808 [2024-10-11 20:04:21,544 INFO L175 Difference]: Start difference. First operand has 66 places, 58 transitions, 193 flow. Second operand 3 states and 115 transitions. [2024-10-11 20:04:21,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 74 transitions, 356 flow [2024-10-11 20:04:21,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 74 transitions, 347 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-11 20:04:21,548 INFO L231 Difference]: Finished difference. Result has 68 places, 58 transitions, 200 flow [2024-10-11 20:04:21,549 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=200, PETRI_PLACES=68, PETRI_TRANSITIONS=58} [2024-10-11 20:04:21,549 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 10 predicate places. [2024-10-11 20:04:21,550 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 58 transitions, 200 flow [2024-10-11 20:04:21,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:04:21,550 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 20:04:21,550 INFO L204 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] [2024-10-11 20:04:21,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 20:04:21,550 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2024-10-11 20:04:21,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:04:21,551 INFO L85 PathProgramCache]: Analyzing trace with hash -520401962, now seen corresponding path program 1 times [2024-10-11 20:04:21,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:04:21,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105846317] [2024-10-11 20:04:21,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:04:21,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:04:21,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:04:21,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:04:21,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:04:21,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105846317] [2024-10-11 20:04:21,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105846317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:04:21,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:04:21,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:04:21,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302817510] [2024-10-11 20:04:21,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:04:21,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:04:21,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:04:21,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:04:21,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:04:21,648 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 66 [2024-10-11 20:04:21,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 58 transitions, 200 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) [2024-10-11 20:04:21,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 20:04:21,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 66 [2024-10-11 20:04:21,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 20:04:21,824 INFO L124 PetriNetUnfolderBase]: 804/1815 cut-off events. [2024-10-11 20:04:21,825 INFO L125 PetriNetUnfolderBase]: For 675/675 co-relation queries the response was YES. [2024-10-11 20:04:21,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4150 conditions, 1815 events. 804/1815 cut-off events. For 675/675 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 9973 event pairs, 255 based on Foata normal form. 92/1862 useless extension candidates. Maximal degree in co-relation 4132. Up to 821 conditions per place. [2024-10-11 20:04:21,837 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 48 selfloop transitions, 4 changer transitions 0/71 dead transitions. [2024-10-11 20:04:21,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 71 transitions, 352 flow [2024-10-11 20:04:21,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:04:21,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 20:04:21,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2024-10-11 20:04:21,839 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5707070707070707 [2024-10-11 20:04:21,840 INFO L175 Difference]: Start difference. First operand has 68 places, 58 transitions, 200 flow. Second operand 3 states and 113 transitions. [2024-10-11 20:04:21,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 71 transitions, 352 flow [2024-10-11 20:04:21,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 71 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 20:04:21,845 INFO L231 Difference]: Finished difference. Result has 68 places, 58 transitions, 202 flow [2024-10-11 20:04:21,845 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=202, PETRI_PLACES=68, PETRI_TRANSITIONS=58} [2024-10-11 20:04:21,846 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 10 predicate places. [2024-10-11 20:04:21,846 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 58 transitions, 202 flow [2024-10-11 20:04:21,847 INFO L472 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) [2024-10-11 20:04:21,847 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 20:04:21,847 INFO L204 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] [2024-10-11 20:04:21,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 20:04:21,847 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2024-10-11 20:04:21,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:04:21,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1038200524, now seen corresponding path program 1 times [2024-10-11 20:04:21,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:04:21,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969671544] [2024-10-11 20:04:21,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:04:21,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:04:21,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:04:22,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:04:22,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:04:22,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969671544] [2024-10-11 20:04:22,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969671544] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:04:22,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:04:22,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:04:22,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256047865] [2024-10-11 20:04:22,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:04:22,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:04:22,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:04:22,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:04:22,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:04:22,085 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 66 [2024-10-11 20:04:22,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 58 transitions, 202 flow. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:04:22,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 20:04:22,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 66 [2024-10-11 20:04:22,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 20:04:22,459 INFO L124 PetriNetUnfolderBase]: 1473/3162 cut-off events. [2024-10-11 20:04:22,459 INFO L125 PetriNetUnfolderBase]: For 1354/1361 co-relation queries the response was YES. [2024-10-11 20:04:22,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7583 conditions, 3162 events. 1473/3162 cut-off events. For 1354/1361 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 17894 event pairs, 766 based on Foata normal form. 5/3035 useless extension candidates. Maximal degree in co-relation 7565. Up to 1308 conditions per place. [2024-10-11 20:04:22,474 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 90 selfloop transitions, 3 changer transitions 0/111 dead transitions. [2024-10-11 20:04:22,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 111 transitions, 578 flow [2024-10-11 20:04:22,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:04:22,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 20:04:22,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 173 transitions. [2024-10-11 20:04:22,477 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6553030303030303 [2024-10-11 20:04:22,478 INFO L175 Difference]: Start difference. First operand has 68 places, 58 transitions, 202 flow. Second operand 4 states and 173 transitions. [2024-10-11 20:04:22,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 111 transitions, 578 flow [2024-10-11 20:04:22,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 111 transitions, 566 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 20:04:22,483 INFO L231 Difference]: Finished difference. Result has 71 places, 60 transitions, 214 flow [2024-10-11 20:04:22,484 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=214, PETRI_PLACES=71, PETRI_TRANSITIONS=60} [2024-10-11 20:04:22,484 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 13 predicate places. [2024-10-11 20:04:22,484 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 60 transitions, 214 flow [2024-10-11 20:04:22,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:04:22,485 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 20:04:22,485 INFO L204 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] [2024-10-11 20:04:22,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 20:04:22,485 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2024-10-11 20:04:22,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:04:22,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1387612570, now seen corresponding path program 1 times [2024-10-11 20:04:22,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:04:22,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441899734] [2024-10-11 20:04:22,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:04:22,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:04:22,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:04:22,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:04:22,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:04:22,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441899734] [2024-10-11 20:04:22,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441899734] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:04:22,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437652630] [2024-10-11 20:04:22,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:04:22,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:04:22,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:04:22,546 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:04:22,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 20:04:22,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:04:22,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 20:04:22,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:04:22,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 20:04:22,695 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:04:22,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437652630] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:04:22,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:04:22,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2024-10-11 20:04:22,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509958141] [2024-10-11 20:04:22,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:04:22,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:04:22,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:04:22,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:04:22,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:04:22,706 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 66 [2024-10-11 20:04:22,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 60 transitions, 214 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) [2024-10-11 20:04:22,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 20:04:22,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 66 [2024-10-11 20:04:22,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 20:04:23,036 INFO L124 PetriNetUnfolderBase]: 1461/3127 cut-off events. [2024-10-11 20:04:23,037 INFO L125 PetriNetUnfolderBase]: For 1224/1235 co-relation queries the response was YES. [2024-10-11 20:04:23,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7370 conditions, 3127 events. 1461/3127 cut-off events. For 1224/1235 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 18009 event pairs, 1152 based on Foata normal form. 15/3043 useless extension candidates. Maximal degree in co-relation 7349. Up to 2476 conditions per place. [2024-10-11 20:04:23,053 INFO L140 encePairwiseOnDemand]: 64/66 looper letters, 38 selfloop transitions, 1 changer transitions 3/59 dead transitions. [2024-10-11 20:04:23,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 59 transitions, 294 flow [2024-10-11 20:04:23,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:04:23,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 20:04:23,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2024-10-11 20:04:23,055 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-10-11 20:04:23,055 INFO L175 Difference]: Start difference. First operand has 71 places, 60 transitions, 214 flow. Second operand 3 states and 99 transitions. [2024-10-11 20:04:23,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 59 transitions, 294 flow [2024-10-11 20:04:23,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 59 transitions, 294 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 20:04:23,059 INFO L231 Difference]: Finished difference. Result has 72 places, 56 transitions, 204 flow [2024-10-11 20:04:23,060 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=204, PETRI_PLACES=72, PETRI_TRANSITIONS=56} [2024-10-11 20:04:23,060 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 14 predicate places. [2024-10-11 20:04:23,060 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 56 transitions, 204 flow [2024-10-11 20:04:23,061 INFO L472 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) [2024-10-11 20:04:23,061 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 20:04:23,061 INFO L204 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] [2024-10-11 20:04:23,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 20:04:23,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 20:04:23,266 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2024-10-11 20:04:23,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:04:23,266 INFO L85 PathProgramCache]: Analyzing trace with hash 359065871, now seen corresponding path program 1 times [2024-10-11 20:04:23,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:04:23,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273062167] [2024-10-11 20:04:23,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:04:23,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:04:23,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:04:23,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [285589132] [2024-10-11 20:04:23,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:04:23,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:04:23,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:04:23,316 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:04:23,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 20:04:23,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:04:23,478 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 20:04:23,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:04:23,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:04:23,683 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:04:23,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:04:23,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273062167] [2024-10-11 20:04:23,684 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:04:23,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285589132] [2024-10-11 20:04:23,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285589132] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:04:23,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:04:23,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:04:23,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653337081] [2024-10-11 20:04:23,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:04:23,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:04:23,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:04:23,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:04:23,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:04:23,697 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 66 [2024-10-11 20:04:23,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 56 transitions, 204 flow. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:04:23,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 20:04:23,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 66 [2024-10-11 20:04:23,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 20:04:23,983 INFO L124 PetriNetUnfolderBase]: 1014/2206 cut-off events. [2024-10-11 20:04:23,984 INFO L125 PetriNetUnfolderBase]: For 887/889 co-relation queries the response was YES. [2024-10-11 20:04:23,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5212 conditions, 2206 events. 1014/2206 cut-off events. For 887/889 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 10913 event pairs, 315 based on Foata normal form. 18/2172 useless extension candidates. Maximal degree in co-relation 5189. Up to 1159 conditions per place. [2024-10-11 20:04:23,993 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 58 selfloop transitions, 3 changer transitions 3/81 dead transitions. [2024-10-11 20:04:23,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 81 transitions, 417 flow [2024-10-11 20:04:23,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:04:23,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 20:04:23,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2024-10-11 20:04:23,995 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.571969696969697 [2024-10-11 20:04:23,995 INFO L175 Difference]: Start difference. First operand has 72 places, 56 transitions, 204 flow. Second operand 4 states and 151 transitions. [2024-10-11 20:04:23,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 81 transitions, 417 flow [2024-10-11 20:04:23,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 81 transitions, 416 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 20:04:23,998 INFO L231 Difference]: Finished difference. Result has 73 places, 56 transitions, 213 flow [2024-10-11 20:04:23,999 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=213, PETRI_PLACES=73, PETRI_TRANSITIONS=56} [2024-10-11 20:04:23,999 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 15 predicate places. [2024-10-11 20:04:23,999 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 56 transitions, 213 flow [2024-10-11 20:04:24,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:04:24,000 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 20:04:24,000 INFO L204 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] [2024-10-11 20:04:24,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 20:04:24,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:04:24,205 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2024-10-11 20:04:24,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:04:24,205 INFO L85 PathProgramCache]: Analyzing trace with hash 278844263, now seen corresponding path program 1 times [2024-10-11 20:04:24,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:04:24,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377118660] [2024-10-11 20:04:24,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:04:24,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:04:24,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:04:24,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:04:24,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:04:24,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377118660] [2024-10-11 20:04:24,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377118660] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:04:24,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:04:24,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 20:04:24,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237057249] [2024-10-11 20:04:24,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:04:24,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 20:04:24,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:04:24,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 20:04:24,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:04:24,811 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 66 [2024-10-11 20:04:24,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 56 transitions, 213 flow. Second operand has 9 states, 9 states have (on average 25.22222222222222) internal successors, (227), 9 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:04:24,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 20:04:24,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 66 [2024-10-11 20:04:24,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 20:04:25,438 INFO L124 PetriNetUnfolderBase]: 1712/3696 cut-off events. [2024-10-11 20:04:25,438 INFO L125 PetriNetUnfolderBase]: For 1614/1622 co-relation queries the response was YES. [2024-10-11 20:04:25,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8784 conditions, 3696 events. 1712/3696 cut-off events. For 1614/1622 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 21532 event pairs, 573 based on Foata normal form. 0/3605 useless extension candidates. Maximal degree in co-relation 8759. Up to 885 conditions per place. [2024-10-11 20:04:25,459 INFO L140 encePairwiseOnDemand]: 55/66 looper letters, 121 selfloop transitions, 17 changer transitions 8/163 dead transitions. [2024-10-11 20:04:25,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 163 transitions, 883 flow [2024-10-11 20:04:25,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 20:04:25,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-11 20:04:25,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 391 transitions. [2024-10-11 20:04:25,461 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5385674931129476 [2024-10-11 20:04:25,461 INFO L175 Difference]: Start difference. First operand has 73 places, 56 transitions, 213 flow. Second operand 11 states and 391 transitions. [2024-10-11 20:04:25,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 163 transitions, 883 flow [2024-10-11 20:04:25,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 163 transitions, 875 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-11 20:04:25,467 INFO L231 Difference]: Finished difference. Result has 87 places, 68 transitions, 328 flow [2024-10-11 20:04:25,467 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=328, PETRI_PLACES=87, PETRI_TRANSITIONS=68} [2024-10-11 20:04:25,468 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 29 predicate places. [2024-10-11 20:04:25,468 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 68 transitions, 328 flow [2024-10-11 20:04:25,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 25.22222222222222) internal successors, (227), 9 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:04:25,469 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 20:04:25,469 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 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] [2024-10-11 20:04:25,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 20:04:25,469 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2024-10-11 20:04:25,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:04:25,470 INFO L85 PathProgramCache]: Analyzing trace with hash -770302035, now seen corresponding path program 1 times [2024-10-11 20:04:25,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:04:25,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49534179] [2024-10-11 20:04:25,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:04:25,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:04:25,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:04:25,824 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:04:25,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:04:25,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49534179] [2024-10-11 20:04:25,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49534179] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:04:25,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702064900] [2024-10-11 20:04:25,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:04:25,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:04:25,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:04:25,827 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:04:25,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 20:04:25,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:04:25,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 20:04:25,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:04:26,318 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:04:26,319 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:04:27,291 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:04:27,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702064900] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:04:27,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:04:27,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2024-10-11 20:04:27,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627511659] [2024-10-11 20:04:27,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:04:27,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 20:04:27,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:04:27,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 20:04:27,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:04:27,359 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 66 [2024-10-11 20:04:27,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 68 transitions, 328 flow. Second operand has 12 states, 12 states have (on average 27.0) internal successors, (324), 12 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:04:27,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 20:04:27,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 66 [2024-10-11 20:04:27,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 20:04:27,864 INFO L124 PetriNetUnfolderBase]: 1368/2910 cut-off events. [2024-10-11 20:04:27,865 INFO L125 PetriNetUnfolderBase]: For 1872/1874 co-relation queries the response was YES. [2024-10-11 20:04:27,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7477 conditions, 2910 events. 1368/2910 cut-off events. For 1872/1874 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 14301 event pairs, 842 based on Foata normal form. 54/2890 useless extension candidates. Maximal degree in co-relation 7446. Up to 1611 conditions per place. [2024-10-11 20:04:27,883 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 63 selfloop transitions, 6 changer transitions 0/83 dead transitions. [2024-10-11 20:04:27,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 83 transitions, 526 flow [2024-10-11 20:04:27,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:04:27,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 20:04:27,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2024-10-11 20:04:27,885 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5037878787878788 [2024-10-11 20:04:27,886 INFO L175 Difference]: Start difference. First operand has 87 places, 68 transitions, 328 flow. Second operand 4 states and 133 transitions. [2024-10-11 20:04:27,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 83 transitions, 526 flow [2024-10-11 20:04:27,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 83 transitions, 512 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-10-11 20:04:27,893 INFO L231 Difference]: Finished difference. Result has 86 places, 65 transitions, 317 flow [2024-10-11 20:04:27,894 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=317, PETRI_PLACES=86, PETRI_TRANSITIONS=65} [2024-10-11 20:04:27,894 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 28 predicate places. [2024-10-11 20:04:27,894 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 65 transitions, 317 flow [2024-10-11 20:04:27,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 27.0) internal successors, (324), 12 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:04:27,895 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 20:04:27,895 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:04:27,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 20:04:28,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:04:28,096 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err3ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2024-10-11 20:04:28,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:04:28,097 INFO L85 PathProgramCache]: Analyzing trace with hash 998687271, now seen corresponding path program 1 times [2024-10-11 20:04:28,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:04:28,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460921692] [2024-10-11 20:04:28,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:04:28,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:04:28,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:04:28,286 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:04:28,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:04:28,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460921692] [2024-10-11 20:04:28,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460921692] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:04:28,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:04:28,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 20:04:28,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677525492] [2024-10-11 20:04:28,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:04:28,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:04:28,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:04:28,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:04:28,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:04:28,298 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 66 [2024-10-11 20:04:28,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 65 transitions, 317 flow. Second operand has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:04:28,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 20:04:28,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 66 [2024-10-11 20:04:28,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 20:04:28,717 INFO L124 PetriNetUnfolderBase]: 1428/2979 cut-off events. [2024-10-11 20:04:28,718 INFO L125 PetriNetUnfolderBase]: For 2046/2046 co-relation queries the response was YES. [2024-10-11 20:04:28,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7754 conditions, 2979 events. 1428/2979 cut-off events. For 2046/2046 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 14548 event pairs, 714 based on Foata normal form. 0/2911 useless extension candidates. Maximal degree in co-relation 7722. Up to 1757 conditions per place. [2024-10-11 20:04:28,731 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 75 selfloop transitions, 12 changer transitions 5/104 dead transitions. [2024-10-11 20:04:28,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 104 transitions, 659 flow [2024-10-11 20:04:28,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:04:28,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 20:04:28,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 199 transitions. [2024-10-11 20:04:28,733 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5025252525252525 [2024-10-11 20:04:28,733 INFO L175 Difference]: Start difference. First operand has 86 places, 65 transitions, 317 flow. Second operand 6 states and 199 transitions. [2024-10-11 20:04:28,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 104 transitions, 659 flow [2024-10-11 20:04:28,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 104 transitions, 649 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 20:04:28,739 INFO L231 Difference]: Finished difference. Result has 87 places, 62 transitions, 334 flow [2024-10-11 20:04:28,739 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=334, PETRI_PLACES=87, PETRI_TRANSITIONS=62} [2024-10-11 20:04:28,741 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 29 predicate places. [2024-10-11 20:04:28,742 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 62 transitions, 334 flow [2024-10-11 20:04:28,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:04:28,742 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 20:04:28,742 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:04:28,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 20:04:28,742 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2024-10-11 20:04:28,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:04:28,743 INFO L85 PathProgramCache]: Analyzing trace with hash 925857996, now seen corresponding path program 1 times [2024-10-11 20:04:28,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:04:28,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202019734] [2024-10-11 20:04:28,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:04:28,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:04:28,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:04:29,051 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:04:29,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:04:29,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202019734] [2024-10-11 20:04:29,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202019734] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:04:29,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023633035] [2024-10-11 20:04:29,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:04:29,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:04:29,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:04:29,054 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:04:29,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 20:04:29,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:04:29,234 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 20:04:29,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:04:29,588 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:04:29,589 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:04:30,641 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:04:30,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023633035] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:04:30,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:04:30,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2024-10-11 20:04:30,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593335157] [2024-10-11 20:04:30,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:04:30,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 20:04:30,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:04:30,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 20:04:30,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:04:30,694 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 66 [2024-10-11 20:04:30,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 62 transitions, 334 flow. Second operand has 11 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) [2024-10-11 20:04:30,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 20:04:30,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 66 [2024-10-11 20:04:30,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 20:04:35,626 INFO L124 PetriNetUnfolderBase]: 2271/5018 cut-off events. [2024-10-11 20:04:35,626 INFO L125 PetriNetUnfolderBase]: For 4149/4150 co-relation queries the response was YES. [2024-10-11 20:04:35,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13352 conditions, 5018 events. 2271/5018 cut-off events. For 4149/4150 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 24201 event pairs, 752 based on Foata normal form. 37/4951 useless extension candidates. Maximal degree in co-relation 13320. Up to 863 conditions per place. [2024-10-11 20:04:35,660 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 151 selfloop transitions, 8 changer transitions 2/174 dead transitions. [2024-10-11 20:04:35,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 174 transitions, 1207 flow [2024-10-11 20:04:35,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 20:04:35,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-11 20:04:35,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 318 transitions. [2024-10-11 20:04:35,662 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6022727272727273 [2024-10-11 20:04:35,662 INFO L175 Difference]: Start difference. First operand has 87 places, 62 transitions, 334 flow. Second operand 8 states and 318 transitions. [2024-10-11 20:04:35,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 174 transitions, 1207 flow [2024-10-11 20:04:35,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 174 transitions, 1163 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-11 20:04:35,673 INFO L231 Difference]: Finished difference. Result has 94 places, 66 transitions, 378 flow [2024-10-11 20:04:35,673 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=378, PETRI_PLACES=94, PETRI_TRANSITIONS=66} [2024-10-11 20:04:35,674 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 36 predicate places. [2024-10-11 20:04:35,674 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 66 transitions, 378 flow [2024-10-11 20:04:35,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 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) [2024-10-11 20:04:35,674 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 20:04:35,675 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:04:35,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 20:04:35,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-11 20:04:35,876 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2024-10-11 20:04:35,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:04:35,876 INFO L85 PathProgramCache]: Analyzing trace with hash 931792455, now seen corresponding path program 1 times [2024-10-11 20:04:35,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:04:35,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135182536] [2024-10-11 20:04:35,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:04:35,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:04:35,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:04:35,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1789244622] [2024-10-11 20:04:35,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:04:35,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:04:35,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:04:35,930 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:04:35,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 20:04:36,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:04:36,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 20:04:36,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:04:36,403 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:04:36,404 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:04:37,822 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:04:37,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:04:37,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135182536] [2024-10-11 20:04:37,822 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:04:37,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789244622] [2024-10-11 20:04:37,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789244622] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:04:37,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 20:04:37,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2024-10-11 20:04:37,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115521291] [2024-10-11 20:04:37,823 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 20:04:37,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 20:04:37,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:04:37,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 20:04:37,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:04:38,010 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 66 [2024-10-11 20:04:38,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 66 transitions, 378 flow. Second operand has 11 states, 11 states have (on average 27.90909090909091) internal successors, (307), 11 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:04:38,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 20:04:38,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 66 [2024-10-11 20:04:38,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 20:04:40,117 INFO L124 PetriNetUnfolderBase]: 1895/4100 cut-off events. [2024-10-11 20:04:40,118 INFO L125 PetriNetUnfolderBase]: For 3558/3558 co-relation queries the response was YES. [2024-10-11 20:04:40,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10970 conditions, 4100 events. 1895/4100 cut-off events. For 3558/3558 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 17843 event pairs, 459 based on Foata normal form. 27/4058 useless extension candidates. Maximal degree in co-relation 10932. Up to 1314 conditions per place. [2024-10-11 20:04:40,140 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 159 selfloop transitions, 9 changer transitions 4/184 dead transitions. [2024-10-11 20:04:40,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 184 transitions, 1198 flow [2024-10-11 20:04:40,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 20:04:40,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-11 20:04:40,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 365 transitions. [2024-10-11 20:04:40,142 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.553030303030303 [2024-10-11 20:04:40,142 INFO L175 Difference]: Start difference. First operand has 94 places, 66 transitions, 378 flow. Second operand 10 states and 365 transitions. [2024-10-11 20:04:40,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 184 transitions, 1198 flow [2024-10-11 20:04:40,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 184 transitions, 1180 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-10-11 20:04:40,153 INFO L231 Difference]: Finished difference. Result has 103 places, 68 transitions, 404 flow [2024-10-11 20:04:40,153 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=404, PETRI_PLACES=103, PETRI_TRANSITIONS=68} [2024-10-11 20:04:40,154 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 45 predicate places. [2024-10-11 20:04:40,154 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 68 transitions, 404 flow [2024-10-11 20:04:40,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 27.90909090909091) internal successors, (307), 11 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:04:40,154 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 20:04:40,155 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:04:40,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 20:04:40,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 20:04:40,359 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2024-10-11 20:04:40,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:04:40,360 INFO L85 PathProgramCache]: Analyzing trace with hash -455699601, now seen corresponding path program 1 times [2024-10-11 20:04:40,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:04:40,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546055251] [2024-10-11 20:04:40,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:04:40,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:04:40,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:04:40,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1658880846] [2024-10-11 20:04:40,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:04:40,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:04:40,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:04:40,421 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:04:40,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 20:04:40,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:04:40,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-10-11 20:04:40,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:04:41,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2024-10-11 20:04:41,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-10-11 20:04:41,968 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:04:41,969 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:04:42,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2024-10-11 20:04:42,678 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 20:04:42,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 75 [2024-10-11 20:04:42,815 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 20:04:42,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 131 [2024-10-11 20:04:55,725 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:04:55,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:04:55,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546055251] [2024-10-11 20:04:55,726 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:04:55,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658880846] [2024-10-11 20:04:55,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658880846] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:04:55,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 20:04:55,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 28 [2024-10-11 20:04:55,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666795999] [2024-10-11 20:04:55,727 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 20:04:55,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-11 20:04:55,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:04:55,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-11 20:04:55,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=686, Unknown=6, NotChecked=0, Total=812 [2024-10-11 20:04:56,085 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 66 [2024-10-11 20:04:56,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 68 transitions, 404 flow. Second operand has 29 states, 29 states have (on average 17.03448275862069) internal successors, (494), 29 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:04:56,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 20:04:56,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 66 [2024-10-11 20:04:56,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 20:05:18,548 WARN L286 SmtUtils]: Spent 20.32s on a formula simplification. DAG size of input: 179 DAG size of output: 175 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-11 20:05:18,660 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse16 (mod (+ c_~next~0 1) 4294967296)) (.cse9 (select |c_#length| |c_~#buffer~0.base|)) (.cse4 (mod c_~next~0 4294967296)) (.cse33 (+ |c_t1Thread1of1ForFork1_~i~0#1| 1))) (let ((.cse32 (mod .cse33 256)) (.cse8 (+ .cse4 |c_~#buffer~0.offset|)) (.cse7 (+ .cse9 4294967295)) (.cse27 (+ .cse16 |c_~#buffer~0.offset|)) (.cse26 (mod (+ c_~first~0 1) 4294967296))) (let ((.cse28 (let ((.cse34 (+ |c_~#buffer~0.offset| .cse26))) (and (<= .cse34 4294967295) (or (< .cse34 0) (< 2147483647 .cse26))))) (.cse14 (< .cse7 .cse27)) (.cse6 (and (or (< 2147483647 .cse4) (< .cse8 0)) (<= .cse8 4294967295))) (.cse17 (+ .cse26 1)) (.cse19 (= (+ 257 |c_t1Thread1of1ForFork1_~i~0#1|) .cse32)) (.cse23 (< .cse32 128)) (.cse24 (= .cse33 .cse32)) (.cse25 (< 127 .cse32)) (.cse5 (mod c_~buffer_size~0 4294967296))) (and (let ((.cse1 (mod c_~first~0 4294967296))) (or (let ((.cse0 (+ |c_~#buffer~0.offset| .cse1))) (and (<= .cse0 4294967295) (or (< 2147483647 .cse1) (< .cse0 0)))) (let ((.cse2 (= .cse4 .cse1)) (.cse3 (mod |c_t1Thread1of1ForFork1_~i~0#1| 256))) (and (or (and .cse2 (= |c_t1Thread1of1ForFork1_~i~0#1| .cse3)) (< 127 .cse3)) (or (and .cse2 (= (+ 256 |c_t1Thread1of1ForFork1_~i~0#1|) .cse3)) (< .cse3 128)))) (< .cse5 (+ .cse1 1)) .cse6 (and (or (< .cse7 .cse8) (< .cse4 2147483648)) (<= .cse9 .cse8)))) (let ((.cse13 (mod (+ 4294967295 c_~first~0) 4294967296))) (let ((.cse10 (< 2147483647 .cse13)) (.cse12 (+ |c_~#buffer~0.offset| .cse13))) (or (let ((.cse11 (select |c_#memory_int#2| |c_~#buffer~0.base|))) (and (or .cse10 (= c_~value~0 (select .cse11 .cse12))) (or (< .cse13 2147483648) (= (select .cse11 (+ |c_~#buffer~0.offset| .cse13 (- 4294967296))) c_~value~0)))) (and (or .cse10 (< .cse12 0)) (<= .cse12 4294967295))))) (or (let ((.cse18 (< .cse27 4294967296)) (.cse21 (< .cse9 (+ .cse16 |c_~#buffer~0.offset| 1))) (.cse20 (+ .cse4 1)) (.cse15 (= .cse16 .cse26)) (.cse22 (< 2147483647 .cse16))) (and (or (and (or .cse14 (and (forall ((v_z_6 Int)) (or (< 4294967295 v_z_6) .cse15 (< (mod .cse16 v_z_6) 2147483648) (< v_z_6 .cse17) .cse18)) (or (forall ((v_z_6 Int)) (or (< 4294967295 v_z_6) (< (mod .cse16 v_z_6) 2147483648) (< v_z_6 .cse17) .cse18)) .cse19))) (or (forall ((v_z_6 Int)) (or (< 4294967295 v_z_6) (< (mod .cse16 v_z_6) 1) (< v_z_6 .cse20) .cse21 (< v_z_6 .cse17) .cse18)) .cse19) (forall ((v_z_6 Int)) (or (< 4294967295 v_z_6) (< (mod .cse16 v_z_6) 1) (< v_z_6 .cse20) .cse21 .cse15 (< v_z_6 .cse17) .cse22)) (forall ((v_z_6 Int)) (or (< 4294967295 v_z_6) (< (mod .cse16 v_z_6) 1) (< v_z_6 .cse20) .cse21 .cse15 (< v_z_6 .cse17) .cse18)) (or .cse19 (forall ((v_z_6 Int)) (or (< 4294967295 v_z_6) (< (mod .cse16 v_z_6) 1) (< v_z_6 .cse20) .cse21 (< v_z_6 .cse17) .cse22)))) .cse23) (or (and (or .cse24 (and (or .cse14 (forall ((v_z_12 Int)) (or (< (mod .cse16 v_z_12) 2147483648) .cse18 (< 4294967295 v_z_12) (< v_z_12 .cse17)))) (forall ((v_z_12 Int)) (or .cse21 (< (mod .cse16 v_z_12) 1) (< 4294967295 v_z_12) .cse22 (< v_z_12 .cse17) (< v_z_12 .cse20))) (forall ((v_z_12 Int)) (or .cse21 (< (mod .cse16 v_z_12) 1) .cse18 (< 4294967295 v_z_12) (< v_z_12 .cse17) (< v_z_12 .cse20))))) (or .cse14 (forall ((v_z_15 Int)) (or (< 4294967295 v_z_15) (< v_z_15 .cse17) (< (mod .cse16 v_z_15) 2147483648) .cse15 .cse18))) (forall ((v_z_15 Int)) (or (< 4294967295 v_z_15) .cse21 (< v_z_15 .cse20) (< v_z_15 .cse17) .cse15 (< (mod .cse16 v_z_15) 1) .cse18)) (forall ((v_z_15 Int)) (or (< 4294967295 v_z_15) .cse21 (< v_z_15 .cse20) (< v_z_15 .cse17) .cse15 (< (mod .cse16 v_z_15) 1) .cse22))) .cse25))) .cse28 .cse6) (let ((.cse29 (mod .cse16 .cse5))) (let ((.cse30 (+ |c_~#buffer~0.offset| .cse29))) (or (< .cse29 1) .cse28 (and (<= .cse30 4294967295) (or (< 2147483647 .cse29) (< .cse30 0))) (and (<= .cse9 .cse30) (or .cse14 (< .cse29 2147483648))) .cse6 (< .cse5 .cse17) (let ((.cse31 (= .cse29 .cse26))) (and (or (and .cse31 .cse19) .cse23) (or (and .cse24 .cse31) .cse25)))))))))) is different from false [2024-10-11 20:05:37,504 WARN L286 SmtUtils]: Spent 16.49s on a formula simplification that was a NOOP. DAG size: 126 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-11 20:05:41,675 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse16 (mod (+ c_~next~0 1) 4294967296)) (.cse9 (select |c_#length| |c_~#buffer~0.base|)) (.cse4 (mod c_~next~0 4294967296)) (.cse33 (+ |c_t1Thread1of1ForFork1_~i~0#1| 1))) (let ((.cse32 (mod .cse33 256)) (.cse8 (+ .cse4 |c_~#buffer~0.offset|)) (.cse7 (+ .cse9 4294967295)) (.cse27 (+ .cse16 |c_~#buffer~0.offset|)) (.cse26 (mod (+ c_~first~0 1) 4294967296))) (let ((.cse28 (let ((.cse34 (+ |c_~#buffer~0.offset| .cse26))) (and (<= .cse34 4294967295) (or (< .cse34 0) (< 2147483647 .cse26))))) (.cse14 (< .cse7 .cse27)) (.cse6 (and (or (< 2147483647 .cse4) (< .cse8 0)) (<= .cse8 4294967295))) (.cse17 (+ .cse26 1)) (.cse19 (= (+ 257 |c_t1Thread1of1ForFork1_~i~0#1|) .cse32)) (.cse23 (< .cse32 128)) (.cse24 (= .cse33 .cse32)) (.cse25 (< 127 .cse32)) (.cse5 (mod c_~buffer_size~0 4294967296))) (and (let ((.cse1 (mod c_~first~0 4294967296))) (or (let ((.cse0 (+ |c_~#buffer~0.offset| .cse1))) (and (<= .cse0 4294967295) (or (< 2147483647 .cse1) (< .cse0 0)))) (let ((.cse2 (= .cse4 .cse1)) (.cse3 (mod |c_t1Thread1of1ForFork1_~i~0#1| 256))) (and (or (and .cse2 (= |c_t1Thread1of1ForFork1_~i~0#1| .cse3)) (< 127 .cse3)) (or (and .cse2 (= (+ 256 |c_t1Thread1of1ForFork1_~i~0#1|) .cse3)) (< .cse3 128)))) (< .cse5 (+ .cse1 1)) .cse6 (and (or (< .cse7 .cse8) (< .cse4 2147483648)) (<= .cse9 .cse8)))) (let ((.cse13 (mod (+ 4294967295 c_~first~0) 4294967296))) (let ((.cse10 (< 2147483647 .cse13)) (.cse12 (+ |c_~#buffer~0.offset| .cse13))) (or (let ((.cse11 (select |c_#memory_int#2| |c_~#buffer~0.base|))) (and (or .cse10 (= c_~value~0 (select .cse11 .cse12))) (or (< .cse13 2147483648) (= (select .cse11 (+ |c_~#buffer~0.offset| .cse13 (- 4294967296))) c_~value~0)))) (and (or .cse10 (< .cse12 0)) (<= .cse12 4294967295))))) (= c_~value~0 |c_t2Thread1of1ForFork0_removeLogElement_#res#1|) (or (let ((.cse18 (< .cse27 4294967296)) (.cse21 (< .cse9 (+ .cse16 |c_~#buffer~0.offset| 1))) (.cse20 (+ .cse4 1)) (.cse15 (= .cse16 .cse26)) (.cse22 (< 2147483647 .cse16))) (and (or (and (or .cse14 (and (forall ((v_z_6 Int)) (or (< 4294967295 v_z_6) .cse15 (< (mod .cse16 v_z_6) 2147483648) (< v_z_6 .cse17) .cse18)) (or (forall ((v_z_6 Int)) (or (< 4294967295 v_z_6) (< (mod .cse16 v_z_6) 2147483648) (< v_z_6 .cse17) .cse18)) .cse19))) (or (forall ((v_z_6 Int)) (or (< 4294967295 v_z_6) (< (mod .cse16 v_z_6) 1) (< v_z_6 .cse20) .cse21 (< v_z_6 .cse17) .cse18)) .cse19) (forall ((v_z_6 Int)) (or (< 4294967295 v_z_6) (< (mod .cse16 v_z_6) 1) (< v_z_6 .cse20) .cse21 .cse15 (< v_z_6 .cse17) .cse22)) (forall ((v_z_6 Int)) (or (< 4294967295 v_z_6) (< (mod .cse16 v_z_6) 1) (< v_z_6 .cse20) .cse21 .cse15 (< v_z_6 .cse17) .cse18)) (or .cse19 (forall ((v_z_6 Int)) (or (< 4294967295 v_z_6) (< (mod .cse16 v_z_6) 1) (< v_z_6 .cse20) .cse21 (< v_z_6 .cse17) .cse22)))) .cse23) (or (and (or .cse24 (and (or .cse14 (forall ((v_z_12 Int)) (or (< (mod .cse16 v_z_12) 2147483648) .cse18 (< 4294967295 v_z_12) (< v_z_12 .cse17)))) (forall ((v_z_12 Int)) (or .cse21 (< (mod .cse16 v_z_12) 1) (< 4294967295 v_z_12) .cse22 (< v_z_12 .cse17) (< v_z_12 .cse20))) (forall ((v_z_12 Int)) (or .cse21 (< (mod .cse16 v_z_12) 1) .cse18 (< 4294967295 v_z_12) (< v_z_12 .cse17) (< v_z_12 .cse20))))) (or .cse14 (forall ((v_z_15 Int)) (or (< 4294967295 v_z_15) (< v_z_15 .cse17) (< (mod .cse16 v_z_15) 2147483648) .cse15 .cse18))) (forall ((v_z_15 Int)) (or (< 4294967295 v_z_15) .cse21 (< v_z_15 .cse20) (< v_z_15 .cse17) .cse15 (< (mod .cse16 v_z_15) 1) .cse18)) (forall ((v_z_15 Int)) (or (< 4294967295 v_z_15) .cse21 (< v_z_15 .cse20) (< v_z_15 .cse17) .cse15 (< (mod .cse16 v_z_15) 1) .cse22))) .cse25))) .cse28 .cse6) (let ((.cse29 (mod .cse16 .cse5))) (let ((.cse30 (+ |c_~#buffer~0.offset| .cse29))) (or (< .cse29 1) .cse28 (and (<= .cse30 4294967295) (or (< 2147483647 .cse29) (< .cse30 0))) (and (<= .cse9 .cse30) (or .cse14 (< .cse29 2147483648))) .cse6 (< .cse5 .cse17) (let ((.cse31 (= .cse29 .cse26))) (and (or (and .cse31 .cse19) .cse23) (or (and .cse24 .cse31) .cse25)))))))))) is different from false