./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_08-cond_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_08-cond_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 b4439281d7e12bca3fd2bd39ebda4196e341f38fedf1c370a96bdabb4944cfe7 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:41:37,463 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:41:37,525 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:41:37,529 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:41:37,531 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:41:37,559 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:41:37,560 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:41:37,560 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:41:37,561 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:41:37,562 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:41:37,562 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:41:37,562 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:41:37,563 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:41:37,564 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:41:37,564 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:41:37,565 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:41:37,565 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:41:37,565 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:41:37,565 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:41:37,566 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:41:37,566 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:41:37,566 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:41:37,569 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:41:37,570 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:41:37,570 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:41:37,570 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:41:37,570 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:41:37,570 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:41:37,570 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:41:37,571 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:41:37,571 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:41:37,571 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:41:37,571 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:41:37,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:41:37,572 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:41:37,572 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:41:37,572 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:41:37,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:41:37,572 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:41:37,572 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:41:37,572 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:41:37,573 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:41:37,573 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 -> b4439281d7e12bca3fd2bd39ebda4196e341f38fedf1c370a96bdabb4944cfe7 [2024-11-09 10:41:37,785 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:41:37,805 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:41:37,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:41:37,809 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:41:37,809 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:41:37,810 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_08-cond_racefree.i [2024-11-09 10:41:39,213 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:41:39,440 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:41:39,441 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_08-cond_racefree.i [2024-11-09 10:41:39,456 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2f8e59b4/677228f661be488d957816b209e0f362/FLAGe999f9f04 [2024-11-09 10:41:39,478 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2f8e59b4/677228f661be488d957816b209e0f362 [2024-11-09 10:41:39,481 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:41:39,482 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:41:39,483 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:41:39,484 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:41:39,490 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:41:39,491 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:41:39" (1/1) ... [2024-11-09 10:41:39,492 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28280554 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:41:39, skipping insertion in model container [2024-11-09 10:41:39,492 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:41:39" (1/1) ... [2024-11-09 10:41:39,545 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:41:39,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:41:40,013 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:41:40,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:41:40,194 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:41:40,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:41:40 WrapperNode [2024-11-09 10:41:40,195 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:41:40,196 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:41:40,196 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:41:40,203 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:41:40,214 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:41:40" (1/1) ... [2024-11-09 10:41:40,251 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:41:40" (1/1) ... [2024-11-09 10:41:40,281 INFO L138 Inliner]: procedures = 271, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 144 [2024-11-09 10:41:40,283 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:41:40,284 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:41:40,284 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:41:40,284 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:41:40,294 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:41:40" (1/1) ... [2024-11-09 10:41:40,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:41:40" (1/1) ... [2024-11-09 10:41:40,300 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:41:40" (1/1) ... [2024-11-09 10:41:40,322 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 5, 5, 2]. 36 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5, 0]. The 1 writes are split as follows [0, 0, 0, 1]. [2024-11-09 10:41:40,322 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:41:40" (1/1) ... [2024-11-09 10:41:40,322 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:41:40" (1/1) ... [2024-11-09 10:41:40,332 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:41:40" (1/1) ... [2024-11-09 10:41:40,337 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:41:40" (1/1) ... [2024-11-09 10:41:40,339 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:41:40" (1/1) ... [2024-11-09 10:41:40,344 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:41:40" (1/1) ... [2024-11-09 10:41:40,347 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:41:40,350 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:41:40,350 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:41:40,351 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:41:40,351 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:41:40" (1/1) ... [2024-11-09 10:41:40,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:41:40,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:41:40,385 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:41:40,392 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:41:40,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 10:41:40,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 10:41:40,434 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-09 10:41:40,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 10:41:40,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 10:41:40,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 10:41:40,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 10:41:40,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 10:41:40,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 10:41:40,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 10:41:40,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 10:41:40,435 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-09 10:41:40,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:41:40,435 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-09 10:41:40,435 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-09 10:41:40,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 10:41:40,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 10:41:40,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 10:41:40,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 10:41:40,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:41:40,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:41:40,438 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:41:40,559 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:41:40,561 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:41:40,814 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:41:40,815 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:41:41,159 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:41:41,160 INFO L316 CfgBuilder]: Removed 10 assume(true) statements. [2024-11-09 10:41:41,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:41:41 BoogieIcfgContainer [2024-11-09 10:41:41,160 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:41:41,162 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:41:41,162 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:41:41,169 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:41:41,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:41:39" (1/3) ... [2024-11-09 10:41:41,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75d0d112 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:41:41, skipping insertion in model container [2024-11-09 10:41:41,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:41:40" (2/3) ... [2024-11-09 10:41:41,173 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75d0d112 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:41:41, skipping insertion in model container [2024-11-09 10:41:41,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:41:41" (3/3) ... [2024-11-09 10:41:41,174 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_08-cond_racefree.i [2024-11-09 10:41:41,205 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:41:41,205 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-09 10:41:41,205 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:41:41,252 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-09 10:41:41,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 67 transitions, 141 flow [2024-11-09 10:41:41,367 INFO L124 PetriNetUnfolderBase]: 21/105 cut-off events. [2024-11-09 10:41:41,368 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 10:41:41,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 105 events. 21/105 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 379 event pairs, 0 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 62. Up to 6 conditions per place. [2024-11-09 10:41:41,371 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 67 transitions, 141 flow [2024-11-09 10:41:41,374 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 67 transitions, 141 flow [2024-11-09 10:41:41,380 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:41:41,385 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;@4b7477fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:41:41,385 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-09 10:41:41,389 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:41:41,389 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-09 10:41:41,389 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:41:41,389 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:41:41,390 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:41:41,390 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:41:41,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:41:41,394 INFO L85 PathProgramCache]: Analyzing trace with hash 469186, now seen corresponding path program 1 times [2024-11-09 10:41:41,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:41:41,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978331926] [2024-11-09 10:41:41,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:41,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:41:41,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:41:41,750 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:41:41,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:41:41,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978331926] [2024-11-09 10:41:41,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978331926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:41:41,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:41:41,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:41:41,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472507294] [2024-11-09 10:41:41,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:41:41,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:41:41,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:41:41,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:41:41,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:41:41,815 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 67 [2024-11-09 10:41:41,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 67 transitions, 141 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:41:41,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:41:41,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 67 [2024-11-09 10:41:41,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:41:41,962 INFO L124 PetriNetUnfolderBase]: 179/511 cut-off events. [2024-11-09 10:41:41,963 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 10:41:41,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 871 conditions, 511 events. 179/511 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2727 event pairs, 120 based on Foata normal form. 97/577 useless extension candidates. Maximal degree in co-relation 808. Up to 307 conditions per place. [2024-11-09 10:41:41,967 INFO L140 encePairwiseOnDemand]: 53/67 looper letters, 35 selfloop transitions, 2 changer transitions 1/63 dead transitions. [2024-11-09 10:41:41,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 63 transitions, 209 flow [2024-11-09 10:41:41,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:41:41,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:41:41,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2024-11-09 10:41:41,980 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6517412935323383 [2024-11-09 10:41:41,981 INFO L175 Difference]: Start difference. First operand has 56 places, 67 transitions, 141 flow. Second operand 3 states and 131 transitions. [2024-11-09 10:41:41,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 63 transitions, 209 flow [2024-11-09 10:41:41,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 63 transitions, 209 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 10:41:41,990 INFO L231 Difference]: Finished difference. Result has 55 places, 53 transitions, 117 flow [2024-11-09 10:41:41,993 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=53, 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=117, PETRI_PLACES=55, PETRI_TRANSITIONS=53} [2024-11-09 10:41:41,997 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, -1 predicate places. [2024-11-09 10:41:41,998 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 53 transitions, 117 flow [2024-11-09 10:41:41,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:41:41,998 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:41:41,998 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:41:42,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 10:41:42,001 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:41:42,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:41:42,002 INFO L85 PathProgramCache]: Analyzing trace with hash 469187, now seen corresponding path program 1 times [2024-11-09 10:41:42,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:41:42,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358157251] [2024-11-09 10:41:42,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:42,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:41:42,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:41:42,216 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:41:42,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:41:42,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358157251] [2024-11-09 10:41:42,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358157251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:41:42,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:41:42,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:41:42,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505879519] [2024-11-09 10:41:42,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:41:42,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:41:42,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:41:42,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:41:42,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:41:42,237 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 67 [2024-11-09 10:41:42,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 53 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:41:42,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:41:42,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 67 [2024-11-09 10:41:42,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:41:42,363 INFO L124 PetriNetUnfolderBase]: 141/445 cut-off events. [2024-11-09 10:41:42,363 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2024-11-09 10:41:42,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 747 conditions, 445 events. 141/445 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2417 event pairs, 61 based on Foata normal form. 1/405 useless extension candidates. Maximal degree in co-relation 712. Up to 267 conditions per place. [2024-11-09 10:41:42,369 INFO L140 encePairwiseOnDemand]: 63/67 looper letters, 35 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2024-11-09 10:41:42,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 63 transitions, 211 flow [2024-11-09 10:41:42,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:41:42,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:41:42,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2024-11-09 10:41:42,372 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6119402985074627 [2024-11-09 10:41:42,373 INFO L175 Difference]: Start difference. First operand has 55 places, 53 transitions, 117 flow. Second operand 3 states and 123 transitions. [2024-11-09 10:41:42,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 63 transitions, 211 flow [2024-11-09 10:41:42,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 63 transitions, 207 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:41:42,376 INFO L231 Difference]: Finished difference. Result has 55 places, 53 transitions, 123 flow [2024-11-09 10:41:42,377 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=123, PETRI_PLACES=55, PETRI_TRANSITIONS=53} [2024-11-09 10:41:42,377 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, -1 predicate places. [2024-11-09 10:41:42,378 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 53 transitions, 123 flow [2024-11-09 10:41:42,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:41:42,378 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:41:42,379 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2024-11-09 10:41:42,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 10:41:42,379 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:41:42,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:41:42,380 INFO L85 PathProgramCache]: Analyzing trace with hash -473885808, now seen corresponding path program 1 times [2024-11-09 10:41:42,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:41:42,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776971746] [2024-11-09 10:41:42,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:42,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:41:42,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:41:42,637 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:41:42,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:41:42,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776971746] [2024-11-09 10:41:42,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776971746] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:41:42,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016346055] [2024-11-09 10:41:42,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:42,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:41:42,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:41:42,646 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:41:42,647 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:41:42,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:41:42,744 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 10:41:42,748 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:41:42,785 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:41:42,828 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:41:42,829 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:41:42,870 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:41:42,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016346055] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:41:42,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:41:42,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2024-11-09 10:41:42,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983862092] [2024-11-09 10:41:42,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:41:42,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:41:42,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:41:42,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:41:42,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:41:42,900 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 67 [2024-11-09 10:41:42,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 53 transitions, 123 flow. Second operand has 7 states, 7 states have (on average 29.428571428571427) internal successors, (206), 7 states have internal predecessors, (206), 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:41:42,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:41:42,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 67 [2024-11-09 10:41:42,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:41:42,949 INFO L124 PetriNetUnfolderBase]: 27/100 cut-off events. [2024-11-09 10:41:42,949 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2024-11-09 10:41:42,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 100 events. 27/100 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 225 event pairs, 18 based on Foata normal form. 20/119 useless extension candidates. Maximal degree in co-relation 179. Up to 57 conditions per place. [2024-11-09 10:41:42,950 INFO L140 encePairwiseOnDemand]: 63/67 looper letters, 23 selfloop transitions, 2 changer transitions 0/34 dead transitions. [2024-11-09 10:41:42,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 34 transitions, 128 flow [2024-11-09 10:41:42,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:41:42,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:41:42,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2024-11-09 10:41:42,951 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.503731343283582 [2024-11-09 10:41:42,951 INFO L175 Difference]: Start difference. First operand has 55 places, 53 transitions, 123 flow. Second operand 4 states and 135 transitions. [2024-11-09 10:41:42,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 34 transitions, 128 flow [2024-11-09 10:41:42,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 34 transitions, 122 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:41:42,952 INFO L231 Difference]: Finished difference. Result has 29 places, 23 transitions, 54 flow [2024-11-09 10:41:42,952 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=54, PETRI_PLACES=29, PETRI_TRANSITIONS=23} [2024-11-09 10:41:42,953 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, -27 predicate places. [2024-11-09 10:41:42,953 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 23 transitions, 54 flow [2024-11-09 10:41:42,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.428571428571427) internal successors, (206), 7 states have internal predecessors, (206), 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:41:42,953 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:41:42,953 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1] [2024-11-09 10:41:42,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 10:41:43,157 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:41:43,158 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:41:43,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:41:43,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1805557715, now seen corresponding path program 1 times [2024-11-09 10:41:43,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:41:43,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847968498] [2024-11-09 10:41:43,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:43,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:41:43,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:41:43,185 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:41:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:41:43,211 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 10:41:43,211 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:41:43,212 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-09 10:41:43,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 7 remaining) [2024-11-09 10:41:43,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 7 remaining) [2024-11-09 10:41:43,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (3 of 7 remaining) [2024-11-09 10:41:43,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 7 remaining) [2024-11-09 10:41:43,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 7 remaining) [2024-11-09 10:41:43,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-09 10:41:43,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 10:41:43,215 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-09 10:41:43,216 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 10:41:43,217 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-09 10:41:43,232 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-09 10:41:43,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 92 transitions, 200 flow [2024-11-09 10:41:43,244 INFO L124 PetriNetUnfolderBase]: 36/180 cut-off events. [2024-11-09 10:41:43,244 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-09 10:41:43,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 180 events. 36/180 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 748 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 109. Up to 9 conditions per place. [2024-11-09 10:41:43,245 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 92 transitions, 200 flow [2024-11-09 10:41:43,247 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 92 transitions, 200 flow [2024-11-09 10:41:43,247 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:41:43,248 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;@4b7477fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:41:43,248 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-09 10:41:43,250 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:41:43,250 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-09 10:41:43,250 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:41:43,250 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:41:43,250 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:41:43,251 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:41:43,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:41:43,251 INFO L85 PathProgramCache]: Analyzing trace with hash 560542, now seen corresponding path program 1 times [2024-11-09 10:41:43,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:41:43,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263668555] [2024-11-09 10:41:43,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:43,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:41:43,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:41:43,289 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:41:43,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:41:43,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263668555] [2024-11-09 10:41:43,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263668555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:41:43,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:41:43,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:41:43,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492731194] [2024-11-09 10:41:43,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:41:43,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:41:43,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:41:43,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:41:43,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:41:43,300 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 92 [2024-11-09 10:41:43,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 92 transitions, 200 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:41:43,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:41:43,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 92 [2024-11-09 10:41:43,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:41:43,883 INFO L124 PetriNetUnfolderBase]: 3559/6891 cut-off events. [2024-11-09 10:41:43,884 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2024-11-09 10:41:43,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12422 conditions, 6891 events. 3559/6891 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 52391 event pairs, 2735 based on Foata normal form. 1720/8315 useless extension candidates. Maximal degree in co-relation 9137. Up to 4731 conditions per place. [2024-11-09 10:41:44,004 INFO L140 encePairwiseOnDemand]: 72/92 looper letters, 55 selfloop transitions, 2 changer transitions 1/91 dead transitions. [2024-11-09 10:41:44,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 91 transitions, 314 flow [2024-11-09 10:41:44,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:41:44,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:41:44,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 187 transitions. [2024-11-09 10:41:44,006 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.677536231884058 [2024-11-09 10:41:44,007 INFO L175 Difference]: Start difference. First operand has 76 places, 92 transitions, 200 flow. Second operand 3 states and 187 transitions. [2024-11-09 10:41:44,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 91 transitions, 314 flow [2024-11-09 10:41:44,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 91 transitions, 314 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 10:41:44,009 INFO L231 Difference]: Finished difference. Result has 75 places, 72 transitions, 164 flow [2024-11-09 10:41:44,010 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=75, PETRI_TRANSITIONS=72} [2024-11-09 10:41:44,010 INFO L277 CegarLoopForPetriNet]: 76 programPoint places, -1 predicate places. [2024-11-09 10:41:44,010 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 72 transitions, 164 flow [2024-11-09 10:41:44,011 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:41:44,011 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:41:44,011 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:41:44,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 10:41:44,011 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:41:44,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:41:44,012 INFO L85 PathProgramCache]: Analyzing trace with hash 560543, now seen corresponding path program 1 times [2024-11-09 10:41:44,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:41:44,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438535837] [2024-11-09 10:41:44,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:44,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:41:44,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:41:44,076 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:41:44,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:41:44,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438535837] [2024-11-09 10:41:44,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438535837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:41:44,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:41:44,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:41:44,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702979828] [2024-11-09 10:41:44,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:41:44,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:41:44,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:41:44,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:41:44,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:41:44,087 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 92 [2024-11-09 10:41:44,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 72 transitions, 164 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:41:44,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:41:44,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 92 [2024-11-09 10:41:44,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:41:44,535 INFO L124 PetriNetUnfolderBase]: 2998/6181 cut-off events. [2024-11-09 10:41:44,535 INFO L125 PetriNetUnfolderBase]: For 318/318 co-relation queries the response was YES. [2024-11-09 10:41:44,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11022 conditions, 6181 events. 2998/6181 cut-off events. For 318/318 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 49078 event pairs, 1227 based on Foata normal form. 1/5817 useless extension candidates. Maximal degree in co-relation 9944. Up to 4562 conditions per place. [2024-11-09 10:41:44,569 INFO L140 encePairwiseOnDemand]: 88/92 looper letters, 47 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2024-11-09 10:41:44,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 83 transitions, 284 flow [2024-11-09 10:41:44,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:41:44,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:41:44,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2024-11-09 10:41:44,573 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5760869565217391 [2024-11-09 10:41:44,573 INFO L175 Difference]: Start difference. First operand has 75 places, 72 transitions, 164 flow. Second operand 3 states and 159 transitions. [2024-11-09 10:41:44,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 83 transitions, 284 flow [2024-11-09 10:41:44,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 83 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:41:44,579 INFO L231 Difference]: Finished difference. Result has 75 places, 73 transitions, 174 flow [2024-11-09 10:41:44,579 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=75, PETRI_TRANSITIONS=73} [2024-11-09 10:41:44,581 INFO L277 CegarLoopForPetriNet]: 76 programPoint places, -1 predicate places. [2024-11-09 10:41:44,581 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 73 transitions, 174 flow [2024-11-09 10:41:44,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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:41:44,582 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:41:44,582 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2024-11-09 10:41:44,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 10:41:44,582 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:41:44,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:41:44,583 INFO L85 PathProgramCache]: Analyzing trace with hash -2000529931, now seen corresponding path program 1 times [2024-11-09 10:41:44,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:41:44,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722837620] [2024-11-09 10:41:44,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:44,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:41:44,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:41:44,696 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:41:44,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:41:44,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722837620] [2024-11-09 10:41:44,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722837620] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:41:44,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153083191] [2024-11-09 10:41:44,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:44,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:41:44,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:41:44,699 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:41:44,701 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:41:44,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:41:44,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 10:41:44,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:41:44,830 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:41:44,876 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:41:44,876 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:41:44,918 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:41:44,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153083191] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:41:44,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:41:44,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2024-11-09 10:41:44,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120709276] [2024-11-09 10:41:44,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:41:44,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:41:44,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:41:44,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:41:44,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:41:44,965 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 92 [2024-11-09 10:41:44,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 73 transitions, 174 flow. Second operand has 7 states, 7 states have (on average 37.42857142857143) internal successors, (262), 7 states have internal predecessors, (262), 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:41:44,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:41:44,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 92 [2024-11-09 10:41:44,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:41:45,480 INFO L124 PetriNetUnfolderBase]: 2632/5890 cut-off events. [2024-11-09 10:41:45,481 INFO L125 PetriNetUnfolderBase]: For 355/355 co-relation queries the response was YES. [2024-11-09 10:41:45,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10109 conditions, 5890 events. 2632/5890 cut-off events. For 355/355 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 48998 event pairs, 161 based on Foata normal form. 120/5565 useless extension candidates. Maximal degree in co-relation 1015. Up to 2839 conditions per place. [2024-11-09 10:41:45,507 INFO L140 encePairwiseOnDemand]: 88/92 looper letters, 84 selfloop transitions, 4 changer transitions 0/121 dead transitions. [2024-11-09 10:41:45,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 121 transitions, 444 flow [2024-11-09 10:41:45,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:41:45,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:41:45,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 266 transitions. [2024-11-09 10:41:45,509 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5782608695652174 [2024-11-09 10:41:45,509 INFO L175 Difference]: Start difference. First operand has 75 places, 73 transitions, 174 flow. Second operand 5 states and 266 transitions. [2024-11-09 10:41:45,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 121 transitions, 444 flow [2024-11-09 10:41:45,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 121 transitions, 442 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:41:45,511 INFO L231 Difference]: Finished difference. Result has 77 places, 72 transitions, 176 flow [2024-11-09 10:41:45,511 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=176, PETRI_PLACES=77, PETRI_TRANSITIONS=72} [2024-11-09 10:41:45,512 INFO L277 CegarLoopForPetriNet]: 76 programPoint places, 1 predicate places. [2024-11-09 10:41:45,512 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 72 transitions, 176 flow [2024-11-09 10:41:45,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 37.42857142857143) internal successors, (262), 7 states have internal predecessors, (262), 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:41:45,512 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:41:45,512 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1] [2024-11-09 10:41:45,527 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:41:45,713 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:41:45,714 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:41:45,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:41:45,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1853521862, now seen corresponding path program 1 times [2024-11-09 10:41:45,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:41:45,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324425530] [2024-11-09 10:41:45,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:45,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:41:45,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:41:45,737 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:41:45,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:41:45,750 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 10:41:45,751 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:41:45,751 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-09 10:41:45,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 7 remaining) [2024-11-09 10:41:45,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 7 remaining) [2024-11-09 10:41:45,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (3 of 7 remaining) [2024-11-09 10:41:45,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 7 remaining) [2024-11-09 10:41:45,752 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 7 remaining) [2024-11-09 10:41:45,752 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-09 10:41:45,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 10:41:45,752 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-09 10:41:45,752 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 10:41:45,752 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-09 10:41:45,768 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-09 10:41:45,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 117 transitions, 261 flow [2024-11-09 10:41:45,782 INFO L124 PetriNetUnfolderBase]: 54/276 cut-off events. [2024-11-09 10:41:45,783 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-09 10:41:45,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 301 conditions, 276 events. 54/276 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1225 event pairs, 1 based on Foata normal form. 0/182 useless extension candidates. Maximal degree in co-relation 191. Up to 12 conditions per place. [2024-11-09 10:41:45,784 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 117 transitions, 261 flow [2024-11-09 10:41:45,786 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 117 transitions, 261 flow [2024-11-09 10:41:45,786 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:41:45,787 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;@4b7477fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:41:45,787 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-09 10:41:45,788 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:41:45,788 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-09 10:41:45,789 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:41:45,789 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:41:45,789 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:41:45,789 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:41:45,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:41:45,789 INFO L85 PathProgramCache]: Analyzing trace with hash 676723, now seen corresponding path program 1 times [2024-11-09 10:41:45,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:41:45,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804999431] [2024-11-09 10:41:45,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:45,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:41:45,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:41:45,830 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:41:45,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:41:45,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804999431] [2024-11-09 10:41:45,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804999431] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:41:45,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:41:45,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:41:45,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038845589] [2024-11-09 10:41:45,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:41:45,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:41:45,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:41:45,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:41:45,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:41:45,839 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 117 [2024-11-09 10:41:45,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 117 transitions, 261 flow. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:41:45,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:41:45,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 117 [2024-11-09 10:41:45,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:41:52,625 INFO L124 PetriNetUnfolderBase]: 53626/87325 cut-off events. [2024-11-09 10:41:52,625 INFO L125 PetriNetUnfolderBase]: For 1236/1236 co-relation queries the response was YES. [2024-11-09 10:41:52,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161738 conditions, 87325 events. 53626/87325 cut-off events. For 1236/1236 co-relation queries the response was YES. Maximal size of possible extension queue 2347. Compared 781289 event pairs, 43458 based on Foata normal form. 25258/109403 useless extension candidates. Maximal degree in co-relation 58750. Up to 63282 conditions per place. [2024-11-09 10:41:53,176 INFO L140 encePairwiseOnDemand]: 91/117 looper letters, 75 selfloop transitions, 2 changer transitions 1/119 dead transitions. [2024-11-09 10:41:53,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 119 transitions, 421 flow [2024-11-09 10:41:53,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:41:53,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:41:53,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 243 transitions. [2024-11-09 10:41:53,178 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6923076923076923 [2024-11-09 10:41:53,179 INFO L175 Difference]: Start difference. First operand has 96 places, 117 transitions, 261 flow. Second operand 3 states and 243 transitions. [2024-11-09 10:41:53,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 119 transitions, 421 flow [2024-11-09 10:41:53,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 119 transitions, 421 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 10:41:53,183 INFO L231 Difference]: Finished difference. Result has 95 places, 91 transitions, 213 flow [2024-11-09 10:41:53,183 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=213, PETRI_PLACES=95, PETRI_TRANSITIONS=91} [2024-11-09 10:41:53,184 INFO L277 CegarLoopForPetriNet]: 96 programPoint places, -1 predicate places. [2024-11-09 10:41:53,184 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 91 transitions, 213 flow [2024-11-09 10:41:53,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:41:53,187 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:41:53,187 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:41:53,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 10:41:53,187 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:41:53,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:41:53,188 INFO L85 PathProgramCache]: Analyzing trace with hash 676724, now seen corresponding path program 1 times [2024-11-09 10:41:53,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:41:53,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887804062] [2024-11-09 10:41:53,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:53,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:41:53,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:41:53,255 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:41:53,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:41:53,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887804062] [2024-11-09 10:41:53,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887804062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:41:53,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:41:53,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:41:53,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702514224] [2024-11-09 10:41:53,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:41:53,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:41:53,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:41:53,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:41:53,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:41:53,264 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 117 [2024-11-09 10:41:53,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 91 transitions, 213 flow. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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:41:53,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:41:53,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 117 [2024-11-09 10:41:53,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:41:58,602 INFO L124 PetriNetUnfolderBase]: 46695/77911 cut-off events. [2024-11-09 10:41:58,603 INFO L125 PetriNetUnfolderBase]: For 4252/4252 co-relation queries the response was YES. [2024-11-09 10:41:58,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145198 conditions, 77911 events. 46695/77911 cut-off events. For 4252/4252 co-relation queries the response was YES. Maximal size of possible extension queue 2097. Compared 708376 event pairs, 27954 based on Foata normal form. 1/74614 useless extension candidates. Maximal degree in co-relation 130511. Up to 63779 conditions per place. [2024-11-09 10:41:59,091 INFO L140 encePairwiseOnDemand]: 113/117 looper letters, 58 selfloop transitions, 2 changer transitions 0/102 dead transitions. [2024-11-09 10:41:59,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 102 transitions, 355 flow [2024-11-09 10:41:59,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:41:59,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:41:59,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2024-11-09 10:41:59,093 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5527065527065527 [2024-11-09 10:41:59,094 INFO L175 Difference]: Start difference. First operand has 95 places, 91 transitions, 213 flow. Second operand 3 states and 194 transitions. [2024-11-09 10:41:59,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 102 transitions, 355 flow [2024-11-09 10:41:59,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 102 transitions, 351 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:41:59,287 INFO L231 Difference]: Finished difference. Result has 95 places, 92 transitions, 223 flow [2024-11-09 10:41:59,287 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=223, PETRI_PLACES=95, PETRI_TRANSITIONS=92} [2024-11-09 10:41:59,288 INFO L277 CegarLoopForPetriNet]: 96 programPoint places, -1 predicate places. [2024-11-09 10:41:59,288 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 92 transitions, 223 flow [2024-11-09 10:41:59,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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:41:59,288 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:41:59,288 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2024-11-09 10:41:59,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 10:41:59,289 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:41:59,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:41:59,289 INFO L85 PathProgramCache]: Analyzing trace with hash -2074832109, now seen corresponding path program 1 times [2024-11-09 10:41:59,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:41:59,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698773179] [2024-11-09 10:41:59,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:59,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:41:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:41:59,381 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:41:59,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:41:59,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698773179] [2024-11-09 10:41:59,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698773179] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:41:59,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133085287] [2024-11-09 10:41:59,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:59,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:41:59,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:41:59,384 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:41:59,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 10:41:59,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:41:59,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 10:41:59,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:41:59,509 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:41:59,548 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:41:59,548 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:41:59,596 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:41:59,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133085287] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:41:59,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:41:59,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 7 [2024-11-09 10:41:59,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415950910] [2024-11-09 10:41:59,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:41:59,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 10:41:59,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:41:59,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 10:41:59,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 10:41:59,653 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 117 [2024-11-09 10:41:59,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 92 transitions, 223 flow. Second operand has 9 states, 9 states have (on average 45.333333333333336) internal successors, (408), 9 states have internal predecessors, (408), 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:41:59,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:41:59,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 117 [2024-11-09 10:41:59,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:42:00,763 INFO L124 PetriNetUnfolderBase]: 10557/16958 cut-off events. [2024-11-09 10:42:00,764 INFO L125 PetriNetUnfolderBase]: For 4739/4739 co-relation queries the response was YES. [2024-11-09 10:42:00,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33518 conditions, 16958 events. 10557/16958 cut-off events. For 4739/4739 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 126434 event pairs, 960 based on Foata normal form. 2220/18584 useless extension candidates. Maximal degree in co-relation 3435. Up to 11100 conditions per place. [2024-11-09 10:42:00,871 INFO L140 encePairwiseOnDemand]: 113/117 looper letters, 92 selfloop transitions, 4 changer transitions 0/121 dead transitions. [2024-11-09 10:42:00,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 121 transitions, 462 flow [2024-11-09 10:42:00,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:42:00,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:42:00,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 360 transitions. [2024-11-09 10:42:00,874 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5128205128205128 [2024-11-09 10:42:00,874 INFO L175 Difference]: Start difference. First operand has 95 places, 92 transitions, 223 flow. Second operand 6 states and 360 transitions. [2024-11-09 10:42:00,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 121 transitions, 462 flow [2024-11-09 10:42:00,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 121 transitions, 458 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-09 10:42:00,879 INFO L231 Difference]: Finished difference. Result has 73 places, 61 transitions, 154 flow [2024-11-09 10:42:00,879 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=154, PETRI_PLACES=73, PETRI_TRANSITIONS=61} [2024-11-09 10:42:00,879 INFO L277 CegarLoopForPetriNet]: 96 programPoint places, -23 predicate places. [2024-11-09 10:42:00,880 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 61 transitions, 154 flow [2024-11-09 10:42:00,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 45.333333333333336) internal successors, (408), 9 states have internal predecessors, (408), 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:00,880 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:42:00,880 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1] [2024-11-09 10:42:00,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 10:42:01,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:42:01,081 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:42:01,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:42:01,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1084227342, now seen corresponding path program 1 times [2024-11-09 10:42:01,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:42:01,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450780641] [2024-11-09 10:42:01,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:42:01,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:42:01,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:42:01,111 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:42:01,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:42:01,135 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 10:42:01,136 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:42:01,137 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-09 10:42:01,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 7 remaining) [2024-11-09 10:42:01,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 7 remaining) [2024-11-09 10:42:01,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (3 of 7 remaining) [2024-11-09 10:42:01,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 7 remaining) [2024-11-09 10:42:01,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 7 remaining) [2024-11-09 10:42:01,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-09 10:42:01,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 10:42:01,139 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-09 10:42:01,140 WARN L244 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 10:42:01,140 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-11-09 10:42:01,164 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-09 10:42:01,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 142 transitions, 324 flow [2024-11-09 10:42:01,189 INFO L124 PetriNetUnfolderBase]: 80/416 cut-off events. [2024-11-09 10:42:01,190 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-09 10:42:01,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 467 conditions, 416 events. 80/416 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2025 event pairs, 6 based on Foata normal form. 0/273 useless extension candidates. Maximal degree in co-relation 300. Up to 32 conditions per place. [2024-11-09 10:42:01,193 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 142 transitions, 324 flow [2024-11-09 10:42:01,195 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 116 places, 142 transitions, 324 flow [2024-11-09 10:42:01,197 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:42:01,198 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;@4b7477fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:42:01,198 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-09 10:42:01,200 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:42:01,200 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-09 10:42:01,200 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:42:01,200 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:42:01,200 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:42:01,200 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:42:01,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:42:01,200 INFO L85 PathProgramCache]: Analyzing trace with hash 817729, now seen corresponding path program 1 times [2024-11-09 10:42:01,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:42:01,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597822938] [2024-11-09 10:42:01,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:42:01,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:42:01,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:42:01,240 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:01,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:42:01,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597822938] [2024-11-09 10:42:01,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597822938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:42:01,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:42:01,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:42:01,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837621670] [2024-11-09 10:42:01,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:42:01,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:42:01,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:42:01,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:42:01,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:42:01,252 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 142 [2024-11-09 10:42:01,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 142 transitions, 324 flow. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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:01,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:42:01,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 142 [2024-11-09 10:42:01,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand