./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/stack-2.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/stack-2.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 1c5d098180a5596f0a60d3177354c69a5ee6da68b8191dc75b6c33b291ef0421 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:25:44,437 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:25:44,510 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 19:25:44,515 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:25:44,515 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:25:44,538 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:25:44,538 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:25:44,538 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:25:44,539 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:25:44,542 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:25:44,542 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:25:44,542 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:25:44,543 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:25:44,544 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:25:44,544 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:25:44,544 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:25:44,544 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:25:44,545 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:25:44,546 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:25:44,547 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:25:44,547 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:25:44,547 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:25:44,547 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:25:44,548 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:25:44,548 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:25:44,548 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:25:44,548 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:25:44,548 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:25:44,548 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:25:44,549 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:25:44,549 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:25:44,549 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:25:44,549 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:25:44,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:25:44,549 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:25:44,550 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:25:44,550 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 19:25:44,550 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 19:25:44,550 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:25:44,550 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:25:44,550 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:25:44,553 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:25:44,553 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 -> 1c5d098180a5596f0a60d3177354c69a5ee6da68b8191dc75b6c33b291ef0421 [2024-10-11 19:25:44,737 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:25:44,754 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:25:44,756 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:25:44,757 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:25:44,757 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:25:44,758 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack-2.i [2024-10-11 19:25:46,004 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:25:46,218 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:25:46,219 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack-2.i [2024-10-11 19:25:46,230 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/eca4cd07a/1fad063badf14365abf406c6097eaf16/FLAG69e345be2 [2024-10-11 19:25:46,241 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/eca4cd07a/1fad063badf14365abf406c6097eaf16 [2024-10-11 19:25:46,243 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:25:46,244 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:25:46,245 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:25:46,246 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:25:46,250 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:25:46,250 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:25:46" (1/1) ... [2024-10-11 19:25:46,251 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e8c3237 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:25:46, skipping insertion in model container [2024-10-11 19:25:46,251 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:25:46" (1/1) ... [2024-10-11 19:25:46,286 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:25:46,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:25:46,629 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 19:25:46,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:25:46,707 INFO L204 MainTranslator]: Completed translation [2024-10-11 19:25:46,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:25:46 WrapperNode [2024-10-11 19:25:46,708 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:25:46,709 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 19:25:46,709 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 19:25:46,709 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 19:25:46,713 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:25:46" (1/1) ... [2024-10-11 19:25:46,725 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:25:46" (1/1) ... [2024-10-11 19:25:46,747 INFO L138 Inliner]: procedures = 277, calls = 37, calls flagged for inlining = 13, calls inlined = 14, statements flattened = 161 [2024-10-11 19:25:46,747 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 19:25:46,748 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 19:25:46,748 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 19:25:46,748 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 19:25:46,755 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:25:46" (1/1) ... [2024-10-11 19:25:46,755 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:25:46" (1/1) ... [2024-10-11 19:25:46,758 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:25:46" (1/1) ... [2024-10-11 19:25:46,770 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 5, 7]. 50 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5]. The 1 writes are split as follows [0, 0, 1]. [2024-10-11 19:25:46,771 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:25:46" (1/1) ... [2024-10-11 19:25:46,771 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:25:46" (1/1) ... [2024-10-11 19:25:46,775 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:25:46" (1/1) ... [2024-10-11 19:25:46,777 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:25:46" (1/1) ... [2024-10-11 19:25:46,778 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:25:46" (1/1) ... [2024-10-11 19:25:46,779 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:25:46" (1/1) ... [2024-10-11 19:25:46,781 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 19:25:46,782 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 19:25:46,782 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 19:25:46,782 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 19:25:46,783 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:25:46" (1/1) ... [2024-10-11 19:25:46,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:25:46,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:25:46,814 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 19:25:46,816 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 19:25:46,858 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-10-11 19:25:46,859 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-10-11 19:25:46,859 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-10-11 19:25:46,859 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-10-11 19:25:46,860 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-11 19:25:46,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 19:25:46,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 19:25:46,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 19:25:46,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 19:25:46,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 19:25:46,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 19:25:46,860 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-11 19:25:46,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 19:25:46,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 19:25:46,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 19:25:46,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 19:25:46,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 19:25:46,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 19:25:46,862 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 19:25:46,977 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 19:25:46,978 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 19:25:47,136 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 19:25:47,136 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 19:25:47,261 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 19:25:47,262 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 19:25:47,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:25:47 BoogieIcfgContainer [2024-10-11 19:25:47,262 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 19:25:47,264 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 19:25:47,265 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 19:25:47,267 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 19:25:47,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:25:46" (1/3) ... [2024-10-11 19:25:47,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44493d50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:25:47, skipping insertion in model container [2024-10-11 19:25:47,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:25:46" (2/3) ... [2024-10-11 19:25:47,269 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44493d50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:25:47, skipping insertion in model container [2024-10-11 19:25:47,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:25:47" (3/3) ... [2024-10-11 19:25:47,270 INFO L112 eAbstractionObserver]: Analyzing ICFG stack-2.i [2024-10-11 19:25:47,282 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 19:25:47,282 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-10-11 19:25:47,282 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 19:25:47,342 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-11 19:25:47,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 55 transitions, 124 flow [2024-10-11 19:25:47,396 INFO L124 PetriNetUnfolderBase]: 9/53 cut-off events. [2024-10-11 19:25:47,396 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 19:25:47,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 53 events. 9/53 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 135 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 48. Up to 3 conditions per place. [2024-10-11 19:25:47,399 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 55 transitions, 124 flow [2024-10-11 19:25:47,403 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 52 transitions, 116 flow [2024-10-11 19:25:47,411 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 19:25:47,420 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;@1dbaf177, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 19:25:47,420 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-10-11 19:25:47,429 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 19:25:47,429 INFO L124 PetriNetUnfolderBase]: 1/19 cut-off events. [2024-10-11 19:25:47,429 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 19:25:47,429 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:25:47,430 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:25:47,430 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-11 19:25:47,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:25:47,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1884156541, now seen corresponding path program 1 times [2024-10-11 19:25:47,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:25:47,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087880339] [2024-10-11 19:25:47,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:25:47,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:25:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:25:47,738 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 19:25:47,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:25:47,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087880339] [2024-10-11 19:25:47,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087880339] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:25:47,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:25:47,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:25:47,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865031638] [2024-10-11 19:25:47,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:25:47,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:25:47,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:25:47,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:25:47,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:25:47,786 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-10-11 19:25:47,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 52 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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 19:25:47,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:25:47,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-10-11 19:25:47,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:25:47,980 INFO L124 PetriNetUnfolderBase]: 454/883 cut-off events. [2024-10-11 19:25:47,980 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-10-11 19:25:47,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1645 conditions, 883 events. 454/883 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4507 event pairs, 242 based on Foata normal form. 90/851 useless extension candidates. Maximal degree in co-relation 1570. Up to 512 conditions per place. [2024-10-11 19:25:47,988 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 43 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2024-10-11 19:25:47,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 60 transitions, 227 flow [2024-10-11 19:25:47,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:25:47,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 19:25:47,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2024-10-11 19:25:48,000 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5318181818181819 [2024-10-11 19:25:48,001 INFO L175 Difference]: Start difference. First operand has 50 places, 52 transitions, 116 flow. Second operand 4 states and 117 transitions. [2024-10-11 19:25:48,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 60 transitions, 227 flow [2024-10-11 19:25:48,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 60 transitions, 217 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-11 19:25:48,007 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 100 flow [2024-10-11 19:25:48,009 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2024-10-11 19:25:48,012 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2024-10-11 19:25:48,013 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 100 flow [2024-10-11 19:25:48,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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 19:25:48,013 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:25:48,013 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:25:48,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 19:25:48,014 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-11 19:25:48,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:25:48,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1884156542, now seen corresponding path program 1 times [2024-10-11 19:25:48,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:25:48,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022002000] [2024-10-11 19:25:48,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:25:48,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:25:48,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:25:48,257 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 19:25:48,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:25:48,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022002000] [2024-10-11 19:25:48,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022002000] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:25:48,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:25:48,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:25:48,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352533711] [2024-10-11 19:25:48,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:25:48,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:25:48,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:25:48,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:25:48,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:25:48,276 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-10-11 19:25:48,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 100 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 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 19:25:48,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:25:48,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-10-11 19:25:48,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:25:48,566 INFO L124 PetriNetUnfolderBase]: 750/1388 cut-off events. [2024-10-11 19:25:48,566 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2024-10-11 19:25:48,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2676 conditions, 1388 events. 750/1388 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7411 event pairs, 125 based on Foata normal form. 0/1220 useless extension candidates. Maximal degree in co-relation 807. Up to 848 conditions per place. [2024-10-11 19:25:48,575 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 87 selfloop transitions, 8 changer transitions 0/108 dead transitions. [2024-10-11 19:25:48,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 108 transitions, 423 flow [2024-10-11 19:25:48,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:25:48,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 19:25:48,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 194 transitions. [2024-10-11 19:25:48,578 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5878787878787879 [2024-10-11 19:25:48,579 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 100 flow. Second operand 6 states and 194 transitions. [2024-10-11 19:25:48,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 108 transitions, 423 flow [2024-10-11 19:25:48,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 108 transitions, 415 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-11 19:25:48,581 INFO L231 Difference]: Finished difference. Result has 52 places, 53 transitions, 153 flow [2024-10-11 19:25:48,582 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=153, PETRI_PLACES=52, PETRI_TRANSITIONS=53} [2024-10-11 19:25:48,582 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2024-10-11 19:25:48,583 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 53 transitions, 153 flow [2024-10-11 19:25:48,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 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 19:25:48,583 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:25:48,584 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:25:48,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 19:25:48,584 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-11 19:25:48,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:25:48,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1982671279, now seen corresponding path program 1 times [2024-10-11 19:25:48,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:25:48,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001638099] [2024-10-11 19:25:48,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:25:48,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:25:48,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:25:48,651 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 19:25:48,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:25:48,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001638099] [2024-10-11 19:25:48,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001638099] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:25:48,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:25:48,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:25:48,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378744561] [2024-10-11 19:25:48,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:25:48,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:25:48,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:25:48,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:25:48,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:25:48,654 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-10-11 19:25:48,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 53 transitions, 153 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 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 19:25:48,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:25:48,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-10-11 19:25:48,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:25:48,832 INFO L124 PetriNetUnfolderBase]: 663/1274 cut-off events. [2024-10-11 19:25:48,832 INFO L125 PetriNetUnfolderBase]: For 155/155 co-relation queries the response was YES. [2024-10-11 19:25:48,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2676 conditions, 1274 events. 663/1274 cut-off events. For 155/155 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 6567 event pairs, 176 based on Foata normal form. 34/1197 useless extension candidates. Maximal degree in co-relation 2591. Up to 721 conditions per place. [2024-10-11 19:25:48,838 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 67 selfloop transitions, 6 changer transitions 0/87 dead transitions. [2024-10-11 19:25:48,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 87 transitions, 376 flow [2024-10-11 19:25:48,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:25:48,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 19:25:48,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 160 transitions. [2024-10-11 19:25:48,840 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5818181818181818 [2024-10-11 19:25:48,840 INFO L175 Difference]: Start difference. First operand has 52 places, 53 transitions, 153 flow. Second operand 5 states and 160 transitions. [2024-10-11 19:25:48,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 87 transitions, 376 flow [2024-10-11 19:25:48,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 87 transitions, 374 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-10-11 19:25:48,844 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 161 flow [2024-10-11 19:25:48,844 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=161, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2024-10-11 19:25:48,844 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 6 predicate places. [2024-10-11 19:25:48,845 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 161 flow [2024-10-11 19:25:48,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 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 19:25:48,845 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:25:48,845 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:25:48,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 19:25:48,846 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-11 19:25:48,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:25:48,846 INFO L85 PathProgramCache]: Analyzing trace with hash -606823708, now seen corresponding path program 1 times [2024-10-11 19:25:48,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:25:48,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053981308] [2024-10-11 19:25:48,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:25:48,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:25:48,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:25:48,891 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 19:25:48,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:25:48,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053981308] [2024-10-11 19:25:48,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053981308] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:25:48,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:25:48,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:25:48,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670332645] [2024-10-11 19:25:48,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:25:48,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:25:48,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:25:48,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:25:48,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:25:48,895 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-10-11 19:25:48,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 161 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 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 19:25:48,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:25:48,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-10-11 19:25:48,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:25:49,108 INFO L124 PetriNetUnfolderBase]: 971/1835 cut-off events. [2024-10-11 19:25:49,109 INFO L125 PetriNetUnfolderBase]: For 331/331 co-relation queries the response was YES. [2024-10-11 19:25:49,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4026 conditions, 1835 events. 971/1835 cut-off events. For 331/331 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 9714 event pairs, 464 based on Foata normal form. 0/1713 useless extension candidates. Maximal degree in co-relation 3355. Up to 1051 conditions per place. [2024-10-11 19:25:49,117 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 73 selfloop transitions, 6 changer transitions 0/93 dead transitions. [2024-10-11 19:25:49,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 93 transitions, 429 flow [2024-10-11 19:25:49,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:25:49,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 19:25:49,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2024-10-11 19:25:49,119 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6318181818181818 [2024-10-11 19:25:49,119 INFO L175 Difference]: Start difference. First operand has 56 places, 52 transitions, 161 flow. Second operand 4 states and 139 transitions. [2024-10-11 19:25:49,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 93 transitions, 429 flow [2024-10-11 19:25:49,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 93 transitions, 429 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 19:25:49,124 INFO L231 Difference]: Finished difference. Result has 61 places, 55 transitions, 197 flow [2024-10-11 19:25:49,124 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=197, PETRI_PLACES=61, PETRI_TRANSITIONS=55} [2024-10-11 19:25:49,125 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 11 predicate places. [2024-10-11 19:25:49,125 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 55 transitions, 197 flow [2024-10-11 19:25:49,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 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 19:25:49,126 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:25:49,126 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:25:49,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 19:25:49,126 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 12 more)] === [2024-10-11 19:25:49,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:25:49,127 INFO L85 PathProgramCache]: Analyzing trace with hash 2114840908, now seen corresponding path program 1 times [2024-10-11 19:25:49,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:25:49,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544834010] [2024-10-11 19:25:49,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:25:49,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:25:49,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:25:49,158 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 19:25:49,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:25:49,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544834010] [2024-10-11 19:25:49,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544834010] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:25:49,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:25:49,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:25:49,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131460923] [2024-10-11 19:25:49,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:25:49,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:25:49,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:25:49,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:25:49,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:25:49,162 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-10-11 19:25:49,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 55 transitions, 197 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 19:25:49,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:25:49,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-10-11 19:25:49,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:25:49,330 INFO L124 PetriNetUnfolderBase]: 1096/2029 cut-off events. [2024-10-11 19:25:49,331 INFO L125 PetriNetUnfolderBase]: For 579/579 co-relation queries the response was YES. [2024-10-11 19:25:49,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4873 conditions, 2029 events. 1096/2029 cut-off events. For 579/579 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 10942 event pairs, 514 based on Foata normal form. 22/1932 useless extension candidates. Maximal degree in co-relation 4011. Up to 1284 conditions per place. [2024-10-11 19:25:49,342 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 62 selfloop transitions, 2 changer transitions 0/78 dead transitions. [2024-10-11 19:25:49,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 78 transitions, 397 flow [2024-10-11 19:25:49,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:25:49,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:25:49,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2024-10-11 19:25:49,345 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6424242424242425 [2024-10-11 19:25:49,345 INFO L175 Difference]: Start difference. First operand has 61 places, 55 transitions, 197 flow. Second operand 3 states and 106 transitions. [2024-10-11 19:25:49,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 78 transitions, 397 flow [2024-10-11 19:25:49,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 78 transitions, 391 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-10-11 19:25:49,353 INFO L231 Difference]: Finished difference. Result has 63 places, 56 transitions, 203 flow [2024-10-11 19:25:49,353 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=203, PETRI_PLACES=63, PETRI_TRANSITIONS=56} [2024-10-11 19:25:49,354 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 13 predicate places. [2024-10-11 19:25:49,354 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 56 transitions, 203 flow [2024-10-11 19:25:49,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 19:25:49,355 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:25:49,355 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:25:49,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 19:25:49,355 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-11 19:25:49,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:25:49,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1369334572, now seen corresponding path program 1 times [2024-10-11 19:25:49,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:25:49,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441113011] [2024-10-11 19:25:49,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:25:49,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:25:49,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:25:49,407 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 19:25:49,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:25:49,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441113011] [2024-10-11 19:25:49,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441113011] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:25:49,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:25:49,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:25:49,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28745523] [2024-10-11 19:25:49,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:25:49,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:25:49,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:25:49,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:25:49,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:25:49,413 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-10-11 19:25:49,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 56 transitions, 203 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 19:25:49,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:25:49,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-10-11 19:25:49,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:25:49,570 INFO L124 PetriNetUnfolderBase]: 1006/1856 cut-off events. [2024-10-11 19:25:49,572 INFO L125 PetriNetUnfolderBase]: For 474/474 co-relation queries the response was YES. [2024-10-11 19:25:49,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4370 conditions, 1856 events. 1006/1856 cut-off events. For 474/474 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 9917 event pairs, 361 based on Foata normal form. 14/1750 useless extension candidates. Maximal degree in co-relation 3871. Up to 1410 conditions per place. [2024-10-11 19:25:49,582 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 49 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2024-10-11 19:25:49,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 64 transitions, 313 flow [2024-10-11 19:25:49,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:25:49,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:25:49,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2024-10-11 19:25:49,583 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5818181818181818 [2024-10-11 19:25:49,583 INFO L175 Difference]: Start difference. First operand has 63 places, 56 transitions, 203 flow. Second operand 3 states and 96 transitions. [2024-10-11 19:25:49,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 64 transitions, 313 flow [2024-10-11 19:25:49,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 64 transitions, 303 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-10-11 19:25:49,586 INFO L231 Difference]: Finished difference. Result has 60 places, 53 transitions, 180 flow [2024-10-11 19:25:49,586 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=57, 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=180, PETRI_PLACES=60, PETRI_TRANSITIONS=53} [2024-10-11 19:25:49,587 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 10 predicate places. [2024-10-11 19:25:49,587 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 180 flow [2024-10-11 19:25:49,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 19:25:49,587 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:25:49,587 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:25:49,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 19:25:49,588 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-11 19:25:49,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:25:49,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1602994892, now seen corresponding path program 1 times [2024-10-11 19:25:49,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:25:49,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597799837] [2024-10-11 19:25:49,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:25:49,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:25:49,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:25:49,824 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:25:49,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:25:49,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597799837] [2024-10-11 19:25:49,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597799837] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 19:25:49,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804484844] [2024-10-11 19:25:49,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:25:49,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 19:25:49,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:25:49,827 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 19:25:49,830 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 19:25:49,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:25:49,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 19:25:49,907 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:25:50,086 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:25:50,087 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:25:50,200 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:25:50,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804484844] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:25:50,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 19:25:50,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2024-10-11 19:25:50,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354690297] [2024-10-11 19:25:50,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 19:25:50,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 19:25:50,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:25:50,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 19:25:50,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-10-11 19:25:50,261 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-10-11 19:25:50,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 53 transitions, 180 flow. Second operand has 15 states, 15 states have (on average 19.0) internal successors, (285), 15 states have internal predecessors, (285), 0 states have call successors, (0), 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 19:25:50,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:25:50,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-10-11 19:25:50,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:25:51,522 INFO L124 PetriNetUnfolderBase]: 4128/7722 cut-off events. [2024-10-11 19:25:51,523 INFO L125 PetriNetUnfolderBase]: For 2485/2485 co-relation queries the response was YES. [2024-10-11 19:25:51,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17864 conditions, 7722 events. 4128/7722 cut-off events. For 2485/2485 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 50434 event pairs, 309 based on Foata normal form. 192/7404 useless extension candidates. Maximal degree in co-relation 7413. Up to 1423 conditions per place. [2024-10-11 19:25:51,556 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 327 selfloop transitions, 45 changer transitions 0/386 dead transitions. [2024-10-11 19:25:51,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 386 transitions, 1892 flow [2024-10-11 19:25:51,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 19:25:51,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-10-11 19:25:51,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 685 transitions. [2024-10-11 19:25:51,559 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6227272727272727 [2024-10-11 19:25:51,559 INFO L175 Difference]: Start difference. First operand has 60 places, 53 transitions, 180 flow. Second operand 20 states and 685 transitions. [2024-10-11 19:25:51,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 386 transitions, 1892 flow [2024-10-11 19:25:51,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 386 transitions, 1850 flow, removed 19 selfloop flow, removed 2 redundant places. [2024-10-11 19:25:51,568 INFO L231 Difference]: Finished difference. Result has 92 places, 98 transitions, 592 flow [2024-10-11 19:25:51,568 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=592, PETRI_PLACES=92, PETRI_TRANSITIONS=98} [2024-10-11 19:25:51,569 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 42 predicate places. [2024-10-11 19:25:51,569 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 98 transitions, 592 flow [2024-10-11 19:25:51,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 19.0) internal successors, (285), 15 states have internal predecessors, (285), 0 states have call successors, (0), 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 19:25:51,569 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:25:51,569 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] [2024-10-11 19:25:51,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 19:25:51,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 19:25:51,770 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-11 19:25:51,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:25:51,771 INFO L85 PathProgramCache]: Analyzing trace with hash -268637720, now seen corresponding path program 1 times [2024-10-11 19:25:51,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:25:51,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303788167] [2024-10-11 19:25:51,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:25:51,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:25:51,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:25:51,825 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 19:25:51,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:25:51,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303788167] [2024-10-11 19:25:51,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303788167] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:25:51,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:25:51,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:25:51,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776015919] [2024-10-11 19:25:51,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:25:51,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:25:51,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:25:51,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:25:51,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:25:51,827 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-10-11 19:25:51,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 98 transitions, 592 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 19:25:51,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:25:51,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-10-11 19:25:51,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:25:52,102 INFO L124 PetriNetUnfolderBase]: 1833/3828 cut-off events. [2024-10-11 19:25:52,103 INFO L125 PetriNetUnfolderBase]: For 2279/2279 co-relation queries the response was YES. [2024-10-11 19:25:52,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9379 conditions, 3828 events. 1833/3828 cut-off events. For 2279/2279 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 22305 event pairs, 372 based on Foata normal form. 234/3906 useless extension candidates. Maximal degree in co-relation 9177. Up to 2311 conditions per place. [2024-10-11 19:25:52,119 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 70 selfloop transitions, 4 changer transitions 0/89 dead transitions. [2024-10-11 19:25:52,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 89 transitions, 609 flow [2024-10-11 19:25:52,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:25:52,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:25:52,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2024-10-11 19:25:52,120 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5696969696969697 [2024-10-11 19:25:52,120 INFO L175 Difference]: Start difference. First operand has 92 places, 98 transitions, 592 flow. Second operand 3 states and 94 transitions. [2024-10-11 19:25:52,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 89 transitions, 609 flow [2024-10-11 19:25:52,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 89 transitions, 561 flow, removed 23 selfloop flow, removed 6 redundant places. [2024-10-11 19:25:52,129 INFO L231 Difference]: Finished difference. Result has 83 places, 78 transitions, 389 flow [2024-10-11 19:25:52,129 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=389, PETRI_PLACES=83, PETRI_TRANSITIONS=78} [2024-10-11 19:25:52,130 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 33 predicate places. [2024-10-11 19:25:52,130 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 78 transitions, 389 flow [2024-10-11 19:25:52,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 19:25:52,130 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:25:52,130 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] [2024-10-11 19:25:52,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 19:25:52,130 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-11 19:25:52,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:25:52,130 INFO L85 PathProgramCache]: Analyzing trace with hash 700879737, now seen corresponding path program 1 times [2024-10-11 19:25:52,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:25:52,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615377821] [2024-10-11 19:25:52,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:25:52,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:25:52,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:25:52,186 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 19:25:52,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:25:52,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615377821] [2024-10-11 19:25:52,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615377821] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:25:52,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:25:52,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:25:52,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101561132] [2024-10-11 19:25:52,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:25:52,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:25:52,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:25:52,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:25:52,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:25:52,193 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-10-11 19:25:52,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 78 transitions, 389 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:25:52,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:25:52,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-10-11 19:25:52,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:25:52,496 INFO L124 PetriNetUnfolderBase]: 1838/3730 cut-off events. [2024-10-11 19:25:52,496 INFO L125 PetriNetUnfolderBase]: For 1489/1489 co-relation queries the response was YES. [2024-10-11 19:25:52,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9363 conditions, 3730 events. 1838/3730 cut-off events. For 1489/1489 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 21405 event pairs, 1214 based on Foata normal form. 0/3605 useless extension candidates. Maximal degree in co-relation 7894. Up to 2670 conditions per place. [2024-10-11 19:25:52,511 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 65 selfloop transitions, 3 changer transitions 0/82 dead transitions. [2024-10-11 19:25:52,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 82 transitions, 540 flow [2024-10-11 19:25:52,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:25:52,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 19:25:52,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2024-10-11 19:25:52,513 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2024-10-11 19:25:52,513 INFO L175 Difference]: Start difference. First operand has 83 places, 78 transitions, 389 flow. Second operand 4 states and 100 transitions. [2024-10-11 19:25:52,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 82 transitions, 540 flow [2024-10-11 19:25:52,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 82 transitions, 536 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 19:25:52,519 INFO L231 Difference]: Finished difference. Result has 84 places, 77 transitions, 389 flow [2024-10-11 19:25:52,519 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=389, PETRI_PLACES=84, PETRI_TRANSITIONS=77} [2024-10-11 19:25:52,520 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 34 predicate places. [2024-10-11 19:25:52,520 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 77 transitions, 389 flow [2024-10-11 19:25:52,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:25:52,520 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:25:52,520 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] [2024-10-11 19:25:52,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 19:25:52,521 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-11 19:25:52,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:25:52,521 INFO L85 PathProgramCache]: Analyzing trace with hash 289520536, now seen corresponding path program 1 times [2024-10-11 19:25:52,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:25:52,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423670517] [2024-10-11 19:25:52,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:25:52,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:25:52,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:25:52,736 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 19:25:52,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:25:52,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423670517] [2024-10-11 19:25:52,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423670517] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:25:52,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:25:52,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 19:25:52,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59800253] [2024-10-11 19:25:52,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:25:52,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 19:25:52,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:25:52,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 19:25:52,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 19:25:52,760 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-10-11 19:25:52,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 77 transitions, 389 flow. Second operand has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 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 19:25:52,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:25:52,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-10-11 19:25:52,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:25:53,141 INFO L124 PetriNetUnfolderBase]: 1961/3997 cut-off events. [2024-10-11 19:25:53,142 INFO L125 PetriNetUnfolderBase]: For 1679/1679 co-relation queries the response was YES. [2024-10-11 19:25:53,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9865 conditions, 3997 events. 1961/3997 cut-off events. For 1679/1679 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 23178 event pairs, 461 based on Foata normal form. 0/3837 useless extension candidates. Maximal degree in co-relation 8395. Up to 2936 conditions per place. [2024-10-11 19:25:53,156 INFO L140 encePairwiseOnDemand]: 46/55 looper letters, 110 selfloop transitions, 9 changer transitions 0/132 dead transitions. [2024-10-11 19:25:53,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 132 transitions, 797 flow [2024-10-11 19:25:53,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 19:25:53,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-11 19:25:53,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 219 transitions. [2024-10-11 19:25:53,160 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49772727272727274 [2024-10-11 19:25:53,160 INFO L175 Difference]: Start difference. First operand has 84 places, 77 transitions, 389 flow. Second operand 8 states and 219 transitions. [2024-10-11 19:25:53,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 132 transitions, 797 flow [2024-10-11 19:25:53,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 132 transitions, 787 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-11 19:25:53,169 INFO L231 Difference]: Finished difference. Result has 91 places, 82 transitions, 442 flow [2024-10-11 19:25:53,169 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=442, PETRI_PLACES=91, PETRI_TRANSITIONS=82} [2024-10-11 19:25:53,169 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 41 predicate places. [2024-10-11 19:25:53,169 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 82 transitions, 442 flow [2024-10-11 19:25:53,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 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 19:25:53,169 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:25:53,170 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 19:25:53,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 19:25:53,170 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-11 19:25:53,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:25:53,170 INFO L85 PathProgramCache]: Analyzing trace with hash -798695038, now seen corresponding path program 1 times [2024-10-11 19:25:53,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:25:53,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684028018] [2024-10-11 19:25:53,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:25:53,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:25:53,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:25:53,209 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 19:25:53,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:25:53,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684028018] [2024-10-11 19:25:53,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684028018] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:25:53,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:25:53,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:25:53,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199770789] [2024-10-11 19:25:53,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:25:53,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:25:53,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:25:53,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:25:53,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:25:53,212 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-10-11 19:25:53,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 82 transitions, 442 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 19:25:53,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:25:53,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-10-11 19:25:53,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:25:53,610 INFO L124 PetriNetUnfolderBase]: 2879/6069 cut-off events. [2024-10-11 19:25:53,610 INFO L125 PetriNetUnfolderBase]: For 3090/3090 co-relation queries the response was YES. [2024-10-11 19:25:53,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15027 conditions, 6069 events. 2879/6069 cut-off events. For 3090/3090 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 40506 event pairs, 1373 based on Foata normal form. 137/5984 useless extension candidates. Maximal degree in co-relation 13000. Up to 3403 conditions per place. [2024-10-11 19:25:53,637 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 124 selfloop transitions, 2 changer transitions 0/140 dead transitions. [2024-10-11 19:25:53,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 140 transitions, 1054 flow [2024-10-11 19:25:53,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:25:53,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:25:53,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2024-10-11 19:25:53,638 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6484848484848484 [2024-10-11 19:25:53,638 INFO L175 Difference]: Start difference. First operand has 91 places, 82 transitions, 442 flow. Second operand 3 states and 107 transitions. [2024-10-11 19:25:53,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 140 transitions, 1054 flow [2024-10-11 19:25:53,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 140 transitions, 1038 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-11 19:25:53,649 INFO L231 Difference]: Finished difference. Result has 90 places, 83 transitions, 445 flow [2024-10-11 19:25:53,649 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=445, PETRI_PLACES=90, PETRI_TRANSITIONS=83} [2024-10-11 19:25:53,649 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 40 predicate places. [2024-10-11 19:25:53,650 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 83 transitions, 445 flow [2024-10-11 19:25:53,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 19:25:53,650 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:25:53,650 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 19:25:53,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 19:25:53,650 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-11 19:25:53,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:25:53,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1104727326, now seen corresponding path program 1 times [2024-10-11 19:25:53,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:25:53,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502178646] [2024-10-11 19:25:53,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:25:53,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:25:53,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:25:53,705 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 19:25:53,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:25:53,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502178646] [2024-10-11 19:25:53,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502178646] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:25:53,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:25:53,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:25:53,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888198317] [2024-10-11 19:25:53,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:25:53,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:25:53,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:25:53,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:25:53,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:25:53,708 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-10-11 19:25:53,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 83 transitions, 445 flow. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 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 19:25:53,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:25:53,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-10-11 19:25:53,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:25:54,198 INFO L124 PetriNetUnfolderBase]: 3194/6487 cut-off events. [2024-10-11 19:25:54,198 INFO L125 PetriNetUnfolderBase]: For 4314/4314 co-relation queries the response was YES. [2024-10-11 19:25:54,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17920 conditions, 6487 events. 3194/6487 cut-off events. For 4314/4314 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 42398 event pairs, 475 based on Foata normal form. 105/6410 useless extension candidates. Maximal degree in co-relation 14840. Up to 2632 conditions per place. [2024-10-11 19:25:54,224 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 109 selfloop transitions, 10 changer transitions 0/133 dead transitions. [2024-10-11 19:25:54,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 133 transitions, 930 flow [2024-10-11 19:25:54,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:25:54,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 19:25:54,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 152 transitions. [2024-10-11 19:25:54,226 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5527272727272727 [2024-10-11 19:25:54,226 INFO L175 Difference]: Start difference. First operand has 90 places, 83 transitions, 445 flow. Second operand 5 states and 152 transitions. [2024-10-11 19:25:54,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 133 transitions, 930 flow [2024-10-11 19:25:54,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 133 transitions, 923 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-10-11 19:25:54,238 INFO L231 Difference]: Finished difference. Result has 96 places, 88 transitions, 519 flow [2024-10-11 19:25:54,238 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=519, PETRI_PLACES=96, PETRI_TRANSITIONS=88} [2024-10-11 19:25:54,238 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 46 predicate places. [2024-10-11 19:25:54,239 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 88 transitions, 519 flow [2024-10-11 19:25:54,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 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 19:25:54,239 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:25:54,239 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 19:25:54,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 19:25:54,239 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-11 19:25:54,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:25:54,239 INFO L85 PathProgramCache]: Analyzing trace with hash 428939891, now seen corresponding path program 1 times [2024-10-11 19:25:54,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:25:54,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717062770] [2024-10-11 19:25:54,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:25:54,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:25:54,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:25:54,729 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 19:25:54,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:25:54,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717062770] [2024-10-11 19:25:54,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717062770] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:25:54,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:25:54,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 19:25:54,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156215791] [2024-10-11 19:25:54,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:25:54,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 19:25:54,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:25:54,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 19:25:54,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-11 19:25:54,778 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-10-11 19:25:54,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 88 transitions, 519 flow. Second operand has 10 states, 10 states have (on average 18.9) internal successors, (189), 10 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:25:54,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:25:54,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-10-11 19:25:54,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:25:55,874 INFO L124 PetriNetUnfolderBase]: 4726/9654 cut-off events. [2024-10-11 19:25:55,874 INFO L125 PetriNetUnfolderBase]: For 8698/8698 co-relation queries the response was YES. [2024-10-11 19:25:55,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26991 conditions, 9654 events. 4726/9654 cut-off events. For 8698/8698 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 67172 event pairs, 1022 based on Foata normal form. 24/9464 useless extension candidates. Maximal degree in co-relation 21486. Up to 4678 conditions per place. [2024-10-11 19:25:55,915 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 187 selfloop transitions, 25 changer transitions 0/226 dead transitions. [2024-10-11 19:25:55,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 226 transitions, 1602 flow [2024-10-11 19:25:55,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 19:25:55,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-11 19:25:55,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 339 transitions. [2024-10-11 19:25:55,916 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5136363636363637 [2024-10-11 19:25:55,916 INFO L175 Difference]: Start difference. First operand has 96 places, 88 transitions, 519 flow. Second operand 12 states and 339 transitions. [2024-10-11 19:25:55,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 226 transitions, 1602 flow [2024-10-11 19:25:55,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 226 transitions, 1600 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 19:25:55,943 INFO L231 Difference]: Finished difference. Result has 112 places, 105 transitions, 735 flow [2024-10-11 19:25:55,943 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=735, PETRI_PLACES=112, PETRI_TRANSITIONS=105} [2024-10-11 19:25:55,943 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 62 predicate places. [2024-10-11 19:25:55,943 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 105 transitions, 735 flow [2024-10-11 19:25:55,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.9) internal successors, (189), 10 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:25:55,944 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:25:55,944 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, 1] [2024-10-11 19:25:55,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 19:25:55,944 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-11 19:25:55,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:25:55,944 INFO L85 PathProgramCache]: Analyzing trace with hash -2104434424, now seen corresponding path program 1 times [2024-10-11 19:25:55,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:25:55,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240064755] [2024-10-11 19:25:55,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:25:55,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:25:55,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:25:55,984 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 19:25:55,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:25:55,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240064755] [2024-10-11 19:25:55,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240064755] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 19:25:55,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352897731] [2024-10-11 19:25:55,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:25:55,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 19:25:55,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:25:55,987 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 19:25:55,988 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 19:25:56,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:25:56,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 19:25:56,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:25:56,089 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 19:25:56,089 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:25:56,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352897731] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:25:56,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 19:25:56,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2024-10-11 19:25:56,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718178892] [2024-10-11 19:25:56,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:25:56,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:25:56,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:25:56,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:25:56,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:25:56,095 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-10-11 19:25:56,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 105 transitions, 735 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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 19:25:56,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:25:56,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-10-11 19:25:56,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:25:56,880 INFO L124 PetriNetUnfolderBase]: 4723/9548 cut-off events. [2024-10-11 19:25:56,880 INFO L125 PetriNetUnfolderBase]: For 11717/11717 co-relation queries the response was YES. [2024-10-11 19:25:56,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28284 conditions, 9548 events. 4723/9548 cut-off events. For 11717/11717 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 67235 event pairs, 3763 based on Foata normal form. 31/9347 useless extension candidates. Maximal degree in co-relation 22595. Up to 8111 conditions per place. [2024-10-11 19:25:56,919 INFO L140 encePairwiseOnDemand]: 53/55 looper letters, 89 selfloop transitions, 1 changer transitions 2/104 dead transitions. [2024-10-11 19:25:56,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 104 transitions, 915 flow [2024-10-11 19:25:56,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:25:56,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:25:56,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-10-11 19:25:56,920 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2024-10-11 19:25:56,920 INFO L175 Difference]: Start difference. First operand has 112 places, 105 transitions, 735 flow. Second operand 3 states and 80 transitions. [2024-10-11 19:25:56,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 104 transitions, 915 flow [2024-10-11 19:25:56,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 104 transitions, 895 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-10-11 19:25:56,951 INFO L231 Difference]: Finished difference. Result has 109 places, 102 transitions, 710 flow [2024-10-11 19:25:56,951 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=713, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=710, PETRI_PLACES=109, PETRI_TRANSITIONS=102} [2024-10-11 19:25:56,952 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 59 predicate places. [2024-10-11 19:25:56,952 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 102 transitions, 710 flow [2024-10-11 19:25:56,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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 19:25:56,952 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:25:56,952 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] [2024-10-11 19:25:56,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 19:25:57,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 19:25:57,154 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-11 19:25:57,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:25:57,154 INFO L85 PathProgramCache]: Analyzing trace with hash -544958678, now seen corresponding path program 1 times [2024-10-11 19:25:57,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:25:57,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761670098] [2024-10-11 19:25:57,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:25:57,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:25:57,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:25:57,594 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:25:57,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:25:57,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761670098] [2024-10-11 19:25:57,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761670098] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 19:25:57,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211092595] [2024-10-11 19:25:57,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:25:57,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 19:25:57,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:25:57,597 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 19:25:57,599 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 19:25:57,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:25:57,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-11 19:25:57,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:25:57,926 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:25:57,927 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:25:58,139 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:25:58,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211092595] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:25:58,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 19:25:58,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 17 [2024-10-11 19:25:58,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932109717] [2024-10-11 19:25:58,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 19:25:58,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 19:25:58,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:25:58,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 19:25:58,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2024-10-11 19:25:58,231 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-10-11 19:25:58,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 102 transitions, 710 flow. Second operand has 19 states, 19 states have (on average 19.94736842105263) internal successors, (379), 19 states have internal predecessors, (379), 0 states have call successors, (0), 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 19:25:58,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:25:58,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-10-11 19:25:58,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:26:01,029 INFO L124 PetriNetUnfolderBase]: 9891/19923 cut-off events. [2024-10-11 19:26:01,030 INFO L125 PetriNetUnfolderBase]: For 24096/24096 co-relation queries the response was YES. [2024-10-11 19:26:01,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58591 conditions, 19923 events. 9891/19923 cut-off events. For 24096/24096 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 154678 event pairs, 1511 based on Foata normal form. 181/19618 useless extension candidates. Maximal degree in co-relation 58549. Up to 3188 conditions per place. [2024-10-11 19:26:01,117 INFO L140 encePairwiseOnDemand]: 45/55 looper letters, 361 selfloop transitions, 94 changer transitions 0/466 dead transitions. [2024-10-11 19:26:01,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 466 transitions, 3630 flow [2024-10-11 19:26:01,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 19:26:01,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-10-11 19:26:01,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 660 transitions. [2024-10-11 19:26:01,119 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2024-10-11 19:26:01,119 INFO L175 Difference]: Start difference. First operand has 109 places, 102 transitions, 710 flow. Second operand 22 states and 660 transitions. [2024-10-11 19:26:01,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 466 transitions, 3630 flow [2024-10-11 19:26:01,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 466 transitions, 3627 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-10-11 19:26:01,186 INFO L231 Difference]: Finished difference. Result has 143 places, 168 transitions, 1670 flow [2024-10-11 19:26:01,186 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1670, PETRI_PLACES=143, PETRI_TRANSITIONS=168} [2024-10-11 19:26:01,186 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 93 predicate places. [2024-10-11 19:26:01,186 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 168 transitions, 1670 flow [2024-10-11 19:26:01,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 19.94736842105263) internal successors, (379), 19 states have internal predecessors, (379), 0 states have call successors, (0), 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 19:26:01,187 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:26:01,187 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] [2024-10-11 19:26:01,199 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 19:26:01,387 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 19:26:01,387 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-11 19:26:01,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:26:01,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1146432797, now seen corresponding path program 1 times [2024-10-11 19:26:01,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:26:01,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326249234] [2024-10-11 19:26:01,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:26:01,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:26:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:26:01,500 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:26:01,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:26:01,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326249234] [2024-10-11 19:26:01,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326249234] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 19:26:01,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454613718] [2024-10-11 19:26:01,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:26:01,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 19:26:01,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:26:01,502 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 19:26:01,503 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 19:26:01,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:26:01,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 19:26:01,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:26:01,634 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:26:01,635 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:26:01,662 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:26:01,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454613718] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:26:01,662 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 19:26:01,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2024-10-11 19:26:01,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927205426] [2024-10-11 19:26:01,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 19:26:01,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 19:26:01,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:26:01,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 19:26:01,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:26:01,668 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-10-11 19:26:01,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 168 transitions, 1670 flow. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 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 19:26:01,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:26:01,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-10-11 19:26:01,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:26:03,810 INFO L124 PetriNetUnfolderBase]: 8507/17297 cut-off events. [2024-10-11 19:26:03,810 INFO L125 PetriNetUnfolderBase]: For 38219/38219 co-relation queries the response was YES. [2024-10-11 19:26:03,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55467 conditions, 17297 events. 8507/17297 cut-off events. For 38219/38219 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 127443 event pairs, 2441 based on Foata normal form. 14/16896 useless extension candidates. Maximal degree in co-relation 55408. Up to 12999 conditions per place. [2024-10-11 19:26:03,905 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 175 selfloop transitions, 15 changer transitions 0/202 dead transitions. [2024-10-11 19:26:03,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 202 transitions, 2099 flow [2024-10-11 19:26:03,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:26:03,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 19:26:03,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 186 transitions. [2024-10-11 19:26:03,906 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5636363636363636 [2024-10-11 19:26:03,906 INFO L175 Difference]: Start difference. First operand has 143 places, 168 transitions, 1670 flow. Second operand 6 states and 186 transitions. [2024-10-11 19:26:03,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 202 transitions, 2099 flow [2024-10-11 19:26:04,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 202 transitions, 1998 flow, removed 46 selfloop flow, removed 3 redundant places. [2024-10-11 19:26:04,046 INFO L231 Difference]: Finished difference. Result has 148 places, 154 transitions, 1476 flow [2024-10-11 19:26:04,047 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=1389, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1476, PETRI_PLACES=148, PETRI_TRANSITIONS=154} [2024-10-11 19:26:04,047 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 98 predicate places. [2024-10-11 19:26:04,047 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 154 transitions, 1476 flow [2024-10-11 19:26:04,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 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 19:26:04,047 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:26:04,048 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] [2024-10-11 19:26:04,060 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 19:26:04,251 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,SelfDestructingSolverStorable15 [2024-10-11 19:26:04,251 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-11 19:26:04,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:26:04,252 INFO L85 PathProgramCache]: Analyzing trace with hash -200995681, now seen corresponding path program 1 times [2024-10-11 19:26:04,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:26:04,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885977921] [2024-10-11 19:26:04,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:26:04,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:26:04,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 19:26:04,265 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 19:26:04,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 19:26:04,300 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 19:26:04,300 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 19:26:04,301 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t2Err2ASSERT_VIOLATIONMEMORY_LEAK (14 of 15 remaining) [2024-10-11 19:26:04,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (13 of 15 remaining) [2024-10-11 19:26:04,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 15 remaining) [2024-10-11 19:26:04,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 15 remaining) [2024-10-11 19:26:04,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2024-10-11 19:26:04,303 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2024-10-11 19:26:04,303 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONMEMORY_LEAK (8 of 15 remaining) [2024-10-11 19:26:04,303 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2024-10-11 19:26:04,303 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2024-10-11 19:26:04,303 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONMEMORY_LEAK (5 of 15 remaining) [2024-10-11 19:26:04,303 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2024-10-11 19:26:04,303 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2024-10-11 19:26:04,303 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONMEMORY_LEAK (2 of 15 remaining) [2024-10-11 19:26:04,303 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 15 remaining) [2024-10-11 19:26:04,303 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 15 remaining) [2024-10-11 19:26:04,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 19:26:04,304 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:26:04,354 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 19:26:04,355 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 19:26:04,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:26:04 BasicIcfg [2024-10-11 19:26:04,360 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 19:26:04,361 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 19:26:04,361 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 19:26:04,361 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 19:26:04,361 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:25:47" (3/4) ... [2024-10-11 19:26:04,362 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 19:26:04,363 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 19:26:04,363 INFO L158 Benchmark]: Toolchain (without parser) took 18119.83ms. Allocated memory was 192.9MB in the beginning and 4.9GB in the end (delta: 4.7GB). Free memory was 123.1MB in the beginning and 4.1GB in the end (delta: -3.9GB). Peak memory consumption was 760.1MB. Max. memory is 16.1GB. [2024-10-11 19:26:04,364 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 109.1MB. Free memory is still 73.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:26:04,364 INFO L158 Benchmark]: CACSL2BoogieTranslator took 463.22ms. Allocated memory is still 192.9MB. Free memory was 122.9MB in the beginning and 142.9MB in the end (delta: -20.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 19:26:04,364 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.75ms. Allocated memory is still 192.9MB. Free memory was 142.9MB in the beginning and 140.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 19:26:04,365 INFO L158 Benchmark]: Boogie Preprocessor took 33.73ms. Allocated memory is still 192.9MB. Free memory was 140.2MB in the beginning and 137.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 19:26:04,365 INFO L158 Benchmark]: RCFGBuilder took 480.77ms. Allocated memory is still 192.9MB. Free memory was 137.6MB in the beginning and 96.2MB in the end (delta: 41.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-10-11 19:26:04,366 INFO L158 Benchmark]: TraceAbstraction took 17096.09ms. Allocated memory was 192.9MB in the beginning and 4.9GB in the end (delta: 4.7GB). Free memory was 95.7MB in the beginning and 4.1GB in the end (delta: -4.0GB). Peak memory consumption was 733.8MB. Max. memory is 16.1GB. [2024-10-11 19:26:04,366 INFO L158 Benchmark]: Witness Printer took 2.59ms. Allocated memory is still 4.9GB. Free memory is still 4.1GB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:26:04,367 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 109.1MB. Free memory is still 73.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 463.22ms. Allocated memory is still 192.9MB. Free memory was 122.9MB in the beginning and 142.9MB in the end (delta: -20.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.75ms. Allocated memory is still 192.9MB. Free memory was 142.9MB in the beginning and 140.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.73ms. Allocated memory is still 192.9MB. Free memory was 140.2MB in the beginning and 137.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 480.77ms. Allocated memory is still 192.9MB. Free memory was 137.6MB in the beginning and 96.2MB in the end (delta: 41.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 17096.09ms. Allocated memory was 192.9MB in the beginning and 4.9GB in the end (delta: 4.7GB). Free memory was 95.7MB in the beginning and 4.1GB in the end (delta: -4.0GB). Peak memory consumption was 733.8MB. Max. memory is 16.1GB. * Witness Printer took 2.59ms. Allocated memory is still 4.9GB. Free memory is still 4.1GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 20]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 20. Possible FailurePath: [L935] 0 static int top=0; [L936] 0 static unsigned int arr[(5)]; [L936] 0 static unsigned int arr[(5)]; [L936] 0 static unsigned int arr[(5)]; [L936] 0 static unsigned int arr[(5)]; [L936] 0 static unsigned int arr[(5)]; [L936] 0 static unsigned int arr[(5)]; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L938] 0 _Bool flag=(0); [L1021] 0 pthread_t id1, id2; [L1023] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={3:0}, flag=0, id1=-1, m={4:0}, top=0] [L990] 1 int i; [L991] 1 unsigned int tmp; [L992] 1 i=0 VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L992] COND TRUE 1 i<(5) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L1024] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arr={3:0}, flag=0, id1=-1, id2=0, m={4:0}, top=0] [L1006] 2 int i; [L1007] 2 i=0 VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L995] 1 tmp = __VERIFIER_nondet_uint() [L996] CALL 1 assume_abort_if_not(tmp < (5)) [L23] COND FALSE 1 !(!cond) [L996] RET 1 assume_abort_if_not(tmp < (5)) [L997] CALL, EXPR 1 push(arr,tmp) [L962] COND FALSE 1 !(top==(5)) [L969] CALL, EXPR 1 get_top() [L954] 1 return top; [L969] RET, EXPR 1 get_top() [L969] 1 stack[get_top()] = x [L970] CALL 1 inc_top() [L946] 1 top++ [L970] RET 1 inc_top() [L972] 1 return 0; VAL [\old(stack)={3:0}, \old(x)=0, \result=0, arr={3:0}, flag=0, m={4:0}, stack={3:0}, top=1, x=0] [L997] RET, EXPR 1 push(arr,tmp) [L997] COND FALSE 1 !(push(arr,tmp)==(-1)) [L999] 1 flag=(1) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, tmp=0, top=1] [L1007] COND TRUE 2 i<(5) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, top=1] [L1010] COND TRUE 2 \read(flag) [L1012] CALL, EXPR 2 pop(arr) [L976] CALL, EXPR 2 get_top() [L954] 2 return top; [L976] RET, EXPR 2 get_top() [L976] COND FALSE 2 !(get_top()==0) [L983] CALL 2 dec_top() [L950] 2 top-- [L983] RET 2 dec_top() [L984] CALL, EXPR 2 get_top() [L954] 2 return top; [L984] RET, EXPR 2 get_top() [L984] EXPR 2 stack[get_top()] [L984] 2 return stack[get_top()]; [L1012] RET, EXPR 2 pop(arr) [L1012] COND FALSE 2 !(!(pop(arr)!=(-2))) [L1007] 2 i++ VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1007] COND TRUE 2 i<(5) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1010] COND TRUE 2 \read(flag) [L1012] CALL, EXPR 2 pop(arr) [L976] CALL, EXPR 2 get_top() [L954] 2 return top; [L976] RET, EXPR 2 get_top() [L976] COND TRUE 2 get_top()==0 [L979] 2 return (-2); VAL [\old(stack)={3:0}, \result=-2, arr={3:0}, flag=1, m={4:0}, stack={3:0}, top=0] [L1012] RET, EXPR 2 pop(arr) [L1012] COND TRUE 2 !(pop(arr)!=(-2)) [L1013] CALL 2 error() [L941] CALL 2 reach_error() [L20] COND FALSE 2 !(0) VAL [arr={3:0}, flag=1, m={4:0}, top=0] [L20] 2 __assert_fail ("0", "stack-2.c", 3, __extension__ __PRETTY_FUNCTION__) VAL [arr={3:0}, flag=1, m={4:0}, top=0] - UnprovableResult [Line: 1019]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1024]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 20]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 85 locations, 15 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 16.9s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1527 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1476 mSDsluCounter, 182 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 178 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4560 IncrementalHoareTripleChecker+Invalid, 4603 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 4 mSDtfsCounter, 4560 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 296 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1670occurred in iteration=15, InterpolantAutomatonStates: 111, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 452 NumberOfCodeBlocks, 452 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 475 ConstructedInterpolants, 0 QuantifiedInterpolants, 3925 SizeOfPredicates, 14 NumberOfNonLiveVariables, 867 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 23 InterpolantComputations, 13 PerfectInterpolantSequences, 7/65 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 19:26:04,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /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/stack-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 1c5d098180a5596f0a60d3177354c69a5ee6da68b8191dc75b6c33b291ef0421 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:26:06,325 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:26:06,381 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-11 19:26:06,386 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:26:06,387 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:26:06,419 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:26:06,420 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:26:06,422 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:26:06,422 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:26:06,422 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:26:06,423 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:26:06,423 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:26:06,423 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:26:06,424 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:26:06,424 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:26:06,424 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:26:06,424 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:26:06,424 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:26:06,425 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:26:06,425 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:26:06,427 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:26:06,428 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:26:06,428 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:26:06,428 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:26:06,428 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:26:06,428 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 19:26:06,429 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:26:06,429 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 19:26:06,429 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:26:06,429 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:26:06,429 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:26:06,430 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:26:06,430 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:26:06,430 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:26:06,430 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:26:06,430 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:26:06,430 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:26:06,431 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:26:06,431 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 19:26:06,431 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 19:26:06,433 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:26:06,433 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:26:06,434 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:26:06,434 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:26:06,434 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 19:26:06,435 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 -> 1c5d098180a5596f0a60d3177354c69a5ee6da68b8191dc75b6c33b291ef0421 [2024-10-11 19:26:06,676 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:26:06,691 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:26:06,694 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:26:06,695 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:26:06,696 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:26:06,696 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack-2.i [2024-10-11 19:26:07,912 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:26:08,123 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:26:08,123 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack-2.i [2024-10-11 19:26:08,138 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b8adfbcba/2119b1a0a60f4ed7a8edebb9ca9e1849/FLAG1bf528e5b [2024-10-11 19:26:08,474 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b8adfbcba/2119b1a0a60f4ed7a8edebb9ca9e1849 [2024-10-11 19:26:08,475 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:26:08,477 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:26:08,477 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:26:08,478 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:26:08,481 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:26:08,482 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:26:08" (1/1) ... [2024-10-11 19:26:08,483 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41b34fcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:08, skipping insertion in model container [2024-10-11 19:26:08,483 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:26:08" (1/1) ... [2024-10-11 19:26:08,514 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:26:08,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:26:08,850 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 19:26:08,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:26:08,954 INFO L204 MainTranslator]: Completed translation [2024-10-11 19:26:08,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:08 WrapperNode [2024-10-11 19:26:08,955 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:26:08,955 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 19:26:08,956 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 19:26:08,956 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 19:26:08,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:08" (1/1) ... [2024-10-11 19:26:08,976 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:08" (1/1) ... [2024-10-11 19:26:08,997 INFO L138 Inliner]: procedures = 281, calls = 37, calls flagged for inlining = 13, calls inlined = 14, statements flattened = 157 [2024-10-11 19:26:08,997 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 19:26:08,998 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 19:26:08,998 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 19:26:08,998 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 19:26:09,006 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:08" (1/1) ... [2024-10-11 19:26:09,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:08" (1/1) ... [2024-10-11 19:26:09,012 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:08" (1/1) ... [2024-10-11 19:26:09,027 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 5, 7]. 50 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5]. The 1 writes are split as follows [0, 0, 1]. [2024-10-11 19:26:09,028 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:08" (1/1) ... [2024-10-11 19:26:09,028 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:08" (1/1) ... [2024-10-11 19:26:09,034 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:08" (1/1) ... [2024-10-11 19:26:09,039 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:08" (1/1) ... [2024-10-11 19:26:09,042 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:08" (1/1) ... [2024-10-11 19:26:09,043 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:08" (1/1) ... [2024-10-11 19:26:09,045 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 19:26:09,046 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 19:26:09,046 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 19:26:09,046 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 19:26:09,047 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:08" (1/1) ... [2024-10-11 19:26:09,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:26:09,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:26:09,070 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 19:26:09,075 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 19:26:09,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 19:26:09,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 19:26:09,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-11 19:26:09,106 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-10-11 19:26:09,106 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-10-11 19:26:09,106 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-10-11 19:26:09,106 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-10-11 19:26:09,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 19:26:09,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 19:26:09,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-11 19:26:09,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 19:26:09,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 19:26:09,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 19:26:09,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-11 19:26:09,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-11 19:26:09,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-11 19:26:09,107 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-11 19:26:09,107 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-11 19:26:09,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 19:26:09,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 19:26:09,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 19:26:09,111 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 19:26:09,263 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 19:26:09,264 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 19:26:09,516 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 19:26:09,516 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 19:26:09,686 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 19:26:09,687 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 19:26:09,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:26:09 BoogieIcfgContainer [2024-10-11 19:26:09,687 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 19:26:09,690 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 19:26:09,690 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 19:26:09,693 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 19:26:09,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:26:08" (1/3) ... [2024-10-11 19:26:09,693 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24f500a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:26:09, skipping insertion in model container [2024-10-11 19:26:09,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:26:08" (2/3) ... [2024-10-11 19:26:09,694 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24f500a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:26:09, skipping insertion in model container [2024-10-11 19:26:09,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:26:09" (3/3) ... [2024-10-11 19:26:09,695 INFO L112 eAbstractionObserver]: Analyzing ICFG stack-2.i [2024-10-11 19:26:09,707 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 19:26:09,708 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-10-11 19:26:09,708 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 19:26:09,756 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-11 19:26:09,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 55 transitions, 124 flow [2024-10-11 19:26:09,798 INFO L124 PetriNetUnfolderBase]: 9/53 cut-off events. [2024-10-11 19:26:09,798 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 19:26:09,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 53 events. 9/53 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 137 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 48. Up to 3 conditions per place. [2024-10-11 19:26:09,801 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 55 transitions, 124 flow [2024-10-11 19:26:09,804 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 52 transitions, 116 flow [2024-10-11 19:26:09,814 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 19:26:09,820 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;@619201ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 19:26:09,820 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-10-11 19:26:09,825 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 19:26:09,825 INFO L124 PetriNetUnfolderBase]: 1/19 cut-off events. [2024-10-11 19:26:09,825 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 19:26:09,825 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:26:09,826 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:26:09,826 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-11 19:26:09,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:26:09,831 INFO L85 PathProgramCache]: Analyzing trace with hash -472343716, now seen corresponding path program 1 times [2024-10-11 19:26:09,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:26:09,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1087829959] [2024-10-11 19:26:09,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:26:09,840 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:26:09,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:26:09,841 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:26:09,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 19:26:09,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:26:09,932 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 19:26:09,935 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:26:10,038 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 19:26:10,038 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:26:10,038 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:26:10,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1087829959] [2024-10-11 19:26:10,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1087829959] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:26:10,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:26:10,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:26:10,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064867607] [2024-10-11 19:26:10,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:26:10,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:26:10,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:26:10,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:26:10,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:26:10,088 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-10-11 19:26:10,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 52 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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 19:26:10,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:26:10,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-10-11 19:26:10,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:26:10,331 INFO L124 PetriNetUnfolderBase]: 454/883 cut-off events. [2024-10-11 19:26:10,332 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-10-11 19:26:10,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1645 conditions, 883 events. 454/883 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4544 event pairs, 242 based on Foata normal form. 90/851 useless extension candidates. Maximal degree in co-relation 1570. Up to 512 conditions per place. [2024-10-11 19:26:10,342 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 43 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2024-10-11 19:26:10,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 60 transitions, 227 flow [2024-10-11 19:26:10,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:26:10,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 19:26:10,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2024-10-11 19:26:10,369 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5318181818181819 [2024-10-11 19:26:10,371 INFO L175 Difference]: Start difference. First operand has 50 places, 52 transitions, 116 flow. Second operand 4 states and 117 transitions. [2024-10-11 19:26:10,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 60 transitions, 227 flow [2024-10-11 19:26:10,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 60 transitions, 217 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-11 19:26:10,383 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 100 flow [2024-10-11 19:26:10,385 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2024-10-11 19:26:10,388 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2024-10-11 19:26:10,388 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 100 flow [2024-10-11 19:26:10,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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 19:26:10,388 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:26:10,388 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:26:10,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 19:26:10,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:26:10,591 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-11 19:26:10,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:26:10,592 INFO L85 PathProgramCache]: Analyzing trace with hash -472343715, now seen corresponding path program 1 times [2024-10-11 19:26:10,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:26:10,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [442722374] [2024-10-11 19:26:10,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:26:10,593 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:26:10,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:26:10,595 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:26:10,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 19:26:10,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:26:10,667 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 19:26:10,668 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:26:10,805 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 19:26:10,806 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:26:10,806 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:26:10,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [442722374] [2024-10-11 19:26:10,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [442722374] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:26:10,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:26:10,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:26:10,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430572391] [2024-10-11 19:26:10,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:26:10,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:26:10,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:26:10,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:26:10,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:26:10,830 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-10-11 19:26:10,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 100 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 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 19:26:10,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:26:10,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-10-11 19:26:10,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:26:11,147 INFO L124 PetriNetUnfolderBase]: 750/1388 cut-off events. [2024-10-11 19:26:11,148 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2024-10-11 19:26:11,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2676 conditions, 1388 events. 750/1388 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7437 event pairs, 125 based on Foata normal form. 0/1220 useless extension candidates. Maximal degree in co-relation 807. Up to 848 conditions per place. [2024-10-11 19:26:11,153 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 87 selfloop transitions, 8 changer transitions 0/108 dead transitions. [2024-10-11 19:26:11,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 108 transitions, 423 flow [2024-10-11 19:26:11,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:26:11,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 19:26:11,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 194 transitions. [2024-10-11 19:26:11,157 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5878787878787879 [2024-10-11 19:26:11,157 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 100 flow. Second operand 6 states and 194 transitions. [2024-10-11 19:26:11,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 108 transitions, 423 flow [2024-10-11 19:26:11,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 108 transitions, 415 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-11 19:26:11,161 INFO L231 Difference]: Finished difference. Result has 52 places, 53 transitions, 153 flow [2024-10-11 19:26:11,161 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=153, PETRI_PLACES=52, PETRI_TRANSITIONS=53} [2024-10-11 19:26:11,162 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2024-10-11 19:26:11,162 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 53 transitions, 153 flow [2024-10-11 19:26:11,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 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 19:26:11,162 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:26:11,162 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:26:11,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 19:26:11,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:26:11,363 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-11 19:26:11,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:26:11,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1851356261, now seen corresponding path program 1 times [2024-10-11 19:26:11,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:26:11,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1477468272] [2024-10-11 19:26:11,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:26:11,364 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:26:11,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:26:11,365 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:26:11,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 19:26:11,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:26:11,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 19:26:11,424 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:26:11,438 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 19:26:11,438 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:26:11,438 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:26:11,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1477468272] [2024-10-11 19:26:11,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1477468272] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:26:11,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:26:11,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:26:11,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654255181] [2024-10-11 19:26:11,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:26:11,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:26:11,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:26:11,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:26:11,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:26:11,442 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 55 [2024-10-11 19:26:11,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 53 transitions, 153 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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 19:26:11,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:26:11,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 55 [2024-10-11 19:26:11,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:26:11,606 INFO L124 PetriNetUnfolderBase]: 793/1531 cut-off events. [2024-10-11 19:26:11,606 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2024-10-11 19:26:11,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3149 conditions, 1531 events. 793/1531 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 8001 event pairs, 348 based on Foata normal form. 0/1390 useless extension candidates. Maximal degree in co-relation 3064. Up to 734 conditions per place. [2024-10-11 19:26:11,613 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 56 selfloop transitions, 3 changer transitions 0/71 dead transitions. [2024-10-11 19:26:11,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 71 transitions, 303 flow [2024-10-11 19:26:11,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:26:11,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:26:11,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2024-10-11 19:26:11,617 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6181818181818182 [2024-10-11 19:26:11,617 INFO L175 Difference]: Start difference. First operand has 52 places, 53 transitions, 153 flow. Second operand 3 states and 102 transitions. [2024-10-11 19:26:11,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 71 transitions, 303 flow [2024-10-11 19:26:11,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 71 transitions, 301 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-10-11 19:26:11,620 INFO L231 Difference]: Finished difference. Result has 54 places, 50 transitions, 148 flow [2024-10-11 19:26:11,620 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=54, PETRI_TRANSITIONS=50} [2024-10-11 19:26:11,622 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 4 predicate places. [2024-10-11 19:26:11,622 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 50 transitions, 148 flow [2024-10-11 19:26:11,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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 19:26:11,623 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:26:11,623 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:26:11,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 19:26:11,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:26:11,825 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-11 19:26:11,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:26:11,825 INFO L85 PathProgramCache]: Analyzing trace with hash -972162493, now seen corresponding path program 1 times [2024-10-11 19:26:11,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:26:11,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1175368428] [2024-10-11 19:26:11,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:26:11,826 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:26:11,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:26:11,828 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:26:11,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 19:26:11,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:26:11,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:26:11,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:26:11,889 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 19:26:11,889 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:26:11,890 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:26:11,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1175368428] [2024-10-11 19:26:11,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1175368428] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:26:11,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:26:11,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:26:11,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70379528] [2024-10-11 19:26:11,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:26:11,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:26:11,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:26:11,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:26:11,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:26:11,891 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-10-11 19:26:11,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 50 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 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 19:26:11,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:26:11,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-10-11 19:26:11,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:26:12,117 INFO L124 PetriNetUnfolderBase]: 1096/2111 cut-off events. [2024-10-11 19:26:12,117 INFO L125 PetriNetUnfolderBase]: For 162/162 co-relation queries the response was YES. [2024-10-11 19:26:12,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4374 conditions, 2111 events. 1096/2111 cut-off events. For 162/162 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 12189 event pairs, 518 based on Foata normal form. 0/1975 useless extension candidates. Maximal degree in co-relation 1577. Up to 1077 conditions per place. [2024-10-11 19:26:12,126 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 68 selfloop transitions, 5 changer transitions 0/89 dead transitions. [2024-10-11 19:26:12,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 89 transitions, 386 flow [2024-10-11 19:26:12,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:26:12,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 19:26:12,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2024-10-11 19:26:12,128 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6318181818181818 [2024-10-11 19:26:12,128 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 148 flow. Second operand 4 states and 139 transitions. [2024-10-11 19:26:12,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 89 transitions, 386 flow [2024-10-11 19:26:12,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 89 transitions, 380 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 19:26:12,132 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 175 flow [2024-10-11 19:26:12,132 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=175, PETRI_PLACES=57, PETRI_TRANSITIONS=53} [2024-10-11 19:26:12,133 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 7 predicate places. [2024-10-11 19:26:12,133 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 175 flow [2024-10-11 19:26:12,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 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 19:26:12,134 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:26:12,134 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:26:12,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-11 19:26:12,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:26:12,337 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 12 more)] === [2024-10-11 19:26:12,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:26:12,337 INFO L85 PathProgramCache]: Analyzing trace with hash -412343804, now seen corresponding path program 1 times [2024-10-11 19:26:12,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:26:12,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [835123468] [2024-10-11 19:26:12,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:26:12,338 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:26:12,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:26:12,340 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:26:12,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 19:26:12,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:26:12,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 19:26:12,396 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:26:12,406 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 19:26:12,406 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:26:12,406 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:26:12,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [835123468] [2024-10-11 19:26:12,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [835123468] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:26:12,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:26:12,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:26:12,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791755455] [2024-10-11 19:26:12,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:26:12,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:26:12,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:26:12,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:26:12,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:26:12,413 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-10-11 19:26:12,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 175 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 19:26:12,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:26:12,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-10-11 19:26:12,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:26:12,589 INFO L124 PetriNetUnfolderBase]: 1158/2185 cut-off events. [2024-10-11 19:26:12,589 INFO L125 PetriNetUnfolderBase]: For 294/294 co-relation queries the response was YES. [2024-10-11 19:26:12,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4957 conditions, 2185 events. 1158/2185 cut-off events. For 294/294 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 12673 event pairs, 599 based on Foata normal form. 12/2076 useless extension candidates. Maximal degree in co-relation 2137. Up to 1555 conditions per place. [2024-10-11 19:26:12,600 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 55 selfloop transitions, 2 changer transitions 0/73 dead transitions. [2024-10-11 19:26:12,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 73 transitions, 342 flow [2024-10-11 19:26:12,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:26:12,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:26:12,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2024-10-11 19:26:12,602 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6424242424242425 [2024-10-11 19:26:12,602 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 175 flow. Second operand 3 states and 106 transitions. [2024-10-11 19:26:12,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 73 transitions, 342 flow [2024-10-11 19:26:12,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 73 transitions, 337 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-10-11 19:26:12,606 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 182 flow [2024-10-11 19:26:12,606 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=182, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2024-10-11 19:26:12,608 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 9 predicate places. [2024-10-11 19:26:12,608 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 182 flow [2024-10-11 19:26:12,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 19:26:12,609 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:26:12,609 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:26:12,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-11 19:26:12,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:26:12,810 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-11 19:26:12,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:26:12,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1061099091, now seen corresponding path program 1 times [2024-10-11 19:26:12,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:26:12,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [716968542] [2024-10-11 19:26:12,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:26:12,811 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:26:12,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:26:12,813 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:26:12,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-11 19:26:12,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:26:12,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 19:26:12,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:26:13,069 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:26:13,070 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:26:13,302 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:26:13,302 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:26:13,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [716968542] [2024-10-11 19:26:13,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [716968542] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:26:13,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:26:13,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2024-10-11 19:26:13,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214742005] [2024-10-11 19:26:13,303 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:26:13,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 19:26:13,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:26:13,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 19:26:13,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-11 19:26:13,405 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-10-11 19:26:13,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 182 flow. Second operand has 10 states, 10 states have (on average 19.0) internal successors, (190), 10 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:26:13,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:26:13,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-10-11 19:26:13,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:26:17,153 INFO L124 PetriNetUnfolderBase]: 5619/10734 cut-off events. [2024-10-11 19:26:17,153 INFO L125 PetriNetUnfolderBase]: For 2728/2728 co-relation queries the response was YES. [2024-10-11 19:26:17,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24314 conditions, 10734 events. 5619/10734 cut-off events. For 2728/2728 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 76285 event pairs, 736 based on Foata normal form. 264/10371 useless extension candidates. Maximal degree in co-relation 10831. Up to 1905 conditions per place. [2024-10-11 19:26:17,204 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 327 selfloop transitions, 45 changer transitions 0/387 dead transitions. [2024-10-11 19:26:17,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 387 transitions, 1861 flow [2024-10-11 19:26:17,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 19:26:17,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-10-11 19:26:17,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 685 transitions. [2024-10-11 19:26:17,207 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6227272727272727 [2024-10-11 19:26:17,207 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 182 flow. Second operand 20 states and 685 transitions. [2024-10-11 19:26:17,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 387 transitions, 1861 flow [2024-10-11 19:26:17,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 387 transitions, 1856 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 19:26:17,216 INFO L231 Difference]: Finished difference. Result has 92 places, 99 transitions, 598 flow [2024-10-11 19:26:17,216 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=598, PETRI_PLACES=92, PETRI_TRANSITIONS=99} [2024-10-11 19:26:17,216 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 42 predicate places. [2024-10-11 19:26:17,217 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 99 transitions, 598 flow [2024-10-11 19:26:17,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 19.0) internal successors, (190), 10 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:26:17,217 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:26:17,217 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] [2024-10-11 19:26:17,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-11 19:26:17,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:26:17,420 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-11 19:26:17,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:26:17,421 INFO L85 PathProgramCache]: Analyzing trace with hash -781759324, now seen corresponding path program 1 times [2024-10-11 19:26:17,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:26:17,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [34182614] [2024-10-11 19:26:17,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:26:17,421 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:26:17,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:26:17,422 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:26:17,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-11 19:26:17,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:26:17,478 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:26:17,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:26:17,501 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 11 treesize of output 9 [2024-10-11 19:26:17,512 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 19:26:17,512 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:26:17,512 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:26:17,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [34182614] [2024-10-11 19:26:17,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [34182614] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:26:17,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:26:17,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:26:17,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810087909] [2024-10-11 19:26:17,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:26:17,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:26:17,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:26:17,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:26:17,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:26:17,514 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-10-11 19:26:17,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 99 transitions, 598 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 19:26:17,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:26:17,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-10-11 19:26:17,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:26:17,988 INFO L124 PetriNetUnfolderBase]: 2678/5618 cut-off events. [2024-10-11 19:26:17,989 INFO L125 PetriNetUnfolderBase]: For 3569/3569 co-relation queries the response was YES. [2024-10-11 19:26:18,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13892 conditions, 5618 events. 2678/5618 cut-off events. For 3569/3569 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 36181 event pairs, 589 based on Foata normal form. 364/5802 useless extension candidates. Maximal degree in co-relation 13558. Up to 3210 conditions per place. [2024-10-11 19:26:18,018 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 70 selfloop transitions, 4 changer transitions 0/90 dead transitions. [2024-10-11 19:26:18,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 90 transitions, 615 flow [2024-10-11 19:26:18,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:26:18,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:26:18,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2024-10-11 19:26:18,020 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5696969696969697 [2024-10-11 19:26:18,020 INFO L175 Difference]: Start difference. First operand has 92 places, 99 transitions, 598 flow. Second operand 3 states and 94 transitions. [2024-10-11 19:26:18,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 90 transitions, 615 flow [2024-10-11 19:26:18,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 90 transitions, 567 flow, removed 23 selfloop flow, removed 6 redundant places. [2024-10-11 19:26:18,038 INFO L231 Difference]: Finished difference. Result has 83 places, 79 transitions, 395 flow [2024-10-11 19:26:18,038 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=395, PETRI_PLACES=83, PETRI_TRANSITIONS=79} [2024-10-11 19:26:18,038 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 33 predicate places. [2024-10-11 19:26:18,039 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 79 transitions, 395 flow [2024-10-11 19:26:18,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 19:26:18,040 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:26:18,040 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] [2024-10-11 19:26:18,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-11 19:26:18,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:26:18,244 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-11 19:26:18,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:26:18,244 INFO L85 PathProgramCache]: Analyzing trace with hash 868213147, now seen corresponding path program 1 times [2024-10-11 19:26:18,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:26:18,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [171914361] [2024-10-11 19:26:18,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:26:18,245 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:26:18,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:26:18,248 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:26:18,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-11 19:26:18,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:26:18,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 19:26:18,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:26:18,426 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 19:26:18,426 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:26:18,426 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:26:18,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [171914361] [2024-10-11 19:26:18,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [171914361] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:26:18,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:26:18,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:26:18,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913827141] [2024-10-11 19:26:18,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:26:18,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:26:18,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:26:18,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:26:18,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:26:18,435 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-10-11 19:26:18,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 79 transitions, 395 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:26:18,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:26:18,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-10-11 19:26:18,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:26:18,792 INFO L124 PetriNetUnfolderBase]: 2633/5407 cut-off events. [2024-10-11 19:26:18,792 INFO L125 PetriNetUnfolderBase]: For 2298/2298 co-relation queries the response was YES. [2024-10-11 19:26:18,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13642 conditions, 5407 events. 2633/5407 cut-off events. For 2298/2298 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 34486 event pairs, 1881 based on Foata normal form. 0/5250 useless extension candidates. Maximal degree in co-relation 11211. Up to 4039 conditions per place. [2024-10-11 19:26:18,814 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 65 selfloop transitions, 3 changer transitions 0/83 dead transitions. [2024-10-11 19:26:18,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 83 transitions, 546 flow [2024-10-11 19:26:18,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:26:18,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 19:26:18,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2024-10-11 19:26:18,815 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2024-10-11 19:26:18,815 INFO L175 Difference]: Start difference. First operand has 83 places, 79 transitions, 395 flow. Second operand 4 states and 100 transitions. [2024-10-11 19:26:18,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 83 transitions, 546 flow [2024-10-11 19:26:18,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 83 transitions, 542 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 19:26:18,824 INFO L231 Difference]: Finished difference. Result has 84 places, 78 transitions, 395 flow [2024-10-11 19:26:18,824 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=395, PETRI_PLACES=84, PETRI_TRANSITIONS=78} [2024-10-11 19:26:18,824 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 34 predicate places. [2024-10-11 19:26:18,824 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 78 transitions, 395 flow [2024-10-11 19:26:18,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:26:18,825 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:26:18,825 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] [2024-10-11 19:26:18,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-10-11 19:26:19,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:26:19,026 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-11 19:26:19,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:26:19,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1194180862, now seen corresponding path program 1 times [2024-10-11 19:26:19,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:26:19,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [201820074] [2024-10-11 19:26:19,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:26:19,027 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:26:19,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:26:19,029 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:26:19,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-11 19:26:19,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:26:19,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 19:26:19,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:26:19,374 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 19:26:19,374 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:26:19,374 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:26:19,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [201820074] [2024-10-11 19:26:19,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [201820074] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:26:19,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:26:19,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:26:19,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421565699] [2024-10-11 19:26:19,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:26:19,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 19:26:19,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:26:19,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 19:26:19,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:26:19,396 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-10-11 19:26:19,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 78 transitions, 395 flow. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:26:19,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:26:19,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-10-11 19:26:19,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:26:19,916 INFO L124 PetriNetUnfolderBase]: 2709/5584 cut-off events. [2024-10-11 19:26:19,917 INFO L125 PetriNetUnfolderBase]: For 2667/2667 co-relation queries the response was YES. [2024-10-11 19:26:19,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13825 conditions, 5584 events. 2709/5584 cut-off events. For 2667/2667 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 35295 event pairs, 859 based on Foata normal form. 0/5406 useless extension candidates. Maximal degree in co-relation 11395. Up to 3583 conditions per place. [2024-10-11 19:26:19,940 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 107 selfloop transitions, 9 changer transitions 0/130 dead transitions. [2024-10-11 19:26:19,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 130 transitions, 792 flow [2024-10-11 19:26:19,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:26:19,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 19:26:19,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 185 transitions. [2024-10-11 19:26:19,942 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5606060606060606 [2024-10-11 19:26:19,942 INFO L175 Difference]: Start difference. First operand has 84 places, 78 transitions, 395 flow. Second operand 6 states and 185 transitions. [2024-10-11 19:26:19,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 130 transitions, 792 flow [2024-10-11 19:26:19,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 130 transitions, 778 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-11 19:26:19,951 INFO L231 Difference]: Finished difference. Result has 89 places, 81 transitions, 433 flow [2024-10-11 19:26:19,951 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=433, PETRI_PLACES=89, PETRI_TRANSITIONS=81} [2024-10-11 19:26:19,951 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 39 predicate places. [2024-10-11 19:26:19,952 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 81 transitions, 433 flow [2024-10-11 19:26:19,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:26:19,952 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:26:19,952 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 19:26:19,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-11 19:26:20,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:26:20,153 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-11 19:26:20,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:26:20,153 INFO L85 PathProgramCache]: Analyzing trace with hash -286825246, now seen corresponding path program 1 times [2024-10-11 19:26:20,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:26:20,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1682754222] [2024-10-11 19:26:20,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:26:20,153 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:26:20,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:26:20,154 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:26:20,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-11 19:26:20,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:26:20,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 19:26:20,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:26:20,216 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 19:26:20,217 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:26:20,217 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:26:20,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1682754222] [2024-10-11 19:26:20,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1682754222] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:26:20,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:26:20,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:26:20,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812737198] [2024-10-11 19:26:20,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:26:20,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:26:20,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:26:20,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:26:20,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:26:20,219 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-10-11 19:26:20,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 81 transitions, 433 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 19:26:20,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:26:20,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-10-11 19:26:20,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:26:20,701 INFO L124 PetriNetUnfolderBase]: 3805/7957 cut-off events. [2024-10-11 19:26:20,702 INFO L125 PetriNetUnfolderBase]: For 3931/3931 co-relation queries the response was YES. [2024-10-11 19:26:20,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19829 conditions, 7957 events. 3805/7957 cut-off events. For 3931/3931 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 55970 event pairs, 1889 based on Foata normal form. 137/7846 useless extension candidates. Maximal degree in co-relation 16740. Up to 4730 conditions per place. [2024-10-11 19:26:20,733 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 121 selfloop transitions, 2 changer transitions 0/138 dead transitions. [2024-10-11 19:26:20,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 138 transitions, 1028 flow [2024-10-11 19:26:20,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:26:20,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:26:20,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2024-10-11 19:26:20,734 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6484848484848484 [2024-10-11 19:26:20,734 INFO L175 Difference]: Start difference. First operand has 89 places, 81 transitions, 433 flow. Second operand 3 states and 107 transitions. [2024-10-11 19:26:20,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 138 transitions, 1028 flow [2024-10-11 19:26:20,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 138 transitions, 1024 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 19:26:20,748 INFO L231 Difference]: Finished difference. Result has 91 places, 82 transitions, 442 flow [2024-10-11 19:26:20,748 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=442, PETRI_PLACES=91, PETRI_TRANSITIONS=82} [2024-10-11 19:26:20,749 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 41 predicate places. [2024-10-11 19:26:20,749 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 82 transitions, 442 flow [2024-10-11 19:26:20,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 19:26:20,749 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:26:20,749 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 19:26:20,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-11 19:26:20,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:26:20,952 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-11 19:26:20,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:26:20,953 INFO L85 PathProgramCache]: Analyzing trace with hash 740525856, now seen corresponding path program 1 times [2024-10-11 19:26:20,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:26:20,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2049215354] [2024-10-11 19:26:20,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:26:20,953 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:26:20,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:26:20,956 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:26:20,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-11 19:26:21,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:26:21,013 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 19:26:21,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:26:21,044 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 19:26:21,044 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:26:21,044 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:26:21,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2049215354] [2024-10-11 19:26:21,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2049215354] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:26:21,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:26:21,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:26:21,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943032273] [2024-10-11 19:26:21,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:26:21,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:26:21,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:26:21,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:26:21,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:26:21,045 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-10-11 19:26:21,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 82 transitions, 442 flow. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 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 19:26:21,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:26:21,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-10-11 19:26:21,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:26:21,725 INFO L124 PetriNetUnfolderBase]: 3746/7782 cut-off events. [2024-10-11 19:26:21,725 INFO L125 PetriNetUnfolderBase]: For 5048/5048 co-relation queries the response was YES. [2024-10-11 19:26:21,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20948 conditions, 7782 events. 3746/7782 cut-off events. For 5048/5048 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 53197 event pairs, 1180 based on Foata normal form. 16/7573 useless extension candidates. Maximal degree in co-relation 17598. Up to 5140 conditions per place. [2024-10-11 19:26:21,761 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 102 selfloop transitions, 7 changer transitions 0/124 dead transitions. [2024-10-11 19:26:21,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 124 transitions, 808 flow [2024-10-11 19:26:21,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:26:21,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 19:26:21,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 165 transitions. [2024-10-11 19:26:21,763 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-10-11 19:26:21,763 INFO L175 Difference]: Start difference. First operand has 91 places, 82 transitions, 442 flow. Second operand 5 states and 165 transitions. [2024-10-11 19:26:21,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 124 transitions, 808 flow [2024-10-11 19:26:21,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 124 transitions, 796 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-10-11 19:26:21,777 INFO L231 Difference]: Finished difference. Result has 94 places, 81 transitions, 448 flow [2024-10-11 19:26:21,777 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=448, PETRI_PLACES=94, PETRI_TRANSITIONS=81} [2024-10-11 19:26:21,778 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 44 predicate places. [2024-10-11 19:26:21,778 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 81 transitions, 448 flow [2024-10-11 19:26:21,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 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 19:26:21,778 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:26:21,778 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 19:26:21,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-11 19:26:21,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:26:21,979 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-11 19:26:21,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:26:21,979 INFO L85 PathProgramCache]: Analyzing trace with hash 2023596201, now seen corresponding path program 1 times [2024-10-11 19:26:21,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:26:21,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [783787210] [2024-10-11 19:26:21,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:26:21,980 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:26:21,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:26:21,982 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:26:21,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-11 19:26:22,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:26:22,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 19:26:22,063 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:26:22,156 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 15 treesize of output 1 [2024-10-11 19:26:22,235 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 15 treesize of output 7 [2024-10-11 19:26:22,253 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 19:26:22,253 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:26:22,253 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:26:22,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [783787210] [2024-10-11 19:26:22,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [783787210] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:26:22,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:26:22,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 19:26:22,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074912305] [2024-10-11 19:26:22,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:26:22,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 19:26:22,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:26:22,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 19:26:22,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-11 19:26:22,295 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-10-11 19:26:22,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 81 transitions, 448 flow. Second operand has 10 states, 10 states have (on average 18.9) internal successors, (189), 10 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:26:22,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:26:22,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-10-11 19:26:22,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:26:23,510 INFO L124 PetriNetUnfolderBase]: 5266/10862 cut-off events. [2024-10-11 19:26:23,510 INFO L125 PetriNetUnfolderBase]: For 7250/7250 co-relation queries the response was YES. [2024-10-11 19:26:23,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29205 conditions, 10862 events. 5266/10862 cut-off events. For 7250/7250 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 75880 event pairs, 1414 based on Foata normal form. 0/10581 useless extension candidates. Maximal degree in co-relation 23605. Up to 5182 conditions per place. [2024-10-11 19:26:23,702 INFO L140 encePairwiseOnDemand]: 45/55 looper letters, 190 selfloop transitions, 21 changer transitions 0/226 dead transitions. [2024-10-11 19:26:23,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 226 transitions, 1496 flow [2024-10-11 19:26:23,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 19:26:23,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-10-11 19:26:23,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 396 transitions. [2024-10-11 19:26:23,704 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2024-10-11 19:26:23,704 INFO L175 Difference]: Start difference. First operand has 94 places, 81 transitions, 448 flow. Second operand 14 states and 396 transitions. [2024-10-11 19:26:23,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 226 transitions, 1496 flow [2024-10-11 19:26:23,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 226 transitions, 1476 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-11 19:26:23,720 INFO L231 Difference]: Finished difference. Result has 106 places, 90 transitions, 556 flow [2024-10-11 19:26:23,720 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=556, PETRI_PLACES=106, PETRI_TRANSITIONS=90} [2024-10-11 19:26:23,720 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 56 predicate places. [2024-10-11 19:26:23,720 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 90 transitions, 556 flow [2024-10-11 19:26:23,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.9) internal successors, (189), 10 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:26:23,721 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:26:23,721 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, 1] [2024-10-11 19:26:23,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-10-11 19:26:23,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:26:23,921 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-11 19:26:23,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:26:23,922 INFO L85 PathProgramCache]: Analyzing trace with hash -180184538, now seen corresponding path program 1 times [2024-10-11 19:26:23,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:26:23,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1353209405] [2024-10-11 19:26:23,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:26:23,922 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:26:23,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:26:23,923 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:26:23,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-11 19:26:23,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:26:23,985 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:26:23,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:26:23,998 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 19:26:23,998 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:26:24,015 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 19:26:24,016 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:26:24,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1353209405] [2024-10-11 19:26:24,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1353209405] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:26:24,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:26:24,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-10-11 19:26:24,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885188003] [2024-10-11 19:26:24,016 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:26:24,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 19:26:24,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:26:24,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 19:26:24,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:26:24,020 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-10-11 19:26:24,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 90 transitions, 556 flow. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 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 19:26:24,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:26:24,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-10-11 19:26:24,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:26:26,255 INFO L124 PetriNetUnfolderBase]: 13641/26402 cut-off events. [2024-10-11 19:26:26,255 INFO L125 PetriNetUnfolderBase]: For 25752/25752 co-relation queries the response was YES. [2024-10-11 19:26:26,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73216 conditions, 26402 events. 13641/26402 cut-off events. For 25752/25752 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 208529 event pairs, 1455 based on Foata normal form. 1703/27509 useless extension candidates. Maximal degree in co-relation 61145. Up to 6709 conditions per place. [2024-10-11 19:26:26,372 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 311 selfloop transitions, 6 changer transitions 0/331 dead transitions. [2024-10-11 19:26:26,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 331 transitions, 2881 flow [2024-10-11 19:26:26,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:26:26,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 19:26:26,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 221 transitions. [2024-10-11 19:26:26,373 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6696969696969697 [2024-10-11 19:26:26,373 INFO L175 Difference]: Start difference. First operand has 106 places, 90 transitions, 556 flow. Second operand 6 states and 221 transitions. [2024-10-11 19:26:26,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 331 transitions, 2881 flow [2024-10-11 19:26:26,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 331 transitions, 2687 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-10-11 19:26:26,430 INFO L231 Difference]: Finished difference. Result has 107 places, 93 transitions, 548 flow [2024-10-11 19:26:26,430 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=548, PETRI_PLACES=107, PETRI_TRANSITIONS=93} [2024-10-11 19:26:26,431 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 57 predicate places. [2024-10-11 19:26:26,431 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 93 transitions, 548 flow [2024-10-11 19:26:26,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 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 19:26:26,431 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:26:26,431 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] [2024-10-11 19:26:26,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-11 19:26:26,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:26:26,632 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-11 19:26:26,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:26:26,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1650130818, now seen corresponding path program 1 times [2024-10-11 19:26:26,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:26:26,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [555864949] [2024-10-11 19:26:26,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:26:26,633 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:26:26,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:26:26,635 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:26:26,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-11 19:26:26,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:26:26,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 19:26:26,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:26:26,941 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:26:26,941 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:26:27,254 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:26:27,254 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:26:27,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [555864949] [2024-10-11 19:26:27,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [555864949] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:26:27,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:26:27,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2024-10-11 19:26:27,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753807032] [2024-10-11 19:26:27,254 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:26:27,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 19:26:27,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:26:27,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 19:26:27,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-11 19:26:27,366 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-10-11 19:26:27,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 93 transitions, 548 flow. Second operand has 12 states, 12 states have (on average 20.166666666666668) internal successors, (242), 12 states have internal predecessors, (242), 0 states have call successors, (0), 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 19:26:27,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:26:27,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-10-11 19:26:27,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:26:35,200 INFO L124 PetriNetUnfolderBase]: 23596/49692 cut-off events. [2024-10-11 19:26:35,200 INFO L125 PetriNetUnfolderBase]: For 68098/68098 co-relation queries the response was YES. [2024-10-11 19:26:35,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150545 conditions, 49692 events. 23596/49692 cut-off events. For 68098/68098 co-relation queries the response was YES. Maximal size of possible extension queue 766. Compared 459478 event pairs, 5913 based on Foata normal form. 210/48359 useless extension candidates. Maximal degree in co-relation 86689. Up to 8212 conditions per place. [2024-10-11 19:26:35,527 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 353 selfloop transitions, 63 changer transitions 0/431 dead transitions. [2024-10-11 19:26:35,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 431 transitions, 3110 flow [2024-10-11 19:26:35,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 19:26:35,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-10-11 19:26:35,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 626 transitions. [2024-10-11 19:26:35,529 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5690909090909091 [2024-10-11 19:26:35,529 INFO L175 Difference]: Start difference. First operand has 107 places, 93 transitions, 548 flow. Second operand 20 states and 626 transitions. [2024-10-11 19:26:35,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 431 transitions, 3110 flow [2024-10-11 19:26:35,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 431 transitions, 3032 flow, removed 31 selfloop flow, removed 1 redundant places. [2024-10-11 19:26:35,864 INFO L231 Difference]: Finished difference. Result has 140 places, 138 transitions, 1054 flow [2024-10-11 19:26:35,864 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1054, PETRI_PLACES=140, PETRI_TRANSITIONS=138} [2024-10-11 19:26:35,864 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 90 predicate places. [2024-10-11 19:26:35,864 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 138 transitions, 1054 flow [2024-10-11 19:26:35,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 20.166666666666668) internal successors, (242), 12 states have internal predecessors, (242), 0 states have call successors, (0), 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 19:26:35,864 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:26:35,864 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] [2024-10-11 19:26:35,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-10-11 19:26:36,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:26:36,065 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-11 19:26:36,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:26:36,065 INFO L85 PathProgramCache]: Analyzing trace with hash -941985837, now seen corresponding path program 1 times [2024-10-11 19:26:36,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:26:36,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1139945650] [2024-10-11 19:26:36,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:26:36,066 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:26:36,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:26:36,067 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:26:36,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-11 19:26:36,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:26:36,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:26:36,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:26:36,168 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:26:36,168 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:26:36,197 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:26:36,197 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:26:36,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1139945650] [2024-10-11 19:26:36,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1139945650] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:26:36,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:26:36,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2024-10-11 19:26:36,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623448270] [2024-10-11 19:26:36,197 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:26:36,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:26:36,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:26:36,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:26:36,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:26:36,198 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-10-11 19:26:36,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 138 transitions, 1054 flow. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:26:36,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:26:36,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-10-11 19:26:36,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:26:41,822 INFO L124 PetriNetUnfolderBase]: 21740/46004 cut-off events. [2024-10-11 19:26:41,822 INFO L125 PetriNetUnfolderBase]: For 81647/81647 co-relation queries the response was YES. [2024-10-11 19:26:42,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144448 conditions, 46004 events. 21740/46004 cut-off events. For 81647/81647 co-relation queries the response was YES. Maximal size of possible extension queue 760. Compared 419702 event pairs, 8430 based on Foata normal form. 25/44780 useless extension candidates. Maximal degree in co-relation 140724. Up to 33279 conditions per place. [2024-10-11 19:26:42,188 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 153 selfloop transitions, 10 changer transitions 0/179 dead transitions. [2024-10-11 19:26:42,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 179 transitions, 1565 flow [2024-10-11 19:26:42,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:26:42,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 19:26:42,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 164 transitions. [2024-10-11 19:26:42,189 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5963636363636363 [2024-10-11 19:26:42,190 INFO L175 Difference]: Start difference. First operand has 140 places, 138 transitions, 1054 flow. Second operand 5 states and 164 transitions. [2024-10-11 19:26:42,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 179 transitions, 1565 flow [2024-10-11 19:26:42,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 179 transitions, 1515 flow, removed 21 selfloop flow, removed 2 redundant places. [2024-10-11 19:26:42,721 INFO L231 Difference]: Finished difference. Result has 144 places, 135 transitions, 1024 flow [2024-10-11 19:26:42,721 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=965, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1024, PETRI_PLACES=144, PETRI_TRANSITIONS=135} [2024-10-11 19:26:42,721 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 94 predicate places. [2024-10-11 19:26:42,721 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 135 transitions, 1024 flow [2024-10-11 19:26:42,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:26:42,721 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:26:42,721 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] [2024-10-11 19:26:42,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-10-11 19:26:42,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:26:42,922 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-11 19:26:42,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:26:42,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1516650404, now seen corresponding path program 1 times [2024-10-11 19:26:42,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:26:42,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [124693185] [2024-10-11 19:26:42,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:26:42,923 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:26:42,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:26:42,925 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:26:42,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-11 19:26:42,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:26:42,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:26:42,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:26:43,031 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:26:43,031 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:26:43,075 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:26:43,076 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:26:43,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [124693185] [2024-10-11 19:26:43,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [124693185] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:26:43,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:26:43,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-10-11 19:26:43,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671208861] [2024-10-11 19:26:43,076 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:26:43,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 19:26:43,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:26:43,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 19:26:43,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-11 19:26:43,077 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-10-11 19:26:43,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 135 transitions, 1024 flow. Second operand has 10 states, 10 states have (on average 22.0) internal successors, (220), 10 states have internal predecessors, (220), 0 states have call successors, (0), 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 19:26:43,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:26:43,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-10-11 19:26:43,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:26:51,017 INFO L124 PetriNetUnfolderBase]: 29796/62415 cut-off events. [2024-10-11 19:26:51,017 INFO L125 PetriNetUnfolderBase]: For 124135/124153 co-relation queries the response was YES. [2024-10-11 19:26:51,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201983 conditions, 62415 events. 29796/62415 cut-off events. For 124135/124153 co-relation queries the response was YES. Maximal size of possible extension queue 923. Compared 585194 event pairs, 6690 based on Foata normal form. 560/61833 useless extension candidates. Maximal degree in co-relation 195816. Up to 14386 conditions per place. [2024-10-11 19:26:51,602 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 317 selfloop transitions, 104 changer transitions 0/437 dead transitions. [2024-10-11 19:26:51,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 437 transitions, 3645 flow [2024-10-11 19:26:51,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 19:26:51,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-10-11 19:26:51,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 588 transitions. [2024-10-11 19:26:51,604 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.593939393939394 [2024-10-11 19:26:51,604 INFO L175 Difference]: Start difference. First operand has 144 places, 135 transitions, 1024 flow. Second operand 18 states and 588 transitions. [2024-10-11 19:26:51,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 437 transitions, 3645 flow [2024-10-11 19:26:52,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 437 transitions, 3528 flow, removed 41 selfloop flow, removed 6 redundant places. [2024-10-11 19:26:52,439 INFO L231 Difference]: Finished difference. Result has 165 places, 187 transitions, 1800 flow [2024-10-11 19:26:52,439 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=949, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1800, PETRI_PLACES=165, PETRI_TRANSITIONS=187} [2024-10-11 19:26:52,440 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 115 predicate places. [2024-10-11 19:26:52,440 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 187 transitions, 1800 flow [2024-10-11 19:26:52,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 22.0) internal successors, (220), 10 states have internal predecessors, (220), 0 states have call successors, (0), 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 19:26:52,440 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:26:52,440 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] [2024-10-11 19:26:52,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-10-11 19:26:52,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:26:52,643 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-11 19:26:52,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:26:52,644 INFO L85 PathProgramCache]: Analyzing trace with hash 615720737, now seen corresponding path program 1 times [2024-10-11 19:26:52,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:26:52,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1827916067] [2024-10-11 19:26:52,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:26:52,644 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:26:52,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:26:52,645 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:26:52,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-11 19:26:52,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 19:26:52,714 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 19:26:52,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 19:26:52,786 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-11 19:26:52,786 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 19:26:52,787 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t2Err2ASSERT_VIOLATIONMEMORY_LEAK (14 of 15 remaining) [2024-10-11 19:26:52,788 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (13 of 15 remaining) [2024-10-11 19:26:52,788 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 15 remaining) [2024-10-11 19:26:52,788 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 15 remaining) [2024-10-11 19:26:52,788 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2024-10-11 19:26:52,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2024-10-11 19:26:52,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONMEMORY_LEAK (8 of 15 remaining) [2024-10-11 19:26:52,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2024-10-11 19:26:52,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2024-10-11 19:26:52,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONMEMORY_LEAK (5 of 15 remaining) [2024-10-11 19:26:52,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2024-10-11 19:26:52,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2024-10-11 19:26:52,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONMEMORY_LEAK (2 of 15 remaining) [2024-10-11 19:26:52,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 15 remaining) [2024-10-11 19:26:52,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 15 remaining) [2024-10-11 19:26:52,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-10-11 19:26:52,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:26:52,990 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:26:53,034 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 19:26:53,035 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 19:26:53,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:26:53 BasicIcfg [2024-10-11 19:26:53,039 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 19:26:53,039 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 19:26:53,039 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 19:26:53,039 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 19:26:53,039 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:26:09" (3/4) ... [2024-10-11 19:26:53,040 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 19:26:53,041 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 19:26:53,042 INFO L158 Benchmark]: Toolchain (without parser) took 44565.13ms. Allocated memory was 71.3MB in the beginning and 11.7GB in the end (delta: 11.7GB). Free memory was 43.4MB in the beginning and 9.1GB in the end (delta: -9.1GB). Peak memory consumption was 2.6GB. Max. memory is 16.1GB. [2024-10-11 19:26:53,042 INFO L158 Benchmark]: CDTParser took 0.61ms. Allocated memory is still 50.3MB. Free memory is still 33.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:26:53,042 INFO L158 Benchmark]: CACSL2BoogieTranslator took 477.41ms. Allocated memory was 71.3MB in the beginning and 88.1MB in the end (delta: 16.8MB). Free memory was 43.2MB in the beginning and 62.0MB in the end (delta: -18.8MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2024-10-11 19:26:53,042 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.74ms. Allocated memory is still 88.1MB. Free memory was 61.6MB in the beginning and 58.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 19:26:53,042 INFO L158 Benchmark]: Boogie Preprocessor took 48.03ms. Allocated memory is still 88.1MB. Free memory was 58.9MB in the beginning and 55.9MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 19:26:53,042 INFO L158 Benchmark]: RCFGBuilder took 640.82ms. Allocated memory is still 88.1MB. Free memory was 55.9MB in the beginning and 42.7MB in the end (delta: 13.2MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. [2024-10-11 19:26:53,043 INFO L158 Benchmark]: TraceAbstraction took 43348.46ms. Allocated memory was 88.1MB in the beginning and 11.7GB in the end (delta: 11.7GB). Free memory was 42.0MB in the beginning and 9.1GB in the end (delta: -9.1GB). Peak memory consumption was 2.6GB. Max. memory is 16.1GB. [2024-10-11 19:26:53,043 INFO L158 Benchmark]: Witness Printer took 2.38ms. Allocated memory is still 11.7GB. Free memory is still 9.1GB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:26:53,044 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.61ms. Allocated memory is still 50.3MB. Free memory is still 33.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 477.41ms. Allocated memory was 71.3MB in the beginning and 88.1MB in the end (delta: 16.8MB). Free memory was 43.2MB in the beginning and 62.0MB in the end (delta: -18.8MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.74ms. Allocated memory is still 88.1MB. Free memory was 61.6MB in the beginning and 58.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.03ms. Allocated memory is still 88.1MB. Free memory was 58.9MB in the beginning and 55.9MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 640.82ms. Allocated memory is still 88.1MB. Free memory was 55.9MB in the beginning and 42.7MB in the end (delta: 13.2MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. * TraceAbstraction took 43348.46ms. Allocated memory was 88.1MB in the beginning and 11.7GB in the end (delta: 11.7GB). Free memory was 42.0MB in the beginning and 9.1GB in the end (delta: -9.1GB). Peak memory consumption was 2.6GB. Max. memory is 16.1GB. * Witness Printer took 2.38ms. Allocated memory is still 11.7GB. Free memory is still 9.1GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 20]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 20. Possible FailurePath: [L935] 0 static int top=0; [L936] 0 static unsigned int arr[(5)]; [L936] 0 static unsigned int arr[(5)]; [L936] 0 static unsigned int arr[(5)]; [L936] 0 static unsigned int arr[(5)]; [L936] 0 static unsigned int arr[(5)]; [L936] 0 static unsigned int arr[(5)]; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L938] 0 _Bool flag=(0); [L1021] 0 pthread_t id1, id2; [L1023] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={3:0}, flag=0, id1=0, m={4:0}, top=0] [L990] 1 int i; [L991] 1 unsigned int tmp; [L992] 1 i=0 VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L992] COND TRUE 1 i<(5) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L1024] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arr={3:0}, flag=0, id1=0, id2=1, m={4:0}, top=0] [L1006] 2 int i; [L1007] 2 i=0 VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L995] 1 tmp = __VERIFIER_nondet_uint() [L996] CALL 1 assume_abort_if_not(tmp < (5)) [L23] COND FALSE 1 !(!cond) [L996] RET 1 assume_abort_if_not(tmp < (5)) [L997] CALL, EXPR 1 push(arr,tmp) [L962] COND FALSE 1 !(top==(5)) [L969] CALL, EXPR 1 get_top() [L954] 1 return top; [L969] RET, EXPR 1 get_top() [L969] 1 stack[get_top()] = x [L970] CALL 1 inc_top() [L946] 1 top++ [L970] RET 1 inc_top() [L972] 1 return 0; VAL [\old(stack)={3:0}, \old(x)=0, \result=0, arr={3:0}, flag=0, m={4:0}, stack={3:0}, top=1, x=0] [L997] RET, EXPR 1 push(arr,tmp) [L997] COND FALSE 1 !(push(arr,tmp)==(-1)) [L999] 1 flag=(1) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, tmp=0, top=1] [L1007] COND TRUE 2 i<(5) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, top=1] [L1010] COND TRUE 2 \read(flag) [L1012] CALL, EXPR 2 pop(arr) [L976] CALL, EXPR 2 get_top() [L954] 2 return top; [L976] RET, EXPR 2 get_top() [L976] COND FALSE 2 !(get_top()==0) [L983] CALL 2 dec_top() [L950] 2 top-- [L983] RET 2 dec_top() [L984] CALL, EXPR 2 get_top() [L954] 2 return top; [L984] RET, EXPR 2 get_top() [L984] EXPR 2 stack[get_top()] [L984] 2 return stack[get_top()]; [L1012] RET, EXPR 2 pop(arr) [L1012] COND FALSE 2 !(!(pop(arr)!=(-2))) [L1007] 2 i++ VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1007] COND TRUE 2 i<(5) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1010] COND TRUE 2 \read(flag) [L1012] CALL, EXPR 2 pop(arr) [L976] CALL, EXPR 2 get_top() [L954] 2 return top; [L976] RET, EXPR 2 get_top() [L976] COND TRUE 2 get_top()==0 [L979] 2 return (-2); VAL [\old(stack)={3:0}, \result=-2, arr={3:0}, flag=1, m={4:0}, stack={3:0}, top=0] [L1012] RET, EXPR 2 pop(arr) [L1012] COND TRUE 2 !(pop(arr)!=(-2)) [L1013] CALL 2 error() [L941] CALL 2 reach_error() [L20] COND FALSE 2 !(0) VAL [arr={3:0}, flag=1, m={4:0}, top=0] [L20] 2 __assert_fail ("0", "stack-2.c", 3, __extension__ __PRETTY_FUNCTION__) VAL [arr={3:0}, flag=1, m={4:0}, top=0] - UnprovableResult [Line: 1019]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1024]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 20]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 85 locations, 15 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 43.2s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 36.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1718 SdHoareTripleChecker+Valid, 7.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1674 mSDsluCounter, 126 SdHoareTripleChecker+Invalid, 6.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 120 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4319 IncrementalHoareTripleChecker+Invalid, 4382 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 6 mSDtfsCounter, 4319 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 503 GetRequests, 391 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1800occurred in iteration=16, InterpolantAutomatonStates: 124, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 363 NumberOfCodeBlocks, 363 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 451 ConstructedInterpolants, 0 QuantifiedInterpolants, 3457 SizeOfPredicates, 53 NumberOfNonLiveVariables, 1612 ConjunctsInSsa, 118 ConjunctsInUnsatCore, 21 InterpolantComputations, 11 PerfectInterpolantSequences, 5/63 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 19:26:53,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample