./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/pthread-deagle/circular_buffer_bad.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 a5ee9b9286f55973fff2cea9c449f3602c5be2a48fed2e7e6cce6beebc18d9bc --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:58:11,979 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:58:12,065 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:58:12,072 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:58:12,074 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:58:12,108 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:58:12,109 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:58:12,109 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:58:12,110 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:58:12,111 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:58:12,111 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:58:12,111 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:58:12,112 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:58:12,112 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:58:12,113 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:58:12,113 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:58:12,113 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:58:12,113 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:58:12,114 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:58:12,114 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:58:12,118 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:58:12,118 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:58:12,119 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:58:12,119 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:58:12,119 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:58:12,119 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:58:12,120 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:58:12,120 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:58:12,120 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:58:12,121 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:58:12,121 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:58:12,121 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:58:12,121 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:58:12,121 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:58:12,122 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:58:12,122 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:58:12,122 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:58:12,123 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:58:12,123 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:58:12,123 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:58:12,125 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:58:12,125 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:58:12,125 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 -> a5ee9b9286f55973fff2cea9c449f3602c5be2a48fed2e7e6cce6beebc18d9bc [2024-11-09 10:58:12,361 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:58:12,384 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:58:12,387 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:58:12,388 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:58:12,389 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:58:12,390 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i [2024-11-09 10:58:13,798 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:58:14,094 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:58:14,096 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i [2024-11-09 10:58:14,114 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e402ce69/75818ddb2ecc46728281b91760fdc72a/FLAG1ff07e6f5 [2024-11-09 10:58:14,125 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e402ce69/75818ddb2ecc46728281b91760fdc72a [2024-11-09 10:58:14,128 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:58:14,129 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:58:14,132 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:58:14,132 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:58:14,137 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:58:14,137 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:58:14" (1/1) ... [2024-11-09 10:58:14,138 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42be982f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:14, skipping insertion in model container [2024-11-09 10:58:14,138 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:58:14" (1/1) ... [2024-11-09 10:58:14,178 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:58:14,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:58:14,583 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:58:14,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:58:14,706 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:58:14,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:14 WrapperNode [2024-11-09 10:58:14,707 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:58:14,708 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:58:14,708 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:58:14,708 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:58:14,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:14" (1/1) ... [2024-11-09 10:58:14,741 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:14" (1/1) ... [2024-11-09 10:58:14,768 INFO L138 Inliner]: procedures = 168, calls = 40, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 142 [2024-11-09 10:58:14,768 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:58:14,769 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:58:14,769 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:58:14,772 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:58:14,783 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:14" (1/1) ... [2024-11-09 10:58:14,784 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:14" (1/1) ... [2024-11-09 10:58:14,787 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:14" (1/1) ... [2024-11-09 10:58:14,809 INFO L175 MemorySlicer]: Split 23 memory accesses to 4 slices as follows [2, 1, 12, 8]. 52 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [2, 1, 10, 8]. The 1 writes are split as follows [0, 0, 1, 0]. [2024-11-09 10:58:14,809 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:14" (1/1) ... [2024-11-09 10:58:14,810 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:14" (1/1) ... [2024-11-09 10:58:14,820 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:14" (1/1) ... [2024-11-09 10:58:14,825 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:14" (1/1) ... [2024-11-09 10:58:14,827 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:14" (1/1) ... [2024-11-09 10:58:14,828 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:14" (1/1) ... [2024-11-09 10:58:14,832 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:58:14,837 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:58:14,837 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:58:14,837 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:58:14,838 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:14" (1/1) ... [2024-11-09 10:58:14,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:58:14,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:58:14,871 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-11-09 10:58:14,883 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-11-09 10:58:14,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 10:58:14,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 10:58:14,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 10:58:14,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 10:58:14,927 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-09 10:58:14,927 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-09 10:58:14,927 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-09 10:58:14,928 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-09 10:58:14,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 10:58:14,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 10:58:14,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 10:58:14,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 10:58:14,930 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-09 10:58:14,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:58:14,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 10:58:14,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 10:58:14,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-09 10:58:14,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-09 10:58:14,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 10:58:14,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 10:58:14,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 10:58:14,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 10:58:14,931 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-09 10:58:14,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:58:14,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:58:14,934 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 10:58:15,112 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:58:15,116 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:58:15,425 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:58:15,425 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:58:15,688 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:58:15,689 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 10:58:15,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:58:15 BoogieIcfgContainer [2024-11-09 10:58:15,689 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:58:15,692 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:58:15,692 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:58:15,695 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:58:15,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:58:14" (1/3) ... [2024-11-09 10:58:15,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15bb0ec9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:58:15, skipping insertion in model container [2024-11-09 10:58:15,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:14" (2/3) ... [2024-11-09 10:58:15,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15bb0ec9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:58:15, skipping insertion in model container [2024-11-09 10:58:15,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:58:15" (3/3) ... [2024-11-09 10:58:15,698 INFO L112 eAbstractionObserver]: Analyzing ICFG circular_buffer_bad.i [2024-11-09 10:58:15,710 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:58:15,711 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-09 10:58:15,711 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:58:15,779 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-09 10:58:15,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 58 transitions, 130 flow [2024-11-09 10:58:15,844 INFO L124 PetriNetUnfolderBase]: 10/56 cut-off events. [2024-11-09 10:58:15,845 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 10:58:15,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 56 events. 10/56 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 150 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2024-11-09 10:58:15,849 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 58 transitions, 130 flow [2024-11-09 10:58:15,852 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 55 transitions, 122 flow [2024-11-09 10:58:15,861 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:58:15,870 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;@4508ddfa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:58:15,871 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-11-09 10:58:15,883 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:58:15,884 INFO L124 PetriNetUnfolderBase]: 2/25 cut-off events. [2024-11-09 10:58:15,884 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 10:58:15,884 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:15,885 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:58:15,885 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-11-09 10:58:15,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:15,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1771818407, now seen corresponding path program 1 times [2024-11-09 10:58:15,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:58:15,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879664606] [2024-11-09 10:58:15,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:15,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:58:16,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:16,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:16,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:58:16,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879664606] [2024-11-09 10:58:16,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879664606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:58:16,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:58:16,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:58:16,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783976872] [2024-11-09 10:58:16,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:58:16,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:58:16,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:58:16,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:58:16,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:58:16,337 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2024-11-09 10:58:16,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 55 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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-11-09 10:58:16,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:16,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2024-11-09 10:58:16,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:16,574 INFO L124 PetriNetUnfolderBase]: 445/831 cut-off events. [2024-11-09 10:58:16,574 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-11-09 10:58:16,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1580 conditions, 831 events. 445/831 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4279 event pairs, 330 based on Foata normal form. 90/846 useless extension candidates. Maximal degree in co-relation 1498. Up to 710 conditions per place. [2024-11-09 10:58:16,585 INFO L140 encePairwiseOnDemand]: 51/58 looper letters, 29 selfloop transitions, 1 changer transitions 0/47 dead transitions. [2024-11-09 10:58:16,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 47 transitions, 166 flow [2024-11-09 10:58:16,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:58:16,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:58:16,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2024-11-09 10:58:16,598 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5344827586206896 [2024-11-09 10:58:16,600 INFO L175 Difference]: Start difference. First operand has 52 places, 55 transitions, 122 flow. Second operand 3 states and 93 transitions. [2024-11-09 10:58:16,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 47 transitions, 166 flow [2024-11-09 10:58:16,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 47 transitions, 158 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 10:58:16,610 INFO L231 Difference]: Finished difference. Result has 46 places, 47 transitions, 100 flow [2024-11-09 10:58:16,614 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=46, PETRI_TRANSITIONS=47} [2024-11-09 10:58:16,618 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -6 predicate places. [2024-11-09 10:58:16,618 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 47 transitions, 100 flow [2024-11-09 10:58:16,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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-11-09 10:58:16,619 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:16,619 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:58:16,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 10:58:16,620 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-11-09 10:58:16,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:16,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1771818408, now seen corresponding path program 1 times [2024-11-09 10:58:16,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:58:16,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024419394] [2024-11-09 10:58:16,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:16,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:58:16,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:16,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:16,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:58:16,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024419394] [2024-11-09 10:58:16,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024419394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:58:16,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:58:16,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:58:16,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920283836] [2024-11-09 10:58:16,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:58:16,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:58:16,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:58:16,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:58:16,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:58:16,954 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2024-11-09 10:58:16,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 47 transitions, 100 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-11-09 10:58:16,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:16,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2024-11-09 10:58:16,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:17,211 INFO L124 PetriNetUnfolderBase]: 788/1475 cut-off events. [2024-11-09 10:58:17,212 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-09 10:58:17,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2710 conditions, 1475 events. 788/1475 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 7756 event pairs, 263 based on Foata normal form. 0/1363 useless extension candidates. Maximal degree in co-relation 2704. Up to 697 conditions per place. [2024-11-09 10:58:17,224 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 53 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2024-11-09 10:58:17,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 71 transitions, 261 flow [2024-11-09 10:58:17,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:58:17,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:58:17,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2024-11-09 10:58:17,226 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6724137931034483 [2024-11-09 10:58:17,226 INFO L175 Difference]: Start difference. First operand has 46 places, 47 transitions, 100 flow. Second operand 3 states and 117 transitions. [2024-11-09 10:58:17,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 71 transitions, 261 flow [2024-11-09 10:58:17,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 71 transitions, 260 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:58:17,230 INFO L231 Difference]: Finished difference. Result has 48 places, 48 transitions, 113 flow [2024-11-09 10:58:17,231 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=48, PETRI_TRANSITIONS=48} [2024-11-09 10:58:17,232 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -4 predicate places. [2024-11-09 10:58:17,232 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 48 transitions, 113 flow [2024-11-09 10:58:17,232 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-11-09 10:58:17,233 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:17,233 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:58:17,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 10:58:17,233 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-09 10:58:17,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:17,235 INFO L85 PathProgramCache]: Analyzing trace with hash -905436107, now seen corresponding path program 1 times [2024-11-09 10:58:17,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:58:17,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309751357] [2024-11-09 10:58:17,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:17,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:58:17,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:17,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:17,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:58:17,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309751357] [2024-11-09 10:58:17,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309751357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:58:17,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:58:17,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:58:17,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924493902] [2024-11-09 10:58:17,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:58:17,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:58:17,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:58:17,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:58:17,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:58:17,471 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2024-11-09 10:58:17,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 48 transitions, 113 flow. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:58:17,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:17,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2024-11-09 10:58:17,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:17,637 INFO L124 PetriNetUnfolderBase]: 831/1494 cut-off events. [2024-11-09 10:58:17,638 INFO L125 PetriNetUnfolderBase]: For 51/61 co-relation queries the response was YES. [2024-11-09 10:58:17,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2928 conditions, 1494 events. 831/1494 cut-off events. For 51/61 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 7620 event pairs, 619 based on Foata normal form. 0/1372 useless extension candidates. Maximal degree in co-relation 2920. Up to 1298 conditions per place. [2024-11-09 10:58:17,647 INFO L140 encePairwiseOnDemand]: 56/58 looper letters, 31 selfloop transitions, 1 changer transitions 0/45 dead transitions. [2024-11-09 10:58:17,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 171 flow [2024-11-09 10:58:17,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:58:17,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:58:17,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2024-11-09 10:58:17,649 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5114942528735632 [2024-11-09 10:58:17,650 INFO L175 Difference]: Start difference. First operand has 48 places, 48 transitions, 113 flow. Second operand 3 states and 89 transitions. [2024-11-09 10:58:17,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 171 flow [2024-11-09 10:58:17,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 45 transitions, 169 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:58:17,651 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 107 flow [2024-11-09 10:58:17,652 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2024-11-09 10:58:17,652 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -6 predicate places. [2024-11-09 10:58:17,653 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 107 flow [2024-11-09 10:58:17,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:58:17,653 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:17,653 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:58:17,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 10:58:17,653 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-09 10:58:17,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:17,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1748481119, now seen corresponding path program 1 times [2024-11-09 10:58:17,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:58:17,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595032033] [2024-11-09 10:58:17,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:17,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:58:17,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:17,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:17,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:58:17,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595032033] [2024-11-09 10:58:17,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595032033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:58:17,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:58:17,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:58:17,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625622751] [2024-11-09 10:58:17,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:58:17,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:58:17,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:58:17,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:58:17,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:58:17,693 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-09 10:58:17,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 107 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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-11-09 10:58:17,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:17,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-09 10:58:17,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:17,896 INFO L124 PetriNetUnfolderBase]: 1091/1969 cut-off events. [2024-11-09 10:58:17,897 INFO L125 PetriNetUnfolderBase]: For 98/118 co-relation queries the response was YES. [2024-11-09 10:58:17,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3812 conditions, 1969 events. 1091/1969 cut-off events. For 98/118 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 11229 event pairs, 517 based on Foata normal form. 24/1879 useless extension candidates. Maximal degree in co-relation 3803. Up to 1179 conditions per place. [2024-11-09 10:58:17,908 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 51 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2024-11-09 10:58:17,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 68 transitions, 264 flow [2024-11-09 10:58:17,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:58:17,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:58:17,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2024-11-09 10:58:17,912 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-11-09 10:58:17,913 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 107 flow. Second operand 3 states and 116 transitions. [2024-11-09 10:58:17,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 68 transitions, 264 flow [2024-11-09 10:58:17,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 68 transitions, 263 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:58:17,916 INFO L231 Difference]: Finished difference. Result has 48 places, 46 transitions, 118 flow [2024-11-09 10:58:17,916 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=48, PETRI_TRANSITIONS=46} [2024-11-09 10:58:17,917 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -4 predicate places. [2024-11-09 10:58:17,918 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 46 transitions, 118 flow [2024-11-09 10:58:17,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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-11-09 10:58:17,918 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:17,918 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:58:17,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 10:58:17,919 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-09 10:58:17,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:17,920 INFO L85 PathProgramCache]: Analyzing trace with hash 2083016124, now seen corresponding path program 1 times [2024-11-09 10:58:17,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:58:17,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986165077] [2024-11-09 10:58:17,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:17,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:58:17,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:17,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-11-09 10:58:17,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:58:17,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986165077] [2024-11-09 10:58:17,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986165077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:58:17,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:58:17,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:58:17,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088861447] [2024-11-09 10:58:17,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:58:17,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:58:17,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:58:17,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:58:17,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:58:17,997 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-09 10:58:17,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 46 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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-11-09 10:58:17,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:17,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-09 10:58:17,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:18,232 INFO L124 PetriNetUnfolderBase]: 1302/2462 cut-off events. [2024-11-09 10:58:18,233 INFO L125 PetriNetUnfolderBase]: For 238/254 co-relation queries the response was YES. [2024-11-09 10:58:18,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4948 conditions, 2462 events. 1302/2462 cut-off events. For 238/254 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 14239 event pairs, 482 based on Foata normal form. 42/2437 useless extension candidates. Maximal degree in co-relation 4938. Up to 1291 conditions per place. [2024-11-09 10:58:18,249 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 48 selfloop transitions, 3 changer transitions 0/66 dead transitions. [2024-11-09 10:58:18,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 66 transitions, 274 flow [2024-11-09 10:58:18,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:58:18,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:58:18,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2024-11-09 10:58:18,252 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6379310344827587 [2024-11-09 10:58:18,253 INFO L175 Difference]: Start difference. First operand has 48 places, 46 transitions, 118 flow. Second operand 3 states and 111 transitions. [2024-11-09 10:58:18,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 66 transitions, 274 flow [2024-11-09 10:58:18,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 66 transitions, 271 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:58:18,255 INFO L231 Difference]: Finished difference. Result has 50 places, 47 transitions, 131 flow [2024-11-09 10:58:18,256 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=131, PETRI_PLACES=50, PETRI_TRANSITIONS=47} [2024-11-09 10:58:18,257 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2024-11-09 10:58:18,259 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 47 transitions, 131 flow [2024-11-09 10:58:18,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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-11-09 10:58:18,259 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:18,259 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:58:18,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 10:58:18,260 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-09 10:58:18,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:18,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1501292205, now seen corresponding path program 1 times [2024-11-09 10:58:18,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:58:18,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402786854] [2024-11-09 10:58:18,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:18,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:58:18,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:18,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:18,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:58:18,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402786854] [2024-11-09 10:58:18,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402786854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:58:18,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:58:18,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:58:18,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374212731] [2024-11-09 10:58:18,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:58:18,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:58:18,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:58:18,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:58:18,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:58:18,308 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-09 10:58:18,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 131 flow. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:58:18,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:18,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-09 10:58:18,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:18,680 INFO L124 PetriNetUnfolderBase]: 2134/4056 cut-off events. [2024-11-09 10:58:18,680 INFO L125 PetriNetUnfolderBase]: For 732/764 co-relation queries the response was YES. [2024-11-09 10:58:18,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8472 conditions, 4056 events. 2134/4056 cut-off events. For 732/764 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 26283 event pairs, 979 based on Foata normal form. 69/3997 useless extension candidates. Maximal degree in co-relation 8460. Up to 2082 conditions per place. [2024-11-09 10:58:18,702 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 55 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2024-11-09 10:58:18,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 72 transitions, 320 flow [2024-11-09 10:58:18,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:58:18,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:58:18,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2024-11-09 10:58:18,704 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6609195402298851 [2024-11-09 10:58:18,704 INFO L175 Difference]: Start difference. First operand has 50 places, 47 transitions, 131 flow. Second operand 3 states and 115 transitions. [2024-11-09 10:58:18,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 72 transitions, 320 flow [2024-11-09 10:58:18,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 72 transitions, 315 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:58:18,711 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 140 flow [2024-11-09 10:58:18,711 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=52, PETRI_TRANSITIONS=48} [2024-11-09 10:58:18,711 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2024-11-09 10:58:18,711 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 140 flow [2024-11-09 10:58:18,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:58:18,712 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:18,712 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:58:18,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 10:58:18,712 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-11-09 10:58:18,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:18,713 INFO L85 PathProgramCache]: Analyzing trace with hash 825924090, now seen corresponding path program 1 times [2024-11-09 10:58:18,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:58:18,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093752181] [2024-11-09 10:58:18,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:18,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:58:18,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:18,799 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:18,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:58:18,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093752181] [2024-11-09 10:58:18,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093752181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:58:18,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:58:18,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:58:18,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667181182] [2024-11-09 10:58:18,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:58:18,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:58:18,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:58:18,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:58:18,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:58:18,807 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-09 10:58:18,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 48 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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-11-09 10:58:18,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:18,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-09 10:58:18,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:19,087 INFO L124 PetriNetUnfolderBase]: 1676/3225 cut-off events. [2024-11-09 10:58:19,087 INFO L125 PetriNetUnfolderBase]: For 685/691 co-relation queries the response was YES. [2024-11-09 10:58:19,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6983 conditions, 3225 events. 1676/3225 cut-off events. For 685/691 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 20188 event pairs, 739 based on Foata normal form. 86/3221 useless extension candidates. Maximal degree in co-relation 6970. Up to 1575 conditions per place. [2024-11-09 10:58:19,108 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 46 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2024-11-09 10:58:19,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 63 transitions, 283 flow [2024-11-09 10:58:19,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:58:19,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:58:19,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2024-11-09 10:58:19,110 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6149425287356322 [2024-11-09 10:58:19,110 INFO L175 Difference]: Start difference. First operand has 52 places, 48 transitions, 140 flow. Second operand 3 states and 107 transitions. [2024-11-09 10:58:19,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 63 transitions, 283 flow [2024-11-09 10:58:19,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 63 transitions, 276 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:58:19,114 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 139 flow [2024-11-09 10:58:19,114 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=139, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2024-11-09 10:58:19,115 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2024-11-09 10:58:19,115 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 139 flow [2024-11-09 10:58:19,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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-11-09 10:58:19,116 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:19,116 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-11-09 10:58:19,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 10:58:19,116 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-09 10:58:19,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:19,117 INFO L85 PathProgramCache]: Analyzing trace with hash -789003703, now seen corresponding path program 1 times [2024-11-09 10:58:19,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:58:19,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890476400] [2024-11-09 10:58:19,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:19,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:58:19,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:19,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:19,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:58:19,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890476400] [2024-11-09 10:58:19,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890476400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:58:19,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:58:19,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:58:19,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969427316] [2024-11-09 10:58:19,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:58:19,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:58:19,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:58:19,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:58:19,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:58:19,224 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-09 10:58:19,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 139 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 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-11-09 10:58:19,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:19,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-09 10:58:19,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:19,423 INFO L124 PetriNetUnfolderBase]: 1070/2324 cut-off events. [2024-11-09 10:58:19,423 INFO L125 PetriNetUnfolderBase]: For 786/786 co-relation queries the response was YES. [2024-11-09 10:58:19,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5098 conditions, 2324 events. 1070/2324 cut-off events. For 786/786 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 14082 event pairs, 335 based on Foata normal form. 126/2408 useless extension candidates. Maximal degree in co-relation 5085. Up to 1144 conditions per place. [2024-11-09 10:58:19,435 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 40 selfloop transitions, 4 changer transitions 0/59 dead transitions. [2024-11-09 10:58:19,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 59 transitions, 269 flow [2024-11-09 10:58:19,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:58:19,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:58:19,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2024-11-09 10:58:19,438 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5977011494252874 [2024-11-09 10:58:19,438 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 139 flow. Second operand 3 states and 104 transitions. [2024-11-09 10:58:19,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 59 transitions, 269 flow [2024-11-09 10:58:19,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 59 transitions, 265 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:58:19,442 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 143 flow [2024-11-09 10:58:19,442 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=143, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2024-11-09 10:58:19,443 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2024-11-09 10:58:19,443 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 143 flow [2024-11-09 10:58:19,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 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-11-09 10:58:19,444 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:19,444 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] [2024-11-09 10:58:19,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 10:58:19,444 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-11-09 10:58:19,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:19,444 INFO L85 PathProgramCache]: Analyzing trace with hash -530676748, now seen corresponding path program 1 times [2024-11-09 10:58:19,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:58:19,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000800217] [2024-11-09 10:58:19,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:19,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:58:19,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:19,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:19,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:58:19,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000800217] [2024-11-09 10:58:19,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000800217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:58:19,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:58:19,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:58:19,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655799374] [2024-11-09 10:58:19,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:58:19,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:58:19,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:58:19,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:58:19,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:58:19,797 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2024-11-09 10:58:19,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 143 flow. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:58:19,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:19,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2024-11-09 10:58:19,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:20,176 INFO L124 PetriNetUnfolderBase]: 1622/3383 cut-off events. [2024-11-09 10:58:20,176 INFO L125 PetriNetUnfolderBase]: For 1252/1252 co-relation queries the response was YES. [2024-11-09 10:58:20,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7868 conditions, 3383 events. 1622/3383 cut-off events. For 1252/1252 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 19607 event pairs, 664 based on Foata normal form. 0/3263 useless extension candidates. Maximal degree in co-relation 7855. Up to 979 conditions per place. [2024-11-09 10:58:20,199 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 104 selfloop transitions, 4 changer transitions 0/121 dead transitions. [2024-11-09 10:58:20,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 121 transitions, 608 flow [2024-11-09 10:58:20,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:58:20,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:58:20,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 198 transitions. [2024-11-09 10:58:20,201 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6827586206896552 [2024-11-09 10:58:20,201 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 143 flow. Second operand 5 states and 198 transitions. [2024-11-09 10:58:20,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 121 transitions, 608 flow [2024-11-09 10:58:20,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 121 transitions, 592 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:58:20,210 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 161 flow [2024-11-09 10:58:20,210 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, 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=57, PETRI_TRANSITIONS=49} [2024-11-09 10:58:20,210 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 5 predicate places. [2024-11-09 10:58:20,211 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 161 flow [2024-11-09 10:58:20,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:58:20,211 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:20,211 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] [2024-11-09 10:58:20,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 10:58:20,212 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-09 10:58:20,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:20,213 INFO L85 PathProgramCache]: Analyzing trace with hash 586333674, now seen corresponding path program 1 times [2024-11-09 10:58:20,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:58:20,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282947057] [2024-11-09 10:58:20,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:20,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:58:20,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:20,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:20,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:58:20,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282947057] [2024-11-09 10:58:20,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282947057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:58:20,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:58:20,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:58:20,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618375353] [2024-11-09 10:58:20,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:58:20,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:58:20,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:58:20,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:58:20,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:58:20,393 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-09 10:58:20,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 161 flow. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:58:20,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:20,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-09 10:58:20,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:20,622 INFO L124 PetriNetUnfolderBase]: 1237/2618 cut-off events. [2024-11-09 10:58:20,622 INFO L125 PetriNetUnfolderBase]: For 1018/1024 co-relation queries the response was YES. [2024-11-09 10:58:20,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5988 conditions, 2618 events. 1237/2618 cut-off events. For 1018/1024 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 14380 event pairs, 516 based on Foata normal form. 28/2572 useless extension candidates. Maximal degree in co-relation 5972. Up to 1667 conditions per place. [2024-11-09 10:58:20,636 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 49 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2024-11-09 10:58:20,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 66 transitions, 320 flow [2024-11-09 10:58:20,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:58:20,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:58:20,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2024-11-09 10:58:20,639 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6264367816091954 [2024-11-09 10:58:20,639 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 161 flow. Second operand 3 states and 109 transitions. [2024-11-09 10:58:20,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 66 transitions, 320 flow [2024-11-09 10:58:20,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 66 transitions, 312 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-11-09 10:58:20,643 INFO L231 Difference]: Finished difference. Result has 59 places, 49 transitions, 161 flow [2024-11-09 10:58:20,643 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=161, PETRI_PLACES=59, PETRI_TRANSITIONS=49} [2024-11-09 10:58:20,646 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 7 predicate places. [2024-11-09 10:58:20,646 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 49 transitions, 161 flow [2024-11-09 10:58:20,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:58:20,647 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:20,647 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-11-09 10:58:20,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 10:58:20,647 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-11-09 10:58:20,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:20,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1790993317, now seen corresponding path program 1 times [2024-11-09 10:58:20,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:58:20,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567288039] [2024-11-09 10:58:20,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:20,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:58:20,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:20,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:20,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:58:20,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567288039] [2024-11-09 10:58:20,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567288039] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:58:20,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567366714] [2024-11-09 10:58:20,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:20,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:58:20,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:58:20,710 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-11-09 10:58:20,711 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-11-09 10:58:20,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:20,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 10:58:20,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:58:20,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 10:58:20,856 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:58:20,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567366714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:58:20,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 10:58:20,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2024-11-09 10:58:20,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364353395] [2024-11-09 10:58:20,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:58:20,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:58:20,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:58:20,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:58:20,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:58:20,863 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2024-11-09 10:58:20,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 49 transitions, 161 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:58:20,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:20,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2024-11-09 10:58:20,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:21,058 INFO L124 PetriNetUnfolderBase]: 1237/2597 cut-off events. [2024-11-09 10:58:21,059 INFO L125 PetriNetUnfolderBase]: For 967/973 co-relation queries the response was YES. [2024-11-09 10:58:21,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6029 conditions, 2597 events. 1237/2597 cut-off events. For 967/973 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 14410 event pairs, 975 based on Foata normal form. 7/2522 useless extension candidates. Maximal degree in co-relation 6011. Up to 2069 conditions per place. [2024-11-09 10:58:21,070 INFO L140 encePairwiseOnDemand]: 56/58 looper letters, 32 selfloop transitions, 1 changer transitions 2/48 dead transitions. [2024-11-09 10:58:21,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 48 transitions, 227 flow [2024-11-09 10:58:21,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:58:21,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:58:21,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2024-11-09 10:58:21,072 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5172413793103449 [2024-11-09 10:58:21,072 INFO L175 Difference]: Start difference. First operand has 59 places, 49 transitions, 161 flow. Second operand 3 states and 90 transitions. [2024-11-09 10:58:21,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 48 transitions, 227 flow [2024-11-09 10:58:21,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 48 transitions, 223 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:58:21,075 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 152 flow [2024-11-09 10:58:21,075 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2024-11-09 10:58:21,075 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 6 predicate places. [2024-11-09 10:58:21,076 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 152 flow [2024-11-09 10:58:21,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:58:21,076 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:21,076 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-11-09 10:58:21,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 10:58:21,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-09 10:58:21,281 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-11-09 10:58:21,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:21,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1453075338, now seen corresponding path program 1 times [2024-11-09 10:58:21,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:58:21,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170747776] [2024-11-09 10:58:21,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:21,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:58:21,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 10:58:21,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [264169666] [2024-11-09 10:58:21,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:21,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:58:21,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:58:21,330 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-11-09 10:58:21,331 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-11-09 10:58:21,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:21,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 10:58:21,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:58:21,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:21,682 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:58:21,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:58:21,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170747776] [2024-11-09 10:58:21,683 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 10:58:21,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264169666] [2024-11-09 10:58:21,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264169666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:58:21,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:58:21,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:58:21,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371721510] [2024-11-09 10:58:21,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:58:21,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:58:21,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:58:21,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:58:21,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:58:21,698 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-09 10:58:21,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 152 flow. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 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-11-09 10:58:21,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:21,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-09 10:58:21,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:21,918 INFO L124 PetriNetUnfolderBase]: 1008/2164 cut-off events. [2024-11-09 10:58:21,918 INFO L125 PetriNetUnfolderBase]: For 775/777 co-relation queries the response was YES. [2024-11-09 10:58:21,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4979 conditions, 2164 events. 1008/2164 cut-off events. For 775/777 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 11056 event pairs, 348 based on Foata normal form. 18/2132 useless extension candidates. Maximal degree in co-relation 4961. Up to 900 conditions per place. [2024-11-09 10:58:21,928 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 57 selfloop transitions, 3 changer transitions 3/76 dead transitions. [2024-11-09 10:58:21,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 76 transitions, 381 flow [2024-11-09 10:58:21,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:58:21,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:58:21,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2024-11-09 10:58:21,930 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6077586206896551 [2024-11-09 10:58:21,930 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 152 flow. Second operand 4 states and 141 transitions. [2024-11-09 10:58:21,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 76 transitions, 381 flow [2024-11-09 10:58:21,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 76 transitions, 380 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:58:21,934 INFO L231 Difference]: Finished difference. Result has 59 places, 46 transitions, 161 flow [2024-11-09 10:58:21,934 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=59, PETRI_TRANSITIONS=46} [2024-11-09 10:58:21,935 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 7 predicate places. [2024-11-09 10:58:21,936 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 46 transitions, 161 flow [2024-11-09 10:58:21,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 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-11-09 10:58:21,936 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:21,937 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] [2024-11-09 10:58:21,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 10:58:22,137 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,SelfDestructingSolverStorable11 [2024-11-09 10:58:22,138 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-11-09 10:58:22,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:22,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1459139867, now seen corresponding path program 1 times [2024-11-09 10:58:22,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:58:22,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442352079] [2024-11-09 10:58:22,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:22,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:58:22,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:23,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:23,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:58:23,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442352079] [2024-11-09 10:58:23,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442352079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:58:23,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:58:23,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 10:58:23,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846861066] [2024-11-09 10:58:23,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:58:23,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 10:58:23,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:58:23,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 10:58:23,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-09 10:58:23,263 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-09 10:58:23,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 161 flow. Second operand has 11 states, 11 states have (on average 22.636363636363637) internal successors, (249), 11 states have internal predecessors, (249), 0 states have call successors, (0), 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-11-09 10:58:23,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:23,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-09 10:58:23,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:24,060 INFO L124 PetriNetUnfolderBase]: 1174/2483 cut-off events. [2024-11-09 10:58:24,061 INFO L125 PetriNetUnfolderBase]: For 1128/1132 co-relation queries the response was YES. [2024-11-09 10:58:24,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5872 conditions, 2483 events. 1174/2483 cut-off events. For 1128/1132 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 13391 event pairs, 376 based on Foata normal form. 0/2429 useless extension candidates. Maximal degree in co-relation 5852. Up to 1326 conditions per place. [2024-11-09 10:58:24,073 INFO L140 encePairwiseOnDemand]: 45/58 looper letters, 94 selfloop transitions, 17 changer transitions 9/133 dead transitions. [2024-11-09 10:58:24,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 133 transitions, 705 flow [2024-11-09 10:58:24,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 10:58:24,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-09 10:58:24,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 362 transitions. [2024-11-09 10:58:24,075 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5201149425287356 [2024-11-09 10:58:24,075 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 161 flow. Second operand 12 states and 362 transitions. [2024-11-09 10:58:24,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 133 transitions, 705 flow [2024-11-09 10:58:24,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 133 transitions, 693 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:58:24,080 INFO L231 Difference]: Finished difference. Result has 75 places, 60 transitions, 295 flow [2024-11-09 10:58:24,081 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=295, PETRI_PLACES=75, PETRI_TRANSITIONS=60} [2024-11-09 10:58:24,082 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 23 predicate places. [2024-11-09 10:58:24,082 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 60 transitions, 295 flow [2024-11-09 10:58:24,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 22.636363636363637) internal successors, (249), 11 states have internal predecessors, (249), 0 states have call successors, (0), 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-11-09 10:58:24,082 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:24,082 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] [2024-11-09 10:58:24,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 10:58:24,083 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-09 10:58:24,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:24,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1091154445, now seen corresponding path program 2 times [2024-11-09 10:58:24,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:58:24,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550003471] [2024-11-09 10:58:24,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:24,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:58:24,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:24,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:24,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:58:24,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550003471] [2024-11-09 10:58:24,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550003471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:58:24,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:58:24,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 10:58:24,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794804854] [2024-11-09 10:58:24,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:58:24,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 10:58:24,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:58:24,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 10:58:24,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-09 10:58:25,046 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-09 10:58:25,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 60 transitions, 295 flow. Second operand has 11 states, 11 states have (on average 22.636363636363637) internal successors, (249), 11 states have internal predecessors, (249), 0 states have call successors, (0), 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-11-09 10:58:25,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:25,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-09 10:58:25,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:25,818 INFO L124 PetriNetUnfolderBase]: 1403/2949 cut-off events. [2024-11-09 10:58:25,818 INFO L125 PetriNetUnfolderBase]: For 3141/3145 co-relation queries the response was YES. [2024-11-09 10:58:25,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8037 conditions, 2949 events. 1403/2949 cut-off events. For 3141/3145 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 16530 event pairs, 426 based on Foata normal form. 0/2894 useless extension candidates. Maximal degree in co-relation 8009. Up to 1651 conditions per place. [2024-11-09 10:58:25,833 INFO L140 encePairwiseOnDemand]: 45/58 looper letters, 103 selfloop transitions, 25 changer transitions 9/150 dead transitions. [2024-11-09 10:58:25,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 150 transitions, 982 flow [2024-11-09 10:58:25,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 10:58:25,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-09 10:58:25,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 365 transitions. [2024-11-09 10:58:25,835 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5244252873563219 [2024-11-09 10:58:25,835 INFO L175 Difference]: Start difference. First operand has 75 places, 60 transitions, 295 flow. Second operand 12 states and 365 transitions. [2024-11-09 10:58:25,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 150 transitions, 982 flow [2024-11-09 10:58:25,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 150 transitions, 960 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-11-09 10:58:25,846 INFO L231 Difference]: Finished difference. Result has 92 places, 80 transitions, 543 flow [2024-11-09 10:58:25,846 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=543, PETRI_PLACES=92, PETRI_TRANSITIONS=80} [2024-11-09 10:58:25,847 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 40 predicate places. [2024-11-09 10:58:25,847 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 80 transitions, 543 flow [2024-11-09 10:58:25,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 22.636363636363637) internal successors, (249), 11 states have internal predecessors, (249), 0 states have call successors, (0), 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-11-09 10:58:25,848 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:25,848 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] [2024-11-09 10:58:25,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 10:58:25,848 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-09 10:58:25,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:25,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1870763185, now seen corresponding path program 3 times [2024-11-09 10:58:25,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:58:25,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238563422] [2024-11-09 10:58:25,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:25,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:58:25,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:26,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:26,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:58:26,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238563422] [2024-11-09 10:58:26,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238563422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:58:26,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:58:26,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 10:58:26,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012037564] [2024-11-09 10:58:26,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:58:26,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 10:58:26,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:58:26,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 10:58:26,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-09 10:58:26,661 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-09 10:58:26,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 80 transitions, 543 flow. Second operand has 11 states, 11 states have (on average 22.636363636363637) internal successors, (249), 11 states have internal predecessors, (249), 0 states have call successors, (0), 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-11-09 10:58:26,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:26,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-09 10:58:26,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:27,403 INFO L124 PetriNetUnfolderBase]: 1567/3300 cut-off events. [2024-11-09 10:58:27,403 INFO L125 PetriNetUnfolderBase]: For 5552/5558 co-relation queries the response was YES. [2024-11-09 10:58:27,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9751 conditions, 3300 events. 1567/3300 cut-off events. For 5552/5558 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 19249 event pairs, 386 based on Foata normal form. 0/3249 useless extension candidates. Maximal degree in co-relation 9715. Up to 1679 conditions per place. [2024-11-09 10:58:27,427 INFO L140 encePairwiseOnDemand]: 45/58 looper letters, 111 selfloop transitions, 42 changer transitions 6/172 dead transitions. [2024-11-09 10:58:27,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 172 transitions, 1278 flow [2024-11-09 10:58:27,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 10:58:27,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-09 10:58:27,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 400 transitions. [2024-11-09 10:58:27,429 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5305039787798409 [2024-11-09 10:58:27,429 INFO L175 Difference]: Start difference. First operand has 92 places, 80 transitions, 543 flow. Second operand 13 states and 400 transitions. [2024-11-09 10:58:27,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 172 transitions, 1278 flow [2024-11-09 10:58:27,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 172 transitions, 1212 flow, removed 33 selfloop flow, removed 0 redundant places. [2024-11-09 10:58:27,454 INFO L231 Difference]: Finished difference. Result has 110 places, 95 transitions, 766 flow [2024-11-09 10:58:27,454 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=766, PETRI_PLACES=110, PETRI_TRANSITIONS=95} [2024-11-09 10:58:27,454 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 58 predicate places. [2024-11-09 10:58:27,455 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 95 transitions, 766 flow [2024-11-09 10:58:27,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 22.636363636363637) internal successors, (249), 11 states have internal predecessors, (249), 0 states have call successors, (0), 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-11-09 10:58:27,455 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:27,456 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] [2024-11-09 10:58:27,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 10:58:27,456 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-09 10:58:27,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:27,456 INFO L85 PathProgramCache]: Analyzing trace with hash 39143349, now seen corresponding path program 4 times [2024-11-09 10:58:27,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:58:27,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329558880] [2024-11-09 10:58:27,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:27,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:58:27,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:28,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:28,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:58:28,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329558880] [2024-11-09 10:58:28,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329558880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:58:28,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:58:28,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 10:58:28,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663974039] [2024-11-09 10:58:28,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:58:28,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 10:58:28,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:58:28,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 10:58:28,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-09 10:58:28,315 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-09 10:58:28,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 95 transitions, 766 flow. Second operand has 11 states, 11 states have (on average 22.636363636363637) internal successors, (249), 11 states have internal predecessors, (249), 0 states have call successors, (0), 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-11-09 10:58:28,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:28,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-09 10:58:28,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:29,217 INFO L124 PetriNetUnfolderBase]: 1807/3792 cut-off events. [2024-11-09 10:58:29,217 INFO L125 PetriNetUnfolderBase]: For 7980/7992 co-relation queries the response was YES. [2024-11-09 10:58:29,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11743 conditions, 3792 events. 1807/3792 cut-off events. For 7980/7992 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 22853 event pairs, 313 based on Foata normal form. 4/3750 useless extension candidates. Maximal degree in co-relation 11699. Up to 1290 conditions per place. [2024-11-09 10:58:29,236 INFO L140 encePairwiseOnDemand]: 45/58 looper letters, 118 selfloop transitions, 65 changer transitions 13/209 dead transitions. [2024-11-09 10:58:29,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 209 transitions, 1646 flow [2024-11-09 10:58:29,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 10:58:29,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-09 10:58:29,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 490 transitions. [2024-11-09 10:58:29,238 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5280172413793104 [2024-11-09 10:58:29,238 INFO L175 Difference]: Start difference. First operand has 110 places, 95 transitions, 766 flow. Second operand 16 states and 490 transitions. [2024-11-09 10:58:29,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 209 transitions, 1646 flow [2024-11-09 10:58:29,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 209 transitions, 1534 flow, removed 41 selfloop flow, removed 3 redundant places. [2024-11-09 10:58:29,266 INFO L231 Difference]: Finished difference. Result has 127 places, 108 transitions, 995 flow [2024-11-09 10:58:29,266 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=995, PETRI_PLACES=127, PETRI_TRANSITIONS=108} [2024-11-09 10:58:29,266 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 75 predicate places. [2024-11-09 10:58:29,267 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 108 transitions, 995 flow [2024-11-09 10:58:29,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 22.636363636363637) internal successors, (249), 11 states have internal predecessors, (249), 0 states have call successors, (0), 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-11-09 10:58:29,267 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:29,267 INFO L204 CegarLoopForPetriNet]: trace histogram [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-11-09 10:58:29,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 10:58:29,267 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-11-09 10:58:29,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:29,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1343068001, now seen corresponding path program 1 times [2024-11-09 10:58:29,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:58:29,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562117140] [2024-11-09 10:58:29,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:29,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:58:29,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:29,302 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:29,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:58:29,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562117140] [2024-11-09 10:58:29,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562117140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:58:29,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:58:29,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:58:29,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516341331] [2024-11-09 10:58:29,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:58:29,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:58:29,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:58:29,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:58:29,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:58:29,306 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2024-11-09 10:58:29,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 108 transitions, 995 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:58:29,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:29,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2024-11-09 10:58:29,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:29,752 INFO L124 PetriNetUnfolderBase]: 1761/3575 cut-off events. [2024-11-09 10:58:29,752 INFO L125 PetriNetUnfolderBase]: For 7961/7973 co-relation queries the response was YES. [2024-11-09 10:58:29,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11567 conditions, 3575 events. 1761/3575 cut-off events. For 7961/7973 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 20562 event pairs, 442 based on Foata normal form. 35/3560 useless extension candidates. Maximal degree in co-relation 11519. Up to 2259 conditions per place. [2024-11-09 10:58:29,773 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 99 selfloop transitions, 7 changer transitions 11/129 dead transitions. [2024-11-09 10:58:29,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 129 transitions, 1359 flow [2024-11-09 10:58:29,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:58:29,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:58:29,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2024-11-09 10:58:29,775 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5919540229885057 [2024-11-09 10:58:29,775 INFO L175 Difference]: Start difference. First operand has 127 places, 108 transitions, 995 flow. Second operand 3 states and 103 transitions. [2024-11-09 10:58:29,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 129 transitions, 1359 flow [2024-11-09 10:58:29,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 129 transitions, 1136 flow, removed 31 selfloop flow, removed 13 redundant places. [2024-11-09 10:58:29,799 INFO L231 Difference]: Finished difference. Result has 118 places, 100 transitions, 767 flow [2024-11-09 10:58:29,799 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=761, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=767, PETRI_PLACES=118, PETRI_TRANSITIONS=100} [2024-11-09 10:58:29,800 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 66 predicate places. [2024-11-09 10:58:29,800 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 100 transitions, 767 flow [2024-11-09 10:58:29,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:58:29,800 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:29,801 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:58:29,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 10:58:29,801 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-09 10:58:29,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:29,801 INFO L85 PathProgramCache]: Analyzing trace with hash 2095745127, now seen corresponding path program 1 times [2024-11-09 10:58:29,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:58:29,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101916563] [2024-11-09 10:58:29,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:29,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:58:29,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 10:58:29,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1125713941] [2024-11-09 10:58:29,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:29,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:58:29,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:58:29,827 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-11-09 10:58:29,829 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-11-09 10:58:29,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:58:29,997 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:58:30,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:58:30,093 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 10:58:30,093 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:58:30,095 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t2Err2ASSERT_VIOLATIONMEMORY_LEAK (14 of 15 remaining) [2024-11-09 10:58:30,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (13 of 15 remaining) [2024-11-09 10:58:30,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 15 remaining) [2024-11-09 10:58:30,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 15 remaining) [2024-11-09 10:58:30,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2024-11-09 10:58:30,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2024-11-09 10:58:30,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONMEMORY_LEAK (8 of 15 remaining) [2024-11-09 10:58:30,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2024-11-09 10:58:30,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2024-11-09 10:58:30,098 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONMEMORY_LEAK (5 of 15 remaining) [2024-11-09 10:58:30,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2024-11-09 10:58:30,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2024-11-09 10:58:30,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONMEMORY_LEAK (2 of 15 remaining) [2024-11-09 10:58:30,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 15 remaining) [2024-11-09 10:58:30,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 15 remaining) [2024-11-09 10:58:30,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 10:58:30,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-09 10:58:30,305 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:58:30,374 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 10:58:30,374 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 10:58:30,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:58:30 BasicIcfg [2024-11-09 10:58:30,378 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 10:58:30,379 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 10:58:30,379 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 10:58:30,379 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 10:58:30,379 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:58:15" (3/4) ... [2024-11-09 10:58:30,381 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 10:58:30,382 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 10:58:30,383 INFO L158 Benchmark]: Toolchain (without parser) took 16253.75ms. Allocated memory was 142.6MB in the beginning and 356.5MB in the end (delta: 213.9MB). Free memory was 85.0MB in the beginning and 206.0MB in the end (delta: -121.0MB). Peak memory consumption was 94.2MB. Max. memory is 16.1GB. [2024-11-09 10:58:30,383 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 142.6MB. Free memory is still 102.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:58:30,383 INFO L158 Benchmark]: CACSL2BoogieTranslator took 575.76ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 111.4MB in the end (delta: -26.4MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. [2024-11-09 10:58:30,383 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.24ms. Allocated memory was 142.6MB in the beginning and 203.4MB in the end (delta: 60.8MB). Free memory was 111.4MB in the beginning and 173.3MB in the end (delta: -61.9MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. [2024-11-09 10:58:30,384 INFO L158 Benchmark]: Boogie Preprocessor took 65.96ms. Allocated memory is still 203.4MB. Free memory was 173.3MB in the beginning and 170.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 10:58:30,384 INFO L158 Benchmark]: RCFGBuilder took 853.52ms. Allocated memory is still 203.4MB. Free memory was 170.1MB in the beginning and 121.9MB in the end (delta: 48.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-11-09 10:58:30,384 INFO L158 Benchmark]: TraceAbstraction took 14686.26ms. Allocated memory was 203.4MB in the beginning and 356.5MB in the end (delta: 153.1MB). Free memory was 120.9MB in the beginning and 206.0MB in the end (delta: -85.1MB). Peak memory consumption was 68.0MB. Max. memory is 16.1GB. [2024-11-09 10:58:30,384 INFO L158 Benchmark]: Witness Printer took 3.46ms. Allocated memory is still 356.5MB. Free memory is still 206.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:58:30,386 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.18ms. Allocated memory is still 142.6MB. Free memory is still 102.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 575.76ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 111.4MB in the end (delta: -26.4MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.24ms. Allocated memory was 142.6MB in the beginning and 203.4MB in the end (delta: 60.8MB). Free memory was 111.4MB in the beginning and 173.3MB in the end (delta: -61.9MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.96ms. Allocated memory is still 203.4MB. Free memory was 173.3MB in the beginning and 170.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 853.52ms. Allocated memory is still 203.4MB. Free memory was 170.1MB in the beginning and 121.9MB in the end (delta: 48.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * TraceAbstraction took 14686.26ms. Allocated memory was 203.4MB in the beginning and 356.5MB in the end (delta: 153.1MB). Free memory was 120.9MB in the beginning and 206.0MB in the end (delta: -85.1MB). Peak memory consumption was 68.0MB. Max. memory is 16.1GB. * Witness Printer took 3.46ms. Allocated memory is still 356.5MB. Free memory is still 206.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 681]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 681. Possible FailurePath: [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L683] 0 static unsigned int first; [L684] 0 static unsigned int next; [L685] 0 static int buffer_size; [L686] 0 _Bool send, receive; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L756] 0 pthread_t id1, id2; [L758] CALL 0 initLog(10) [L690] 0 buffer_size = max [L691] EXPR 0 next = 0 [L691] 0 first = next = 0 [L758] RET 0 initLog(10) [L759] 0 send=1 [L760] 0 receive=0 [L761] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [buffer={3:0}, buffer_size=10, first=0, id1=-1, m={4:0}, next=0, receive=0, send=1] [L762] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [buffer={3:0}, buffer_size=10, first=0, id1=-1, id2=0, m={4:0}, next=0, receive=0, send=1] [L739] 2 int i; [L740] 2 i=0 VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L740] COND TRUE 2 i<7 VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L743] COND FALSE 2 !(\read(receive)) VAL [buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L740] 2 i++ VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=1, m={4:0}, next=0, receive=0, send=1] [L723] 1 int i; [L724] 1 i=0 VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L724] COND TRUE 1 i<7 VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L727] COND TRUE 1 \read(send) [L729] CALL 1 insertLogElement(i) [L707] COND TRUE 1 next < buffer_size && buffer_size > 0 VAL [buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L709] 1 buffer[next] = b [L710] 1 next = (next+1)%buffer_size VAL [\old(b)=0, b=0, buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=1, receive=0, send=1] [L712] COND TRUE 1 next 0 && first < buffer_size [L697] 2 first++ VAL [buffer={3:0}, buffer_size=10, first=1, m={4:0}, next=1, receive=1, send=0] [L698] EXPR 2 buffer[first-1] [L698] 2 return buffer[first-1]; [L745] RET, EXPR 2 removeLogElement() [L745] COND FALSE 2 !(removeLogElement()==i) [L746] CALL 2 reach_error() [L681] COND FALSE 2 !(0) VAL [buffer={3:0}, buffer_size=10, first=1, m={4:0}, next=1, receive=1, send=0] [L681] 2 __assert_fail ("0", "", 0, __extension__ __PRETTY_FUNCTION__) VAL [buffer={3:0}, buffer_size=10, first=1, m={4:0}, next=1, receive=1, send=0] - UnprovableResult [Line: 754]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 761]: 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: 762]: 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: 681]: 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, 89 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: 14.5s, OverallIterations: 18, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1164 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1036 mSDsluCounter, 505 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 495 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4026 IncrementalHoareTripleChecker+Invalid, 4039 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 10 mSDtfsCounter, 4026 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 142 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=995occurred in iteration=16, InterpolantAutomatonStates: 95, 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.5s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 461 NumberOfCodeBlocks, 461 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 354 ConstructedInterpolants, 0 QuantifiedInterpolants, 3178 SizeOfPredicates, 0 NumberOfNonLiveVariables, 395 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 18 InterpolantComputations, 17 PerfectInterpolantSequences, 15/16 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-11-09 10:58:30,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/pthread-deagle/circular_buffer_bad.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 a5ee9b9286f55973fff2cea9c449f3602c5be2a48fed2e7e6cce6beebc18d9bc --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:58:32,617 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:58:32,670 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-09 10:58:32,675 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:58:32,675 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:58:32,705 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:58:32,706 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:58:32,706 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:58:32,707 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:58:32,707 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:58:32,708 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:58:32,708 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:58:32,708 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:58:32,709 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:58:32,709 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:58:32,709 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:58:32,710 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:58:32,710 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:58:32,710 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:58:32,711 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:58:32,711 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:58:32,711 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:58:32,714 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:58:32,714 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:58:32,714 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:58:32,714 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 10:58:32,715 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:58:32,715 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 10:58:32,715 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:58:32,716 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:58:32,716 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:58:32,720 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:58:32,720 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:58:32,721 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:58:32,721 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:58:32,721 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:58:32,721 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:58:32,722 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:58:32,722 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 10:58:32,722 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 10:58:32,722 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:58:32,724 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:58:32,725 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:58:32,725 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:58:32,725 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 -> a5ee9b9286f55973fff2cea9c449f3602c5be2a48fed2e7e6cce6beebc18d9bc [2024-11-09 10:58:33,041 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:58:33,060 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:58:33,063 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:58:33,064 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:58:33,065 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:58:33,066 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i [2024-11-09 10:58:34,649 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:58:34,925 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:58:34,926 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i [2024-11-09 10:58:34,945 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a879a107/63211644bf7b4d14aee0a2f0909bacb2/FLAGa2700d2f5 [2024-11-09 10:58:35,219 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a879a107/63211644bf7b4d14aee0a2f0909bacb2 [2024-11-09 10:58:35,220 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:58:35,221 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:58:35,222 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:58:35,222 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:58:35,229 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:58:35,232 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:58:35" (1/1) ... [2024-11-09 10:58:35,232 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a438f72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:35, skipping insertion in model container [2024-11-09 10:58:35,232 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:58:35" (1/1) ... [2024-11-09 10:58:35,279 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:58:35,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:58:35,683 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:58:35,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:58:35,790 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:58:35,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:35 WrapperNode [2024-11-09 10:58:35,791 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:58:35,792 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:58:35,792 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:58:35,793 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:58:35,806 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:35" (1/1) ... [2024-11-09 10:58:35,831 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:35" (1/1) ... [2024-11-09 10:58:35,867 INFO L138 Inliner]: procedures = 175, calls = 40, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 141 [2024-11-09 10:58:35,869 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:58:35,870 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:58:35,871 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:58:35,871 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:58:35,881 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:35" (1/1) ... [2024-11-09 10:58:35,881 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:35" (1/1) ... [2024-11-09 10:58:35,885 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:35" (1/1) ... [2024-11-09 10:58:35,912 INFO L175 MemorySlicer]: Split 23 memory accesses to 4 slices as follows [2, 1, 12, 8]. 52 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [2, 1, 10, 8]. The 1 writes are split as follows [0, 0, 1, 0]. [2024-11-09 10:58:35,912 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:35" (1/1) ... [2024-11-09 10:58:35,913 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:35" (1/1) ... [2024-11-09 10:58:35,927 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:35" (1/1) ... [2024-11-09 10:58:35,934 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:35" (1/1) ... [2024-11-09 10:58:35,936 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:35" (1/1) ... [2024-11-09 10:58:35,938 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:35" (1/1) ... [2024-11-09 10:58:35,943 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:58:35,944 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:58:35,944 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:58:35,944 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:58:35,945 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:35" (1/1) ... [2024-11-09 10:58:35,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:58:35,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:58:35,983 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-11-09 10:58:35,986 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-11-09 10:58:36,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 10:58:36,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 10:58:36,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-09 10:58:36,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-09 10:58:36,022 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-09 10:58:36,022 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-09 10:58:36,022 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-09 10:58:36,022 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-09 10:58:36,023 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-09 10:58:36,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:58:36,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-09 10:58:36,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-09 10:58:36,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-09 10:58:36,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-09 10:58:36,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 10:58:36,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 10:58:36,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-09 10:58:36,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-09 10:58:36,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-09 10:58:36,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-09 10:58:36,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-09 10:58:36,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-09 10:58:36,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 10:58:36,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 10:58:36,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 10:58:36,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-09 10:58:36,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-09 10:58:36,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-09 10:58:36,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-09 10:58:36,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-09 10:58:36,025 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-09 10:58:36,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:58:36,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:58:36,030 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 10:58:36,201 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:58:36,203 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:58:36,570 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:58:36,571 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:58:36,797 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:58:36,797 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 10:58:36,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:58:36 BoogieIcfgContainer [2024-11-09 10:58:36,798 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:58:36,800 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:58:36,800 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:58:36,804 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:58:36,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:58:35" (1/3) ... [2024-11-09 10:58:36,804 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74fb72f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:58:36, skipping insertion in model container [2024-11-09 10:58:36,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:35" (2/3) ... [2024-11-09 10:58:36,806 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74fb72f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:58:36, skipping insertion in model container [2024-11-09 10:58:36,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:58:36" (3/3) ... [2024-11-09 10:58:36,807 INFO L112 eAbstractionObserver]: Analyzing ICFG circular_buffer_bad.i [2024-11-09 10:58:36,822 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:58:36,822 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-09 10:58:36,822 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:58:36,891 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-09 10:58:36,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 58 transitions, 130 flow [2024-11-09 10:58:36,951 INFO L124 PetriNetUnfolderBase]: 10/56 cut-off events. [2024-11-09 10:58:36,954 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 10:58:36,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 56 events. 10/56 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 150 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2024-11-09 10:58:36,959 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 58 transitions, 130 flow [2024-11-09 10:58:36,963 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 55 transitions, 122 flow [2024-11-09 10:58:36,975 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:58:36,983 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;@7e0979a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:58:36,984 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-11-09 10:58:36,992 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:58:36,992 INFO L124 PetriNetUnfolderBase]: 2/25 cut-off events. [2024-11-09 10:58:36,992 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 10:58:36,993 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:36,994 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:58:36,994 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-11-09 10:58:36,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:37,000 INFO L85 PathProgramCache]: Analyzing trace with hash 746990759, now seen corresponding path program 1 times [2024-11-09 10:58:37,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:58:37,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [618476997] [2024-11-09 10:58:37,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:37,014 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-11-09 10:58:37,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:58:37,017 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-11-09 10:58:37,019 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-11-09 10:58:37,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:37,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:58:37,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:58:37,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:37,258 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:58:37,259 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:58:37,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [618476997] [2024-11-09 10:58:37,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [618476997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:58:37,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:58:37,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:58:37,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376804536] [2024-11-09 10:58:37,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:58:37,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:58:37,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:58:37,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:58:37,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:58:37,325 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2024-11-09 10:58:37,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 55 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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-11-09 10:58:37,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:37,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2024-11-09 10:58:37,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:37,580 INFO L124 PetriNetUnfolderBase]: 445/831 cut-off events. [2024-11-09 10:58:37,582 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-11-09 10:58:37,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1580 conditions, 831 events. 445/831 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4260 event pairs, 330 based on Foata normal form. 90/846 useless extension candidates. Maximal degree in co-relation 1498. Up to 710 conditions per place. [2024-11-09 10:58:37,591 INFO L140 encePairwiseOnDemand]: 51/58 looper letters, 29 selfloop transitions, 1 changer transitions 0/47 dead transitions. [2024-11-09 10:58:37,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 47 transitions, 166 flow [2024-11-09 10:58:37,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:58:37,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:58:37,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2024-11-09 10:58:37,603 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5344827586206896 [2024-11-09 10:58:37,604 INFO L175 Difference]: Start difference. First operand has 52 places, 55 transitions, 122 flow. Second operand 3 states and 93 transitions. [2024-11-09 10:58:37,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 47 transitions, 166 flow [2024-11-09 10:58:37,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 47 transitions, 158 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 10:58:37,613 INFO L231 Difference]: Finished difference. Result has 46 places, 47 transitions, 100 flow [2024-11-09 10:58:37,617 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=46, PETRI_TRANSITIONS=47} [2024-11-09 10:58:37,620 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -6 predicate places. [2024-11-09 10:58:37,620 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 47 transitions, 100 flow [2024-11-09 10:58:37,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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-11-09 10:58:37,621 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:37,621 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:58:37,626 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 (2)] Forceful destruction successful, exit code 0 [2024-11-09 10:58:37,822 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-11-09 10:58:37,823 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-11-09 10:58:37,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:37,824 INFO L85 PathProgramCache]: Analyzing trace with hash 746990760, now seen corresponding path program 1 times [2024-11-09 10:58:37,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:58:37,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1358836926] [2024-11-09 10:58:37,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:37,825 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-11-09 10:58:37,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:58:37,826 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-11-09 10:58:37,827 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-11-09 10:58:37,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:37,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:58:37,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:58:38,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:38,087 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:58:38,087 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:58:38,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1358836926] [2024-11-09 10:58:38,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1358836926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:58:38,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:58:38,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:58:38,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999953910] [2024-11-09 10:58:38,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:58:38,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:58:38,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:58:38,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:58:38,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:58:38,113 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2024-11-09 10:58:38,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 47 transitions, 100 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-11-09 10:58:38,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:38,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2024-11-09 10:58:38,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:38,415 INFO L124 PetriNetUnfolderBase]: 788/1475 cut-off events. [2024-11-09 10:58:38,415 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-09 10:58:38,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2710 conditions, 1475 events. 788/1475 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 7775 event pairs, 263 based on Foata normal form. 0/1363 useless extension candidates. Maximal degree in co-relation 2704. Up to 697 conditions per place. [2024-11-09 10:58:38,430 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 53 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2024-11-09 10:58:38,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 71 transitions, 261 flow [2024-11-09 10:58:38,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:58:38,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:58:38,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2024-11-09 10:58:38,434 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6724137931034483 [2024-11-09 10:58:38,434 INFO L175 Difference]: Start difference. First operand has 46 places, 47 transitions, 100 flow. Second operand 3 states and 117 transitions. [2024-11-09 10:58:38,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 71 transitions, 261 flow [2024-11-09 10:58:38,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 71 transitions, 260 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:58:38,438 INFO L231 Difference]: Finished difference. Result has 48 places, 48 transitions, 113 flow [2024-11-09 10:58:38,438 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=48, PETRI_TRANSITIONS=48} [2024-11-09 10:58:38,439 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -4 predicate places. [2024-11-09 10:58:38,439 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 48 transitions, 113 flow [2024-11-09 10:58:38,440 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-11-09 10:58:38,440 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:38,440 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:58:38,445 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-11-09 10:58:38,640 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-11-09 10:58:38,641 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-09 10:58:38,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:38,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1376607603, now seen corresponding path program 1 times [2024-11-09 10:58:38,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:58:38,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2120385017] [2024-11-09 10:58:38,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:38,643 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-11-09 10:58:38,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:58:38,645 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-11-09 10:58:38,650 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-11-09 10:58:38,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:38,775 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:58:38,776 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:58:38,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:38,858 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:58:38,858 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:58:38,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2120385017] [2024-11-09 10:58:38,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2120385017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:58:38,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:58:38,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:58:38,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982891597] [2024-11-09 10:58:38,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:58:38,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:58:38,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:58:38,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:58:38,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:58:38,883 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-09 10:58:38,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 48 transitions, 113 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 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-11-09 10:58:38,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:38,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-09 10:58:38,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:39,228 INFO L124 PetriNetUnfolderBase]: 986/1971 cut-off events. [2024-11-09 10:58:39,229 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2024-11-09 10:58:39,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3688 conditions, 1971 events. 986/1971 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 10779 event pairs, 195 based on Foata normal form. 75/1974 useless extension candidates. Maximal degree in co-relation 3680. Up to 626 conditions per place. [2024-11-09 10:58:39,241 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 74 selfloop transitions, 3 changer transitions 0/94 dead transitions. [2024-11-09 10:58:39,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 94 transitions, 369 flow [2024-11-09 10:58:39,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:58:39,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:58:39,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 164 transitions. [2024-11-09 10:58:39,243 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7068965517241379 [2024-11-09 10:58:39,243 INFO L175 Difference]: Start difference. First operand has 48 places, 48 transitions, 113 flow. Second operand 4 states and 164 transitions. [2024-11-09 10:58:39,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 94 transitions, 369 flow [2024-11-09 10:58:39,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 94 transitions, 367 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:58:39,246 INFO L231 Difference]: Finished difference. Result has 52 places, 49 transitions, 133 flow [2024-11-09 10:58:39,246 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=133, PETRI_PLACES=52, PETRI_TRANSITIONS=49} [2024-11-09 10:58:39,247 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2024-11-09 10:58:39,247 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 49 transitions, 133 flow [2024-11-09 10:58:39,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 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-11-09 10:58:39,248 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:39,248 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:58:39,255 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 (4)] Forceful destruction successful, exit code 0 [2024-11-09 10:58:39,448 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-11-09 10:58:39,449 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-09 10:58:39,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:39,449 INFO L85 PathProgramCache]: Analyzing trace with hash -465349603, now seen corresponding path program 1 times [2024-11-09 10:58:39,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:58:39,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [248416688] [2024-11-09 10:58:39,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:39,450 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-11-09 10:58:39,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:58:39,453 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-11-09 10:58:39,454 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-11-09 10:58:39,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:39,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 10:58:39,534 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:58:39,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:39,544 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:58:39,545 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:58:39,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [248416688] [2024-11-09 10:58:39,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [248416688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:58:39,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:58:39,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:58:39,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230320829] [2024-11-09 10:58:39,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:58:39,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:58:39,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:58:39,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:58:39,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:58:39,550 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-09 10:58:39,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 49 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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-11-09 10:58:39,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:39,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-09 10:58:39,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:39,936 INFO L124 PetriNetUnfolderBase]: 1304/2502 cut-off events. [2024-11-09 10:58:39,937 INFO L125 PetriNetUnfolderBase]: For 547/567 co-relation queries the response was YES. [2024-11-09 10:58:39,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5003 conditions, 2502 events. 1304/2502 cut-off events. For 547/567 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 14887 event pairs, 728 based on Foata normal form. 24/2392 useless extension candidates. Maximal degree in co-relation 4992. Up to 1600 conditions per place. [2024-11-09 10:58:39,950 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 52 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2024-11-09 10:58:39,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 71 transitions, 294 flow [2024-11-09 10:58:39,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:58:39,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:58:39,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2024-11-09 10:58:39,953 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-11-09 10:58:39,953 INFO L175 Difference]: Start difference. First operand has 52 places, 49 transitions, 133 flow. Second operand 3 states and 116 transitions. [2024-11-09 10:58:39,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 71 transitions, 294 flow [2024-11-09 10:58:39,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 71 transitions, 289 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:58:39,956 INFO L231 Difference]: Finished difference. Result has 53 places, 50 transitions, 141 flow [2024-11-09 10:58:39,957 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=141, PETRI_PLACES=53, PETRI_TRANSITIONS=50} [2024-11-09 10:58:39,957 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2024-11-09 10:58:39,958 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 50 transitions, 141 flow [2024-11-09 10:58:39,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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-11-09 10:58:39,958 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:39,958 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:58:39,963 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-11-09 10:58:40,159 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-11-09 10:58:40,159 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-09 10:58:40,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:40,160 INFO L85 PathProgramCache]: Analyzing trace with hash 398733114, now seen corresponding path program 1 times [2024-11-09 10:58:40,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:58:40,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [349984917] [2024-11-09 10:58:40,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:40,161 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-11-09 10:58:40,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:58:40,164 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-11-09 10:58:40,165 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-11-09 10:58:40,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:40,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 10:58:40,262 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:58:40,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:40,285 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:58:40,285 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:58:40,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [349984917] [2024-11-09 10:58:40,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [349984917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:58:40,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:58:40,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:58:40,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442370051] [2024-11-09 10:58:40,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:58:40,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:58:40,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:58:40,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:58:40,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:58:40,291 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2024-11-09 10:58:40,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 50 transitions, 141 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-11-09 10:58:40,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:40,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2024-11-09 10:58:40,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:40,653 INFO L124 PetriNetUnfolderBase]: 1343/2676 cut-off events. [2024-11-09 10:58:40,653 INFO L125 PetriNetUnfolderBase]: For 554/574 co-relation queries the response was YES. [2024-11-09 10:58:40,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5531 conditions, 2676 events. 1343/2676 cut-off events. For 554/574 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 15953 event pairs, 606 based on Foata normal form. 0/2575 useless extension candidates. Maximal degree in co-relation 5520. Up to 1181 conditions per place. [2024-11-09 10:58:40,668 INFO L140 encePairwiseOnDemand]: 53/58 looper letters, 52 selfloop transitions, 4 changer transitions 0/72 dead transitions. [2024-11-09 10:58:40,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 72 transitions, 321 flow [2024-11-09 10:58:40,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:58:40,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:58:40,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2024-11-09 10:58:40,670 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6436781609195402 [2024-11-09 10:58:40,670 INFO L175 Difference]: Start difference. First operand has 53 places, 50 transitions, 141 flow. Second operand 3 states and 112 transitions. [2024-11-09 10:58:40,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 72 transitions, 321 flow [2024-11-09 10:58:40,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 72 transitions, 318 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:58:40,673 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 165 flow [2024-11-09 10:58:40,673 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=139, 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=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=165, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2024-11-09 10:58:40,673 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 4 predicate places. [2024-11-09 10:58:40,673 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 165 flow [2024-11-09 10:58:40,674 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-11-09 10:58:40,674 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:40,674 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:58:40,680 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-11-09 10:58:40,877 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-11-09 10:58:40,877 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-09 10:58:40,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:40,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1607237163, now seen corresponding path program 1 times [2024-11-09 10:58:40,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:58:40,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [494864655] [2024-11-09 10:58:40,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:40,879 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-11-09 10:58:40,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:58:40,880 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-11-09 10:58:40,881 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-11-09 10:58:40,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:40,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 10:58:40,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:58:40,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:40,970 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:58:40,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:58:40,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [494864655] [2024-11-09 10:58:40,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [494864655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:58:40,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:58:40,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:58:40,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130475066] [2024-11-09 10:58:40,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:58:40,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:58:40,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:58:40,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:58:40,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:58:40,974 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2024-11-09 10:58:40,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 165 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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-11-09 10:58:40,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:40,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2024-11-09 10:58:40,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:41,352 INFO L124 PetriNetUnfolderBase]: 1397/2801 cut-off events. [2024-11-09 10:58:41,352 INFO L125 PetriNetUnfolderBase]: For 856/900 co-relation queries the response was YES. [2024-11-09 10:58:41,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6020 conditions, 2801 events. 1397/2801 cut-off events. For 856/900 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 17360 event pairs, 532 based on Foata normal form. 0/2665 useless extension candidates. Maximal degree in co-relation 6006. Up to 1632 conditions per place. [2024-11-09 10:58:41,368 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 53 selfloop transitions, 3 changer transitions 0/73 dead transitions. [2024-11-09 10:58:41,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 73 transitions, 346 flow [2024-11-09 10:58:41,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:58:41,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:58:41,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2024-11-09 10:58:41,370 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6379310344827587 [2024-11-09 10:58:41,370 INFO L175 Difference]: Start difference. First operand has 56 places, 52 transitions, 165 flow. Second operand 3 states and 111 transitions. [2024-11-09 10:58:41,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 73 transitions, 346 flow [2024-11-09 10:58:41,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 73 transitions, 336 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:58:41,375 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 174 flow [2024-11-09 10:58:41,375 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=57, PETRI_TRANSITIONS=53} [2024-11-09 10:58:41,376 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 5 predicate places. [2024-11-09 10:58:41,376 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 174 flow [2024-11-09 10:58:41,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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-11-09 10:58:41,376 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:41,376 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:58:41,381 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 (7)] Ended with exit code 0 [2024-11-09 10:58:41,576 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-11-09 10:58:41,577 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-11-09 10:58:41,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:41,578 INFO L85 PathProgramCache]: Analyzing trace with hash -864807880, now seen corresponding path program 1 times [2024-11-09 10:58:41,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:58:41,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1890520559] [2024-11-09 10:58:41,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:41,578 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-11-09 10:58:41,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:58:41,580 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-11-09 10:58:41,581 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-11-09 10:58:41,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:41,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 10:58:41,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:58:41,717 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:41,717 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:58:41,718 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:58:41,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1890520559] [2024-11-09 10:58:41,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1890520559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:58:41,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:58:41,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:58:41,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509987496] [2024-11-09 10:58:41,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:58:41,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:58:41,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:58:41,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:58:41,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:58:41,727 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2024-11-09 10:58:41,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 174 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-11-09 10:58:41,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:41,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2024-11-09 10:58:41,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:42,055 INFO L124 PetriNetUnfolderBase]: 1014/2027 cut-off events. [2024-11-09 10:58:42,055 INFO L125 PetriNetUnfolderBase]: For 564/576 co-relation queries the response was YES. [2024-11-09 10:58:42,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4360 conditions, 2027 events. 1014/2027 cut-off events. For 564/576 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 10512 event pairs, 422 based on Foata normal form. 64/2043 useless extension candidates. Maximal degree in co-relation 4345. Up to 1083 conditions per place. [2024-11-09 10:58:42,067 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 47 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2024-11-09 10:58:42,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 66 transitions, 301 flow [2024-11-09 10:58:42,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:58:42,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:58:42,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2024-11-09 10:58:42,069 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6091954022988506 [2024-11-09 10:58:42,069 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 174 flow. Second operand 3 states and 106 transitions. [2024-11-09 10:58:42,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 66 transitions, 301 flow [2024-11-09 10:58:42,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 66 transitions, 293 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-09 10:58:42,073 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 164 flow [2024-11-09 10:58:42,073 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2024-11-09 10:58:42,074 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 6 predicate places. [2024-11-09 10:58:42,074 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 164 flow [2024-11-09 10:58:42,075 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-11-09 10:58:42,075 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:42,075 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-11-09 10:58:42,082 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-11-09 10:58:42,275 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-11-09 10:58:42,276 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-09 10:58:42,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:42,276 INFO L85 PathProgramCache]: Analyzing trace with hash -370566483, now seen corresponding path program 1 times [2024-11-09 10:58:42,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:58:42,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1030190859] [2024-11-09 10:58:42,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:42,277 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-11-09 10:58:42,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:58:42,278 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-11-09 10:58:42,279 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-11-09 10:58:42,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:42,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:58:42,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:58:42,454 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-11-09 10:58:42,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:42,490 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:58:42,490 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:58:42,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1030190859] [2024-11-09 10:58:42,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1030190859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:58:42,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:58:42,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:58:42,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073283631] [2024-11-09 10:58:42,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:58:42,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:58:42,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:58:42,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:58:42,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:58:42,492 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-09 10:58:42,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 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-11-09 10:58:42,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:42,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-09 10:58:42,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:42,767 INFO L124 PetriNetUnfolderBase]: 619/1417 cut-off events. [2024-11-09 10:58:42,767 INFO L125 PetriNetUnfolderBase]: For 423/423 co-relation queries the response was YES. [2024-11-09 10:58:42,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2997 conditions, 1417 events. 619/1417 cut-off events. For 423/423 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 6675 event pairs, 188 based on Foata normal form. 72/1453 useless extension candidates. Maximal degree in co-relation 2982. Up to 626 conditions per place. [2024-11-09 10:58:42,779 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 40 selfloop transitions, 4 changer transitions 0/62 dead transitions. [2024-11-09 10:58:42,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 62 transitions, 284 flow [2024-11-09 10:58:42,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:58:42,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:58:42,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2024-11-09 10:58:42,781 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.603448275862069 [2024-11-09 10:58:42,781 INFO L175 Difference]: Start difference. First operand has 58 places, 51 transitions, 164 flow. Second operand 3 states and 105 transitions. [2024-11-09 10:58:42,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 62 transitions, 284 flow [2024-11-09 10:58:42,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 62 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:58:42,785 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 168 flow [2024-11-09 10:58:42,785 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2024-11-09 10:58:42,786 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 6 predicate places. [2024-11-09 10:58:42,786 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 168 flow [2024-11-09 10:58:42,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 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-11-09 10:58:42,786 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:42,786 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] [2024-11-09 10:58:42,794 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-11-09 10:58:42,987 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-11-09 10:58:42,987 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-11-09 10:58:42,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:42,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1230312578, now seen corresponding path program 1 times [2024-11-09 10:58:42,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:58:42,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1531277136] [2024-11-09 10:58:42,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:42,989 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-11-09 10:58:42,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:58:42,991 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-11-09 10:58:42,992 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-11-09 10:58:43,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:43,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 10:58:43,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:58:43,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:43,447 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:58:43,447 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:58:43,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1531277136] [2024-11-09 10:58:43,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1531277136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:58:43,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:58:43,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:58:43,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832456715] [2024-11-09 10:58:43,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:58:43,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:58:43,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:58:43,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:58:43,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:58:43,467 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2024-11-09 10:58:43,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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-11-09 10:58:43,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:43,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2024-11-09 10:58:43,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:43,868 INFO L124 PetriNetUnfolderBase]: 1216/2661 cut-off events. [2024-11-09 10:58:43,868 INFO L125 PetriNetUnfolderBase]: For 983/983 co-relation queries the response was YES. [2024-11-09 10:58:43,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6000 conditions, 2661 events. 1216/2661 cut-off events. For 983/983 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 14477 event pairs, 625 based on Foata normal form. 0/2559 useless extension candidates. Maximal degree in co-relation 5985. Up to 1000 conditions per place. [2024-11-09 10:58:43,883 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 80 selfloop transitions, 3 changer transitions 0/100 dead transitions. [2024-11-09 10:58:43,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 100 transitions, 510 flow [2024-11-09 10:58:43,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:58:43,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:58:43,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2024-11-09 10:58:43,886 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6853448275862069 [2024-11-09 10:58:43,886 INFO L175 Difference]: Start difference. First operand has 58 places, 51 transitions, 168 flow. Second operand 4 states and 159 transitions. [2024-11-09 10:58:43,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 100 transitions, 510 flow [2024-11-09 10:58:43,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 100 transitions, 498 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:58:43,890 INFO L231 Difference]: Finished difference. Result has 61 places, 53 transitions, 180 flow [2024-11-09 10:58:43,891 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=180, PETRI_PLACES=61, PETRI_TRANSITIONS=53} [2024-11-09 10:58:43,891 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2024-11-09 10:58:43,891 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 53 transitions, 180 flow [2024-11-09 10:58:43,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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-11-09 10:58:43,892 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:43,892 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-11-09 10:58:43,901 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-11-09 10:58:44,092 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-11-09 10:58:44,093 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-11-09 10:58:44,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:44,093 INFO L85 PathProgramCache]: Analyzing trace with hash -2063220063, now seen corresponding path program 1 times [2024-11-09 10:58:44,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:58:44,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1120984935] [2024-11-09 10:58:44,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:44,094 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-11-09 10:58:44,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:58:44,095 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-11-09 10:58:44,096 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-11-09 10:58:44,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:44,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 10:58:44,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:58:44,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:44,231 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:58:44,232 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:58:44,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1120984935] [2024-11-09 10:58:44,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1120984935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:58:44,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:58:44,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:58:44,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79936040] [2024-11-09 10:58:44,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:58:44,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:58:44,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:58:44,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:58:44,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:58:44,238 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-09 10:58:44,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 53 transitions, 180 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:58:44,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:44,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-09 10:58:44,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:44,627 INFO L124 PetriNetUnfolderBase]: 1500/3318 cut-off events. [2024-11-09 10:58:44,628 INFO L125 PetriNetUnfolderBase]: For 1126/1132 co-relation queries the response was YES. [2024-11-09 10:58:44,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7288 conditions, 3318 events. 1500/3318 cut-off events. For 1126/1132 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 19750 event pairs, 913 based on Foata normal form. 23/3255 useless extension candidates. Maximal degree in co-relation 7270. Up to 2099 conditions per place. [2024-11-09 10:58:44,645 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 57 selfloop transitions, 2 changer transitions 0/77 dead transitions. [2024-11-09 10:58:44,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 77 transitions, 385 flow [2024-11-09 10:58:44,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:58:44,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:58:44,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2024-11-09 10:58:44,647 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-11-09 10:58:44,647 INFO L175 Difference]: Start difference. First operand has 61 places, 53 transitions, 180 flow. Second operand 3 states and 116 transitions. [2024-11-09 10:58:44,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 77 transitions, 385 flow [2024-11-09 10:58:44,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 77 transitions, 385 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 10:58:44,651 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 192 flow [2024-11-09 10:58:44,651 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=61, 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=192, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2024-11-09 10:58:44,651 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 12 predicate places. [2024-11-09 10:58:44,652 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 192 flow [2024-11-09 10:58:44,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:58:44,652 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:44,652 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-11-09 10:58:44,659 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-11-09 10:58:44,852 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-11-09 10:58:44,853 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-11-09 10:58:44,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:44,853 INFO L85 PathProgramCache]: Analyzing trace with hash -333457146, now seen corresponding path program 1 times [2024-11-09 10:58:44,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:58:44,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [25407967] [2024-11-09 10:58:44,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:44,854 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-11-09 10:58:44,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:58:44,855 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-11-09 10:58:44,856 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-11-09 10:58:44,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:44,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:58:44,971 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:58:45,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:45,140 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:58:45,140 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:58:45,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [25407967] [2024-11-09 10:58:45,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [25407967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:58:45,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:58:45,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:58:45,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177819052] [2024-11-09 10:58:45,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:58:45,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:58:45,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:58:45,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:58:45,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:58:45,170 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-09 10:58:45,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 192 flow. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 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-11-09 10:58:45,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:45,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-09 10:58:45,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:45,541 INFO L124 PetriNetUnfolderBase]: 1060/2336 cut-off events. [2024-11-09 10:58:45,541 INFO L125 PetriNetUnfolderBase]: For 1049/1053 co-relation queries the response was YES. [2024-11-09 10:58:45,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5537 conditions, 2336 events. 1060/2336 cut-off events. For 1049/1053 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 11961 event pairs, 367 based on Foata normal form. 18/2303 useless extension candidates. Maximal degree in co-relation 5517. Up to 1219 conditions per place. [2024-11-09 10:58:45,557 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 59 selfloop transitions, 3 changer transitions 0/80 dead transitions. [2024-11-09 10:58:45,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 80 transitions, 409 flow [2024-11-09 10:58:45,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:58:45,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:58:45,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 140 transitions. [2024-11-09 10:58:45,559 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.603448275862069 [2024-11-09 10:58:45,559 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 192 flow. Second operand 4 states and 140 transitions. [2024-11-09 10:58:45,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 80 transitions, 409 flow [2024-11-09 10:58:45,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 80 transitions, 404 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:58:45,563 INFO L231 Difference]: Finished difference. Result has 67 places, 54 transitions, 200 flow [2024-11-09 10:58:45,564 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=200, PETRI_PLACES=67, PETRI_TRANSITIONS=54} [2024-11-09 10:58:45,564 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 15 predicate places. [2024-11-09 10:58:45,565 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 54 transitions, 200 flow [2024-11-09 10:58:45,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 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-11-09 10:58:45,566 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:45,566 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] [2024-11-09 10:58:45,572 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-11-09 10:58:45,766 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-11-09 10:58:45,766 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-11-09 10:58:45,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:45,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1044603421, now seen corresponding path program 1 times [2024-11-09 10:58:45,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:58:45,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [13523019] [2024-11-09 10:58:45,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:45,767 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-11-09 10:58:45,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:58:45,769 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-11-09 10:58:45,769 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-11-09 10:58:45,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:45,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 10:58:45,924 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:58:46,126 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 12 treesize of output 8 [2024-11-09 10:58:46,291 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 18 treesize of output 10 [2024-11-09 10:58:46,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:46,331 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:58:46,331 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:58:46,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [13523019] [2024-11-09 10:58:46,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [13523019] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:58:46,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:58:46,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 10:58:46,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399287667] [2024-11-09 10:58:46,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:58:46,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 10:58:46,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:58:46,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 10:58:46,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-09 10:58:46,521 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-09 10:58:46,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 54 transitions, 200 flow. Second operand has 10 states, 10 states have (on average 22.7) internal successors, (227), 10 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:58:46,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:46,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-09 10:58:46,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:47,417 INFO L124 PetriNetUnfolderBase]: 1223/2688 cut-off events. [2024-11-09 10:58:47,418 INFO L125 PetriNetUnfolderBase]: For 1357/1363 co-relation queries the response was YES. [2024-11-09 10:58:47,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6409 conditions, 2688 events. 1223/2688 cut-off events. For 1357/1363 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 14413 event pairs, 423 based on Foata normal form. 0/2638 useless extension candidates. Maximal degree in co-relation 6387. Up to 1724 conditions per place. [2024-11-09 10:58:47,431 INFO L140 encePairwiseOnDemand]: 47/58 looper letters, 97 selfloop transitions, 14 changer transitions 0/129 dead transitions. [2024-11-09 10:58:47,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 129 transitions, 689 flow [2024-11-09 10:58:47,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 10:58:47,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-09 10:58:47,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 331 transitions. [2024-11-09 10:58:47,435 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5188087774294671 [2024-11-09 10:58:47,435 INFO L175 Difference]: Start difference. First operand has 67 places, 54 transitions, 200 flow. Second operand 11 states and 331 transitions. [2024-11-09 10:58:47,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 129 transitions, 689 flow [2024-11-09 10:58:47,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 129 transitions, 680 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:58:47,439 INFO L231 Difference]: Finished difference. Result has 81 places, 65 transitions, 310 flow [2024-11-09 10:58:47,440 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=310, PETRI_PLACES=81, PETRI_TRANSITIONS=65} [2024-11-09 10:58:47,442 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 29 predicate places. [2024-11-09 10:58:47,442 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 65 transitions, 310 flow [2024-11-09 10:58:47,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 22.7) internal successors, (227), 10 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:58:47,443 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:47,443 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] [2024-11-09 10:58:47,452 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-11-09 10:58:47,647 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-11-09 10:58:47,648 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-11-09 10:58:47,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:47,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1656545843, now seen corresponding path program 2 times [2024-11-09 10:58:47,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:58:47,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [130733458] [2024-11-09 10:58:47,649 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:58:47,649 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-11-09 10:58:47,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:58:47,652 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-11-09 10:58:47,653 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-11-09 10:58:47,763 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 10:58:47,763 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:58:47,768 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 10:58:47,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:58:47,961 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 12 treesize of output 8 [2024-11-09 10:58:48,094 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 18 treesize of output 10 [2024-11-09 10:58:48,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:48,133 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:58:48,133 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:58:48,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [130733458] [2024-11-09 10:58:48,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [130733458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:58:48,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:58:48,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 10:58:48,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512312305] [2024-11-09 10:58:48,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:58:48,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 10:58:48,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:58:48,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 10:58:48,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-09 10:58:48,303 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-09 10:58:48,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 65 transitions, 310 flow. Second operand has 10 states, 10 states have (on average 22.7) internal successors, (227), 10 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:58:48,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:48,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-09 10:58:48,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:49,118 INFO L124 PetriNetUnfolderBase]: 1419/3091 cut-off events. [2024-11-09 10:58:49,118 INFO L125 PetriNetUnfolderBase]: For 2970/2976 co-relation queries the response was YES. [2024-11-09 10:58:49,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8241 conditions, 3091 events. 1419/3091 cut-off events. For 2970/2976 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 17181 event pairs, 494 based on Foata normal form. 0/3035 useless extension candidates. Maximal degree in co-relation 8213. Up to 2015 conditions per place. [2024-11-09 10:58:49,139 INFO L140 encePairwiseOnDemand]: 47/58 looper letters, 99 selfloop transitions, 20 changer transitions 0/137 dead transitions. [2024-11-09 10:58:49,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 137 transitions, 874 flow [2024-11-09 10:58:49,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 10:58:49,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-09 10:58:49,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 332 transitions. [2024-11-09 10:58:49,142 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5203761755485894 [2024-11-09 10:58:49,142 INFO L175 Difference]: Start difference. First operand has 81 places, 65 transitions, 310 flow. Second operand 11 states and 332 transitions. [2024-11-09 10:58:49,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 137 transitions, 874 flow [2024-11-09 10:58:49,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 137 transitions, 853 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-11-09 10:58:49,153 INFO L231 Difference]: Finished difference. Result has 95 places, 81 transitions, 512 flow [2024-11-09 10:58:49,154 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=512, PETRI_PLACES=95, PETRI_TRANSITIONS=81} [2024-11-09 10:58:49,155 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 43 predicate places. [2024-11-09 10:58:49,155 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 81 transitions, 512 flow [2024-11-09 10:58:49,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 22.7) internal successors, (227), 10 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:58:49,155 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:49,155 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] [2024-11-09 10:58:49,165 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-11-09 10:58:49,356 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-11-09 10:58:49,356 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-09 10:58:49,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:49,357 INFO L85 PathProgramCache]: Analyzing trace with hash -148860277, now seen corresponding path program 3 times [2024-11-09 10:58:49,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:58:49,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1726538326] [2024-11-09 10:58:49,357 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 10:58:49,357 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-11-09 10:58:49,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:58:49,360 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-11-09 10:58:49,362 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-11-09 10:58:49,518 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-09 10:58:49,519 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:58:49,527 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 10:58:49,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:58:49,688 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 12 treesize of output 8 [2024-11-09 10:58:49,835 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 18 treesize of output 10 [2024-11-09 10:58:49,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:49,879 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:58:49,880 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:58:49,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1726538326] [2024-11-09 10:58:49,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1726538326] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:58:49,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:58:49,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 10:58:49,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810832362] [2024-11-09 10:58:49,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:58:49,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 10:58:49,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:58:49,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 10:58:49,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-09 10:58:50,049 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-11-09 10:58:50,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 81 transitions, 512 flow. Second operand has 10 states, 10 states have (on average 22.7) internal successors, (227), 10 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:58:50,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:50,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-11-09 10:58:50,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:50,882 INFO L124 PetriNetUnfolderBase]: 1566/3406 cut-off events. [2024-11-09 10:58:50,883 INFO L125 PetriNetUnfolderBase]: For 4668/4676 co-relation queries the response was YES. [2024-11-09 10:58:50,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9693 conditions, 3406 events. 1566/3406 cut-off events. For 4668/4676 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 19519 event pairs, 491 based on Foata normal form. 0/3351 useless extension candidates. Maximal degree in co-relation 9659. Up to 2284 conditions per place. [2024-11-09 10:58:50,907 INFO L140 encePairwiseOnDemand]: 47/58 looper letters, 113 selfloop transitions, 20 changer transitions 0/151 dead transitions. [2024-11-09 10:58:50,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 151 transitions, 1093 flow [2024-11-09 10:58:50,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 10:58:50,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-09 10:58:50,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 333 transitions. [2024-11-09 10:58:50,910 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5219435736677116 [2024-11-09 10:58:50,910 INFO L175 Difference]: Start difference. First operand has 95 places, 81 transitions, 512 flow. Second operand 11 states and 333 transitions. [2024-11-09 10:58:50,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 151 transitions, 1093 flow [2024-11-09 10:58:50,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 151 transitions, 1035 flow, removed 29 selfloop flow, removed 0 redundant places. [2024-11-09 10:58:50,930 INFO L231 Difference]: Finished difference. Result has 111 places, 93 transitions, 659 flow [2024-11-09 10:58:50,931 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=659, PETRI_PLACES=111, PETRI_TRANSITIONS=93} [2024-11-09 10:58:50,932 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 59 predicate places. [2024-11-09 10:58:50,932 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 93 transitions, 659 flow [2024-11-09 10:58:50,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 22.7) internal successors, (227), 10 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:58:50,933 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:50,933 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] [2024-11-09 10:58:50,940 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 (15)] Ended with exit code 0 [2024-11-09 10:58:51,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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-11-09 10:58:51,134 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-09 10:58:51,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:51,134 INFO L85 PathProgramCache]: Analyzing trace with hash 323406515, now seen corresponding path program 4 times [2024-11-09 10:58:51,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:58:51,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [572773535] [2024-11-09 10:58:51,135 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 10:58:51,135 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-11-09 10:58:51,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:58:51,136 INFO L229 MonitoredProcess]: Starting monitored process 16 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-11-09 10:58:51,137 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 (16)] Waiting until timeout for monitored process [2024-11-09 10:58:51,254 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 10:58:51,254 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:58:51,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 10:58:51,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:58:51,395 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 12 treesize of output 8 [2024-11-09 10:58:51,584 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 18 treesize of output 10 [2024-11-09 10:58:51,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:51,611 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:58:51,611 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:58:51,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [572773535] [2024-11-09 10:58:51,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [572773535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:58:51,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:58:51,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 10:58:51,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838414481] [2024-11-09 10:58:51,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:58:51,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 10:58:51,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:58:51,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 10:58:51,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-09 10:58:51,774 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2024-11-09 10:58:51,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 93 transitions, 659 flow. Second operand has 11 states, 11 states have (on average 21.636363636363637) internal successors, (238), 11 states have internal predecessors, (238), 0 states have call successors, (0), 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-11-09 10:58:51,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:51,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2024-11-09 10:58:51,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:52,614 INFO L124 PetriNetUnfolderBase]: 1607/3447 cut-off events. [2024-11-09 10:58:52,614 INFO L125 PetriNetUnfolderBase]: For 5235/5255 co-relation queries the response was YES. [2024-11-09 10:58:52,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10045 conditions, 3447 events. 1607/3447 cut-off events. For 5235/5255 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 19608 event pairs, 322 based on Foata normal form. 4/3413 useless extension candidates. Maximal degree in co-relation 10003. Up to 1179 conditions per place. [2024-11-09 10:58:52,647 INFO L140 encePairwiseOnDemand]: 47/58 looper letters, 114 selfloop transitions, 52 changer transitions 0/183 dead transitions. [2024-11-09 10:58:52,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 183 transitions, 1341 flow [2024-11-09 10:58:52,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 10:58:52,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-09 10:58:52,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 410 transitions. [2024-11-09 10:58:52,650 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5049261083743842 [2024-11-09 10:58:52,650 INFO L175 Difference]: Start difference. First operand has 111 places, 93 transitions, 659 flow. Second operand 14 states and 410 transitions. [2024-11-09 10:58:52,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 183 transitions, 1341 flow [2024-11-09 10:58:52,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 183 transitions, 1295 flow, removed 23 selfloop flow, removed 0 redundant places. [2024-11-09 10:58:52,671 INFO L231 Difference]: Finished difference. Result has 127 places, 100 transitions, 839 flow [2024-11-09 10:58:52,671 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=839, PETRI_PLACES=127, PETRI_TRANSITIONS=100} [2024-11-09 10:58:52,671 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 75 predicate places. [2024-11-09 10:58:52,672 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 100 transitions, 839 flow [2024-11-09 10:58:52,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 21.636363636363637) internal successors, (238), 11 states have internal predecessors, (238), 0 states have call successors, (0), 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-11-09 10:58:52,672 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:52,672 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, 1] [2024-11-09 10:58:52,679 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 (16)] Ended with exit code 0 [2024-11-09 10:58:52,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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-11-09 10:58:52,877 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-09 10:58:52,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:52,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1474539435, now seen corresponding path program 1 times [2024-11-09 10:58:52,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:58:52,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [417480026] [2024-11-09 10:58:52,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:52,877 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-11-09 10:58:52,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:58:52,879 INFO L229 MonitoredProcess]: Starting monitored process 17 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-11-09 10:58:52,880 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 (17)] Waiting until timeout for monitored process [2024-11-09 10:58:52,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:52,982 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:58:52,983 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:58:52,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:58:52,998 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:58:53,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:58:53,027 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:58:53,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [417480026] [2024-11-09 10:58:53,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [417480026] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:58:53,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:58:53,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-09 10:58:53,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007195873] [2024-11-09 10:58:53,027 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:58:53,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:58:53,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:58:53,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:58:53,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:58:53,033 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2024-11-09 10:58:53,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 100 transitions, 839 flow. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 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-11-09 10:58:53,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:53,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2024-11-09 10:58:53,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:54,027 INFO L124 PetriNetUnfolderBase]: 3271/6757 cut-off events. [2024-11-09 10:58:54,027 INFO L125 PetriNetUnfolderBase]: For 9814/9828 co-relation queries the response was YES. [2024-11-09 10:58:54,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19487 conditions, 6757 events. 3271/6757 cut-off events. For 9814/9828 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 42929 event pairs, 450 based on Foata normal form. 295/6955 useless extension candidates. Maximal degree in co-relation 19440. Up to 1411 conditions per place. [2024-11-09 10:58:54,064 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 149 selfloop transitions, 25 changer transitions 0/191 dead transitions. [2024-11-09 10:58:54,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 191 transitions, 1744 flow [2024-11-09 10:58:54,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:58:54,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:58:54,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 236 transitions. [2024-11-09 10:58:54,068 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6781609195402298 [2024-11-09 10:58:54,068 INFO L175 Difference]: Start difference. First operand has 127 places, 100 transitions, 839 flow. Second operand 6 states and 236 transitions. [2024-11-09 10:58:54,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 191 transitions, 1744 flow [2024-11-09 10:58:54,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 191 transitions, 1418 flow, removed 74 selfloop flow, removed 16 redundant places. [2024-11-09 10:58:54,112 INFO L231 Difference]: Finished difference. Result has 120 places, 103 transitions, 742 flow [2024-11-09 10:58:54,112 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=742, PETRI_PLACES=120, PETRI_TRANSITIONS=103} [2024-11-09 10:58:54,113 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 68 predicate places. [2024-11-09 10:58:54,113 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 103 transitions, 742 flow [2024-11-09 10:58:54,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 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-11-09 10:58:54,113 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:54,114 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:58:54,123 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 (17)] Ended with exit code 0 [2024-11-09 10:58:54,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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-11-09 10:58:54,314 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-11-09 10:58:54,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:54,315 INFO L85 PathProgramCache]: Analyzing trace with hash 405701161, now seen corresponding path program 1 times [2024-11-09 10:58:54,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:58:54,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2095901183] [2024-11-09 10:58:54,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:54,315 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-11-09 10:58:54,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:58:54,317 INFO L229 MonitoredProcess]: Starting monitored process 18 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-11-09 10:58:54,318 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 (18)] Waiting until timeout for monitored process [2024-11-09 10:58:54,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:58:54,444 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:58:54,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:58:54,560 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-09 10:58:54,561 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:58:54,562 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t2Err2ASSERT_VIOLATIONMEMORY_LEAK (14 of 15 remaining) [2024-11-09 10:58:54,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (13 of 15 remaining) [2024-11-09 10:58:54,564 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 15 remaining) [2024-11-09 10:58:54,564 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 15 remaining) [2024-11-09 10:58:54,564 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2024-11-09 10:58:54,564 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2024-11-09 10:58:54,564 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONMEMORY_LEAK (8 of 15 remaining) [2024-11-09 10:58:54,564 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2024-11-09 10:58:54,564 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2024-11-09 10:58:54,564 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONMEMORY_LEAK (5 of 15 remaining) [2024-11-09 10:58:54,565 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2024-11-09 10:58:54,565 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2024-11-09 10:58:54,565 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONMEMORY_LEAK (2 of 15 remaining) [2024-11-09 10:58:54,565 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 15 remaining) [2024-11-09 10:58:54,565 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 15 remaining) [2024-11-09 10:58:54,574 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 (18)] Ended with exit code 0 [2024-11-09 10:58:54,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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-11-09 10:58:54,766 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:58:54,824 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 10:58:54,825 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 10:58:54,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:58:54 BasicIcfg [2024-11-09 10:58:54,829 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 10:58:54,830 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 10:58:54,830 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 10:58:54,830 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 10:58:54,830 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:58:36" (3/4) ... [2024-11-09 10:58:54,832 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 10:58:54,833 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 10:58:54,833 INFO L158 Benchmark]: Toolchain (without parser) took 19612.03ms. Allocated memory was 58.7MB in the beginning and 306.2MB in the end (delta: 247.5MB). Free memory was 35.7MB in the beginning and 158.3MB in the end (delta: -122.7MB). Peak memory consumption was 122.9MB. Max. memory is 16.1GB. [2024-11-09 10:58:54,834 INFO L158 Benchmark]: CDTParser took 0.89ms. Allocated memory is still 48.2MB. Free memory is still 31.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:58:54,834 INFO L158 Benchmark]: CACSL2BoogieTranslator took 569.23ms. Allocated memory is still 58.7MB. Free memory was 35.3MB in the beginning and 24.6MB in the end (delta: 10.7MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. [2024-11-09 10:58:54,834 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.21ms. Allocated memory was 58.7MB in the beginning and 77.6MB in the end (delta: 18.9MB). Free memory was 24.6MB in the beginning and 54.1MB in the end (delta: -29.5MB). Peak memory consumption was 3.5MB. Max. memory is 16.1GB. [2024-11-09 10:58:54,835 INFO L158 Benchmark]: Boogie Preprocessor took 72.65ms. Allocated memory is still 77.6MB. Free memory was 54.1MB in the beginning and 50.6MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:58:54,835 INFO L158 Benchmark]: RCFGBuilder took 854.47ms. Allocated memory is still 77.6MB. Free memory was 50.6MB in the beginning and 34.9MB in the end (delta: 15.7MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. [2024-11-09 10:58:54,835 INFO L158 Benchmark]: TraceAbstraction took 18029.45ms. Allocated memory was 77.6MB in the beginning and 306.2MB in the end (delta: 228.6MB). Free memory was 34.1MB in the beginning and 159.4MB in the end (delta: -125.3MB). Peak memory consumption was 104.0MB. Max. memory is 16.1GB. [2024-11-09 10:58:54,835 INFO L158 Benchmark]: Witness Printer took 3.43ms. Allocated memory is still 306.2MB. Free memory was 159.4MB in the beginning and 158.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:58:54,837 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.89ms. Allocated memory is still 48.2MB. Free memory is still 31.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 569.23ms. Allocated memory is still 58.7MB. Free memory was 35.3MB in the beginning and 24.6MB in the end (delta: 10.7MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.21ms. Allocated memory was 58.7MB in the beginning and 77.6MB in the end (delta: 18.9MB). Free memory was 24.6MB in the beginning and 54.1MB in the end (delta: -29.5MB). Peak memory consumption was 3.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.65ms. Allocated memory is still 77.6MB. Free memory was 54.1MB in the beginning and 50.6MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 854.47ms. Allocated memory is still 77.6MB. Free memory was 50.6MB in the beginning and 34.9MB in the end (delta: 15.7MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. * TraceAbstraction took 18029.45ms. Allocated memory was 77.6MB in the beginning and 306.2MB in the end (delta: 228.6MB). Free memory was 34.1MB in the beginning and 159.4MB in the end (delta: -125.3MB). Peak memory consumption was 104.0MB. Max. memory is 16.1GB. * Witness Printer took 3.43ms. Allocated memory is still 306.2MB. Free memory was 159.4MB in the beginning and 158.3MB 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: 681]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 681. Possible FailurePath: [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L683] 0 static unsigned int first; [L684] 0 static unsigned int next; [L685] 0 static int buffer_size; [L686] 0 _Bool send, receive; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L756] 0 pthread_t id1, id2; [L758] CALL 0 initLog(10) [L690] 0 buffer_size = max [L691] EXPR 0 next = 0 [L691] 0 first = next = 0 [L758] RET 0 initLog(10) [L759] 0 send=1 [L760] 0 receive=0 [L761] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [buffer={3:0}, buffer_size=10, first=0, id1=0, m={4:0}, next=0, receive=0, send=1] [L723] 1 int i; [L724] 1 i=0 VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L762] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [buffer={3:0}, buffer_size=10, first=0, id1=0, id2=1, m={4:0}, next=0, receive=0, send=1] [L739] 2 int i; [L740] 2 i=0 VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L724] COND TRUE 1 i<7 VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L740] COND TRUE 2 i<7 VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L743] COND FALSE 2 !(\read(receive)) VAL [buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L727] COND TRUE 1 \read(send) [L729] CALL 1 insertLogElement(i) [L707] COND TRUE 1 next < buffer_size && buffer_size > 0 VAL [buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L709] 1 buffer[next] = b [L710] 1 next = (next+1)%buffer_size VAL [\old(b)=0, b=0, buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=1, receive=0, send=1] [L712] COND TRUE 1 next 0 && first < buffer_size [L697] 2 first++ VAL [buffer={3:0}, buffer_size=10, first=1, m={4:0}, next=1, receive=1, send=0] [L698] EXPR 2 buffer[first-1] [L698] 2 return buffer[first-1]; [L745] RET, EXPR 2 removeLogElement() [L745] COND FALSE 2 !(removeLogElement()==i) [L746] CALL 2 reach_error() [L681] COND FALSE 2 !(0) VAL [buffer={3:0}, buffer_size=10, first=1, m={4:0}, next=1, receive=1, send=0] [L681] 2 __assert_fail ("0", "", 0, __extension__ __PRETTY_FUNCTION__) VAL [buffer={3:0}, buffer_size=10, first=1, m={4:0}, next=1, receive=1, send=0] - UnprovableResult [Line: 754]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 761]: 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: 762]: 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: 681]: 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, 89 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: 17.8s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 9.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1064 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 945 mSDsluCounter, 487 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 463 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4028 IncrementalHoareTripleChecker+Invalid, 4044 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 24 mSDtfsCounter, 4028 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 354 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=839occurred in iteration=15, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 354 NumberOfCodeBlocks, 354 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 335 ConstructedInterpolants, 0 QuantifiedInterpolants, 2530 SizeOfPredicates, 38 NumberOfNonLiveVariables, 1678 ConjunctsInSsa, 100 ConjunctsInUnsatCore, 17 InterpolantComputations, 15 PerfectInterpolantSequences, 10/12 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-11-09 10:58:54,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample