./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_28-funptr_racefree.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/goblint-regression/28-race_reach_28-funptr_racefree.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 3e2d1ca14c91be6e836759580a015ed2d4b9eb8ea9888f9f925ea579405b630f --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:42:25,787 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:42:25,870 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:42:25,878 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:42:25,878 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:42:25,910 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:42:25,910 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:42:25,910 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:42:25,911 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:42:25,911 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:42:25,912 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:42:25,912 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:42:25,913 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:42:25,913 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:42:25,913 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:42:25,914 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:42:25,914 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:42:25,914 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:42:25,915 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:42:25,915 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:42:25,915 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:42:25,916 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:42:25,916 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:42:25,917 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:42:25,917 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:42:25,917 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:42:25,917 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:42:25,918 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:42:25,918 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:42:25,918 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:42:25,919 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:42:25,919 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:42:25,919 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:42:25,920 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:42:25,920 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:42:25,920 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:42:25,921 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:42:25,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:42:25,921 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:42:25,921 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:42:25,922 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:42:25,922 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:42:25,922 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 -> 3e2d1ca14c91be6e836759580a015ed2d4b9eb8ea9888f9f925ea579405b630f [2024-11-09 10:42:26,202 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:42:26,228 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:42:26,232 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:42:26,233 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:42:26,234 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:42:26,235 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_28-funptr_racefree.i [2024-11-09 10:42:27,872 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:42:28,123 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:42:28,123 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_28-funptr_racefree.i [2024-11-09 10:42:28,140 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a413cf2b/844b1f66196f47ac8278693cc1312683/FLAGb2896c4dc [2024-11-09 10:42:28,153 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a413cf2b/844b1f66196f47ac8278693cc1312683 [2024-11-09 10:42:28,156 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:42:28,157 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:42:28,158 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:42:28,159 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:42:28,164 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:42:28,165 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:42:28" (1/1) ... [2024-11-09 10:42:28,166 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@282e4134 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:42:28, skipping insertion in model container [2024-11-09 10:42:28,166 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:42:28" (1/1) ... [2024-11-09 10:42:28,216 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:42:28,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:42:28,687 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:42:28,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:42:28,827 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:42:28,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:42:28 WrapperNode [2024-11-09 10:42:28,828 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:42:28,829 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:42:28,830 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:42:28,830 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:42:28,838 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:42:28" (1/1) ... [2024-11-09 10:42:28,862 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:42:28" (1/1) ... [2024-11-09 10:42:28,900 INFO L138 Inliner]: procedures = 252, calls = 52, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 143 [2024-11-09 10:42:28,902 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:42:28,902 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:42:28,903 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:42:28,903 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:42:28,914 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:42:28" (1/1) ... [2024-11-09 10:42:28,915 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:42:28" (1/1) ... [2024-11-09 10:42:28,918 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:42:28" (1/1) ... [2024-11-09 10:42:28,943 INFO L175 MemorySlicer]: Split 19 memory accesses to 5 slices as follows [2, 5, 5, 5, 2]. 26 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 5, 5, 0]. The 1 writes are split as follows [0, 0, 0, 0, 1]. [2024-11-09 10:42:28,947 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:42:28" (1/1) ... [2024-11-09 10:42:28,948 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:42:28" (1/1) ... [2024-11-09 10:42:28,959 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:42:28" (1/1) ... [2024-11-09 10:42:28,965 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:42:28" (1/1) ... [2024-11-09 10:42:28,968 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:42:28" (1/1) ... [2024-11-09 10:42:28,973 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:42:28" (1/1) ... [2024-11-09 10:42:28,976 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:42:28,981 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:42:28,981 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:42:28,981 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:42:28,982 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:42:28" (1/1) ... [2024-11-09 10:42:28,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:42:28,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:42:29,020 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:42:29,023 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:42:29,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 10:42:29,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 10:42:29,079 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-09 10:42:29,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 10:42:29,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 10:42:29,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 10:42:29,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 10:42:29,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-09 10:42:29,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 10:42:29,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 10:42:29,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 10:42:29,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 10:42:29,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-09 10:42:29,082 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-09 10:42:29,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:42:29,082 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-09 10:42:29,082 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-09 10:42:29,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 10:42:29,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 10:42:29,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 10:42:29,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 10:42:29,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-09 10:42:29,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:42:29,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:42:29,086 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:42:29,244 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:42:29,246 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:42:29,518 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:42:29,518 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:42:29,702 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:42:29,702 INFO L316 CfgBuilder]: Removed 10 assume(true) statements. [2024-11-09 10:42:29,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:42:29 BoogieIcfgContainer [2024-11-09 10:42:29,703 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:42:29,706 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:42:29,706 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:42:29,709 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:42:29,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:42:28" (1/3) ... [2024-11-09 10:42:29,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f453368 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:42:29, skipping insertion in model container [2024-11-09 10:42:29,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:42:28" (2/3) ... [2024-11-09 10:42:29,711 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f453368 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:42:29, skipping insertion in model container [2024-11-09 10:42:29,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:42:29" (3/3) ... [2024-11-09 10:42:29,714 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_28-funptr_racefree.i [2024-11-09 10:42:29,731 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:42:29,732 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-09 10:42:29,732 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:42:29,779 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-09 10:42:29,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 68 transitions, 143 flow [2024-11-09 10:42:29,869 INFO L124 PetriNetUnfolderBase]: 15/103 cut-off events. [2024-11-09 10:42:29,870 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 10:42:29,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 103 events. 15/103 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 361 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 63. Up to 4 conditions per place. [2024-11-09 10:42:29,877 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 68 transitions, 143 flow [2024-11-09 10:42:29,881 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 68 transitions, 143 flow [2024-11-09 10:42:29,892 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:42:29,900 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;@17489217, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:42:29,900 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-09 10:42:29,905 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:42:29,906 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-09 10:42:29,906 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:42:29,906 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:42:29,907 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:42:29,908 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-09 10:42:29,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:42:29,913 INFO L85 PathProgramCache]: Analyzing trace with hash 387454, now seen corresponding path program 1 times [2024-11-09 10:42:29,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:42:29,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909576164] [2024-11-09 10:42:29,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:42:29,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:42:30,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:42:30,248 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:42:30,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:42:30,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909576164] [2024-11-09 10:42:30,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909576164] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:42:30,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:42:30,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:42:30,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462034853] [2024-11-09 10:42:30,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:42:30,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:42:30,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:42:30,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:42:30,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:42:30,309 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 68 [2024-11-09 10:42:30,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 68 transitions, 143 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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:42:30,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:42:30,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 68 [2024-11-09 10:42:30,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:42:30,569 INFO L124 PetriNetUnfolderBase]: 253/754 cut-off events. [2024-11-09 10:42:30,569 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 10:42:30,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1317 conditions, 754 events. 253/754 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3959 event pairs, 224 based on Foata normal form. 121/851 useless extension candidates. Maximal degree in co-relation 1256. Up to 497 conditions per place. [2024-11-09 10:42:30,605 INFO L140 encePairwiseOnDemand]: 54/68 looper letters, 47 selfloop transitions, 2 changer transitions 1/69 dead transitions. [2024-11-09 10:42:30,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 69 transitions, 245 flow [2024-11-09 10:42:30,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:42:30,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:42:30,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2024-11-09 10:42:30,625 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6127450980392157 [2024-11-09 10:42:30,627 INFO L175 Difference]: Start difference. First operand has 60 places, 68 transitions, 143 flow. Second operand 3 states and 125 transitions. [2024-11-09 10:42:30,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 69 transitions, 245 flow [2024-11-09 10:42:30,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 69 transitions, 245 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 10:42:30,645 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 119 flow [2024-11-09 10:42:30,647 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=119, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2024-11-09 10:42:30,684 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, -1 predicate places. [2024-11-09 10:42:30,685 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 119 flow [2024-11-09 10:42:30,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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:42:30,685 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:42:30,685 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:42:30,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 10:42:30,686 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-09 10:42:30,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:42:30,687 INFO L85 PathProgramCache]: Analyzing trace with hash 387455, now seen corresponding path program 1 times [2024-11-09 10:42:30,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:42:30,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768185068] [2024-11-09 10:42:30,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:42:30,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:42:30,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:42:30,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:42:30,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:42:30,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768185068] [2024-11-09 10:42:30,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768185068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:42:30,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:42:30,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:42:30,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397741900] [2024-11-09 10:42:30,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:42:30,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:42:30,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:42:30,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:42:30,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:42:30,903 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 68 [2024-11-09 10:42:30,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 119 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:42:30,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:42:30,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 68 [2024-11-09 10:42:30,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:42:31,066 INFO L124 PetriNetUnfolderBase]: 224/698 cut-off events. [2024-11-09 10:42:31,066 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2024-11-09 10:42:31,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1206 conditions, 698 events. 224/698 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3681 event pairs, 120 based on Foata normal form. 1/662 useless extension candidates. Maximal degree in co-relation 1172. Up to 468 conditions per place. [2024-11-09 10:42:31,073 INFO L140 encePairwiseOnDemand]: 64/68 looper letters, 47 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2024-11-09 10:42:31,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 69 transitions, 247 flow [2024-11-09 10:42:31,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:42:31,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:42:31,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2024-11-09 10:42:31,076 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5735294117647058 [2024-11-09 10:42:31,077 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 119 flow. Second operand 3 states and 117 transitions. [2024-11-09 10:42:31,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 69 transitions, 247 flow [2024-11-09 10:42:31,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 69 transitions, 243 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:42:31,082 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 125 flow [2024-11-09 10:42:31,082 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2024-11-09 10:42:31,083 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, -1 predicate places. [2024-11-09 10:42:31,083 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 125 flow [2024-11-09 10:42:31,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:42:31,084 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:42:31,084 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2024-11-09 10:42:31,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 10:42:31,085 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-09 10:42:31,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:42:31,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1351604769, now seen corresponding path program 1 times [2024-11-09 10:42:31,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:42:31,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792909648] [2024-11-09 10:42:31,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:42:31,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:42:31,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:42:31,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:42:31,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:42:31,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792909648] [2024-11-09 10:42:31,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792909648] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:42:31,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567574990] [2024-11-09 10:42:31,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:42:31,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:42:31,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:42:31,279 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:42:31,281 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:42:31,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:42:31,369 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 10:42:31,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:42:31,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2024-11-09 10:42:31,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:42:31,539 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:42:31,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:42:31,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567574990] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:42:31,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:42:31,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2024-11-09 10:42:31,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910500418] [2024-11-09 10:42:31,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:42:31,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:42:31,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:42:31,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:42:31,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:42:31,654 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 68 [2024-11-09 10:42:31,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 125 flow. Second operand has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 0 states have call successors, (0), 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:42:31,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:42:31,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 68 [2024-11-09 10:42:31,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:42:31,740 INFO L124 PetriNetUnfolderBase]: 42/127 cut-off events. [2024-11-09 10:42:31,741 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-09 10:42:31,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 270 conditions, 127 events. 42/127 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 365 event pairs, 0 based on Foata normal form. 30/153 useless extension candidates. Maximal degree in co-relation 239. Up to 87 conditions per place. [2024-11-09 10:42:31,742 INFO L140 encePairwiseOnDemand]: 64/68 looper letters, 33 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2024-11-09 10:42:31,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 43 transitions, 166 flow [2024-11-09 10:42:31,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:42:31,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:42:31,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2024-11-09 10:42:31,744 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.44485294117647056 [2024-11-09 10:42:31,744 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 125 flow. Second operand 4 states and 121 transitions. [2024-11-09 10:42:31,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 43 transitions, 166 flow [2024-11-09 10:42:31,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 43 transitions, 160 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:42:31,763 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 62 flow [2024-11-09 10:42:31,763 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=62, PETRI_PLACES=33, PETRI_TRANSITIONS=27} [2024-11-09 10:42:31,763 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, -27 predicate places. [2024-11-09 10:42:31,764 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 62 flow [2024-11-09 10:42:31,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 0 states have call successors, (0), 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:42:31,764 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:42:31,764 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1] [2024-11-09 10:42:31,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 10:42:31,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:42:31,966 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-09 10:42:31,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:42:31,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1049924762, now seen corresponding path program 1 times [2024-11-09 10:42:31,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:42:31,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876050895] [2024-11-09 10:42:31,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:42:31,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:42:31,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:42:31,985 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:42:31,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:42:32,014 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 10:42:32,015 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:42:32,016 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-09 10:42:32,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 7 remaining) [2024-11-09 10:42:32,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 7 remaining) [2024-11-09 10:42:32,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 7 remaining) [2024-11-09 10:42:32,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 7 remaining) [2024-11-09 10:42:32,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2024-11-09 10:42:32,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-09 10:42:32,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 10:42:32,019 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-09 10:42:32,022 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 10:42:32,022 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-09 10:42:32,045 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-09 10:42:32,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 97 transitions, 210 flow [2024-11-09 10:42:32,066 INFO L124 PetriNetUnfolderBase]: 27/179 cut-off events. [2024-11-09 10:42:32,066 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-09 10:42:32,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 179 events. 27/179 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 749 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 107. Up to 6 conditions per place. [2024-11-09 10:42:32,068 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 97 transitions, 210 flow [2024-11-09 10:42:32,070 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 97 transitions, 210 flow [2024-11-09 10:42:32,071 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:42:32,072 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;@17489217, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:42:32,072 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-09 10:42:32,074 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:42:32,074 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-09 10:42:32,074 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:42:32,075 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:42:32,075 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:42:32,075 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-09 10:42:32,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:42:32,075 INFO L85 PathProgramCache]: Analyzing trace with hash 483775, now seen corresponding path program 1 times [2024-11-09 10:42:32,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:42:32,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326389340] [2024-11-09 10:42:32,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:42:32,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:42:32,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:42:32,112 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:42:32,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:42:32,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326389340] [2024-11-09 10:42:32,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326389340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:42:32,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:42:32,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:42:32,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775509313] [2024-11-09 10:42:32,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:42:32,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:42:32,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:42:32,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:42:32,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:42:32,128 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 97 [2024-11-09 10:42:32,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 97 transitions, 210 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:42:32,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:42:32,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 97 [2024-11-09 10:42:32,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:42:33,739 INFO L124 PetriNetUnfolderBase]: 8123/15821 cut-off events. [2024-11-09 10:42:33,739 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2024-11-09 10:42:33,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28696 conditions, 15821 events. 8123/15821 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 125167 event pairs, 7210 based on Foata normal form. 2972/18286 useless extension candidates. Maximal degree in co-relation 21754. Up to 11384 conditions per place. [2024-11-09 10:42:33,849 INFO L140 encePairwiseOnDemand]: 77/97 looper letters, 77 selfloop transitions, 2 changer transitions 1/106 dead transitions. [2024-11-09 10:42:33,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 106 transitions, 388 flow [2024-11-09 10:42:33,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:42:33,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:42:33,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 188 transitions. [2024-11-09 10:42:33,855 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6460481099656358 [2024-11-09 10:42:33,855 INFO L175 Difference]: Start difference. First operand has 84 places, 97 transitions, 210 flow. Second operand 3 states and 188 transitions. [2024-11-09 10:42:33,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 106 transitions, 388 flow [2024-11-09 10:42:33,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 106 transitions, 388 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 10:42:33,862 INFO L231 Difference]: Finished difference. Result has 83 places, 77 transitions, 174 flow [2024-11-09 10:42:33,862 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=83, PETRI_TRANSITIONS=77} [2024-11-09 10:42:33,863 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -1 predicate places. [2024-11-09 10:42:33,863 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 77 transitions, 174 flow [2024-11-09 10:42:33,863 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:42:33,863 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:42:33,863 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:42:33,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 10:42:33,864 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-09 10:42:33,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:42:33,865 INFO L85 PathProgramCache]: Analyzing trace with hash 483776, now seen corresponding path program 1 times [2024-11-09 10:42:33,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:42:33,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420583852] [2024-11-09 10:42:33,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:42:33,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:42:33,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:42:33,934 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:42:33,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:42:33,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420583852] [2024-11-09 10:42:33,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420583852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:42:33,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:42:33,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:42:33,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557789805] [2024-11-09 10:42:33,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:42:33,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:42:33,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:42:33,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:42:33,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:42:33,950 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 97 [2024-11-09 10:42:33,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 77 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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:42:33,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:42:33,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 97 [2024-11-09 10:42:33,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:42:35,268 INFO L124 PetriNetUnfolderBase]: 7226/14592 cut-off events. [2024-11-09 10:42:35,268 INFO L125 PetriNetUnfolderBase]: For 186/199 co-relation queries the response was YES. [2024-11-09 10:42:35,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26304 conditions, 14592 events. 7226/14592 cut-off events. For 186/199 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 118260 event pairs, 5570 based on Foata normal form. 1/13961 useless extension candidates. Maximal degree in co-relation 24406. Up to 11355 conditions per place. [2024-11-09 10:42:35,361 INFO L140 encePairwiseOnDemand]: 93/97 looper letters, 64 selfloop transitions, 2 changer transitions 0/93 dead transitions. [2024-11-09 10:42:35,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 93 transitions, 338 flow [2024-11-09 10:42:35,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:42:35,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:42:35,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2024-11-09 10:42:35,364 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5326460481099656 [2024-11-09 10:42:35,364 INFO L175 Difference]: Start difference. First operand has 83 places, 77 transitions, 174 flow. Second operand 3 states and 155 transitions. [2024-11-09 10:42:35,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 93 transitions, 338 flow [2024-11-09 10:42:35,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 93 transitions, 334 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:42:35,383 INFO L231 Difference]: Finished difference. Result has 83 places, 78 transitions, 184 flow [2024-11-09 10:42:35,383 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=83, PETRI_TRANSITIONS=78} [2024-11-09 10:42:35,384 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -1 predicate places. [2024-11-09 10:42:35,385 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 78 transitions, 184 flow [2024-11-09 10:42:35,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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:42:35,386 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:42:35,386 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2024-11-09 10:42:35,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 10:42:35,387 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-09 10:42:35,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:42:35,387 INFO L85 PathProgramCache]: Analyzing trace with hash 115548199, now seen corresponding path program 1 times [2024-11-09 10:42:35,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:42:35,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686350099] [2024-11-09 10:42:35,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:42:35,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:42:35,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:42:35,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:42:35,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:42:35,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686350099] [2024-11-09 10:42:35,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686350099] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:42:35,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255367646] [2024-11-09 10:42:35,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:42:35,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:42:35,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:42:35,545 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:42:35,547 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:42:35,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:42:35,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 10:42:35,639 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:42:35,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2024-11-09 10:42:35,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:42:35,700 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:42:35,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:42:35,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255367646] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:42:35,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:42:35,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2024-11-09 10:42:35,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418963960] [2024-11-09 10:42:35,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:42:35,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:42:35,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:42:35,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:42:35,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:42:35,795 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 97 [2024-11-09 10:42:35,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 78 transitions, 184 flow. Second operand has 7 states, 7 states have (on average 30.428571428571427) internal successors, (213), 7 states have internal predecessors, (213), 0 states have call successors, (0), 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:42:35,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:42:35,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 97 [2024-11-09 10:42:35,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:42:37,152 INFO L124 PetriNetUnfolderBase]: 7057/14013 cut-off events. [2024-11-09 10:42:37,152 INFO L125 PetriNetUnfolderBase]: For 596/596 co-relation queries the response was YES. [2024-11-09 10:42:37,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25617 conditions, 14013 events. 7057/14013 cut-off events. For 596/596 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 114900 event pairs, 137 based on Foata normal form. 255/13891 useless extension candidates. Maximal degree in co-relation 15217. Up to 8564 conditions per place. [2024-11-09 10:42:37,252 INFO L140 encePairwiseOnDemand]: 93/97 looper letters, 121 selfloop transitions, 4 changer transitions 0/151 dead transitions. [2024-11-09 10:42:37,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 151 transitions, 578 flow [2024-11-09 10:42:37,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:42:37,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:42:37,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 268 transitions. [2024-11-09 10:42:37,255 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5525773195876289 [2024-11-09 10:42:37,255 INFO L175 Difference]: Start difference. First operand has 83 places, 78 transitions, 184 flow. Second operand 5 states and 268 transitions. [2024-11-09 10:42:37,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 151 transitions, 578 flow [2024-11-09 10:42:37,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 151 transitions, 576 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:42:37,259 INFO L231 Difference]: Finished difference. Result has 85 places, 77 transitions, 186 flow [2024-11-09 10:42:37,260 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=186, PETRI_PLACES=85, PETRI_TRANSITIONS=77} [2024-11-09 10:42:37,261 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, 1 predicate places. [2024-11-09 10:42:37,262 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 77 transitions, 186 flow [2024-11-09 10:42:37,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 30.428571428571427) internal successors, (213), 7 states have internal predecessors, (213), 0 states have call successors, (0), 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:42:37,262 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:42:37,263 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1] [2024-11-09 10:42:37,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 10:42:37,466 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,SelfDestructingSolverStorable6 [2024-11-09 10:42:37,467 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-09 10:42:37,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:42:37,468 INFO L85 PathProgramCache]: Analyzing trace with hash -937613290, now seen corresponding path program 1 times [2024-11-09 10:42:37,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:42:37,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591028613] [2024-11-09 10:42:37,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:42:37,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:42:37,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:42:37,494 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:42:37,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:42:37,509 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 10:42:37,509 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:42:37,510 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-09 10:42:37,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 7 remaining) [2024-11-09 10:42:37,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 7 remaining) [2024-11-09 10:42:37,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 7 remaining) [2024-11-09 10:42:37,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 7 remaining) [2024-11-09 10:42:37,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2024-11-09 10:42:37,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-09 10:42:37,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 10:42:37,511 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-09 10:42:37,512 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 10:42:37,512 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-09 10:42:37,539 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-09 10:42:37,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 126 transitions, 279 flow [2024-11-09 10:42:37,587 INFO L124 PetriNetUnfolderBase]: 42/276 cut-off events. [2024-11-09 10:42:37,588 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-09 10:42:37,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 301 conditions, 276 events. 42/276 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1272 event pairs, 1 based on Foata normal form. 0/194 useless extension candidates. Maximal degree in co-relation 190. Up to 12 conditions per place. [2024-11-09 10:42:37,590 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 126 transitions, 279 flow [2024-11-09 10:42:37,592 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 126 transitions, 279 flow [2024-11-09 10:42:37,594 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:42:37,594 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;@17489217, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:42:37,594 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-09 10:42:37,596 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:42:37,596 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-09 10:42:37,596 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:42:37,596 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:42:37,596 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:42:37,597 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-09 10:42:37,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:42:37,597 INFO L85 PathProgramCache]: Analyzing trace with hash 608893, now seen corresponding path program 1 times [2024-11-09 10:42:37,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:42:37,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192461377] [2024-11-09 10:42:37,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:42:37,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:42:37,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:42:37,726 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:42:37,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:42:37,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192461377] [2024-11-09 10:42:37,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192461377] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:42:37,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:42:37,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:42:37,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059149575] [2024-11-09 10:42:37,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:42:37,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:42:37,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:42:37,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:42:37,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:42:37,741 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 126 [2024-11-09 10:42:37,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 126 transitions, 279 flow. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 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:42:37,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:42:37,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 126 [2024-11-09 10:42:37,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:43:01,202 INFO L124 PetriNetUnfolderBase]: 189484/306047 cut-off events. [2024-11-09 10:43:01,203 INFO L125 PetriNetUnfolderBase]: For 2419/2419 co-relation queries the response was YES. [2024-11-09 10:43:01,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 568595 conditions, 306047 events. 189484/306047 cut-off events. For 2419/2419 co-relation queries the response was YES. Maximal size of possible extension queue 5242. Compared 2894704 event pairs, 167707 based on Foata normal form. 63279/360062 useless extension candidates. Maximal degree in co-relation 228786. Up to 231132 conditions per place. [2024-11-09 10:43:03,066 INFO L140 encePairwiseOnDemand]: 100/126 looper letters, 107 selfloop transitions, 2 changer transitions 1/143 dead transitions. [2024-11-09 10:43:03,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 143 transitions, 533 flow [2024-11-09 10:43:03,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:43:03,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:43:03,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 251 transitions. [2024-11-09 10:43:03,068 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6640211640211641 [2024-11-09 10:43:03,068 INFO L175 Difference]: Start difference. First operand has 108 places, 126 transitions, 279 flow. Second operand 3 states and 251 transitions. [2024-11-09 10:43:03,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 143 transitions, 533 flow [2024-11-09 10:43:03,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 143 transitions, 533 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 10:43:03,073 INFO L231 Difference]: Finished difference. Result has 107 places, 100 transitions, 231 flow [2024-11-09 10:43:03,073 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=231, PETRI_PLACES=107, PETRI_TRANSITIONS=100} [2024-11-09 10:43:03,074 INFO L277 CegarLoopForPetriNet]: 108 programPoint places, -1 predicate places. [2024-11-09 10:43:03,074 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 100 transitions, 231 flow [2024-11-09 10:43:03,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 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:43:03,074 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:43:03,074 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:43:03,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 10:43:03,075 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-09 10:43:03,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:43:03,075 INFO L85 PathProgramCache]: Analyzing trace with hash 608894, now seen corresponding path program 1 times [2024-11-09 10:43:03,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:43:03,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493828076] [2024-11-09 10:43:03,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:43:03,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:43:03,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:43:03,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:43:03,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:43:03,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493828076] [2024-11-09 10:43:03,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493828076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:43:03,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:43:03,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:43:03,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418776520] [2024-11-09 10:43:03,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:43:03,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:43:03,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:43:03,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:43:03,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:43:03,152 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 126 [2024-11-09 10:43:03,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 100 transitions, 231 flow. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 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:43:03,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:43:03,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 126 [2024-11-09 10:43:03,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand