./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_longer-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack_longer-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 4351dece6a672e511bbcb86915e62fc8a7361763ad7ab88f2e640b2d00ea50a7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:08:11,516 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:08:11,604 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 12:08:11,608 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:08:11,609 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:08:11,644 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:08:11,645 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:08:11,645 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:08:11,646 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:08:11,651 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:08:11,651 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:08:11,652 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:08:11,652 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:08:11,653 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:08:11,653 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:08:11,653 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:08:11,653 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:08:11,654 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:08:11,654 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:08:11,656 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:08:11,656 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 12:08:11,657 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 12:08:11,657 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 12:08:11,657 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:08:11,658 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 12:08:11,658 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:08:11,658 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:08:11,659 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:08:11,659 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:08:11,659 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:08:11,659 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:08:11,660 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:08:11,660 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:08:11,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:08:11,661 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:08:11,661 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:08:11,663 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 12:08:11,663 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 12:08:11,663 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:08:11,664 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:08:11,664 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:08:11,664 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:08:11,664 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/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/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 -> 4351dece6a672e511bbcb86915e62fc8a7361763ad7ab88f2e640b2d00ea50a7 [2024-10-13 12:08:11,950 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:08:11,975 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:08:11,980 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:08:11,981 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:08:11,982 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:08:11,983 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack_longer-1.i [2024-10-13 12:08:13,579 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:08:13,866 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:08:13,867 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack_longer-1.i [2024-10-13 12:08:13,898 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b081cd42f/0ec43f6e758d48009741f4d32a6fb5ac/FLAG9d975bb3e [2024-10-13 12:08:13,915 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b081cd42f/0ec43f6e758d48009741f4d32a6fb5ac [2024-10-13 12:08:13,918 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:08:13,920 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:08:13,921 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:08:13,921 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:08:13,929 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:08:13,930 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:08:13" (1/1) ... [2024-10-13 12:08:13,934 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53ec1920 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:13, skipping insertion in model container [2024-10-13 12:08:13,934 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:08:13" (1/1) ... [2024-10-13 12:08:13,990 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:08:14,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:08:14,593 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 12:08:14,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:08:14,729 INFO L204 MainTranslator]: Completed translation [2024-10-13 12:08:14,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:14 WrapperNode [2024-10-13 12:08:14,730 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:08:14,732 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 12:08:14,732 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 12:08:14,733 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 12:08:14,741 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:14" (1/1) ... [2024-10-13 12:08:14,760 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:14" (1/1) ... [2024-10-13 12:08:14,799 INFO L138 Inliner]: procedures = 277, calls = 32, calls flagged for inlining = 13, calls inlined = 14, statements flattened = 157 [2024-10-13 12:08:14,802 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 12:08:14,803 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 12:08:14,804 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 12:08:14,804 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 12:08:14,817 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:14" (1/1) ... [2024-10-13 12:08:14,817 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:14" (1/1) ... [2024-10-13 12:08:14,827 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:14" (1/1) ... [2024-10-13 12:08:14,853 INFO L175 MemorySlicer]: Split 10 memory accesses to 3 slices as follows [2, 3, 5]. 50 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 5]. The 2 writes are split as follows [0, 2, 0]. [2024-10-13 12:08:14,853 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:14" (1/1) ... [2024-10-13 12:08:14,853 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:14" (1/1) ... [2024-10-13 12:08:14,890 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:14" (1/1) ... [2024-10-13 12:08:14,900 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:14" (1/1) ... [2024-10-13 12:08:14,910 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:14" (1/1) ... [2024-10-13 12:08:14,916 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:14" (1/1) ... [2024-10-13 12:08:14,923 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 12:08:14,924 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 12:08:14,925 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 12:08:14,925 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 12:08:14,926 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:14" (1/1) ... [2024-10-13 12:08:14,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:08:14,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:08:14,996 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 12:08:15,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 12:08:15,054 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-10-13 12:08:15,054 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-10-13 12:08:15,054 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-10-13 12:08:15,055 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-10-13 12:08:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-13 12:08:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 12:08:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 12:08:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-13 12:08:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 12:08:15,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 12:08:15,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 12:08:15,057 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-13 12:08:15,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 12:08:15,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 12:08:15,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 12:08:15,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 12:08:15,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 12:08:15,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 12:08:15,060 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 12:08:15,256 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 12:08:15,259 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 12:08:15,547 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 12:08:15,547 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 12:08:15,713 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 12:08:15,713 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 12:08:15,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:08:15 BoogieIcfgContainer [2024-10-13 12:08:15,714 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 12:08:15,716 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 12:08:15,716 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 12:08:15,720 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 12:08:15,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:08:13" (1/3) ... [2024-10-13 12:08:15,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4781c04a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:08:15, skipping insertion in model container [2024-10-13 12:08:15,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:14" (2/3) ... [2024-10-13 12:08:15,722 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4781c04a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:08:15, skipping insertion in model container [2024-10-13 12:08:15,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:08:15" (3/3) ... [2024-10-13 12:08:15,723 INFO L112 eAbstractionObserver]: Analyzing ICFG stack_longer-1.i [2024-10-13 12:08:15,742 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 12:08:15,743 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-10-13 12:08:15,743 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 12:08:15,830 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-13 12:08:15,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 55 transitions, 124 flow [2024-10-13 12:08:15,909 INFO L124 PetriNetUnfolderBase]: 9/53 cut-off events. [2024-10-13 12:08:15,912 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-13 12:08:15,917 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 8. Compared 144 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-13 12:08:15,918 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 55 transitions, 124 flow [2024-10-13 12:08:15,923 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 52 transitions, 116 flow [2024-10-13 12:08:15,941 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:08:15,950 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;@1f2f705a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:08:15,950 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-10-13 12:08:15,963 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 12:08:15,964 INFO L124 PetriNetUnfolderBase]: 1/19 cut-off events. [2024-10-13 12:08:15,964 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-13 12:08:15,964 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:08:15,968 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:08:15,969 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-13 12:08:15,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:08:15,975 INFO L85 PathProgramCache]: Analyzing trace with hash 493317020, now seen corresponding path program 1 times [2024-10-13 12:08:15,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:08:15,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046369090] [2024-10-13 12:08:15,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:08:15,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:08:16,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:08:16,521 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-13 12:08:16,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:08:16,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046369090] [2024-10-13 12:08:16,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046369090] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:08:16,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:08:16,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:08:16,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935763083] [2024-10-13 12:08:16,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:08:16,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:08:16,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:08:16,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:08:16,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:08:16,595 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-10-13 12:08:16,599 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-13 12:08:16,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:08:16,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-10-13 12:08:16,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:08:16,940 INFO L124 PetriNetUnfolderBase]: 454/883 cut-off events. [2024-10-13 12:08:16,940 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-10-13 12:08:16,946 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 55. Compared 4518 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-13 12:08:16,956 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 43 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2024-10-13 12:08:16,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 60 transitions, 227 flow [2024-10-13 12:08:16,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:08:16,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:08:16,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2024-10-13 12:08:16,973 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5318181818181819 [2024-10-13 12:08:16,975 INFO L175 Difference]: Start difference. First operand has 50 places, 52 transitions, 116 flow. Second operand 4 states and 117 transitions. [2024-10-13 12:08:16,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 60 transitions, 227 flow [2024-10-13 12:08:16,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 60 transitions, 217 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-13 12:08:16,987 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 100 flow [2024-10-13 12:08:16,990 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-13 12:08:16,998 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2024-10-13 12:08:16,998 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 100 flow [2024-10-13 12:08:16,999 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-13 12:08:16,999 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:08:16,999 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:08:17,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 12:08:17,000 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-13 12:08:17,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:08:17,002 INFO L85 PathProgramCache]: Analyzing trace with hash 493317021, now seen corresponding path program 1 times [2024-10-13 12:08:17,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:08:17,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760803637] [2024-10-13 12:08:17,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:08:17,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:08:17,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:08:17,375 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-13 12:08:17,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:08:17,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760803637] [2024-10-13 12:08:17,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760803637] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:08:17,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:08:17,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:08:17,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263489235] [2024-10-13 12:08:17,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:08:17,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:08:17,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:08:17,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:08:17,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:08:17,405 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-10-13 12:08:17,407 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-13 12:08:17,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:08:17,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-10-13 12:08:17,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:08:17,860 INFO L124 PetriNetUnfolderBase]: 750/1388 cut-off events. [2024-10-13 12:08:17,860 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2024-10-13 12:08:17,863 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 7425 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-13 12:08:17,872 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 87 selfloop transitions, 8 changer transitions 0/108 dead transitions. [2024-10-13 12:08:17,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 108 transitions, 423 flow [2024-10-13 12:08:17,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:08:17,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 12:08:17,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 194 transitions. [2024-10-13 12:08:17,875 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5878787878787879 [2024-10-13 12:08:17,875 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 100 flow. Second operand 6 states and 194 transitions. [2024-10-13 12:08:17,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 108 transitions, 423 flow [2024-10-13 12:08:17,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 108 transitions, 415 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-13 12:08:17,881 INFO L231 Difference]: Finished difference. Result has 52 places, 53 transitions, 153 flow [2024-10-13 12:08:17,882 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-13 12:08:17,883 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2024-10-13 12:08:17,884 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 53 transitions, 153 flow [2024-10-13 12:08:17,884 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-13 12:08:17,885 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:08:17,885 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:08:17,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 12:08:17,885 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-13 12:08:17,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:08:17,887 INFO L85 PathProgramCache]: Analyzing trace with hash -860785579, now seen corresponding path program 1 times [2024-10-13 12:08:17,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:08:17,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727252051] [2024-10-13 12:08:17,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:08:17,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:08:17,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:08:17,969 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-13 12:08:17,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:08:17,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727252051] [2024-10-13 12:08:17,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727252051] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:08:17,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:08:17,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:08:17,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424040396] [2024-10-13 12:08:17,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:08:17,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:08:17,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:08:17,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:08:17,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:08:17,973 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-10-13 12:08:17,973 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-13 12:08:17,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:08:17,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-10-13 12:08:17,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:08:18,217 INFO L124 PetriNetUnfolderBase]: 663/1274 cut-off events. [2024-10-13 12:08:18,217 INFO L125 PetriNetUnfolderBase]: For 155/155 co-relation queries the response was YES. [2024-10-13 12:08:18,221 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 6563 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-13 12:08:18,229 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 67 selfloop transitions, 6 changer transitions 0/87 dead transitions. [2024-10-13 12:08:18,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 87 transitions, 376 flow [2024-10-13 12:08:18,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:08:18,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 12:08:18,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 160 transitions. [2024-10-13 12:08:18,232 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5818181818181818 [2024-10-13 12:08:18,232 INFO L175 Difference]: Start difference. First operand has 52 places, 53 transitions, 153 flow. Second operand 5 states and 160 transitions. [2024-10-13 12:08:18,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 87 transitions, 376 flow [2024-10-13 12:08:18,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 87 transitions, 374 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-10-13 12:08:18,238 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 161 flow [2024-10-13 12:08:18,238 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-13 12:08:18,239 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 6 predicate places. [2024-10-13 12:08:18,239 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 161 flow [2024-10-13 12:08:18,239 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-13 12:08:18,239 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:08:18,239 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:08:18,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 12:08:18,240 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-13 12:08:18,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:08:18,240 INFO L85 PathProgramCache]: Analyzing trace with hash -12933470, now seen corresponding path program 1 times [2024-10-13 12:08:18,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:08:18,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5931411] [2024-10-13 12:08:18,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:08:18,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:08:18,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:08:18,316 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-13 12:08:18,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:08:18,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5931411] [2024-10-13 12:08:18,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5931411] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:08:18,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:08:18,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:08:18,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120062721] [2024-10-13 12:08:18,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:08:18,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:08:18,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:08:18,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:08:18,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:08:18,320 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-10-13 12:08:18,321 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-13 12:08:18,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:08:18,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-10-13 12:08:18,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:08:18,651 INFO L124 PetriNetUnfolderBase]: 971/1835 cut-off events. [2024-10-13 12:08:18,651 INFO L125 PetriNetUnfolderBase]: For 331/331 co-relation queries the response was YES. [2024-10-13 12:08:18,658 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 9682 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-13 12:08:18,670 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 73 selfloop transitions, 6 changer transitions 0/93 dead transitions. [2024-10-13 12:08:18,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 93 transitions, 429 flow [2024-10-13 12:08:18,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:08:18,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:08:18,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2024-10-13 12:08:18,675 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6318181818181818 [2024-10-13 12:08:18,675 INFO L175 Difference]: Start difference. First operand has 56 places, 52 transitions, 161 flow. Second operand 4 states and 139 transitions. [2024-10-13 12:08:18,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 93 transitions, 429 flow [2024-10-13 12:08:18,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 93 transitions, 429 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 12:08:18,681 INFO L231 Difference]: Finished difference. Result has 61 places, 55 transitions, 197 flow [2024-10-13 12:08:18,682 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-13 12:08:18,683 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 11 predicate places. [2024-10-13 12:08:18,683 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 55 transitions, 197 flow [2024-10-13 12:08:18,683 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-13 12:08:18,683 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:08:18,684 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:08:18,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 12:08:18,684 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-13 12:08:18,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:08:18,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1853953479, now seen corresponding path program 1 times [2024-10-13 12:08:18,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:08:18,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861049437] [2024-10-13 12:08:18,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:08:18,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:08:18,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:08:18,734 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-13 12:08:18,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:08:18,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861049437] [2024-10-13 12:08:18,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861049437] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:08:18,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:08:18,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:08:18,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087108908] [2024-10-13 12:08:18,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:08:18,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:08:18,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:08:18,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:08:18,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:08:18,740 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-10-13 12:08:18,741 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-13 12:08:18,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:08:18,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-10-13 12:08:18,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:08:19,050 INFO L124 PetriNetUnfolderBase]: 1096/2029 cut-off events. [2024-10-13 12:08:19,050 INFO L125 PetriNetUnfolderBase]: For 579/579 co-relation queries the response was YES. [2024-10-13 12:08:19,058 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 10881 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-13 12:08:19,070 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 62 selfloop transitions, 2 changer transitions 0/78 dead transitions. [2024-10-13 12:08:19,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 78 transitions, 397 flow [2024-10-13 12:08:19,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:08:19,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:08:19,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2024-10-13 12:08:19,073 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6424242424242425 [2024-10-13 12:08:19,073 INFO L175 Difference]: Start difference. First operand has 61 places, 55 transitions, 197 flow. Second operand 3 states and 106 transitions. [2024-10-13 12:08:19,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 78 transitions, 397 flow [2024-10-13 12:08:19,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 78 transitions, 391 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-10-13 12:08:19,085 INFO L231 Difference]: Finished difference. Result has 63 places, 56 transitions, 203 flow [2024-10-13 12:08:19,085 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-13 12:08:19,086 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 13 predicate places. [2024-10-13 12:08:19,086 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 56 transitions, 203 flow [2024-10-13 12:08:19,087 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-13 12:08:19,087 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:08:19,087 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:08:19,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 12:08:19,088 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-13 12:08:19,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:08:19,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1588015164, now seen corresponding path program 1 times [2024-10-13 12:08:19,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:08:19,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147031405] [2024-10-13 12:08:19,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:08:19,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:08:19,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:08:19,150 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-13 12:08:19,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:08:19,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147031405] [2024-10-13 12:08:19,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147031405] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:08:19,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:08:19,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:08:19,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457359105] [2024-10-13 12:08:19,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:08:19,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:08:19,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:08:19,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:08:19,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:08:19,157 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-10-13 12:08:19,157 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-13 12:08:19,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:08:19,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-10-13 12:08:19,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:08:19,435 INFO L124 PetriNetUnfolderBase]: 1006/1856 cut-off events. [2024-10-13 12:08:19,435 INFO L125 PetriNetUnfolderBase]: For 474/474 co-relation queries the response was YES. [2024-10-13 12:08:19,441 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 9913 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-13 12:08:19,452 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 49 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2024-10-13 12:08:19,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 64 transitions, 313 flow [2024-10-13 12:08:19,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:08:19,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:08:19,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2024-10-13 12:08:19,454 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5818181818181818 [2024-10-13 12:08:19,454 INFO L175 Difference]: Start difference. First operand has 63 places, 56 transitions, 203 flow. Second operand 3 states and 96 transitions. [2024-10-13 12:08:19,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 64 transitions, 313 flow [2024-10-13 12:08:19,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 64 transitions, 303 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-10-13 12:08:19,459 INFO L231 Difference]: Finished difference. Result has 60 places, 53 transitions, 180 flow [2024-10-13 12:08:19,459 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-13 12:08:19,460 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 10 predicate places. [2024-10-13 12:08:19,460 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 180 flow [2024-10-13 12:08:19,461 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-13 12:08:19,461 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:08:19,461 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:08:19,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 12:08:19,462 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-13 12:08:19,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:08:19,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1819283733, now seen corresponding path program 1 times [2024-10-13 12:08:19,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:08:19,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207850108] [2024-10-13 12:08:19,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:08:19,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:08:19,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:08:19,776 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-13 12:08:19,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:08:19,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207850108] [2024-10-13 12:08:19,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207850108] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:08:19,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049755963] [2024-10-13 12:08:19,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:08:19,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:08:19,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:08:19,782 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 12:08:19,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 12:08:19,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:08:19,896 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-13 12:08:19,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:08:20,218 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-13 12:08:20,219 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:08:20,437 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-13 12:08:20,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049755963] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:08:20,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:08:20,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2024-10-13 12:08:20,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75375386] [2024-10-13 12:08:20,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:08:20,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 12:08:20,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:08:20,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 12:08:20,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-10-13 12:08:20,522 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-10-13 12:08:20,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 53 transitions, 180 flow. Second operand has 14 states, 14 states have (on average 19.214285714285715) internal successors, (269), 14 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:08:20,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:08:20,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-10-13 12:08:20,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:08:22,522 INFO L124 PetriNetUnfolderBase]: 4128/7722 cut-off events. [2024-10-13 12:08:22,522 INFO L125 PetriNetUnfolderBase]: For 2485/2485 co-relation queries the response was YES. [2024-10-13 12:08:22,561 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 50405 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-13 12:08:22,716 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 327 selfloop transitions, 45 changer transitions 0/386 dead transitions. [2024-10-13 12:08:22,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 386 transitions, 1892 flow [2024-10-13 12:08:22,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-13 12:08:22,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-10-13 12:08:22,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 685 transitions. [2024-10-13 12:08:22,720 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6227272727272727 [2024-10-13 12:08:22,721 INFO L175 Difference]: Start difference. First operand has 60 places, 53 transitions, 180 flow. Second operand 20 states and 685 transitions. [2024-10-13 12:08:22,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 386 transitions, 1892 flow [2024-10-13 12:08:22,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 386 transitions, 1850 flow, removed 19 selfloop flow, removed 2 redundant places. [2024-10-13 12:08:22,740 INFO L231 Difference]: Finished difference. Result has 92 places, 98 transitions, 592 flow [2024-10-13 12:08:22,740 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-13 12:08:22,742 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 42 predicate places. [2024-10-13 12:08:22,742 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 98 transitions, 592 flow [2024-10-13 12:08:22,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 19.214285714285715) internal successors, (269), 14 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:08:22,743 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:08:22,743 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-13 12:08:22,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 12:08:22,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:08:22,948 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-13 12:08:22,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:08:22,949 INFO L85 PathProgramCache]: Analyzing trace with hash 577278495, now seen corresponding path program 1 times [2024-10-13 12:08:22,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:08:22,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103757999] [2024-10-13 12:08:22,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:08:22,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:08:22,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:08:23,060 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-13 12:08:23,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:08:23,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103757999] [2024-10-13 12:08:23,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103757999] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:08:23,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:08:23,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:08:23,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950953142] [2024-10-13 12:08:23,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:08:23,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:08:23,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:08:23,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:08:23,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:08:23,065 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-10-13 12:08:23,065 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-13 12:08:23,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:08:23,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-10-13 12:08:23,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:08:23,610 INFO L124 PetriNetUnfolderBase]: 1833/3828 cut-off events. [2024-10-13 12:08:23,611 INFO L125 PetriNetUnfolderBase]: For 2279/2279 co-relation queries the response was YES. [2024-10-13 12:08:23,628 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 95. Compared 22279 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-13 12:08:23,644 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 70 selfloop transitions, 4 changer transitions 0/89 dead transitions. [2024-10-13 12:08:23,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 89 transitions, 609 flow [2024-10-13 12:08:23,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:08:23,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:08:23,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2024-10-13 12:08:23,646 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5696969696969697 [2024-10-13 12:08:23,646 INFO L175 Difference]: Start difference. First operand has 92 places, 98 transitions, 592 flow. Second operand 3 states and 94 transitions. [2024-10-13 12:08:23,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 89 transitions, 609 flow [2024-10-13 12:08:23,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 89 transitions, 561 flow, removed 23 selfloop flow, removed 6 redundant places. [2024-10-13 12:08:23,662 INFO L231 Difference]: Finished difference. Result has 83 places, 78 transitions, 389 flow [2024-10-13 12:08:23,662 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-13 12:08:23,663 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 33 predicate places. [2024-10-13 12:08:23,663 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 78 transitions, 389 flow [2024-10-13 12:08:23,663 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-13 12:08:23,663 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:08:23,663 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-13 12:08:23,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 12:08:23,664 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-13 12:08:23,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:08:23,664 INFO L85 PathProgramCache]: Analyzing trace with hash 716793377, now seen corresponding path program 1 times [2024-10-13 12:08:23,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:08:23,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182122891] [2024-10-13 12:08:23,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:08:23,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:08:23,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:08:23,756 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-13 12:08:23,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:08:23,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182122891] [2024-10-13 12:08:23,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182122891] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:08:23,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:08:23,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:08:23,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143496420] [2024-10-13 12:08:23,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:08:23,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:08:23,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:08:23,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:08:23,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:08:23,780 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-10-13 12:08:23,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 78 transitions, 389 flow. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 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-13 12:08:23,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:08:23,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-10-13 12:08:23,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:08:24,246 INFO L124 PetriNetUnfolderBase]: 1838/3730 cut-off events. [2024-10-13 12:08:24,247 INFO L125 PetriNetUnfolderBase]: For 1489/1489 co-relation queries the response was YES. [2024-10-13 12:08:24,265 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 92. Compared 21430 event pairs, 1002 based on Foata normal form. 0/3605 useless extension candidates. Maximal degree in co-relation 7894. Up to 2166 conditions per place. [2024-10-13 12:08:24,284 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 56 selfloop transitions, 18 changer transitions 0/88 dead transitions. [2024-10-13 12:08:24,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 88 transitions, 565 flow [2024-10-13 12:08:24,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:08:24,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 12:08:24,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2024-10-13 12:08:24,286 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.44363636363636366 [2024-10-13 12:08:24,286 INFO L175 Difference]: Start difference. First operand has 83 places, 78 transitions, 389 flow. Second operand 5 states and 122 transitions. [2024-10-13 12:08:24,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 88 transitions, 565 flow [2024-10-13 12:08:24,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 88 transitions, 561 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:08:24,296 INFO L231 Difference]: Finished difference. Result has 85 places, 77 transitions, 419 flow [2024-10-13 12:08:24,297 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=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=419, PETRI_PLACES=85, PETRI_TRANSITIONS=77} [2024-10-13 12:08:24,297 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 35 predicate places. [2024-10-13 12:08:24,298 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 77 transitions, 419 flow [2024-10-13 12:08:24,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 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-13 12:08:24,298 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:08:24,298 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-13 12:08:24,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 12:08:24,299 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-13 12:08:24,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:08:24,299 INFO L85 PathProgramCache]: Analyzing trace with hash 5313600, now seen corresponding path program 1 times [2024-10-13 12:08:24,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:08:24,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884815327] [2024-10-13 12:08:24,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:08:24,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:08:24,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:08:24,648 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-13 12:08:24,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:08:24,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884815327] [2024-10-13 12:08:24,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884815327] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:08:24,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:08:24,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 12:08:24,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972863834] [2024-10-13 12:08:24,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:08:24,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 12:08:24,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:08:24,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 12:08:24,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-13 12:08:24,680 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-10-13 12:08:24,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 77 transitions, 419 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-13 12:08:24,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:08:24,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-10-13 12:08:24,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:08:25,407 INFO L124 PetriNetUnfolderBase]: 1961/3997 cut-off events. [2024-10-13 12:08:25,407 INFO L125 PetriNetUnfolderBase]: For 2197/2197 co-relation queries the response was YES. [2024-10-13 12:08:25,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10051 conditions, 3997 events. 1961/3997 cut-off events. For 2197/2197 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 23139 event pairs, 461 based on Foata normal form. 0/3837 useless extension candidates. Maximal degree in co-relation 8547. Up to 2936 conditions per place. [2024-10-13 12:08:25,440 INFO L140 encePairwiseOnDemand]: 46/55 looper letters, 110 selfloop transitions, 9 changer transitions 0/132 dead transitions. [2024-10-13 12:08:25,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 132 transitions, 831 flow [2024-10-13 12:08:25,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 12:08:25,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-13 12:08:25,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 219 transitions. [2024-10-13 12:08:25,442 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49772727272727274 [2024-10-13 12:08:25,443 INFO L175 Difference]: Start difference. First operand has 85 places, 77 transitions, 419 flow. Second operand 8 states and 219 transitions. [2024-10-13 12:08:25,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 132 transitions, 831 flow [2024-10-13 12:08:25,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 132 transitions, 787 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-13 12:08:25,461 INFO L231 Difference]: Finished difference. Result has 91 places, 82 transitions, 442 flow [2024-10-13 12:08:25,462 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-13 12:08:25,463 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 41 predicate places. [2024-10-13 12:08:25,463 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 82 transitions, 442 flow [2024-10-13 12:08:25,463 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-13 12:08:25,463 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:08:25,464 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-13 12:08:25,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 12:08:25,464 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-13 12:08:25,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:08:25,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1334438469, now seen corresponding path program 1 times [2024-10-13 12:08:25,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:08:25,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534078607] [2024-10-13 12:08:25,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:08:25,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:08:25,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:08:25,521 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-13 12:08:25,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:08:25,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534078607] [2024-10-13 12:08:25,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534078607] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:08:25,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:08:25,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:08:25,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545783667] [2024-10-13 12:08:25,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:08:25,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:08:25,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:08:25,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:08:25,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:08:25,526 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-10-13 12:08:25,527 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-13 12:08:25,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:08:25,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-10-13 12:08:25,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:08:26,387 INFO L124 PetriNetUnfolderBase]: 2879/6069 cut-off events. [2024-10-13 12:08:26,387 INFO L125 PetriNetUnfolderBase]: For 3090/3090 co-relation queries the response was YES. [2024-10-13 12:08:26,416 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 40441 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-13 12:08:26,440 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 124 selfloop transitions, 2 changer transitions 0/140 dead transitions. [2024-10-13 12:08:26,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 140 transitions, 1054 flow [2024-10-13 12:08:26,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:08:26,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:08:26,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2024-10-13 12:08:26,442 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6484848484848484 [2024-10-13 12:08:26,442 INFO L175 Difference]: Start difference. First operand has 91 places, 82 transitions, 442 flow. Second operand 3 states and 107 transitions. [2024-10-13 12:08:26,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 140 transitions, 1054 flow [2024-10-13 12:08:26,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 140 transitions, 1038 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-13 12:08:26,459 INFO L231 Difference]: Finished difference. Result has 90 places, 83 transitions, 445 flow [2024-10-13 12:08:26,460 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-13 12:08:26,461 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 40 predicate places. [2024-10-13 12:08:26,461 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 83 transitions, 445 flow [2024-10-13 12:08:26,461 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-13 12:08:26,461 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:08:26,461 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-13 12:08:26,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 12:08:26,462 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-13 12:08:26,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:08:26,462 INFO L85 PathProgramCache]: Analyzing trace with hash 717766388, now seen corresponding path program 1 times [2024-10-13 12:08:26,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:08:26,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722190684] [2024-10-13 12:08:26,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:08:26,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:08:26,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:08:26,539 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-13 12:08:26,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:08:26,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722190684] [2024-10-13 12:08:26,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722190684] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:08:26,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:08:26,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:08:26,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606286815] [2024-10-13 12:08:26,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:08:26,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:08:26,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:08:26,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:08:26,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:08:26,546 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-10-13 12:08:26,546 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-13 12:08:26,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:08:26,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-10-13 12:08:26,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:08:27,377 INFO L124 PetriNetUnfolderBase]: 3194/6487 cut-off events. [2024-10-13 12:08:27,377 INFO L125 PetriNetUnfolderBase]: For 4314/4314 co-relation queries the response was YES. [2024-10-13 12:08:27,415 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 42420 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-13 12:08:27,444 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 109 selfloop transitions, 10 changer transitions 0/133 dead transitions. [2024-10-13 12:08:27,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 133 transitions, 930 flow [2024-10-13 12:08:27,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:08:27,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 12:08:27,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 152 transitions. [2024-10-13 12:08:27,447 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5527272727272727 [2024-10-13 12:08:27,447 INFO L175 Difference]: Start difference. First operand has 90 places, 83 transitions, 445 flow. Second operand 5 states and 152 transitions. [2024-10-13 12:08:27,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 133 transitions, 930 flow [2024-10-13 12:08:27,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 133 transitions, 923 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-10-13 12:08:27,472 INFO L231 Difference]: Finished difference. Result has 96 places, 88 transitions, 519 flow [2024-10-13 12:08:27,473 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-13 12:08:27,474 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 46 predicate places. [2024-10-13 12:08:27,475 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 88 transitions, 519 flow [2024-10-13 12:08:27,475 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-13 12:08:27,476 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:08:27,476 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-13 12:08:27,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 12:08:27,476 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-13 12:08:27,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:08:27,477 INFO L85 PathProgramCache]: Analyzing trace with hash 831181812, now seen corresponding path program 1 times [2024-10-13 12:08:27,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:08:27,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315548944] [2024-10-13 12:08:27,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:08:27,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:08:27,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:08:28,050 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-13 12:08:28,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:08:28,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315548944] [2024-10-13 12:08:28,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315548944] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:08:28,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:08:28,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 12:08:28,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396769129] [2024-10-13 12:08:28,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:08:28,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 12:08:28,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:08:28,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 12:08:28,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-13 12:08:28,086 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-10-13 12:08:28,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 88 transitions, 519 flow. Second operand has 9 states, 9 states have (on average 19.11111111111111) internal successors, (172), 9 states have internal predecessors, (172), 0 states have call successors, (0), 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-13 12:08:28,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:08:28,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-10-13 12:08:28,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:08:29,935 INFO L124 PetriNetUnfolderBase]: 5347/10919 cut-off events. [2024-10-13 12:08:29,935 INFO L125 PetriNetUnfolderBase]: For 10085/10085 co-relation queries the response was YES. [2024-10-13 12:08:30,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30633 conditions, 10919 events. 5347/10919 cut-off events. For 10085/10085 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 78445 event pairs, 1255 based on Foata normal form. 0/10666 useless extension candidates. Maximal degree in co-relation 25008. Up to 4690 conditions per place. [2024-10-13 12:08:30,069 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 201 selfloop transitions, 22 changer transitions 0/237 dead transitions. [2024-10-13 12:08:30,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 237 transitions, 1743 flow [2024-10-13 12:08:30,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 12:08:30,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-13 12:08:30,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 300 transitions. [2024-10-13 12:08:30,072 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2024-10-13 12:08:30,072 INFO L175 Difference]: Start difference. First operand has 96 places, 88 transitions, 519 flow. Second operand 10 states and 300 transitions. [2024-10-13 12:08:30,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 237 transitions, 1743 flow [2024-10-13 12:08:30,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 237 transitions, 1741 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:08:30,123 INFO L231 Difference]: Finished difference. Result has 108 places, 104 transitions, 714 flow [2024-10-13 12:08:30,124 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=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=714, PETRI_PLACES=108, PETRI_TRANSITIONS=104} [2024-10-13 12:08:30,126 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 58 predicate places. [2024-10-13 12:08:30,126 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 104 transitions, 714 flow [2024-10-13 12:08:30,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.11111111111111) internal successors, (172), 9 states have internal predecessors, (172), 0 states have call successors, (0), 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-13 12:08:30,126 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:08:30,127 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-13 12:08:30,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 12:08:30,127 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-13 12:08:30,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:08:30,128 INFO L85 PathProgramCache]: Analyzing trace with hash -496639167, now seen corresponding path program 1 times [2024-10-13 12:08:30,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:08:30,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755834628] [2024-10-13 12:08:30,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:08:30,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:08:30,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:08:30,202 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-13 12:08:30,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:08:30,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755834628] [2024-10-13 12:08:30,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755834628] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:08:30,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116794739] [2024-10-13 12:08:30,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:08:30,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:08:30,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:08:30,206 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 12:08:30,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 12:08:30,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:08:30,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 12:08:30,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:08:30,347 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-13 12:08:30,348 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:08:30,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116794739] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:08:30,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 12:08:30,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2024-10-13 12:08:30,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783021089] [2024-10-13 12:08:30,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:08:30,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:08:30,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:08:30,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:08:30,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:08:30,360 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-10-13 12:08:30,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 104 transitions, 714 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-13 12:08:30,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:08:30,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-10-13 12:08:30,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:08:31,687 INFO L124 PetriNetUnfolderBase]: 5346/10809 cut-off events. [2024-10-13 12:08:31,687 INFO L125 PetriNetUnfolderBase]: For 13005/13005 co-relation queries the response was YES. [2024-10-13 12:08:31,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31825 conditions, 10809 events. 5346/10809 cut-off events. For 13005/13005 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 78298 event pairs, 4242 based on Foata normal form. 37/10575 useless extension candidates. Maximal degree in co-relation 26059. Up to 9151 conditions per place. [2024-10-13 12:08:31,890 INFO L140 encePairwiseOnDemand]: 53/55 looper letters, 88 selfloop transitions, 1 changer transitions 2/103 dead transitions. [2024-10-13 12:08:31,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 103 transitions, 892 flow [2024-10-13 12:08:31,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:08:31,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:08:31,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-10-13 12:08:31,891 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2024-10-13 12:08:31,891 INFO L175 Difference]: Start difference. First operand has 108 places, 104 transitions, 714 flow. Second operand 3 states and 80 transitions. [2024-10-13 12:08:31,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 103 transitions, 892 flow [2024-10-13 12:08:31,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 103 transitions, 876 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-10-13 12:08:31,945 INFO L231 Difference]: Finished difference. Result has 106 places, 101 transitions, 693 flow [2024-10-13 12:08:31,945 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=693, PETRI_PLACES=106, PETRI_TRANSITIONS=101} [2024-10-13 12:08:31,946 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 56 predicate places. [2024-10-13 12:08:31,946 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 101 transitions, 693 flow [2024-10-13 12:08:31,946 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-13 12:08:31,946 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:08:31,946 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-13 12:08:31,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 12:08:32,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-13 12:08:32,148 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-13 12:08:32,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:08:32,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1260113550, now seen corresponding path program 1 times [2024-10-13 12:08:32,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:08:32,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875282171] [2024-10-13 12:08:32,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:08:32,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:08:32,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:08:32,552 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:08:32,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:08:32,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875282171] [2024-10-13 12:08:32,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875282171] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:08:32,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204075412] [2024-10-13 12:08:32,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:08:32,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:08:32,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:08:32,557 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 12:08:32,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 12:08:32,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:08:32,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-13 12:08:32,674 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:08:33,061 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-13 12:08:33,061 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:08:33,329 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-13 12:08:33,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204075412] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:08:33,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:08:33,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 17 [2024-10-13 12:08:33,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322320583] [2024-10-13 12:08:33,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:08:33,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-13 12:08:33,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:08:33,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-13 12:08:33,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2024-10-13 12:08:33,475 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-10-13 12:08:33,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 101 transitions, 693 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-13 12:08:33,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:08:33,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-10-13 12:08:33,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:08:37,996 INFO L124 PetriNetUnfolderBase]: 11456/23033 cut-off events. [2024-10-13 12:08:37,997 INFO L125 PetriNetUnfolderBase]: For 26340/26340 co-relation queries the response was YES. [2024-10-13 12:08:38,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67294 conditions, 23033 events. 11456/23033 cut-off events. For 26340/26340 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 183351 event pairs, 1776 based on Foata normal form. 209/22669 useless extension candidates. Maximal degree in co-relation 67254. Up to 3694 conditions per place. [2024-10-13 12:08:38,343 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 493 selfloop transitions, 159 changer transitions 0/663 dead transitions. [2024-10-13 12:08:38,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 663 transitions, 4889 flow [2024-10-13 12:08:38,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-10-13 12:08:38,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2024-10-13 12:08:38,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 1181 transitions. [2024-10-13 12:08:38,351 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4880165289256198 [2024-10-13 12:08:38,351 INFO L175 Difference]: Start difference. First operand has 106 places, 101 transitions, 693 flow. Second operand 44 states and 1181 transitions. [2024-10-13 12:08:38,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 663 transitions, 4889 flow [2024-10-13 12:08:38,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 663 transitions, 4886 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-10-13 12:08:38,466 INFO L231 Difference]: Finished difference. Result has 167 places, 244 transitions, 2459 flow [2024-10-13 12:08:38,467 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=2459, PETRI_PLACES=167, PETRI_TRANSITIONS=244} [2024-10-13 12:08:38,467 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 117 predicate places. [2024-10-13 12:08:38,467 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 244 transitions, 2459 flow [2024-10-13 12:08:38,468 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-13 12:08:38,468 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:08:38,468 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-13 12:08:38,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 12:08:38,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:08:38,673 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-13 12:08:38,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:08:38,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1203192130, now seen corresponding path program 1 times [2024-10-13 12:08:38,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:08:38,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089141962] [2024-10-13 12:08:38,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:08:38,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:08:38,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:08:38,832 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-13 12:08:38,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:08:38,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089141962] [2024-10-13 12:08:38,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089141962] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:08:38,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194079903] [2024-10-13 12:08:38,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:08:38,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:08:38,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:08:38,836 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 12:08:38,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 12:08:39,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:08:39,060 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 12:08:39,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:08:39,114 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-13 12:08:39,114 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:08:39,152 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-13 12:08:39,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194079903] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:08:39,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:08:39,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-10-13 12:08:39,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896165166] [2024-10-13 12:08:39,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:08:39,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:08:39,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:08:39,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:08:39,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:08:39,154 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-10-13 12:08:39,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 244 transitions, 2459 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-13 12:08:39,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:08:39,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-10-13 12:08:39,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:08:42,330 INFO L124 PetriNetUnfolderBase]: 8844/17951 cut-off events. [2024-10-13 12:08:42,330 INFO L125 PetriNetUnfolderBase]: For 40558/40558 co-relation queries the response was YES. [2024-10-13 12:08:42,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58666 conditions, 17951 events. 8844/17951 cut-off events. For 40558/40558 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 133841 event pairs, 2955 based on Foata normal form. 14/17528 useless extension candidates. Maximal degree in co-relation 58604. Up to 13544 conditions per place. [2024-10-13 12:08:42,522 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 239 selfloop transitions, 13 changer transitions 0/264 dead transitions. [2024-10-13 12:08:42,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 264 transitions, 2895 flow [2024-10-13 12:08:42,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:08:42,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 12:08:42,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 165 transitions. [2024-10-13 12:08:42,524 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-10-13 12:08:42,524 INFO L175 Difference]: Start difference. First operand has 167 places, 244 transitions, 2459 flow. Second operand 5 states and 165 transitions. [2024-10-13 12:08:42,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 264 transitions, 2895 flow [2024-10-13 12:08:42,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 264 transitions, 2590 flow, removed 148 selfloop flow, removed 2 redundant places. [2024-10-13 12:08:42,771 INFO L231 Difference]: Finished difference. Result has 171 places, 220 transitions, 1943 flow [2024-10-13 12:08:42,772 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=1882, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1943, PETRI_PLACES=171, PETRI_TRANSITIONS=220} [2024-10-13 12:08:42,772 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 121 predicate places. [2024-10-13 12:08:42,773 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 220 transitions, 1943 flow [2024-10-13 12:08:42,773 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-13 12:08:42,774 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:08:42,774 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-13 12:08:42,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-13 12:08:42,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-13 12:08:42,979 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-13 12:08:42,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:08:42,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1501752532, now seen corresponding path program 1 times [2024-10-13 12:08:42,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:08:42,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557463729] [2024-10-13 12:08:42,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:08:42,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:08:43,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:08:43,032 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 12:08:43,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:08:43,097 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 12:08:43,098 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 12:08:43,099 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t2Err2ASSERT_VIOLATIONMEMORY_LEAK (14 of 15 remaining) [2024-10-13 12:08:43,101 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (13 of 15 remaining) [2024-10-13 12:08:43,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 15 remaining) [2024-10-13 12:08:43,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 15 remaining) [2024-10-13 12:08:43,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2024-10-13 12:08:43,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2024-10-13 12:08:43,103 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONMEMORY_LEAK (8 of 15 remaining) [2024-10-13 12:08:43,103 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2024-10-13 12:08:43,103 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2024-10-13 12:08:43,103 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONMEMORY_LEAK (5 of 15 remaining) [2024-10-13 12:08:43,103 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2024-10-13 12:08:43,103 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2024-10-13 12:08:43,104 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONMEMORY_LEAK (2 of 15 remaining) [2024-10-13 12:08:43,105 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 15 remaining) [2024-10-13 12:08:43,105 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 15 remaining) [2024-10-13 12:08:43,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 12:08:43,106 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-13 12:08:43,191 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-13 12:08:43,191 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 12:08:43,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:08:43 BasicIcfg [2024-10-13 12:08:43,199 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 12:08:43,200 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 12:08:43,201 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 12:08:43,201 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 12:08:43,202 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:08:15" (3/4) ... [2024-10-13 12:08:43,204 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 12:08:43,205 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 12:08:43,206 INFO L158 Benchmark]: Toolchain (without parser) took 29286.48ms. Allocated memory was 163.6MB in the beginning and 6.9GB in the end (delta: 6.7GB). Free memory was 106.0MB in the beginning and 6.1GB in the end (delta: -6.0GB). Peak memory consumption was 739.5MB. Max. memory is 16.1GB. [2024-10-13 12:08:43,206 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 163.6MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:08:43,207 INFO L158 Benchmark]: CACSL2BoogieTranslator took 809.76ms. Allocated memory is still 163.6MB. Free memory was 105.6MB in the beginning and 74.0MB in the end (delta: 31.6MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-13 12:08:43,207 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.04ms. Allocated memory is still 163.6MB. Free memory was 74.0MB in the beginning and 71.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 12:08:43,207 INFO L158 Benchmark]: Boogie Preprocessor took 120.20ms. Allocated memory is still 163.6MB. Free memory was 71.1MB in the beginning and 131.8MB in the end (delta: -60.7MB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. [2024-10-13 12:08:43,207 INFO L158 Benchmark]: RCFGBuilder took 789.61ms. Allocated memory is still 163.6MB. Free memory was 131.8MB in the beginning and 94.5MB in the end (delta: 37.3MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-10-13 12:08:43,208 INFO L158 Benchmark]: TraceAbstraction took 27483.70ms. Allocated memory was 163.6MB in the beginning and 6.9GB in the end (delta: 6.7GB). Free memory was 94.1MB in the beginning and 6.1GB in the end (delta: -6.0GB). Peak memory consumption was 728.4MB. Max. memory is 16.1GB. [2024-10-13 12:08:43,208 INFO L158 Benchmark]: Witness Printer took 5.34ms. Allocated memory is still 6.9GB. Free memory was 6.1GB in the beginning and 6.1GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:08:43,210 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.19ms. Allocated memory is still 163.6MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 809.76ms. Allocated memory is still 163.6MB. Free memory was 105.6MB in the beginning and 74.0MB in the end (delta: 31.6MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.04ms. Allocated memory is still 163.6MB. Free memory was 74.0MB in the beginning and 71.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 120.20ms. Allocated memory is still 163.6MB. Free memory was 71.1MB in the beginning and 131.8MB in the end (delta: -60.7MB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. * RCFGBuilder took 789.61ms. Allocated memory is still 163.6MB. Free memory was 131.8MB in the beginning and 94.5MB in the end (delta: 37.3MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 27483.70ms. Allocated memory was 163.6MB in the beginning and 6.9GB in the end (delta: 6.7GB). Free memory was 94.1MB in the beginning and 6.1GB in the end (delta: -6.0GB). Peak memory consumption was 728.4MB. Max. memory is 16.1GB. * Witness Printer took 5.34ms. Allocated memory is still 6.9GB. Free memory was 6.1GB in the beginning and 6.1GB in the end (delta: 1.0MB). 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[(400)]; [L936] 0 static unsigned int arr[(400)]; [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); [L1019] 0 pthread_t id1, id2; [L1021] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={3:0}, flag=0, id1=-1, m={4:0}, top=0] [L988] 1 int i; [L989] 1 unsigned int tmp; [L990] 1 i=0 VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L990] COND TRUE 1 i<(400) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L1022] 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] [L1004] 2 int i; [L1005] 2 i=0 VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L993] 1 tmp = __VERIFIER_nondet_uint() [L994] CALL 1 assume_abort_if_not(tmp < (400)) [L23] COND FALSE 1 !(!cond) [L994] RET 1 assume_abort_if_not(tmp < (400)) [L995] CALL, EXPR 1 push(arr,tmp) [L960] COND FALSE 1 !(top==(400)) [L967] CALL, EXPR 1 get_top() [L952] 1 return top; [L967] RET, EXPR 1 get_top() [L967] 1 stack[get_top()] = x [L968] CALL 1 inc_top() [L944] 1 top++ [L968] RET 1 inc_top() [L970] 1 return 0; VAL [\old(stack)={3:0}, \old(x)=399, \result=0, arr={3:0}, flag=0, m={4:0}, stack={3:0}, top=1, x=399] [L995] RET, EXPR 1 push(arr,tmp) [L995] COND FALSE 1 !(push(arr,tmp)==(-1)) [L997] 1 flag=(1) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, tmp=399, top=1] [L1005] COND TRUE 2 i<(400) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, top=1] [L1008] COND TRUE 2 \read(flag) [L1010] CALL, EXPR 2 pop(arr) [L974] CALL, EXPR 2 get_top() [L952] 2 return top; [L974] RET, EXPR 2 get_top() [L974] COND FALSE 2 !(get_top()==0) [L981] CALL 2 dec_top() [L948] 2 top-- [L981] RET 2 dec_top() [L982] CALL, EXPR 2 get_top() [L952] 2 return top; [L982] RET, EXPR 2 get_top() [L982] EXPR 2 stack[get_top()] [L982] 2 return stack[get_top()]; [L1010] RET, EXPR 2 pop(arr) [L1010] COND FALSE 2 !(!(pop(arr)!=(-2))) [L1005] 2 i++ VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1005] COND TRUE 2 i<(400) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1008] COND TRUE 2 \read(flag) [L1010] CALL, EXPR 2 pop(arr) [L974] CALL, EXPR 2 get_top() [L952] 2 return top; [L974] RET, EXPR 2 get_top() [L974] COND TRUE 2 get_top()==0 [L977] 2 return (-2); VAL [\old(stack)={3:0}, \result=-2, arr={3:0}, flag=1, m={4:0}, stack={3:0}, top=0] [L1010] RET, EXPR 2 pop(arr) [L1010] COND TRUE 2 !(pop(arr)!=(-2)) [L1011] CALL 2 error() [L940] 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_longer-1.c", 3, __extension__ __PRETTY_FUNCTION__) VAL [arr={3:0}, flag=1, m={4:0}, top=0] - UnprovableResult [Line: 1017]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1021]: 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: 1022]: 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: 27.2s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 20.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1699 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1640 mSDsluCounter, 251 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 224 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4507 IncrementalHoareTripleChecker+Invalid, 4562 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 27 mSDtfsCounter, 4507 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 309 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1014 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2459occurred in iteration=15, InterpolantAutomatonStates: 131, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 452 NumberOfCodeBlocks, 452 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 475 ConstructedInterpolants, 0 QuantifiedInterpolants, 3656 SizeOfPredicates, 14 NumberOfNonLiveVariables, 835 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 23 InterpolantComputations, 13 PerfectInterpolantSequences, 11/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-13 12:08:43,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack_longer-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 4351dece6a672e511bbcb86915e62fc8a7361763ad7ab88f2e640b2d00ea50a7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:08:45,880 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:08:45,972 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-13 12:08:45,978 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:08:45,979 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:08:46,015 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:08:46,016 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:08:46,018 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:08:46,018 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:08:46,019 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:08:46,020 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:08:46,020 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:08:46,021 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:08:46,023 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:08:46,023 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:08:46,024 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:08:46,024 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:08:46,024 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:08:46,025 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:08:46,025 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:08:46,025 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 12:08:46,026 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 12:08:46,030 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 12:08:46,030 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:08:46,031 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 12:08:46,031 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 12:08:46,031 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:08:46,032 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 12:08:46,032 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:08:46,032 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:08:46,032 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:08:46,033 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:08:46,033 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:08:46,033 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:08:46,033 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:08:46,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:08:46,034 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:08:46,034 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:08:46,034 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 12:08:46,034 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 12:08:46,035 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:08:46,036 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:08:46,037 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:08:46,037 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:08:46,037 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 12:08:46,037 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/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/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 -> 4351dece6a672e511bbcb86915e62fc8a7361763ad7ab88f2e640b2d00ea50a7 [2024-10-13 12:08:46,407 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:08:46,438 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:08:46,441 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:08:46,442 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:08:46,442 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:08:46,444 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack_longer-1.i [2024-10-13 12:08:48,228 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:08:48,588 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:08:48,589 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack_longer-1.i [2024-10-13 12:08:48,619 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5feab69a5/ada34183a6954c0982faf30b0778c455/FLAGc37070ee4 [2024-10-13 12:08:48,641 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5feab69a5/ada34183a6954c0982faf30b0778c455 [2024-10-13 12:08:48,644 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:08:48,645 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:08:48,647 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:08:48,647 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:08:48,654 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:08:48,655 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:08:48" (1/1) ... [2024-10-13 12:08:48,656 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@573b26d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:48, skipping insertion in model container [2024-10-13 12:08:48,656 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:08:48" (1/1) ... [2024-10-13 12:08:48,723 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:08:49,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:08:49,305 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 12:08:49,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:08:49,443 INFO L204 MainTranslator]: Completed translation [2024-10-13 12:08:49,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:49 WrapperNode [2024-10-13 12:08:49,444 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:08:49,445 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 12:08:49,445 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 12:08:49,445 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 12:08:49,453 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:49" (1/1) ... [2024-10-13 12:08:49,480 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:49" (1/1) ... [2024-10-13 12:08:49,510 INFO L138 Inliner]: procedures = 281, calls = 32, calls flagged for inlining = 13, calls inlined = 14, statements flattened = 153 [2024-10-13 12:08:49,511 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 12:08:49,514 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 12:08:49,514 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 12:08:49,514 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 12:08:49,525 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:49" (1/1) ... [2024-10-13 12:08:49,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:49" (1/1) ... [2024-10-13 12:08:49,541 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:49" (1/1) ... [2024-10-13 12:08:49,579 INFO L175 MemorySlicer]: Split 10 memory accesses to 3 slices as follows [2, 5, 3]. 50 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 2 writes are split as follows [0, 0, 2]. [2024-10-13 12:08:49,579 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:49" (1/1) ... [2024-10-13 12:08:49,579 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:49" (1/1) ... [2024-10-13 12:08:49,598 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:49" (1/1) ... [2024-10-13 12:08:49,605 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:49" (1/1) ... [2024-10-13 12:08:49,610 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:49" (1/1) ... [2024-10-13 12:08:49,612 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:49" (1/1) ... [2024-10-13 12:08:49,617 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 12:08:49,619 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 12:08:49,619 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 12:08:49,619 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 12:08:49,621 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:49" (1/1) ... [2024-10-13 12:08:49,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:08:49,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:08:49,666 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 12:08:49,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 12:08:49,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 12:08:49,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 12:08:49,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-13 12:08:49,715 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-10-13 12:08:49,715 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-10-13 12:08:49,716 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-10-13 12:08:49,716 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-10-13 12:08:49,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 12:08:49,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 12:08:49,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-13 12:08:49,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 12:08:49,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 12:08:49,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-13 12:08:49,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-13 12:08:49,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-13 12:08:49,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-13 12:08:49,717 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-13 12:08:49,717 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-13 12:08:49,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 12:08:49,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 12:08:49,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 12:08:49,719 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 12:08:49,933 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 12:08:49,937 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 12:08:50,321 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 12:08:50,331 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 12:08:50,607 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 12:08:50,608 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 12:08:50,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:08:50 BoogieIcfgContainer [2024-10-13 12:08:50,609 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 12:08:50,611 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 12:08:50,613 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 12:08:50,616 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 12:08:50,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:08:48" (1/3) ... [2024-10-13 12:08:50,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c58727a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:08:50, skipping insertion in model container [2024-10-13 12:08:50,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:49" (2/3) ... [2024-10-13 12:08:50,619 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c58727a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:08:50, skipping insertion in model container [2024-10-13 12:08:50,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:08:50" (3/3) ... [2024-10-13 12:08:50,620 INFO L112 eAbstractionObserver]: Analyzing ICFG stack_longer-1.i [2024-10-13 12:08:50,637 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 12:08:50,637 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-10-13 12:08:50,637 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 12:08:50,702 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-13 12:08:50,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 55 transitions, 124 flow [2024-10-13 12:08:50,779 INFO L124 PetriNetUnfolderBase]: 9/53 cut-off events. [2024-10-13 12:08:50,779 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-13 12:08:50,783 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 8. Compared 145 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-13 12:08:50,784 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 55 transitions, 124 flow [2024-10-13 12:08:50,787 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 52 transitions, 116 flow [2024-10-13 12:08:50,797 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:08:50,805 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;@635f4e9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:08:50,806 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-10-13 12:08:50,813 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 12:08:50,813 INFO L124 PetriNetUnfolderBase]: 1/19 cut-off events. [2024-10-13 12:08:50,813 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-13 12:08:50,813 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:08:50,814 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:08:50,815 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-13 12:08:50,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:08:50,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1622437433, now seen corresponding path program 1 times [2024-10-13 12:08:50,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:08:50,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1749766306] [2024-10-13 12:08:50,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:08:50,838 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-13 12:08:50,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:08:50,840 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-13 12:08:50,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-13 12:08:50,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:08:50,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 12:08:50,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:08:51,129 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-13 12:08:51,129 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:08:51,132 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:08:51,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1749766306] [2024-10-13 12:08:51,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1749766306] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:08:51,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:08:51,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:08:51,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099049942] [2024-10-13 12:08:51,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:08:51,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:08:51,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:08:51,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:08:51,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:08:51,210 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-10-13 12:08:51,214 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-13 12:08:51,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:08:51,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-10-13 12:08:51,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:08:51,570 INFO L124 PetriNetUnfolderBase]: 454/883 cut-off events. [2024-10-13 12:08:51,574 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-10-13 12:08:51,578 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 55. Compared 4530 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-13 12:08:51,594 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 43 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2024-10-13 12:08:51,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 60 transitions, 227 flow [2024-10-13 12:08:51,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:08:51,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:08:51,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2024-10-13 12:08:51,609 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5318181818181819 [2024-10-13 12:08:51,611 INFO L175 Difference]: Start difference. First operand has 50 places, 52 transitions, 116 flow. Second operand 4 states and 117 transitions. [2024-10-13 12:08:51,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 60 transitions, 227 flow [2024-10-13 12:08:51,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 60 transitions, 217 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-13 12:08:51,623 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 100 flow [2024-10-13 12:08:51,626 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-13 12:08:51,630 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2024-10-13 12:08:51,630 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 100 flow [2024-10-13 12:08:51,631 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-13 12:08:51,631 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:08:51,631 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:08:51,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-13 12:08:51,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-13 12:08:51,833 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-13 12:08:51,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:08:51,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1622437434, now seen corresponding path program 1 times [2024-10-13 12:08:51,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:08:51,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2106738771] [2024-10-13 12:08:51,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:08:51,835 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-13 12:08:51,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:08:51,838 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-13 12:08:51,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-13 12:08:51,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:08:51,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 12:08:51,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:08:52,114 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-13 12:08:52,115 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:08:52,115 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:08:52,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2106738771] [2024-10-13 12:08:52,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2106738771] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:08:52,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:08:52,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:08:52,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631178604] [2024-10-13 12:08:52,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:08:52,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:08:52,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:08:52,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:08:52,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:08:52,170 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-10-13 12:08:52,171 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-13 12:08:52,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:08:52,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-10-13 12:08:52,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:08:52,807 INFO L124 PetriNetUnfolderBase]: 750/1388 cut-off events. [2024-10-13 12:08:52,808 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2024-10-13 12:08:52,814 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 7410 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-13 12:08:52,822 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 87 selfloop transitions, 8 changer transitions 0/108 dead transitions. [2024-10-13 12:08:52,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 108 transitions, 423 flow [2024-10-13 12:08:52,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:08:52,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 12:08:52,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 194 transitions. [2024-10-13 12:08:52,829 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5878787878787879 [2024-10-13 12:08:52,830 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 100 flow. Second operand 6 states and 194 transitions. [2024-10-13 12:08:52,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 108 transitions, 423 flow [2024-10-13 12:08:52,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 108 transitions, 415 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-13 12:08:52,835 INFO L231 Difference]: Finished difference. Result has 52 places, 53 transitions, 153 flow [2024-10-13 12:08:52,836 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-13 12:08:52,837 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2024-10-13 12:08:52,837 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 53 transitions, 153 flow [2024-10-13 12:08:52,838 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-13 12:08:52,838 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:08:52,838 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:08:52,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-13 12:08:53,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/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-13 12:08:53,043 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-13 12:08:53,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:08:53,044 INFO L85 PathProgramCache]: Analyzing trace with hash -738373742, now seen corresponding path program 1 times [2024-10-13 12:08:53,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:08:53,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [741282116] [2024-10-13 12:08:53,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:08:53,045 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-13 12:08:53,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:08:53,047 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/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-13 12:08:53,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-13 12:08:53,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:08:53,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 12:08:53,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:08:53,155 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-13 12:08:53,155 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:08:53,156 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:08:53,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [741282116] [2024-10-13 12:08:53,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [741282116] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:08:53,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:08:53,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:08:53,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680124266] [2024-10-13 12:08:53,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:08:53,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:08:53,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:08:53,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:08:53,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:08:53,163 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 55 [2024-10-13 12:08:53,164 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-13 12:08:53,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:08:53,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 55 [2024-10-13 12:08:53,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:08:53,412 INFO L124 PetriNetUnfolderBase]: 793/1531 cut-off events. [2024-10-13 12:08:53,412 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2024-10-13 12:08:53,416 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 8029 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-13 12:08:53,424 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 56 selfloop transitions, 3 changer transitions 0/71 dead transitions. [2024-10-13 12:08:53,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 71 transitions, 303 flow [2024-10-13 12:08:53,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:08:53,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:08:53,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2024-10-13 12:08:53,426 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6181818181818182 [2024-10-13 12:08:53,426 INFO L175 Difference]: Start difference. First operand has 52 places, 53 transitions, 153 flow. Second operand 3 states and 102 transitions. [2024-10-13 12:08:53,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 71 transitions, 303 flow [2024-10-13 12:08:53,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 71 transitions, 301 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-10-13 12:08:53,431 INFO L231 Difference]: Finished difference. Result has 54 places, 50 transitions, 148 flow [2024-10-13 12:08:53,431 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-13 12:08:53,432 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 4 predicate places. [2024-10-13 12:08:53,432 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 50 transitions, 148 flow [2024-10-13 12:08:53,432 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-13 12:08:53,432 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:08:53,433 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:08:53,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-13 12:08:53,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/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-13 12:08:53,636 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-13 12:08:53,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:08:53,637 INFO L85 PathProgramCache]: Analyzing trace with hash -120106817, now seen corresponding path program 1 times [2024-10-13 12:08:53,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:08:53,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2046393979] [2024-10-13 12:08:53,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:08:53,638 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-13 12:08:53,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:08:53,640 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/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-13 12:08:53,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-13 12:08:53,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:08:53,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:08:53,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:08:53,732 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-13 12:08:53,733 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:08:53,733 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:08:53,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2046393979] [2024-10-13 12:08:53,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2046393979] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:08:53,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:08:53,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:08:53,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962643450] [2024-10-13 12:08:53,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:08:53,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:08:53,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:08:53,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:08:53,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:08:53,736 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-10-13 12:08:53,737 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-13 12:08:53,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:08:53,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-10-13 12:08:53,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:08:54,171 INFO L124 PetriNetUnfolderBase]: 1096/2111 cut-off events. [2024-10-13 12:08:54,172 INFO L125 PetriNetUnfolderBase]: For 162/162 co-relation queries the response was YES. [2024-10-13 12:08:54,178 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 12212 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-13 12:08:54,190 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 68 selfloop transitions, 5 changer transitions 0/89 dead transitions. [2024-10-13 12:08:54,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 89 transitions, 386 flow [2024-10-13 12:08:54,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:08:54,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:08:54,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2024-10-13 12:08:54,193 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6318181818181818 [2024-10-13 12:08:54,196 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 148 flow. Second operand 4 states and 139 transitions. [2024-10-13 12:08:54,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 89 transitions, 386 flow [2024-10-13 12:08:54,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 89 transitions, 380 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:08:54,201 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 175 flow [2024-10-13 12:08:54,201 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-13 12:08:54,202 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 7 predicate places. [2024-10-13 12:08:54,202 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 175 flow [2024-10-13 12:08:54,202 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-13 12:08:54,203 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:08:54,203 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:08:54,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Ended with exit code 0 [2024-10-13 12:08:54,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/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-13 12:08:54,404 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-13 12:08:54,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:08:54,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1752604105, now seen corresponding path program 1 times [2024-10-13 12:08:54,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:08:54,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1071125874] [2024-10-13 12:08:54,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:08:54,406 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-13 12:08:54,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:08:54,410 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/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-13 12:08:54,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-13 12:08:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:08:54,482 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 12:08:54,483 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:08:54,492 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-13 12:08:54,492 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:08:54,492 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:08:54,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1071125874] [2024-10-13 12:08:54,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1071125874] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:08:54,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:08:54,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:08:54,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81831645] [2024-10-13 12:08:54,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:08:54,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:08:54,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:08:54,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:08:54,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:08:54,497 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-10-13 12:08:54,497 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-13 12:08:54,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:08:54,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-10-13 12:08:54,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:08:54,797 INFO L124 PetriNetUnfolderBase]: 1158/2185 cut-off events. [2024-10-13 12:08:54,797 INFO L125 PetriNetUnfolderBase]: For 294/294 co-relation queries the response was YES. [2024-10-13 12:08:54,805 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 12669 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-13 12:08:54,817 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 55 selfloop transitions, 2 changer transitions 0/73 dead transitions. [2024-10-13 12:08:54,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 73 transitions, 342 flow [2024-10-13 12:08:54,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:08:54,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:08:54,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2024-10-13 12:08:54,820 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6424242424242425 [2024-10-13 12:08:54,820 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 175 flow. Second operand 3 states and 106 transitions. [2024-10-13 12:08:54,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 73 transitions, 342 flow [2024-10-13 12:08:54,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 73 transitions, 337 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-10-13 12:08:54,828 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 182 flow [2024-10-13 12:08:54,828 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-13 12:08:54,829 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 9 predicate places. [2024-10-13 12:08:54,829 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 182 flow [2024-10-13 12:08:54,829 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-13 12:08:54,829 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:08:54,830 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:08:54,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Ended with exit code 0 [2024-10-13 12:08:55,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/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-13 12:08:55,034 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-13 12:08:55,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:08:55,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1805734286, now seen corresponding path program 1 times [2024-10-13 12:08:55,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:08:55,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1606577556] [2024-10-13 12:08:55,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:08:55,036 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-13 12:08:55,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:08:55,039 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/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-13 12:08:55,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-13 12:08:55,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:08:55,124 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 12:08:55,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:08:55,418 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-13 12:08:55,419 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:08:55,798 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-13 12:08:55,798 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:08:55,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1606577556] [2024-10-13 12:08:55,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1606577556] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:08:55,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:08:55,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2024-10-13 12:08:55,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815914567] [2024-10-13 12:08:55,800 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:08:55,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 12:08:55,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:08:55,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 12:08:55,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-13 12:08:55,962 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-10-13 12:08:55,963 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-13 12:08:55,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:08:55,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-10-13 12:08:55,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:09:01,447 INFO L124 PetriNetUnfolderBase]: 5619/10734 cut-off events. [2024-10-13 12:09:01,447 INFO L125 PetriNetUnfolderBase]: For 2728/2728 co-relation queries the response was YES. [2024-10-13 12:09:01,501 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 76339 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-13 12:09:01,573 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 327 selfloop transitions, 45 changer transitions 0/387 dead transitions. [2024-10-13 12:09:01,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 387 transitions, 1861 flow [2024-10-13 12:09:01,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-13 12:09:01,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-10-13 12:09:01,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 685 transitions. [2024-10-13 12:09:01,577 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6227272727272727 [2024-10-13 12:09:01,577 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 182 flow. Second operand 20 states and 685 transitions. [2024-10-13 12:09:01,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 387 transitions, 1861 flow [2024-10-13 12:09:01,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 387 transitions, 1856 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:09:01,597 INFO L231 Difference]: Finished difference. Result has 92 places, 99 transitions, 598 flow [2024-10-13 12:09:01,598 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-13 12:09:01,599 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 42 predicate places. [2024-10-13 12:09:01,600 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 99 transitions, 598 flow [2024-10-13 12:09:01,601 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-13 12:09:01,601 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:09:01,601 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-13 12:09:01,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Forceful destruction successful, exit code 0 [2024-10-13 12:09:01,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/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-13 12:09:01,802 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-13 12:09:01,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:09:01,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1473379118, now seen corresponding path program 1 times [2024-10-13 12:09:01,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:09:01,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1608014827] [2024-10-13 12:09:01,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:09:01,804 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-13 12:09:01,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:09:01,806 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/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-13 12:09:01,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-13 12:09:01,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:09:01,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:09:01,919 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:09:01,954 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-13 12:09:01,973 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-13 12:09:01,974 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:09:01,974 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:09:01,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1608014827] [2024-10-13 12:09:01,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1608014827] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:09:01,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:09:01,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:09:01,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517933248] [2024-10-13 12:09:01,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:09:01,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:09:01,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:09:01,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:09:01,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:09:01,977 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-10-13 12:09:01,978 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-13 12:09:01,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:09:01,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-10-13 12:09:01,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:09:02,808 INFO L124 PetriNetUnfolderBase]: 2678/5618 cut-off events. [2024-10-13 12:09:02,811 INFO L125 PetriNetUnfolderBase]: For 3569/3569 co-relation queries the response was YES. [2024-10-13 12:09:02,839 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 36171 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-13 12:09:02,872 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 70 selfloop transitions, 4 changer transitions 0/90 dead transitions. [2024-10-13 12:09:02,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 90 transitions, 615 flow [2024-10-13 12:09:02,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:09:02,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:09:02,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2024-10-13 12:09:02,874 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5696969696969697 [2024-10-13 12:09:02,874 INFO L175 Difference]: Start difference. First operand has 92 places, 99 transitions, 598 flow. Second operand 3 states and 94 transitions. [2024-10-13 12:09:02,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 90 transitions, 615 flow [2024-10-13 12:09:02,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 90 transitions, 567 flow, removed 23 selfloop flow, removed 6 redundant places. [2024-10-13 12:09:02,911 INFO L231 Difference]: Finished difference. Result has 83 places, 79 transitions, 395 flow [2024-10-13 12:09:02,911 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-13 12:09:02,912 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 33 predicate places. [2024-10-13 12:09:02,913 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 79 transitions, 395 flow [2024-10-13 12:09:02,913 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-13 12:09:02,913 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:09:02,913 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-13 12:09:02,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-13 12:09:03,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/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-13 12:09:03,118 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-13 12:09:03,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:09:03,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1880369082, now seen corresponding path program 1 times [2024-10-13 12:09:03,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:09:03,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1730799310] [2024-10-13 12:09:03,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:09:03,120 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-13 12:09:03,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:09:03,121 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/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-13 12:09:03,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-13 12:09:03,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:09:03,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 12:09:03,214 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:09:03,357 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-13 12:09:03,358 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:09:03,359 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:09:03,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1730799310] [2024-10-13 12:09:03,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1730799310] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:09:03,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:09:03,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:09:03,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881384718] [2024-10-13 12:09:03,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:09:03,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:09:03,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:09:03,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:09:03,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:09:03,379 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-10-13 12:09:03,380 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-13 12:09:03,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:09:03,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-10-13 12:09:03,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:09:04,108 INFO L124 PetriNetUnfolderBase]: 2633/5407 cut-off events. [2024-10-13 12:09:04,109 INFO L125 PetriNetUnfolderBase]: For 2298/2298 co-relation queries the response was YES. [2024-10-13 12:09:04,132 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 34530 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-13 12:09:04,160 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 65 selfloop transitions, 3 changer transitions 0/83 dead transitions. [2024-10-13 12:09:04,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 83 transitions, 546 flow [2024-10-13 12:09:04,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:09:04,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:09:04,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2024-10-13 12:09:04,162 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2024-10-13 12:09:04,162 INFO L175 Difference]: Start difference. First operand has 83 places, 79 transitions, 395 flow. Second operand 4 states and 100 transitions. [2024-10-13 12:09:04,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 83 transitions, 546 flow [2024-10-13 12:09:04,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 83 transitions, 542 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:09:04,179 INFO L231 Difference]: Finished difference. Result has 84 places, 78 transitions, 395 flow [2024-10-13 12:09:04,181 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-13 12:09:04,183 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 34 predicate places. [2024-10-13 12:09:04,184 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 78 transitions, 395 flow [2024-10-13 12:09:04,184 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-13 12:09:04,184 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:09:04,184 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-13 12:09:04,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Ended with exit code 0 [2024-10-13 12:09:04,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/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-13 12:09:04,386 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-13 12:09:04,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:09:04,387 INFO L85 PathProgramCache]: Analyzing trace with hash 923237661, now seen corresponding path program 1 times [2024-10-13 12:09:04,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:09:04,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [948691986] [2024-10-13 12:09:04,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:09:04,388 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-13 12:09:04,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:09:04,391 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/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-13 12:09:04,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-13 12:09:04,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:09:04,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 12:09:04,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:09:04,856 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-13 12:09:04,857 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:09:04,857 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:09:04,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [948691986] [2024-10-13 12:09:04,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [948691986] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:09:04,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:09:04,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:09:04,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823596801] [2024-10-13 12:09:04,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:09:04,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:09:04,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:09:04,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:09:04,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:09:04,887 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-10-13 12:09:04,888 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-13 12:09:04,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:09:04,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-10-13 12:09:04,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:09:05,759 INFO L124 PetriNetUnfolderBase]: 2709/5584 cut-off events. [2024-10-13 12:09:05,759 INFO L125 PetriNetUnfolderBase]: For 2667/2667 co-relation queries the response was YES. [2024-10-13 12:09:05,783 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 35292 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-13 12:09:05,813 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 107 selfloop transitions, 9 changer transitions 0/130 dead transitions. [2024-10-13 12:09:05,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 130 transitions, 792 flow [2024-10-13 12:09:05,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:09:05,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 12:09:05,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 185 transitions. [2024-10-13 12:09:05,815 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5606060606060606 [2024-10-13 12:09:05,815 INFO L175 Difference]: Start difference. First operand has 84 places, 78 transitions, 395 flow. Second operand 6 states and 185 transitions. [2024-10-13 12:09:05,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 130 transitions, 792 flow [2024-10-13 12:09:05,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 130 transitions, 778 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-13 12:09:05,837 INFO L231 Difference]: Finished difference. Result has 89 places, 81 transitions, 433 flow [2024-10-13 12:09:05,837 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-13 12:09:05,838 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 39 predicate places. [2024-10-13 12:09:05,838 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 81 transitions, 433 flow [2024-10-13 12:09:05,839 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-13 12:09:05,839 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:09:05,839 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-13 12:09:05,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-13 12:09:06,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/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-13 12:09:06,040 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-13 12:09:06,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:09:06,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1079345895, now seen corresponding path program 1 times [2024-10-13 12:09:06,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:09:06,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1424322580] [2024-10-13 12:09:06,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:09:06,043 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-13 12:09:06,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:09:06,047 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/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-13 12:09:06,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-13 12:09:06,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:09:06,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 12:09:06,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:09:06,143 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-13 12:09:06,143 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:09:06,143 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:09:06,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1424322580] [2024-10-13 12:09:06,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1424322580] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:09:06,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:09:06,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:09:06,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357714967] [2024-10-13 12:09:06,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:09:06,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:09:06,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:09:06,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:09:06,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:09:06,148 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-10-13 12:09:06,148 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-13 12:09:06,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:09:06,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-10-13 12:09:06,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:09:06,969 INFO L124 PetriNetUnfolderBase]: 3805/7957 cut-off events. [2024-10-13 12:09:06,970 INFO L125 PetriNetUnfolderBase]: For 3931/3931 co-relation queries the response was YES. [2024-10-13 12:09:06,998 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 55988 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-13 12:09:07,028 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 121 selfloop transitions, 2 changer transitions 0/138 dead transitions. [2024-10-13 12:09:07,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 138 transitions, 1028 flow [2024-10-13 12:09:07,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:09:07,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:09:07,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2024-10-13 12:09:07,030 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6484848484848484 [2024-10-13 12:09:07,031 INFO L175 Difference]: Start difference. First operand has 89 places, 81 transitions, 433 flow. Second operand 3 states and 107 transitions. [2024-10-13 12:09:07,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 138 transitions, 1028 flow [2024-10-13 12:09:07,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 138 transitions, 1024 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:09:07,054 INFO L231 Difference]: Finished difference. Result has 91 places, 82 transitions, 442 flow [2024-10-13 12:09:07,056 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-13 12:09:07,056 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 41 predicate places. [2024-10-13 12:09:07,057 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 82 transitions, 442 flow [2024-10-13 12:09:07,058 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-13 12:09:07,058 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:09:07,058 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-13 12:09:07,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Ended with exit code 0 [2024-10-13 12:09:07,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/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-13 12:09:07,259 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-13 12:09:07,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:09:07,259 INFO L85 PathProgramCache]: Analyzing trace with hash 536686063, now seen corresponding path program 1 times [2024-10-13 12:09:07,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:09:07,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1973285027] [2024-10-13 12:09:07,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:09:07,260 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-13 12:09:07,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:09:07,267 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/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-13 12:09:07,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-13 12:09:07,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:09:07,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 12:09:07,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:09:07,396 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-13 12:09:07,396 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:09:07,396 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:09:07,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1973285027] [2024-10-13 12:09:07,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1973285027] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:09:07,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:09:07,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:09:07,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308305506] [2024-10-13 12:09:07,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:09:07,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:09:07,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:09:07,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:09:07,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:09:07,400 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-10-13 12:09:07,400 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-13 12:09:07,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:09:07,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-10-13 12:09:07,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:09:08,297 INFO L124 PetriNetUnfolderBase]: 3746/7782 cut-off events. [2024-10-13 12:09:08,298 INFO L125 PetriNetUnfolderBase]: For 5048/5048 co-relation queries the response was YES. [2024-10-13 12:09:08,324 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 53193 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-13 12:09:08,356 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 102 selfloop transitions, 7 changer transitions 0/124 dead transitions. [2024-10-13 12:09:08,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 124 transitions, 808 flow [2024-10-13 12:09:08,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:09:08,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 12:09:08,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 165 transitions. [2024-10-13 12:09:08,358 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-10-13 12:09:08,358 INFO L175 Difference]: Start difference. First operand has 91 places, 82 transitions, 442 flow. Second operand 5 states and 165 transitions. [2024-10-13 12:09:08,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 124 transitions, 808 flow [2024-10-13 12:09:08,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 124 transitions, 796 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-10-13 12:09:08,383 INFO L231 Difference]: Finished difference. Result has 94 places, 81 transitions, 448 flow [2024-10-13 12:09:08,383 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-13 12:09:08,383 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 44 predicate places. [2024-10-13 12:09:08,384 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 81 transitions, 448 flow [2024-10-13 12:09:08,384 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-13 12:09:08,384 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:09:08,384 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-13 12:09:08,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-13 12:09:08,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/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-13 12:09:08,586 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-13 12:09:08,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:09:08,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1422859333, now seen corresponding path program 1 times [2024-10-13 12:09:08,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:09:08,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [451543312] [2024-10-13 12:09:08,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:09:08,587 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-13 12:09:08,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:09:08,591 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/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-13 12:09:08,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-13 12:09:08,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:09:08,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-13 12:09:08,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:09:08,819 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-13 12:09:08,960 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-13 12:09:08,990 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-13 12:09:08,991 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:09:08,991 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:09:08,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [451543312] [2024-10-13 12:09:08,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [451543312] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:09:08,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:09:08,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 12:09:08,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693339202] [2024-10-13 12:09:08,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:09:08,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 12:09:08,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:09:08,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 12:09:08,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-13 12:09:09,069 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-10-13 12:09:09,070 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-13 12:09:09,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:09:09,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-10-13 12:09:09,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:09:10,909 INFO L124 PetriNetUnfolderBase]: 5266/10862 cut-off events. [2024-10-13 12:09:10,909 INFO L125 PetriNetUnfolderBase]: For 7250/7250 co-relation queries the response was YES. [2024-10-13 12:09:10,955 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 75844 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-13 12:09:10,995 INFO L140 encePairwiseOnDemand]: 45/55 looper letters, 190 selfloop transitions, 21 changer transitions 0/226 dead transitions. [2024-10-13 12:09:10,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 226 transitions, 1496 flow [2024-10-13 12:09:10,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 12:09:10,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-10-13 12:09:10,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 396 transitions. [2024-10-13 12:09:10,998 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2024-10-13 12:09:10,998 INFO L175 Difference]: Start difference. First operand has 94 places, 81 transitions, 448 flow. Second operand 14 states and 396 transitions. [2024-10-13 12:09:10,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 226 transitions, 1496 flow [2024-10-13 12:09:11,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 226 transitions, 1476 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-13 12:09:11,038 INFO L231 Difference]: Finished difference. Result has 106 places, 90 transitions, 556 flow [2024-10-13 12:09:11,038 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-13 12:09:11,039 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 56 predicate places. [2024-10-13 12:09:11,039 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 90 transitions, 556 flow [2024-10-13 12:09:11,039 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-13 12:09:11,040 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:09:11,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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:09:11,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Ended with exit code 0 [2024-10-13 12:09:11,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/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-13 12:09:11,244 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-13 12:09:11,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:09:11,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1389318123, now seen corresponding path program 1 times [2024-10-13 12:09:11,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:09:11,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1305147249] [2024-10-13 12:09:11,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:09:11,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-13 12:09:11,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:09:11,248 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/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-13 12:09:11,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-13 12:09:11,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:09:11,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:09:11,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:09:11,378 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-13 12:09:11,379 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:09:11,418 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-13 12:09:11,419 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:09:11,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1305147249] [2024-10-13 12:09:11,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1305147249] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:09:11,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:09:11,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-10-13 12:09:11,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143282460] [2024-10-13 12:09:11,420 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:09:11,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:09:11,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:09:11,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:09:11,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:09:11,425 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-10-13 12:09:11,426 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-13 12:09:11,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:09:11,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-10-13 12:09:11,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:09:14,694 INFO L124 PetriNetUnfolderBase]: 13641/26402 cut-off events. [2024-10-13 12:09:14,694 INFO L125 PetriNetUnfolderBase]: For 25752/25752 co-relation queries the response was YES. [2024-10-13 12:09:14,847 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 209055 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-13 12:09:14,937 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 311 selfloop transitions, 6 changer transitions 0/331 dead transitions. [2024-10-13 12:09:14,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 331 transitions, 2881 flow [2024-10-13 12:09:14,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:09:14,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 12:09:14,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 221 transitions. [2024-10-13 12:09:14,939 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6696969696969697 [2024-10-13 12:09:14,939 INFO L175 Difference]: Start difference. First operand has 106 places, 90 transitions, 556 flow. Second operand 6 states and 221 transitions. [2024-10-13 12:09:14,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 331 transitions, 2881 flow [2024-10-13 12:09:15,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 331 transitions, 2687 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-10-13 12:09:15,060 INFO L231 Difference]: Finished difference. Result has 107 places, 93 transitions, 548 flow [2024-10-13 12:09:15,060 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-13 12:09:15,061 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 57 predicate places. [2024-10-13 12:09:15,061 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 93 transitions, 548 flow [2024-10-13 12:09:15,061 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-13 12:09:15,061 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:09:15,062 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-13 12:09:15,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-13 12:09:15,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/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-13 12:09:15,263 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-13 12:09:15,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:09:15,263 INFO L85 PathProgramCache]: Analyzing trace with hash 782294467, now seen corresponding path program 1 times [2024-10-13 12:09:15,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:09:15,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [692656516] [2024-10-13 12:09:15,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:09:15,264 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-13 12:09:15,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:09:15,269 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/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-13 12:09:15,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-13 12:09:15,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:09:15,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 12:09:15,392 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:09:15,836 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-13 12:09:15,836 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:09:16,367 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-13 12:09:16,368 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:09:16,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [692656516] [2024-10-13 12:09:16,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [692656516] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:09:16,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:09:16,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2024-10-13 12:09:16,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421450431] [2024-10-13 12:09:16,368 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:09:16,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 12:09:16,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:09:16,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 12:09:16,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-13 12:09:16,506 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2024-10-13 12:09:16,507 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-13 12:09:16,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:09:16,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2024-10-13 12:09:16,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand