./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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/weaver/popl20-bad-buffer-mult-alt3.wvr.c -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 fdebcc32a5907a5601109dc3fb4ac7750aa88ce6953c83cffe48f47befc15286 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:23:33,957 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:23:34,007 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:23:34,014 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:23:34,016 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:23:34,034 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:23:34,035 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:23:34,035 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:23:34,035 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:23:34,035 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:23:34,035 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:23:34,035 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:23:34,036 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:23:34,036 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:23:34,036 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:23:34,036 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:23:34,036 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:23:34,036 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:23:34,036 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:23:34,037 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:23:34,037 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:23:34,037 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:23:34,037 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:23:34,037 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:23:34,037 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:23:34,037 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:23:34,037 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:23:34,037 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:23:34,037 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:23:34,038 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:23:34,038 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:23:34,038 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:23:34,038 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:23:34,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:23:34,038 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:23:34,038 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:23:34,038 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:23:34,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:23:34,038 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:23:34,039 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:23:34,039 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:23:34,039 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:23:34,039 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> fdebcc32a5907a5601109dc3fb4ac7750aa88ce6953c83cffe48f47befc15286 [2025-03-09 01:23:34,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:23:34,288 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:23:34,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:23:34,291 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:23:34,291 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:23:34,293 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c [2025-03-09 01:23:35,465 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/808982f56/fcf4d53d44a149d3a869751bad01a438/FLAGb67aac5e9 [2025-03-09 01:23:35,762 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:23:35,763 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c [2025-03-09 01:23:35,771 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/808982f56/fcf4d53d44a149d3a869751bad01a438/FLAGb67aac5e9 [2025-03-09 01:23:35,786 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/808982f56/fcf4d53d44a149d3a869751bad01a438 [2025-03-09 01:23:35,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:23:35,790 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:23:35,791 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:23:35,791 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:23:35,795 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:23:35,795 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:23:35" (1/1) ... [2025-03-09 01:23:35,797 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e42eceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:35, skipping insertion in model container [2025-03-09 01:23:35,797 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:23:35" (1/1) ... [2025-03-09 01:23:35,810 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:23:35,965 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 01:23:35,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:23:35,983 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:23:36,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:23:36,033 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:23:36,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:36 WrapperNode [2025-03-09 01:23:36,034 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:23:36,035 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:23:36,036 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:23:36,036 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:23:36,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:36" (1/1) ... [2025-03-09 01:23:36,048 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:36" (1/1) ... [2025-03-09 01:23:36,074 INFO L138 Inliner]: procedures = 25, calls = 60, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 295 [2025-03-09 01:23:36,074 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:23:36,076 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:23:36,076 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:23:36,076 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:23:36,083 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:36" (1/1) ... [2025-03-09 01:23:36,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:36" (1/1) ... [2025-03-09 01:23:36,086 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:36" (1/1) ... [2025-03-09 01:23:36,109 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-09 01:23:36,109 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:36" (1/1) ... [2025-03-09 01:23:36,109 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:36" (1/1) ... [2025-03-09 01:23:36,115 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:36" (1/1) ... [2025-03-09 01:23:36,116 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:36" (1/1) ... [2025-03-09 01:23:36,117 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:36" (1/1) ... [2025-03-09 01:23:36,117 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:36" (1/1) ... [2025-03-09 01:23:36,119 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:23:36,120 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:23:36,120 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:23:36,120 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:23:36,121 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:36" (1/1) ... [2025-03-09 01:23:36,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:23:36,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:23:36,148 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) [2025-03-09 01:23:36,150 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 [2025-03-09 01:23:36,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:23:36,169 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 01:23:36,169 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 01:23:36,169 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 01:23:36,169 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 01:23:36,169 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-09 01:23:36,169 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-09 01:23:36,169 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-09 01:23:36,169 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-09 01:23:36,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:23:36,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:23:36,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:23:36,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:23:36,169 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-09 01:23:36,169 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-09 01:23:36,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 01:23:36,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:23:36,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:23:36,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:23:36,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:23:36,170 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:23:36,268 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:23:36,269 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:23:36,699 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:23:36,699 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:23:36,986 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:23:36,988 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:23:36,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:23:36 BoogieIcfgContainer [2025-03-09 01:23:36,988 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:23:36,990 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:23:36,991 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:23:36,995 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:23:36,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:23:35" (1/3) ... [2025-03-09 01:23:36,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aa72c84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:23:36, skipping insertion in model container [2025-03-09 01:23:36,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:36" (2/3) ... [2025-03-09 01:23:36,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aa72c84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:23:36, skipping insertion in model container [2025-03-09 01:23:36,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:23:36" (3/3) ... [2025-03-09 01:23:36,997 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt3.wvr.c [2025-03-09 01:23:37,010 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:23:37,012 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-buffer-mult-alt3.wvr.c that has 5 procedures, 61 locations, 1 initial locations, 6 loop locations, and 14 error locations. [2025-03-09 01:23:37,012 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:23:37,086 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-09 01:23:37,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 66 transitions, 160 flow [2025-03-09 01:23:37,156 INFO L124 PetriNetUnfolderBase]: 6/62 cut-off events. [2025-03-09 01:23:37,159 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-09 01:23:37,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 62 events. 6/62 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 140 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2025-03-09 01:23:37,166 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 66 transitions, 160 flow [2025-03-09 01:23:37,169 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 61 transitions, 146 flow [2025-03-09 01:23:37,177 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:23:37,193 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;@364c1a87, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:23:37,194 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-03-09 01:23:37,200 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:23:37,202 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-09 01:23:37,202 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:23:37,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:37,203 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:23:37,203 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-09 01:23:37,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:37,208 INFO L85 PathProgramCache]: Analyzing trace with hash 800587, now seen corresponding path program 1 times [2025-03-09 01:23:37,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:37,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021851520] [2025-03-09 01:23:37,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:37,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:37,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:23:37,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:23:37,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:37,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:37,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:23:37,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:37,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021851520] [2025-03-09 01:23:37,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021851520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:23:37,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:23:37,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:23:37,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986894951] [2025-03-09 01:23:37,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:37,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:23:37,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:37,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:23:37,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:23:37,467 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-09 01:23:37,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 61 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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) [2025-03-09 01:23:37,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:37,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-09 01:23:37,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:39,242 INFO L124 PetriNetUnfolderBase]: 15159/20183 cut-off events. [2025-03-09 01:23:39,242 INFO L125 PetriNetUnfolderBase]: For 484/484 co-relation queries the response was YES. [2025-03-09 01:23:39,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40874 conditions, 20183 events. 15159/20183 cut-off events. For 484/484 co-relation queries the response was YES. Maximal size of possible extension queue 1085. Compared 115955 event pairs, 12544 based on Foata normal form. 1/14525 useless extension candidates. Maximal degree in co-relation 38292. Up to 19683 conditions per place. [2025-03-09 01:23:39,369 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 44 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2025-03-09 01:23:39,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 57 transitions, 230 flow [2025-03-09 01:23:39,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:23:39,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:23:39,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2025-03-09 01:23:39,382 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4898989898989899 [2025-03-09 01:23:39,384 INFO L175 Difference]: Start difference. First operand has 68 places, 61 transitions, 146 flow. Second operand 3 states and 97 transitions. [2025-03-09 01:23:39,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 57 transitions, 230 flow [2025-03-09 01:23:39,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 57 transitions, 214 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-09 01:23:39,500 INFO L231 Difference]: Finished difference. Result has 58 places, 57 transitions, 126 flow [2025-03-09 01:23:39,502 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=58, PETRI_TRANSITIONS=57} [2025-03-09 01:23:39,505 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -10 predicate places. [2025-03-09 01:23:39,505 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 126 flow [2025-03-09 01:23:39,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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) [2025-03-09 01:23:39,506 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:39,506 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:23:39,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:23:39,507 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-09 01:23:39,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:39,507 INFO L85 PathProgramCache]: Analyzing trace with hash 800588, now seen corresponding path program 1 times [2025-03-09 01:23:39,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:39,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383422502] [2025-03-09 01:23:39,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:39,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:39,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:23:39,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:23:39,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:39,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:39,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:23:39,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:39,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383422502] [2025-03-09 01:23:39,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383422502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:23:39,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:23:39,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:23:39,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667335113] [2025-03-09 01:23:39,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:39,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:23:39,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:39,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:23:39,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:23:39,813 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-09 01:23:39,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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) [2025-03-09 01:23:39,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:39,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-09 01:23:39,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:41,043 INFO L124 PetriNetUnfolderBase]: 15160/20186 cut-off events. [2025-03-09 01:23:41,043 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-03-09 01:23:41,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40235 conditions, 20186 events. 15160/20186 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 1085. Compared 115902 event pairs, 12544 based on Foata normal form. 0/14525 useless extension candidates. Maximal degree in co-relation 40206. Up to 19692 conditions per place. [2025-03-09 01:23:41,151 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 47 selfloop transitions, 4 changer transitions 0/60 dead transitions. [2025-03-09 01:23:41,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 60 transitions, 234 flow [2025-03-09 01:23:41,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:23:41,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:23:41,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2025-03-09 01:23:41,155 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2025-03-09 01:23:41,155 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 126 flow. Second operand 4 states and 116 transitions. [2025-03-09 01:23:41,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 60 transitions, 234 flow [2025-03-09 01:23:41,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 60 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:23:41,158 INFO L231 Difference]: Finished difference. Result has 61 places, 60 transitions, 149 flow [2025-03-09 01:23:41,158 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=149, PETRI_PLACES=61, PETRI_TRANSITIONS=60} [2025-03-09 01:23:41,159 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -7 predicate places. [2025-03-09 01:23:41,159 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 60 transitions, 149 flow [2025-03-09 01:23:41,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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) [2025-03-09 01:23:41,160 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:41,161 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-09 01:23:41,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:23:41,161 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-09 01:23:41,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:41,162 INFO L85 PathProgramCache]: Analyzing trace with hash 24819526, now seen corresponding path program 1 times [2025-03-09 01:23:41,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:41,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089991735] [2025-03-09 01:23:41,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:41,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:41,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 01:23:41,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 01:23:41,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:41,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:41,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:23:41,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:41,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089991735] [2025-03-09 01:23:41,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089991735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:23:41,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:23:41,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:23:41,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192849984] [2025-03-09 01:23:41,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:41,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:23:41,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:41,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:23:41,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:23:41,386 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-09 01:23:41,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 60 transitions, 149 flow. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:23:41,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:41,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-09 01:23:41,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:42,407 INFO L124 PetriNetUnfolderBase]: 15161/20189 cut-off events. [2025-03-09 01:23:42,408 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-03-09 01:23:42,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40252 conditions, 20189 events. 15161/20189 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 1085. Compared 115859 event pairs, 12544 based on Foata normal form. 0/14527 useless extension candidates. Maximal degree in co-relation 40227. Up to 19691 conditions per place. [2025-03-09 01:23:42,498 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 47 selfloop transitions, 7 changer transitions 0/63 dead transitions. [2025-03-09 01:23:42,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 63 transitions, 263 flow [2025-03-09 01:23:42,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:23:42,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:23:42,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2025-03-09 01:23:42,500 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2025-03-09 01:23:42,500 INFO L175 Difference]: Start difference. First operand has 61 places, 60 transitions, 149 flow. Second operand 5 states and 135 transitions. [2025-03-09 01:23:42,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 63 transitions, 263 flow [2025-03-09 01:23:42,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 63 transitions, 260 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:23:42,502 INFO L231 Difference]: Finished difference. Result has 66 places, 63 transitions, 183 flow [2025-03-09 01:23:42,502 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=183, PETRI_PLACES=66, PETRI_TRANSITIONS=63} [2025-03-09 01:23:42,503 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -2 predicate places. [2025-03-09 01:23:42,503 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 183 flow [2025-03-09 01:23:42,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:23:42,503 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:42,503 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-09 01:23:42,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:23:42,503 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-09 01:23:42,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:42,504 INFO L85 PathProgramCache]: Analyzing trace with hash 769391090, now seen corresponding path program 1 times [2025-03-09 01:23:42,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:42,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2814990] [2025-03-09 01:23:42,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:42,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:42,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:23:42,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:23:42,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:42,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:42,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:23:42,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:42,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2814990] [2025-03-09 01:23:42,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2814990] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:23:42,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216791434] [2025-03-09 01:23:42,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:42,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:23:42,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:23:42,704 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) [2025-03-09 01:23:42,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:23:42,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:23:42,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:23:42,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:42,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:42,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 01:23:42,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:23:42,822 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 10 treesize of output 9 [2025-03-09 01:23:42,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:23:42,998 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:23:43,082 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:23:43,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216791434] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:23:43,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:23:43,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-09 01:23:43,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828296663] [2025-03-09 01:23:43,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:23:43,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:23:43,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:43,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:23:43,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:23:43,131 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-09 01:23:43,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 63 transitions, 183 flow. Second operand has 11 states, 11 states have (on average 17.363636363636363) internal successors, (191), 11 states have internal predecessors, (191), 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) [2025-03-09 01:23:43,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:43,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-09 01:23:43,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:44,515 INFO L124 PetriNetUnfolderBase]: 15162/20191 cut-off events. [2025-03-09 01:23:44,516 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-09 01:23:44,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40275 conditions, 20191 events. 15162/20191 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 1085. Compared 115951 event pairs, 12544 based on Foata normal form. 0/14532 useless extension candidates. Maximal degree in co-relation 40237. Up to 19692 conditions per place. [2025-03-09 01:23:44,634 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 46 selfloop transitions, 10 changer transitions 0/65 dead transitions. [2025-03-09 01:23:44,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 65 transitions, 306 flow [2025-03-09 01:23:44,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:23:44,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:23:44,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 183 transitions. [2025-03-09 01:23:44,637 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3465909090909091 [2025-03-09 01:23:44,637 INFO L175 Difference]: Start difference. First operand has 66 places, 63 transitions, 183 flow. Second operand 8 states and 183 transitions. [2025-03-09 01:23:44,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 65 transitions, 306 flow [2025-03-09 01:23:44,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 65 transitions, 305 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:23:44,639 INFO L231 Difference]: Finished difference. Result has 71 places, 65 transitions, 213 flow [2025-03-09 01:23:44,639 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=213, PETRI_PLACES=71, PETRI_TRANSITIONS=65} [2025-03-09 01:23:44,640 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2025-03-09 01:23:44,640 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 65 transitions, 213 flow [2025-03-09 01:23:44,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 17.363636363636363) internal successors, (191), 11 states have internal predecessors, (191), 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) [2025-03-09 01:23:44,640 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:44,640 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-09 01:23:44,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 01:23:44,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:23:44,845 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-09 01:23:44,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:44,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1918214525, now seen corresponding path program 1 times [2025-03-09 01:23:44,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:44,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977235876] [2025-03-09 01:23:44,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:44,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:44,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:23:44,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:23:44,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:44,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:45,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:23:45,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:45,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977235876] [2025-03-09 01:23:45,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977235876] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:23:45,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470690095] [2025-03-09 01:23:45,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:45,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:23:45,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:23:45,072 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) [2025-03-09 01:23:45,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:23:45,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:23:45,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:23:45,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:45,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:45,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 01:23:45,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:23:45,167 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 [2025-03-09 01:23:45,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:23:45,270 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:23:45,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:23:45,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470690095] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:23:45,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:23:45,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-09 01:23:45,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267856634] [2025-03-09 01:23:45,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:23:45,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:23:45,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:45,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:23:45,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:23:45,465 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-09 01:23:45,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 65 transitions, 213 flow. Second operand has 13 states, 13 states have (on average 17.307692307692307) internal successors, (225), 13 states have internal predecessors, (225), 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) [2025-03-09 01:23:45,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:45,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-09 01:23:45,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:46,757 INFO L124 PetriNetUnfolderBase]: 15162/20190 cut-off events. [2025-03-09 01:23:46,757 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-09 01:23:46,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40282 conditions, 20190 events. 15162/20190 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 1085. Compared 115888 event pairs, 12544 based on Foata normal form. 0/14532 useless extension candidates. Maximal degree in co-relation 40236. Up to 19683 conditions per place. [2025-03-09 01:23:46,841 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 40 selfloop transitions, 15 changer transitions 0/64 dead transitions. [2025-03-09 01:23:46,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 64 transitions, 319 flow [2025-03-09 01:23:46,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:23:46,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:23:46,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 165 transitions. [2025-03-09 01:23:46,843 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2025-03-09 01:23:46,843 INFO L175 Difference]: Start difference. First operand has 71 places, 65 transitions, 213 flow. Second operand 7 states and 165 transitions. [2025-03-09 01:23:46,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 64 transitions, 319 flow [2025-03-09 01:23:46,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 64 transitions, 272 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-03-09 01:23:46,844 INFO L231 Difference]: Finished difference. Result has 68 places, 64 transitions, 192 flow [2025-03-09 01:23:46,844 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=192, PETRI_PLACES=68, PETRI_TRANSITIONS=64} [2025-03-09 01:23:46,845 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 0 predicate places. [2025-03-09 01:23:46,845 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 64 transitions, 192 flow [2025-03-09 01:23:46,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 17.307692307692307) internal successors, (225), 13 states have internal predecessors, (225), 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) [2025-03-09 01:23:46,845 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:46,845 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:46,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 01:23:47,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:23:47,046 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-09 01:23:47,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:47,047 INFO L85 PathProgramCache]: Analyzing trace with hash -752860672, now seen corresponding path program 1 times [2025-03-09 01:23:47,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:47,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640072838] [2025-03-09 01:23:47,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:47,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:47,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:23:47,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:23:47,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:47,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:47,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:23:47,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:47,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640072838] [2025-03-09 01:23:47,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640072838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:23:47,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:23:47,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:23:47,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024962227] [2025-03-09 01:23:47,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:47,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:23:47,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:47,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:23:47,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:23:47,108 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-03-09 01:23:47,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 64 transitions, 192 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 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) [2025-03-09 01:23:47,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:47,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-03-09 01:23:47,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:48,246 INFO L124 PetriNetUnfolderBase]: 18046/24270 cut-off events. [2025-03-09 01:23:48,246 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2025-03-09 01:23:48,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48423 conditions, 24270 events. 18046/24270 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 1234. Compared 144204 event pairs, 15126 based on Foata normal form. 630/18644 useless extension candidates. Maximal degree in co-relation 40230. Up to 19695 conditions per place. [2025-03-09 01:23:48,334 INFO L140 encePairwiseOnDemand]: 55/66 looper letters, 86 selfloop transitions, 5 changer transitions 0/100 dead transitions. [2025-03-09 01:23:48,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 100 transitions, 480 flow [2025-03-09 01:23:48,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:23:48,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:23:48,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 181 transitions. [2025-03-09 01:23:48,339 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5484848484848485 [2025-03-09 01:23:48,339 INFO L175 Difference]: Start difference. First operand has 68 places, 64 transitions, 192 flow. Second operand 5 states and 181 transitions. [2025-03-09 01:23:48,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 100 transitions, 480 flow [2025-03-09 01:23:48,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 100 transitions, 439 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-03-09 01:23:48,340 INFO L231 Difference]: Finished difference. Result has 69 places, 66 transitions, 204 flow [2025-03-09 01:23:48,340 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=204, PETRI_PLACES=69, PETRI_TRANSITIONS=66} [2025-03-09 01:23:48,341 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 1 predicate places. [2025-03-09 01:23:48,341 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 66 transitions, 204 flow [2025-03-09 01:23:48,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 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) [2025-03-09 01:23:48,341 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:48,341 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:48,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:23:48,341 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-09 01:23:48,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:48,341 INFO L85 PathProgramCache]: Analyzing trace with hash 371078938, now seen corresponding path program 1 times [2025-03-09 01:23:48,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:48,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438235071] [2025-03-09 01:23:48,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:48,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:48,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:23:48,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:23:48,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:48,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:48,445 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:23:48,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:48,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438235071] [2025-03-09 01:23:48,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438235071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:23:48,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:23:48,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:23:48,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454093128] [2025-03-09 01:23:48,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:48,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:23:48,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:48,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:23:48,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:23:48,453 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-09 01:23:48,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 66 transitions, 204 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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) [2025-03-09 01:23:48,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:48,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-09 01:23:48,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:49,239 INFO L124 PetriNetUnfolderBase]: 13846/18638 cut-off events. [2025-03-09 01:23:49,239 INFO L125 PetriNetUnfolderBase]: For 1190/1190 co-relation queries the response was YES. [2025-03-09 01:23:49,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39532 conditions, 18638 events. 13846/18638 cut-off events. For 1190/1190 co-relation queries the response was YES. Maximal size of possible extension queue 931. Compared 107525 event pairs, 11474 based on Foata normal form. 0/14633 useless extension candidates. Maximal degree in co-relation 31364. Up to 18210 conditions per place. [2025-03-09 01:23:49,326 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 48 selfloop transitions, 7 changer transitions 0/64 dead transitions. [2025-03-09 01:23:49,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 64 transitions, 306 flow [2025-03-09 01:23:49,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:23:49,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:23:49,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2025-03-09 01:23:49,328 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38181818181818183 [2025-03-09 01:23:49,328 INFO L175 Difference]: Start difference. First operand has 69 places, 66 transitions, 204 flow. Second operand 5 states and 126 transitions. [2025-03-09 01:23:49,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 64 transitions, 306 flow [2025-03-09 01:23:49,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 64 transitions, 301 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:23:49,331 INFO L231 Difference]: Finished difference. Result has 69 places, 64 transitions, 205 flow [2025-03-09 01:23:49,331 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=205, PETRI_PLACES=69, PETRI_TRANSITIONS=64} [2025-03-09 01:23:49,332 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 1 predicate places. [2025-03-09 01:23:49,332 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 64 transitions, 205 flow [2025-03-09 01:23:49,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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) [2025-03-09 01:23:49,332 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:49,332 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:49,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:23:49,332 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-09 01:23:49,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:49,333 INFO L85 PathProgramCache]: Analyzing trace with hash 371078939, now seen corresponding path program 1 times [2025-03-09 01:23:49,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:49,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375735067] [2025-03-09 01:23:49,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:49,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:49,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:23:49,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:23:49,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:49,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:49,523 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:23:49,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:49,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375735067] [2025-03-09 01:23:49,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375735067] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:23:49,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237134654] [2025-03-09 01:23:49,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:49,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:23:49,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:23:49,526 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) [2025-03-09 01:23:49,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 01:23:49,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:23:49,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:23:49,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:49,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:49,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-09 01:23:49,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:23:49,596 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 6 treesize of output 5 [2025-03-09 01:23:49,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:23:49,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-09 01:23:49,646 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:23:49,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 01:23:49,668 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:23:49,668 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:23:49,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237134654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:23:49,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:23:49,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2025-03-09 01:23:49,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814177830] [2025-03-09 01:23:49,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:49,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:23:49,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:49,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:23:49,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:23:49,682 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-09 01:23:49,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 64 transitions, 205 flow. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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) [2025-03-09 01:23:49,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:49,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-09 01:23:49,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:50,318 INFO L124 PetriNetUnfolderBase]: 10318/13958 cut-off events. [2025-03-09 01:23:50,319 INFO L125 PetriNetUnfolderBase]: For 992/992 co-relation queries the response was YES. [2025-03-09 01:23:50,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28870 conditions, 13958 events. 10318/13958 cut-off events. For 992/992 co-relation queries the response was YES. Maximal size of possible extension queue 693. Compared 77982 event pairs, 8438 based on Foata normal form. 0/11788 useless extension candidates. Maximal degree in co-relation 20658. Up to 13649 conditions per place. [2025-03-09 01:23:50,368 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 49 selfloop transitions, 4 changer transitions 0/62 dead transitions. [2025-03-09 01:23:50,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 62 transitions, 303 flow [2025-03-09 01:23:50,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:23:50,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:23:50,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2025-03-09 01:23:50,369 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2025-03-09 01:23:50,369 INFO L175 Difference]: Start difference. First operand has 69 places, 64 transitions, 205 flow. Second operand 4 states and 108 transitions. [2025-03-09 01:23:50,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 62 transitions, 303 flow [2025-03-09 01:23:50,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 62 transitions, 292 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:23:50,371 INFO L231 Difference]: Finished difference. Result has 67 places, 62 transitions, 194 flow [2025-03-09 01:23:50,371 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=194, PETRI_PLACES=67, PETRI_TRANSITIONS=62} [2025-03-09 01:23:50,372 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -1 predicate places. [2025-03-09 01:23:50,372 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 62 transitions, 194 flow [2025-03-09 01:23:50,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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) [2025-03-09 01:23:50,372 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:50,372 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:50,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 01:23:50,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:23:50,577 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-09 01:23:50,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:50,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1754012507, now seen corresponding path program 1 times [2025-03-09 01:23:50,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:50,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627384604] [2025-03-09 01:23:50,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:50,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:50,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:23:50,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:23:50,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:50,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:50,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:23:50,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:50,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627384604] [2025-03-09 01:23:50,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627384604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:23:50,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:23:50,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:23:50,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999530451] [2025-03-09 01:23:50,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:50,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:23:50,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:50,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:23:50,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:23:50,659 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-09 01:23:50,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 62 transitions, 194 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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) [2025-03-09 01:23:50,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:50,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-09 01:23:50,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:51,331 INFO L124 PetriNetUnfolderBase]: 7579/10306 cut-off events. [2025-03-09 01:23:51,331 INFO L125 PetriNetUnfolderBase]: For 737/737 co-relation queries the response was YES. [2025-03-09 01:23:51,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21330 conditions, 10306 events. 7579/10306 cut-off events. For 737/737 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 54923 event pairs, 6078 based on Foata normal form. 0/9254 useless extension candidates. Maximal degree in co-relation 15262. Up to 10036 conditions per place. [2025-03-09 01:23:51,388 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 47 selfloop transitions, 4 changer transitions 0/60 dead transitions. [2025-03-09 01:23:51,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 60 transitions, 292 flow [2025-03-09 01:23:51,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:23:51,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:23:51,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2025-03-09 01:23:51,389 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4015151515151515 [2025-03-09 01:23:51,389 INFO L175 Difference]: Start difference. First operand has 67 places, 62 transitions, 194 flow. Second operand 4 states and 106 transitions. [2025-03-09 01:23:51,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 60 transitions, 292 flow [2025-03-09 01:23:51,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 60 transitions, 287 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:23:51,391 INFO L231 Difference]: Finished difference. Result has 66 places, 60 transitions, 193 flow [2025-03-09 01:23:51,392 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=193, PETRI_PLACES=66, PETRI_TRANSITIONS=60} [2025-03-09 01:23:51,392 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -2 predicate places. [2025-03-09 01:23:51,392 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 193 flow [2025-03-09 01:23:51,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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) [2025-03-09 01:23:51,392 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:51,392 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:51,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 01:23:51,393 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-09 01:23:51,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:51,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1754012508, now seen corresponding path program 1 times [2025-03-09 01:23:51,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:51,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028781802] [2025-03-09 01:23:51,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:51,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:51,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:23:51,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:23:51,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:51,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:51,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:23:51,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:51,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028781802] [2025-03-09 01:23:51,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028781802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:23:51,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:23:51,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:23:51,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949345827] [2025-03-09 01:23:51,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:51,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:23:51,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:51,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:23:51,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:23:51,469 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-03-09 01:23:51,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 60 transitions, 193 flow. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:23:51,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:51,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-03-09 01:23:51,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:52,353 INFO L124 PetriNetUnfolderBase]: 9640/13375 cut-off events. [2025-03-09 01:23:52,353 INFO L125 PetriNetUnfolderBase]: For 995/995 co-relation queries the response was YES. [2025-03-09 01:23:52,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27677 conditions, 13375 events. 9640/13375 cut-off events. For 995/995 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 75948 event pairs, 7905 based on Foata normal form. 382/12914 useless extension candidates. Maximal degree in co-relation 19838. Up to 10048 conditions per place. [2025-03-09 01:23:52,435 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 70 selfloop transitions, 7 changer transitions 0/86 dead transitions. [2025-03-09 01:23:52,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 86 transitions, 411 flow [2025-03-09 01:23:52,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:23:52,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:23:52,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 145 transitions. [2025-03-09 01:23:52,436 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5492424242424242 [2025-03-09 01:23:52,436 INFO L175 Difference]: Start difference. First operand has 66 places, 60 transitions, 193 flow. Second operand 4 states and 145 transitions. [2025-03-09 01:23:52,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 86 transitions, 411 flow [2025-03-09 01:23:52,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 86 transitions, 406 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:23:52,444 INFO L231 Difference]: Finished difference. Result has 68 places, 60 transitions, 212 flow [2025-03-09 01:23:52,444 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=212, PETRI_PLACES=68, PETRI_TRANSITIONS=60} [2025-03-09 01:23:52,445 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 0 predicate places. [2025-03-09 01:23:52,445 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 60 transitions, 212 flow [2025-03-09 01:23:52,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:23:52,445 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:52,445 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:52,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 01:23:52,445 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-09 01:23:52,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:52,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1593925415, now seen corresponding path program 1 times [2025-03-09 01:23:52,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:52,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074517058] [2025-03-09 01:23:52,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:52,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:52,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:23:52,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:23:52,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:52,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:52,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:23:52,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:52,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074517058] [2025-03-09 01:23:52,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074517058] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:23:52,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072648300] [2025-03-09 01:23:52,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:52,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:23:52,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:23:52,650 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:23:52,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 01:23:52,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:23:52,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:23:52,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:52,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:52,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-09 01:23:52,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:23:52,809 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:23:52,810 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:23:52,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072648300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:23:52,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:23:52,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-03-09 01:23:52,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272301010] [2025-03-09 01:23:52,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:52,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:23:52,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:52,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:23:52,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:23:52,824 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-03-09 01:23:52,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 60 transitions, 212 flow. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:23:52,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:52,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-03-09 01:23:52,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:53,482 INFO L124 PetriNetUnfolderBase]: 7323/10275 cut-off events. [2025-03-09 01:23:53,482 INFO L125 PetriNetUnfolderBase]: For 1453/1453 co-relation queries the response was YES. [2025-03-09 01:23:53,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21954 conditions, 10275 events. 7323/10275 cut-off events. For 1453/1453 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 57651 event pairs, 5929 based on Foata normal form. 0/10031 useless extension candidates. Maximal degree in co-relation 15695. Up to 9903 conditions per place. [2025-03-09 01:23:53,533 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 43 selfloop transitions, 6 changer transitions 0/58 dead transitions. [2025-03-09 01:23:53,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 58 transitions, 302 flow [2025-03-09 01:23:53,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:23:53,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:23:53,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2025-03-09 01:23:53,534 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2025-03-09 01:23:53,534 INFO L175 Difference]: Start difference. First operand has 68 places, 60 transitions, 212 flow. Second operand 4 states and 112 transitions. [2025-03-09 01:23:53,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 58 transitions, 302 flow [2025-03-09 01:23:53,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 58 transitions, 297 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:23:53,537 INFO L231 Difference]: Finished difference. Result has 68 places, 58 transitions, 211 flow [2025-03-09 01:23:53,537 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=211, PETRI_PLACES=68, PETRI_TRANSITIONS=58} [2025-03-09 01:23:53,537 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 0 predicate places. [2025-03-09 01:23:53,537 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 58 transitions, 211 flow [2025-03-09 01:23:53,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:23:53,538 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:53,538 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:53,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 01:23:53,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:23:53,738 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-09 01:23:53,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:53,739 INFO L85 PathProgramCache]: Analyzing trace with hash -152366483, now seen corresponding path program 1 times [2025-03-09 01:23:53,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:53,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041347968] [2025-03-09 01:23:53,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:53,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:53,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 01:23:53,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 01:23:53,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:53,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:53,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:23:53,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:53,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041347968] [2025-03-09 01:23:53,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041347968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:23:53,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:23:53,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:23:53,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698031015] [2025-03-09 01:23:53,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:53,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:23:53,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:53,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:23:53,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:23:53,936 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-03-09 01:23:53,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 58 transitions, 211 flow. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 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) [2025-03-09 01:23:53,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:53,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-03-09 01:23:53,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:54,576 INFO L124 PetriNetUnfolderBase]: 7382/10913 cut-off events. [2025-03-09 01:23:54,577 INFO L125 PetriNetUnfolderBase]: For 1699/1699 co-relation queries the response was YES. [2025-03-09 01:23:54,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22998 conditions, 10913 events. 7382/10913 cut-off events. For 1699/1699 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 66360 event pairs, 881 based on Foata normal form. 558/11416 useless extension candidates. Maximal degree in co-relation 19272. Up to 6046 conditions per place. [2025-03-09 01:23:54,609 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 82 selfloop transitions, 5 changer transitions 3/99 dead transitions. [2025-03-09 01:23:54,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 99 transitions, 493 flow [2025-03-09 01:23:54,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:23:54,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:23:54,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 170 transitions. [2025-03-09 01:23:54,610 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2025-03-09 01:23:54,610 INFO L175 Difference]: Start difference. First operand has 68 places, 58 transitions, 211 flow. Second operand 5 states and 170 transitions. [2025-03-09 01:23:54,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 99 transitions, 493 flow [2025-03-09 01:23:54,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 99 transitions, 484 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:23:54,612 INFO L231 Difference]: Finished difference. Result has 71 places, 56 transitions, 193 flow [2025-03-09 01:23:54,612 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=193, PETRI_PLACES=71, PETRI_TRANSITIONS=56} [2025-03-09 01:23:54,613 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2025-03-09 01:23:54,613 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 56 transitions, 193 flow [2025-03-09 01:23:54,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 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) [2025-03-09 01:23:54,613 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:54,613 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:54,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 01:23:54,613 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-09 01:23:54,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:54,613 INFO L85 PathProgramCache]: Analyzing trace with hash -48937970, now seen corresponding path program 1 times [2025-03-09 01:23:54,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:54,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365254704] [2025-03-09 01:23:54,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:54,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:54,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-09 01:23:54,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 01:23:54,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:54,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:54,727 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:23:54,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:54,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365254704] [2025-03-09 01:23:54,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365254704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:23:54,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:23:54,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:23:54,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351345417] [2025-03-09 01:23:54,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:54,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:23:54,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:54,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:23:54,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:23:54,731 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-03-09 01:23:54,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 56 transitions, 193 flow. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 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) [2025-03-09 01:23:54,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:54,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-03-09 01:23:54,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:55,330 INFO L124 PetriNetUnfolderBase]: 7889/11206 cut-off events. [2025-03-09 01:23:55,331 INFO L125 PetriNetUnfolderBase]: For 4270/4270 co-relation queries the response was YES. [2025-03-09 01:23:55,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25859 conditions, 11206 events. 7889/11206 cut-off events. For 4270/4270 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 62633 event pairs, 1032 based on Foata normal form. 480/11668 useless extension candidates. Maximal degree in co-relation 25820. Up to 6156 conditions per place. [2025-03-09 01:23:55,378 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 93 selfloop transitions, 7 changer transitions 0/109 dead transitions. [2025-03-09 01:23:55,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 109 transitions, 536 flow [2025-03-09 01:23:55,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:23:55,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:23:55,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 202 transitions. [2025-03-09 01:23:55,379 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.51010101010101 [2025-03-09 01:23:55,379 INFO L175 Difference]: Start difference. First operand has 71 places, 56 transitions, 193 flow. Second operand 6 states and 202 transitions. [2025-03-09 01:23:55,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 109 transitions, 536 flow [2025-03-09 01:23:55,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 109 transitions, 522 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-09 01:23:55,382 INFO L231 Difference]: Finished difference. Result has 73 places, 59 transitions, 221 flow [2025-03-09 01:23:55,382 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=221, PETRI_PLACES=73, PETRI_TRANSITIONS=59} [2025-03-09 01:23:55,382 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 5 predicate places. [2025-03-09 01:23:55,382 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 59 transitions, 221 flow [2025-03-09 01:23:55,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 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) [2025-03-09 01:23:55,383 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:55,383 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:55,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 01:23:55,383 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-09 01:23:55,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:55,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1785842088, now seen corresponding path program 2 times [2025-03-09 01:23:55,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:55,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004065338] [2025-03-09 01:23:55,383 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:23:55,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:55,393 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-09 01:23:55,398 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 35 statements. [2025-03-09 01:23:55,398 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:23:55,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:55,475 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:23:55,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:55,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004065338] [2025-03-09 01:23:55,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004065338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:23:55,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:23:55,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:23:55,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520980835] [2025-03-09 01:23:55,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:55,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:23:55,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:55,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:23:55,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:23:55,479 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-03-09 01:23:55,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 59 transitions, 221 flow. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 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) [2025-03-09 01:23:55,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:55,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-03-09 01:23:55,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:56,592 INFO L124 PetriNetUnfolderBase]: 14318/20298 cut-off events. [2025-03-09 01:23:56,592 INFO L125 PetriNetUnfolderBase]: For 11288/11288 co-relation queries the response was YES. [2025-03-09 01:23:56,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50452 conditions, 20298 events. 14318/20298 cut-off events. For 11288/11288 co-relation queries the response was YES. Maximal size of possible extension queue 815. Compared 124123 event pairs, 1222 based on Foata normal form. 865/21126 useless extension candidates. Maximal degree in co-relation 50411. Up to 9655 conditions per place. [2025-03-09 01:23:56,693 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 125 selfloop transitions, 9 changer transitions 0/143 dead transitions. [2025-03-09 01:23:56,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 143 transitions, 727 flow [2025-03-09 01:23:56,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:23:56,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:23:56,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 234 transitions. [2025-03-09 01:23:56,694 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5909090909090909 [2025-03-09 01:23:56,694 INFO L175 Difference]: Start difference. First operand has 73 places, 59 transitions, 221 flow. Second operand 6 states and 234 transitions. [2025-03-09 01:23:56,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 143 transitions, 727 flow [2025-03-09 01:23:56,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 143 transitions, 717 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-09 01:23:56,717 INFO L231 Difference]: Finished difference. Result has 80 places, 66 transitions, 292 flow [2025-03-09 01:23:56,717 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=292, PETRI_PLACES=80, PETRI_TRANSITIONS=66} [2025-03-09 01:23:56,718 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 12 predicate places. [2025-03-09 01:23:56,718 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 66 transitions, 292 flow [2025-03-09 01:23:56,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 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) [2025-03-09 01:23:56,718 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:56,718 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:56,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 01:23:56,718 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-09 01:23:56,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:56,718 INFO L85 PathProgramCache]: Analyzing trace with hash 666200338, now seen corresponding path program 3 times [2025-03-09 01:23:56,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:56,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991127400] [2025-03-09 01:23:56,719 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:23:56,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:56,725 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 3 equivalence classes. [2025-03-09 01:23:56,747 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 01:23:56,747 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 01:23:56,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:23:56,747 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 01:23:56,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-09 01:23:56,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 01:23:56,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:56,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:23:56,795 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 01:23:56,795 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 01:23:56,796 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (25 of 26 remaining) [2025-03-09 01:23:56,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 26 remaining) [2025-03-09 01:23:56,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 26 remaining) [2025-03-09 01:23:56,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 26 remaining) [2025-03-09 01:23:56,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 26 remaining) [2025-03-09 01:23:56,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 26 remaining) [2025-03-09 01:23:56,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 26 remaining) [2025-03-09 01:23:56,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 26 remaining) [2025-03-09 01:23:56,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 26 remaining) [2025-03-09 01:23:56,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 26 remaining) [2025-03-09 01:23:56,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 26 remaining) [2025-03-09 01:23:56,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (14 of 26 remaining) [2025-03-09 01:23:56,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 26 remaining) [2025-03-09 01:23:56,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 26 remaining) [2025-03-09 01:23:56,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 26 remaining) [2025-03-09 01:23:56,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 26 remaining) [2025-03-09 01:23:56,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 26 remaining) [2025-03-09 01:23:56,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 26 remaining) [2025-03-09 01:23:56,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 26 remaining) [2025-03-09 01:23:56,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 26 remaining) [2025-03-09 01:23:56,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 26 remaining) [2025-03-09 01:23:56,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 26 remaining) [2025-03-09 01:23:56,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 26 remaining) [2025-03-09 01:23:56,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 26 remaining) [2025-03-09 01:23:56,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 26 remaining) [2025-03-09 01:23:56,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 26 remaining) [2025-03-09 01:23:56,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 01:23:56,799 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:56,868 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-09 01:23:56,868 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 01:23:56,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 01:23:56 BasicIcfg [2025-03-09 01:23:56,872 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 01:23:56,872 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 01:23:56,872 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 01:23:56,872 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 01:23:56,873 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:23:36" (3/4) ... [2025-03-09 01:23:56,875 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 01:23:56,875 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 01:23:56,876 INFO L158 Benchmark]: Toolchain (without parser) took 21086.50ms. Allocated memory was 142.6MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 111.9MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 2.6GB. Max. memory is 16.1GB. [2025-03-09 01:23:56,877 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:23:56,877 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.45ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 98.9MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:23:56,877 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.58ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 96.6MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:23:56,877 INFO L158 Benchmark]: Boogie Preprocessor took 43.53ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 94.1MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:23:56,877 INFO L158 Benchmark]: IcfgBuilder took 868.37ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 77.2MB in the end (delta: 16.9MB). Peak memory consumption was 65.5MB. Max. memory is 16.1GB. [2025-03-09 01:23:56,877 INFO L158 Benchmark]: TraceAbstraction took 19881.26ms. Allocated memory was 142.6MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 76.4MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. [2025-03-09 01:23:56,878 INFO L158 Benchmark]: Witness Printer took 3.09ms. Allocated memory is still 3.8GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 455.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:23:56,879 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 243.45ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 98.9MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.58ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 96.6MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.53ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 94.1MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 868.37ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 77.2MB in the end (delta: 16.9MB). Peak memory consumption was 65.5MB. Max. memory is 16.1GB. * TraceAbstraction took 19881.26ms. Allocated memory was 142.6MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 76.4MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. * Witness Printer took 3.09ms. Allocated memory is still 3.8GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 455.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 21]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 21. Possible FailurePath: [L40] 0 int* q1; [L41] 0 int* q2; [L42] 0 int i, j, total, C, N, M, q1_front, q1_back, q2_front, q2_back, n1, n2; [L124] 0 pthread_t t1, t2, t3, t4; [L126] 0 C = __VERIFIER_nondet_int() [L127] 0 M = __VERIFIER_nondet_int() [L128] 0 N = __VERIFIER_nondet_int() [L130] 0 q1_front = __VERIFIER_nondet_int() [L131] 0 q1_back = __VERIFIER_nondet_int() [L132] 0 q2_front = __VERIFIER_nondet_int() [L133] 0 q2_back = __VERIFIER_nondet_int() [L135] 0 n1 = __VERIFIER_nondet_int() [L136] 0 n2 = __VERIFIER_nondet_int() [L137] CALL, EXPR 0 create_fresh_int_array(n1) [L160] CALL 0 assume_abort_if_not(size >= 0) [L37] COND FALSE 0 !(!cond) [L160] RET 0 assume_abort_if_not(size >= 0) [L161] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L37] COND FALSE 0 !(!cond) [L161] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L163] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L164] 0 int i = 0; VAL [C=3, M=0, N=1, \old(size)=1, arr={-1:0}, i=0, i=0, j=0, n1=1, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L164] COND TRUE 0 i < size [L165] 0 arr[i] = __VERIFIER_nondet_int() [L164] 0 i++ VAL [C=3, M=0, N=1, \old(size)=1, arr={-1:0}, i=0, i=1, j=0, n1=1, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L164] COND FALSE 0 !(i < size) [L167] 0 return arr; [L137] RET, EXPR 0 create_fresh_int_array(n1) [L137] 0 q1 = create_fresh_int_array(n1) [L138] CALL, EXPR 0 create_fresh_int_array(n2) [L160] CALL 0 assume_abort_if_not(size >= 0) [L37] COND FALSE 0 !(!cond) [L160] RET 0 assume_abort_if_not(size >= 0) [L161] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L37] COND FALSE 0 !(!cond) [L161] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L163] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L164] 0 int i = 0; VAL [C=3, M=0, N=1, \old(size)=0, arr={-3:0}, i=0, i=0, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=0, total=0] [L164] COND FALSE 0 !(i < size) [L167] 0 return arr; [L138] RET, EXPR 0 create_fresh_int_array(n2) [L138] 0 q2 = create_fresh_int_array(n2) [L140] CALL 0 assume_abort_if_not(C > -2147483648) [L37] COND FALSE 0 !(!cond) [L140] RET 0 assume_abort_if_not(C > -2147483648) [L141] CALL 0 assume_abort_if_not(N > M && M >= 0 && C > 0 && q1_front == q1_back && q2_front == q2_back) [L37] COND FALSE 0 !(!cond) [L141] RET 0 assume_abort_if_not(N > M && M >= 0 && C > 0 && q1_front == q1_back && q2_front == q2_back) [L144] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [C=3, M=0, N=1, i=0, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, t1=-2, total=0] [L49] 1 _Bool cond = i < N; VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, i=0, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L51] COND TRUE 1 \read(cond) VAL [C=3, M=0, N=1, i=0, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L53] EXPR 1 q1_back >= 0 && q1_back < n1 && q1[q1_back] == C [L53] EXPR 1 q1_back >= 0 && q1_back < n1 && q1[q1_back] == C [L53] EXPR 1 q1[q1_back] [L53] EXPR 1 q1_back >= 0 && q1_back < n1 && q1[q1_back] == C [L53] CALL 1 assume_abort_if_not(q1_back >= 0 && q1_back < n1 && q1[q1_back] == C) [L37] COND FALSE 1 !(!cond) [L53] RET 1 assume_abort_if_not(q1_back >= 0 && q1_back < n1 && q1[q1_back] == C) [L54] 1 i++ VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L145] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, t1=-2, t2=-1, total=0] [L69] 2 _Bool cond = j < M; VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L146] FCALL, FORK 0 pthread_create(&t3, 0, thread3, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, t1=-2, t2=-1, t3=0, total=0] [L89] 3 _Bool cond = i < N || q1_front < q1_back; VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L71] COND FALSE 2 !(\read(cond)) [L84] 2 return 0; [L147] FCALL, FORK 0 pthread_create(&t4, 0, thread4, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, t1=-2, t2=-1, t3=0, t4=1, total=0] [L107] 4 _Bool cond = j < M || q2_front < q2_back; VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L109] COND FALSE 4 !(\read(cond)) [L120] 4 return 0; [L91] COND FALSE 3 !(\read(cond)) [L102] 3 return 0; [L57] 1 q1_back++ VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L60] 1 cond = i < N VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L51] COND FALSE 1 !(\read(cond)) [L64] 1 return 0; [L148] FCALL, JOIN 1 pthread_join(t1, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, t1=-2, t2=-1, t3=0, t4=1, total=0] [L149] FCALL, JOIN 2 pthread_join(t2, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, t1=-2, t2=-1, t3=0, t4=1, total=0] [L150] FCALL, JOIN 3 pthread_join(t3, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, t1=-2, t2=-1, t3=0, t4=1, total=0] [L151] FCALL, JOIN 4 pthread_join(t4, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, t1=-2, t2=-1, t3=0, t4=1, total=0] [L153] CALL 0 assume_abort_if_not(total <= 0) [L37] COND FALSE 0 !(!cond) [L153] RET 0 assume_abort_if_not(total <= 0) [L154] CALL 0 reach_error() [L21] 0 __assert_fail("0", "popl20-bad-buffer-mult-alt.wvr.c", 21, __extension__ __PRETTY_FUNCTION__) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 123]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 144]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 146]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 147]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 99 locations, 108 edges, 26 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 19.7s, OverallIterations: 15, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 15.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 698 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 625 mSDsluCounter, 43 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 27 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2355 IncrementalHoareTripleChecker+Invalid, 2404 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 16 mSDtfsCounter, 2355 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=292occurred in iteration=14, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 248 NumberOfCodeBlocks, 245 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 204 ConstructedInterpolants, 1 QuantifiedInterpolants, 1811 SizeOfPredicates, 11 NumberOfNonLiveVariables, 501 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 20 InterpolantComputations, 12 PerfectInterpolantSequences, 25/39 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-09 01:23:56,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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/weaver/popl20-bad-buffer-mult-alt3.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fdebcc32a5907a5601109dc3fb4ac7750aa88ce6953c83cffe48f47befc15286 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:23:59,209 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:23:59,289 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-03-09 01:23:59,294 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:23:59,295 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:23:59,318 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:23:59,319 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:23:59,319 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:23:59,320 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:23:59,320 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:23:59,320 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:23:59,321 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:23:59,321 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:23:59,321 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:23:59,321 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:23:59,322 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:23:59,322 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:23:59,322 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:23:59,322 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:23:59,322 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:23:59,322 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:23:59,322 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:23:59,322 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:23:59,322 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:23:59,322 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:23:59,323 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-09 01:23:59,323 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-09 01:23:59,323 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:23:59,323 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:23:59,323 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:23:59,323 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:23:59,323 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:23:59,323 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:23:59,323 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:23:59,324 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:23:59,324 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:23:59,324 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:23:59,324 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:23:59,324 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-09 01:23:59,324 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-09 01:23:59,324 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:23:59,324 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:23:59,324 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:23:59,325 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:23:59,325 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> fdebcc32a5907a5601109dc3fb4ac7750aa88ce6953c83cffe48f47befc15286 [2025-03-09 01:23:59,569 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:23:59,577 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:23:59,579 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:23:59,580 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:23:59,580 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:23:59,581 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c [2025-03-09 01:24:00,708 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/044aefca5/b6598f6cc3264edd9dc5ac12505fd410/FLAG1c8d0b283 [2025-03-09 01:24:00,915 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:24:00,915 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c [2025-03-09 01:24:00,924 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/044aefca5/b6598f6cc3264edd9dc5ac12505fd410/FLAG1c8d0b283 [2025-03-09 01:24:01,278 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/044aefca5/b6598f6cc3264edd9dc5ac12505fd410 [2025-03-09 01:24:01,282 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:24:01,283 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:24:01,285 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:24:01,288 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:24:01,292 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:24:01,293 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:24:01" (1/1) ... [2025-03-09 01:24:01,294 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32087e7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:24:01, skipping insertion in model container [2025-03-09 01:24:01,294 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:24:01" (1/1) ... [2025-03-09 01:24:01,310 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:24:01,453 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 01:24:01,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:24:01,466 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:24:01,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:24:01,510 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:24:01,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:24:01 WrapperNode [2025-03-09 01:24:01,511 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:24:01,513 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:24:01,513 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:24:01,513 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:24:01,517 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:24:01" (1/1) ... [2025-03-09 01:24:01,529 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:24:01" (1/1) ... [2025-03-09 01:24:01,559 INFO L138 Inliner]: procedures = 27, calls = 60, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 282 [2025-03-09 01:24:01,560 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:24:01,561 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:24:01,561 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:24:01,561 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:24:01,566 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:24:01" (1/1) ... [2025-03-09 01:24:01,567 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:24:01" (1/1) ... [2025-03-09 01:24:01,570 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:24:01" (1/1) ... [2025-03-09 01:24:01,589 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-09 01:24:01,589 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:24:01" (1/1) ... [2025-03-09 01:24:01,590 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:24:01" (1/1) ... [2025-03-09 01:24:01,602 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:24:01" (1/1) ... [2025-03-09 01:24:01,606 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:24:01" (1/1) ... [2025-03-09 01:24:01,608 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:24:01" (1/1) ... [2025-03-09 01:24:01,610 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:24:01" (1/1) ... [2025-03-09 01:24:01,616 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:24:01,617 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:24:01,618 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:24:01,618 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:24:01,619 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:24:01" (1/1) ... [2025-03-09 01:24:01,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:24:01,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:24:01,653 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) [2025-03-09 01:24:01,656 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 [2025-03-09 01:24:01,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:24:01,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-09 01:24:01,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-09 01:24:01,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-09 01:24:01,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-09 01:24:01,675 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 01:24:01,675 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 01:24:01,675 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 01:24:01,675 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 01:24:01,675 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-09 01:24:01,675 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-09 01:24:01,675 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-09 01:24:01,675 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-09 01:24:01,675 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-09 01:24:01,675 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-09 01:24:01,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 01:24:01,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:24:01,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:24:01,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-09 01:24:01,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-09 01:24:01,679 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:24:01,799 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:24:01,800 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:24:02,250 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:24:02,251 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:24:02,518 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:24:02,518 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:24:02,518 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:24:02 BoogieIcfgContainer [2025-03-09 01:24:02,519 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:24:02,520 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:24:02,520 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:24:02,524 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:24:02,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:24:01" (1/3) ... [2025-03-09 01:24:02,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@733615e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:24:02, skipping insertion in model container [2025-03-09 01:24:02,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:24:01" (2/3) ... [2025-03-09 01:24:02,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@733615e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:24:02, skipping insertion in model container [2025-03-09 01:24:02,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:24:02" (3/3) ... [2025-03-09 01:24:02,526 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt3.wvr.c [2025-03-09 01:24:02,537 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:24:02,538 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-buffer-mult-alt3.wvr.c that has 5 procedures, 61 locations, 1 initial locations, 6 loop locations, and 14 error locations. [2025-03-09 01:24:02,539 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:24:02,614 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-09 01:24:02,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 66 transitions, 160 flow [2025-03-09 01:24:02,668 INFO L124 PetriNetUnfolderBase]: 6/62 cut-off events. [2025-03-09 01:24:02,672 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-09 01:24:02,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 62 events. 6/62 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 144 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2025-03-09 01:24:02,676 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 66 transitions, 160 flow [2025-03-09 01:24:02,678 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 61 transitions, 146 flow [2025-03-09 01:24:02,688 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:24:02,697 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;@234fcb4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:24:02,698 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-03-09 01:24:02,701 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:24:02,701 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-09 01:24:02,701 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:24:02,701 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:24:02,702 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:24:02,702 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-09 01:24:02,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:24:02,706 INFO L85 PathProgramCache]: Analyzing trace with hash 771906, now seen corresponding path program 1 times [2025-03-09 01:24:02,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:24:02,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [29256510] [2025-03-09 01:24:02,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:24:02,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:24:02,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:24:02,717 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) [2025-03-09 01:24:02,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:24:02,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:24:02,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:24:02,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:24:02,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:02,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:24:02,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:24:02,838 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 6 treesize of output 7 [2025-03-09 01:24:02,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:24:02,860 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:24:02,861 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 01:24:02,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29256510] [2025-03-09 01:24:02,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [29256510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:24:02,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:24:02,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:24:02,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954574087] [2025-03-09 01:24:02,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:24:02,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:24:02,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 01:24:02,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:24:02,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:24:02,926 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-09 01:24:02,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 61 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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) [2025-03-09 01:24:02,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:24:02,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-09 01:24:02,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:24:04,687 INFO L124 PetriNetUnfolderBase]: 15159/20183 cut-off events. [2025-03-09 01:24:04,687 INFO L125 PetriNetUnfolderBase]: For 484/484 co-relation queries the response was YES. [2025-03-09 01:24:04,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40874 conditions, 20183 events. 15159/20183 cut-off events. For 484/484 co-relation queries the response was YES. Maximal size of possible extension queue 1085. Compared 116347 event pairs, 12544 based on Foata normal form. 1/14315 useless extension candidates. Maximal degree in co-relation 38292. Up to 19683 conditions per place. [2025-03-09 01:24:04,830 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 44 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2025-03-09 01:24:04,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 57 transitions, 230 flow [2025-03-09 01:24:04,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:24:04,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:24:04,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2025-03-09 01:24:04,839 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4898989898989899 [2025-03-09 01:24:04,839 INFO L175 Difference]: Start difference. First operand has 68 places, 61 transitions, 146 flow. Second operand 3 states and 97 transitions. [2025-03-09 01:24:04,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 57 transitions, 230 flow [2025-03-09 01:24:04,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 57 transitions, 214 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-09 01:24:04,870 INFO L231 Difference]: Finished difference. Result has 58 places, 57 transitions, 126 flow [2025-03-09 01:24:04,872 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=58, PETRI_TRANSITIONS=57} [2025-03-09 01:24:04,874 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -10 predicate places. [2025-03-09 01:24:04,874 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 126 flow [2025-03-09 01:24:04,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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) [2025-03-09 01:24:04,875 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:24:04,875 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:24:04,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 01:24:05,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:24:05,078 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-09 01:24:05,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:24:05,079 INFO L85 PathProgramCache]: Analyzing trace with hash 771907, now seen corresponding path program 1 times [2025-03-09 01:24:05,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:24:05,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [983389985] [2025-03-09 01:24:05,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:24:05,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:24:05,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:24:05,082 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) [2025-03-09 01:24:05,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:24:05,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:24:05,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:24:05,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:24:05,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:05,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 01:24:05,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:24:05,164 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 7 [2025-03-09 01:24:05,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:24:05,238 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:24:05,238 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 01:24:05,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983389985] [2025-03-09 01:24:05,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983389985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:24:05,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:24:05,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:24:05,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832630085] [2025-03-09 01:24:05,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:24:05,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:24:05,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 01:24:05,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:24:05,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:24:05,263 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-09 01:24:05,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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) [2025-03-09 01:24:05,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:24:05,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-09 01:24:05,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:24:06,872 INFO L124 PetriNetUnfolderBase]: 15161/20189 cut-off events. [2025-03-09 01:24:06,873 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-03-09 01:24:06,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40242 conditions, 20189 events. 15161/20189 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 1085. Compared 116279 event pairs, 12544 based on Foata normal form. 0/14318 useless extension candidates. Maximal degree in co-relation 40206. Up to 19692 conditions per place. [2025-03-09 01:24:06,951 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 47 selfloop transitions, 7 changer transitions 0/63 dead transitions. [2025-03-09 01:24:06,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 63 transitions, 248 flow [2025-03-09 01:24:06,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:24:06,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:24:06,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2025-03-09 01:24:06,955 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2025-03-09 01:24:06,957 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 126 flow. Second operand 4 states and 120 transitions. [2025-03-09 01:24:06,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 63 transitions, 248 flow [2025-03-09 01:24:06,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 63 transitions, 242 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:24:06,959 INFO L231 Difference]: Finished difference. Result has 62 places, 63 transitions, 178 flow [2025-03-09 01:24:06,960 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=178, PETRI_PLACES=62, PETRI_TRANSITIONS=63} [2025-03-09 01:24:06,961 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -6 predicate places. [2025-03-09 01:24:06,962 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 63 transitions, 178 flow [2025-03-09 01:24:06,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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) [2025-03-09 01:24:06,962 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:24:06,962 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-09 01:24:06,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 01:24:07,162 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 [2025-03-09 01:24:07,163 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-09 01:24:07,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:24:07,163 INFO L85 PathProgramCache]: Analyzing trace with hash 741827837, now seen corresponding path program 1 times [2025-03-09 01:24:07,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:24:07,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2072150434] [2025-03-09 01:24:07,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:24:07,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:24:07,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:24:07,166 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) [2025-03-09 01:24:07,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 01:24:07,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:24:07,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:24:07,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:24:07,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:07,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:24:07,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:24:07,239 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 7 [2025-03-09 01:24:07,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:24:07,332 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:24:07,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:24:07,492 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 01:24:07,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072150434] [2025-03-09 01:24:07,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072150434] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:24:07,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:24:07,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2025-03-09 01:24:07,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282529869] [2025-03-09 01:24:07,493 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 01:24:07,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 01:24:07,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 01:24:07,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 01:24:07,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:24:07,553 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-09 01:24:07,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 63 transitions, 178 flow. Second operand has 8 states, 8 states have (on average 17.25) internal successors, (138), 8 states have internal predecessors, (138), 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) [2025-03-09 01:24:07,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:24:07,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-09 01:24:07,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:24:09,462 INFO L124 PetriNetUnfolderBase]: 15167/20207 cut-off events. [2025-03-09 01:24:09,463 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-03-09 01:24:09,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40320 conditions, 20207 events. 15167/20207 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 1085. Compared 116357 event pairs, 12544 based on Foata normal form. 0/14334 useless extension candidates. Maximal degree in co-relation 40217. Up to 19695 conditions per place. [2025-03-09 01:24:09,573 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 47 selfloop transitions, 25 changer transitions 0/81 dead transitions. [2025-03-09 01:24:09,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 81 transitions, 400 flow [2025-03-09 01:24:09,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:24:09,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 01:24:09,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 238 transitions. [2025-03-09 01:24:09,578 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3606060606060606 [2025-03-09 01:24:09,578 INFO L175 Difference]: Start difference. First operand has 62 places, 63 transitions, 178 flow. Second operand 10 states and 238 transitions. [2025-03-09 01:24:09,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 81 transitions, 400 flow [2025-03-09 01:24:09,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 81 transitions, 400 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 01:24:09,579 INFO L231 Difference]: Finished difference. Result has 74 places, 81 transitions, 340 flow [2025-03-09 01:24:09,581 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=340, PETRI_PLACES=74, PETRI_TRANSITIONS=81} [2025-03-09 01:24:09,582 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 6 predicate places. [2025-03-09 01:24:09,582 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 81 transitions, 340 flow [2025-03-09 01:24:09,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.25) internal successors, (138), 8 states have internal predecessors, (138), 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) [2025-03-09 01:24:09,583 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:24:09,583 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:24:09,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 01:24:09,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:24:09,784 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-09 01:24:09,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:24:09,785 INFO L85 PathProgramCache]: Analyzing trace with hash -2126028959, now seen corresponding path program 1 times [2025-03-09 01:24:09,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:24:09,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1658048325] [2025-03-09 01:24:09,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:24:09,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:24:09,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:24:09,787 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:24:09,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 01:24:09,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:24:09,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:24:09,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:24:09,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:09,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:24:09,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:24:09,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:24:09,890 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:24:09,890 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 01:24:09,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658048325] [2025-03-09 01:24:09,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658048325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:24:09,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:24:09,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:24:09,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266555976] [2025-03-09 01:24:09,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:24:09,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:24:09,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 01:24:09,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:24:09,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:24:09,905 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-03-09 01:24:09,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 81 transitions, 340 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 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) [2025-03-09 01:24:09,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:24:09,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-03-09 01:24:09,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:24:11,626 INFO L124 PetriNetUnfolderBase]: 18054/24297 cut-off events. [2025-03-09 01:24:11,627 INFO L125 PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES. [2025-03-09 01:24:11,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48562 conditions, 24297 events. 18054/24297 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 1234. Compared 144922 event pairs, 15126 based on Foata normal form. 630/18635 useless extension candidates. Maximal degree in co-relation 48474. Up to 19710 conditions per place. [2025-03-09 01:24:11,803 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 112 selfloop transitions, 3 changer transitions 0/126 dead transitions. [2025-03-09 01:24:11,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 126 transitions, 740 flow [2025-03-09 01:24:11,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:24:11,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:24:11,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 160 transitions. [2025-03-09 01:24:11,805 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2025-03-09 01:24:11,805 INFO L175 Difference]: Start difference. First operand has 74 places, 81 transitions, 340 flow. Second operand 4 states and 160 transitions. [2025-03-09 01:24:11,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 126 transitions, 740 flow [2025-03-09 01:24:11,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 126 transitions, 646 flow, removed 29 selfloop flow, removed 4 redundant places. [2025-03-09 01:24:11,811 INFO L231 Difference]: Finished difference. Result has 74 places, 81 transitions, 295 flow [2025-03-09 01:24:11,811 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=295, PETRI_PLACES=74, PETRI_TRANSITIONS=81} [2025-03-09 01:24:11,812 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 6 predicate places. [2025-03-09 01:24:11,813 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 81 transitions, 295 flow [2025-03-09 01:24:11,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 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) [2025-03-09 01:24:11,813 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:24:11,813 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:24:11,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 01:24:12,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:24:12,019 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-09 01:24:12,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:24:12,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1580942823, now seen corresponding path program 1 times [2025-03-09 01:24:12,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:24:12,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2108639265] [2025-03-09 01:24:12,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:24:12,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:24:12,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:24:12,023 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:24:12,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 01:24:12,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:24:12,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:24:12,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:24:12,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:12,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 01:24:12,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:24:12,094 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 6 treesize of output 7 [2025-03-09 01:24:12,123 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2025-03-09 01:24:12,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2025-03-09 01:24:12,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:24:12,145 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:24:12,145 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 01:24:12,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108639265] [2025-03-09 01:24:12,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108639265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:24:12,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:24:12,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:24:12,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106190256] [2025-03-09 01:24:12,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:24:12,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:24:12,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 01:24:12,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:24:12,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:24:12,169 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-09 01:24:12,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 81 transitions, 295 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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) [2025-03-09 01:24:12,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:24:12,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-09 01:24:12,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:24:13,098 INFO L124 PetriNetUnfolderBase]: 13854/18665 cut-off events. [2025-03-09 01:24:13,099 INFO L125 PetriNetUnfolderBase]: For 1208/1208 co-relation queries the response was YES. [2025-03-09 01:24:13,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39638 conditions, 18665 events. 13854/18665 cut-off events. For 1208/1208 co-relation queries the response was YES. Maximal size of possible extension queue 931. Compared 107695 event pairs, 11474 based on Foata normal form. 0/14505 useless extension candidates. Maximal degree in co-relation 39562. Up to 18216 conditions per place. [2025-03-09 01:24:13,209 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 57 selfloop transitions, 11 changer transitions 0/79 dead transitions. [2025-03-09 01:24:13,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 79 transitions, 423 flow [2025-03-09 01:24:13,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:24:13,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:24:13,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2025-03-09 01:24:13,210 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38181818181818183 [2025-03-09 01:24:13,210 INFO L175 Difference]: Start difference. First operand has 74 places, 81 transitions, 295 flow. Second operand 5 states and 126 transitions. [2025-03-09 01:24:13,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 79 transitions, 423 flow [2025-03-09 01:24:13,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 79 transitions, 419 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-09 01:24:13,213 INFO L231 Difference]: Finished difference. Result has 75 places, 79 transitions, 305 flow [2025-03-09 01:24:13,213 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=305, PETRI_PLACES=75, PETRI_TRANSITIONS=79} [2025-03-09 01:24:13,214 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 7 predicate places. [2025-03-09 01:24:13,214 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 79 transitions, 305 flow [2025-03-09 01:24:13,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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) [2025-03-09 01:24:13,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:24:13,214 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:24:13,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 01:24:13,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:24:13,415 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-09 01:24:13,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:24:13,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1580942824, now seen corresponding path program 1 times [2025-03-09 01:24:13,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:24:13,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [665415784] [2025-03-09 01:24:13,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:24:13,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:24:13,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:24:13,417 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:24:13,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 01:24:13,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:24:13,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:24:13,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:24:13,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:13,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 01:24:13,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:24:13,497 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 6 treesize of output 7 [2025-03-09 01:24:13,504 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 7 [2025-03-09 01:24:13,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:24:13,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-09 01:24:13,647 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-09 01:24:13,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-03-09 01:24:13,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:24:13,722 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:24:14,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:24:14,319 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 01:24:14,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665415784] [2025-03-09 01:24:14,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665415784] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:24:14,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:24:14,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2025-03-09 01:24:14,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361787315] [2025-03-09 01:24:14,320 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 01:24:14,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:24:14,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 01:24:14,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:24:14,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:24:14,449 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 66 [2025-03-09 01:24:14,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 79 transitions, 305 flow. Second operand has 10 states, 10 states have (on average 15.6) internal successors, (156), 10 states have internal predecessors, (156), 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) [2025-03-09 01:24:14,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:24:14,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 66 [2025-03-09 01:24:14,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:24:20,437 INFO L124 PetriNetUnfolderBase]: 28720/38505 cut-off events. [2025-03-09 01:24:20,437 INFO L125 PetriNetUnfolderBase]: For 3159/3159 co-relation queries the response was YES. [2025-03-09 01:24:20,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81177 conditions, 38505 events. 28720/38505 cut-off events. For 3159/3159 co-relation queries the response was YES. Maximal size of possible extension queue 1442. Compared 232523 event pairs, 23186 based on Foata normal form. 0/31839 useless extension candidates. Maximal degree in co-relation 72782. Up to 14255 conditions per place. [2025-03-09 01:24:20,854 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 131 selfloop transitions, 46 changer transitions 0/186 dead transitions. [2025-03-09 01:24:20,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 186 transitions, 1036 flow [2025-03-09 01:24:20,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 01:24:20,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-09 01:24:20,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 345 transitions. [2025-03-09 01:24:20,856 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37337662337662336 [2025-03-09 01:24:20,857 INFO L175 Difference]: Start difference. First operand has 75 places, 79 transitions, 305 flow. Second operand 14 states and 345 transitions. [2025-03-09 01:24:20,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 186 transitions, 1036 flow [2025-03-09 01:24:20,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 186 transitions, 993 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:24:20,860 INFO L231 Difference]: Finished difference. Result has 91 places, 105 transitions, 588 flow [2025-03-09 01:24:20,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=588, PETRI_PLACES=91, PETRI_TRANSITIONS=105} [2025-03-09 01:24:20,861 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 23 predicate places. [2025-03-09 01:24:20,861 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 105 transitions, 588 flow [2025-03-09 01:24:20,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.6) internal successors, (156), 10 states have internal predecessors, (156), 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) [2025-03-09 01:24:20,861 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:24:20,861 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:24:20,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 01:24:21,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:24:21,062 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-09 01:24:21,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:24:21,062 INFO L85 PathProgramCache]: Analyzing trace with hash 606513245, now seen corresponding path program 1 times [2025-03-09 01:24:21,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:24:21,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1754915928] [2025-03-09 01:24:21,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:24:21,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:24:21,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:24:21,064 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:24:21,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 01:24:21,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:24:21,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:24:21,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:24:21,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:21,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:24:21,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:24:21,120 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 6 treesize of output 7 [2025-03-09 01:24:21,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:24:21,138 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:24:21,138 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 01:24:21,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754915928] [2025-03-09 01:24:21,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754915928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:24:21,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:24:21,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:24:21,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795786017] [2025-03-09 01:24:21,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:24:21,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:24:21,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 01:24:21,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:24:21,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:24:21,156 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-09 01:24:21,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 105 transitions, 588 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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) [2025-03-09 01:24:21,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:24:21,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-09 01:24:21,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:24:22,715 INFO L124 PetriNetUnfolderBase]: 21093/28358 cut-off events. [2025-03-09 01:24:22,715 INFO L125 PetriNetUnfolderBase]: For 7371/7371 co-relation queries the response was YES. [2025-03-09 01:24:22,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61676 conditions, 28358 events. 21093/28358 cut-off events. For 7371/7371 co-relation queries the response was YES. Maximal size of possible extension queue 1015. Compared 164566 event pairs, 16706 based on Foata normal form. 0/25270 useless extension candidates. Maximal degree in co-relation 61577. Up to 27633 conditions per place. [2025-03-09 01:24:22,878 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 82 selfloop transitions, 10 changer transitions 0/103 dead transitions. [2025-03-09 01:24:22,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 103 transitions, 768 flow [2025-03-09 01:24:22,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:24:22,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:24:22,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2025-03-09 01:24:22,879 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2025-03-09 01:24:22,879 INFO L175 Difference]: Start difference. First operand has 91 places, 105 transitions, 588 flow. Second operand 4 states and 108 transitions. [2025-03-09 01:24:22,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 103 transitions, 768 flow [2025-03-09 01:24:22,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 103 transitions, 765 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:24:22,888 INFO L231 Difference]: Finished difference. Result has 91 places, 103 transitions, 601 flow [2025-03-09 01:24:22,888 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=601, PETRI_PLACES=91, PETRI_TRANSITIONS=103} [2025-03-09 01:24:22,888 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 23 predicate places. [2025-03-09 01:24:22,889 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 103 transitions, 601 flow [2025-03-09 01:24:22,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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) [2025-03-09 01:24:22,889 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:24:22,889 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:24:22,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 01:24:23,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:24:23,089 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-09 01:24:23,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:24:23,090 INFO L85 PathProgramCache]: Analyzing trace with hash 606513246, now seen corresponding path program 1 times [2025-03-09 01:24:23,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:24:23,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [654371294] [2025-03-09 01:24:23,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:24:23,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:24:23,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:24:23,092 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:24:23,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 01:24:23,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:24:23,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:24:23,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:24:23,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:23,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:24:23,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:24:23,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:24:23,195 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:24:23,195 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 01:24:23,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654371294] [2025-03-09 01:24:23,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654371294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:24:23,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:24:23,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:24:23,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351232652] [2025-03-09 01:24:23,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:24:23,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:24:23,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 01:24:23,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:24:23,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:24:23,212 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-03-09 01:24:23,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 103 transitions, 601 flow. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:24:23,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:24:23,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-03-09 01:24:23,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:24:25,971 INFO L124 PetriNetUnfolderBase]: 26874/36803 cut-off events. [2025-03-09 01:24:25,971 INFO L125 PetriNetUnfolderBase]: For 9865/9865 co-relation queries the response was YES. [2025-03-09 01:24:26,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80112 conditions, 36803 events. 26874/36803 cut-off events. For 9865/9865 co-relation queries the response was YES. Maximal size of possible extension queue 1270. Compared 227867 event pairs, 21735 based on Foata normal form. 1016/35413 useless extension candidates. Maximal degree in co-relation 60144. Up to 27677 conditions per place. [2025-03-09 01:24:26,303 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 108 selfloop transitions, 12 changer transitions 0/131 dead transitions. [2025-03-09 01:24:26,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 131 transitions, 921 flow [2025-03-09 01:24:26,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:24:26,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:24:26,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 149 transitions. [2025-03-09 01:24:26,304 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5643939393939394 [2025-03-09 01:24:26,304 INFO L175 Difference]: Start difference. First operand has 91 places, 103 transitions, 601 flow. Second operand 4 states and 149 transitions. [2025-03-09 01:24:26,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 131 transitions, 921 flow [2025-03-09 01:24:26,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 131 transitions, 910 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:24:26,320 INFO L231 Difference]: Finished difference. Result has 93 places, 103 transitions, 625 flow [2025-03-09 01:24:26,320 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=625, PETRI_PLACES=93, PETRI_TRANSITIONS=103} [2025-03-09 01:24:26,320 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 25 predicate places. [2025-03-09 01:24:26,320 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 103 transitions, 625 flow [2025-03-09 01:24:26,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:24:26,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:24:26,321 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2025-03-09 01:24:26,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-09 01:24:26,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:24:26,521 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-09 01:24:26,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:24:26,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1966237909, now seen corresponding path program 2 times [2025-03-09 01:24:26,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:24:26,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [182919695] [2025-03-09 01:24:26,522 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:24:26,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:24:26,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:24:26,523 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:24:26,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 01:24:26,572 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-09 01:24:26,585 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:24:26,585 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:24:26,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:26,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 01:24:26,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:24:26,592 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 7 [2025-03-09 01:24:26,748 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:24:26,748 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:24:27,262 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:24:27,262 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 01:24:27,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182919695] [2025-03-09 01:24:27,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182919695] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:24:27,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:24:27,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2025-03-09 01:24:27,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680888083] [2025-03-09 01:24:27,263 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 01:24:27,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 01:24:27,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 01:24:27,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 01:24:27,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:24:27,460 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-09 01:24:27,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 103 transitions, 625 flow. Second operand has 14 states, 14 states have (on average 17.571428571428573) internal successors, (246), 14 states have internal predecessors, (246), 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) [2025-03-09 01:24:27,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:24:27,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-09 01:24:27,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:24:30,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 01:24:37,599 INFO L124 PetriNetUnfolderBase]: 26904/36893 cut-off events. [2025-03-09 01:24:37,599 INFO L125 PetriNetUnfolderBase]: For 12141/12141 co-relation queries the response was YES. [2025-03-09 01:24:37,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84852 conditions, 36893 events. 26904/36893 cut-off events. For 12141/12141 co-relation queries the response was YES. Maximal size of possible extension queue 1241. Compared 228791 event pairs, 21735 based on Foata normal form. 30/33627 useless extension candidates. Maximal degree in co-relation 64263. Up to 35723 conditions per place. [2025-03-09 01:24:37,918 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 47 selfloop transitions, 107 changer transitions 0/163 dead transitions. [2025-03-09 01:24:37,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 163 transitions, 1413 flow [2025-03-09 01:24:37,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-09 01:24:37,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-09 01:24:37,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 468 transitions. [2025-03-09 01:24:37,921 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32231404958677684 [2025-03-09 01:24:37,922 INFO L175 Difference]: Start difference. First operand has 93 places, 103 transitions, 625 flow. Second operand 22 states and 468 transitions. [2025-03-09 01:24:37,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 163 transitions, 1413 flow [2025-03-09 01:24:37,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 163 transitions, 1398 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:24:37,966 INFO L231 Difference]: Finished difference. Result has 119 places, 163 transitions, 1394 flow [2025-03-09 01:24:37,966 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1394, PETRI_PLACES=119, PETRI_TRANSITIONS=163} [2025-03-09 01:24:37,966 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 51 predicate places. [2025-03-09 01:24:37,966 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 163 transitions, 1394 flow [2025-03-09 01:24:37,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 17.571428571428573) internal successors, (246), 14 states have internal predecessors, (246), 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) [2025-03-09 01:24:37,967 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:24:37,967 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:24:37,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-09 01:24:38,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:24:38,167 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-09 01:24:38,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:24:38,168 INFO L85 PathProgramCache]: Analyzing trace with hash 991665627, now seen corresponding path program 1 times [2025-03-09 01:24:38,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:24:38,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1028098568] [2025-03-09 01:24:38,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:24:38,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:24:38,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:24:38,170 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:24:38,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 01:24:38,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:24:38,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:24:38,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:24:38,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:38,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 01:24:38,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:24:38,237 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 7 [2025-03-09 01:24:38,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:24:38,377 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:24:38,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:24:38,927 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 01:24:38,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028098568] [2025-03-09 01:24:38,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028098568] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:24:38,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:24:38,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-03-09 01:24:38,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863635813] [2025-03-09 01:24:38,927 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 01:24:38,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:24:38,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 01:24:38,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:24:38,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:24:39,122 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-09 01:24:39,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 163 transitions, 1394 flow. Second operand has 10 states, 10 states have (on average 17.9) internal successors, (179), 10 states have internal predecessors, (179), 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) [2025-03-09 01:24:39,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:24:39,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-09 01:24:39,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:24:45,589 INFO L124 PetriNetUnfolderBase]: 56136/76369 cut-off events. [2025-03-09 01:24:45,590 INFO L125 PetriNetUnfolderBase]: For 25786/25786 co-relation queries the response was YES. [2025-03-09 01:24:46,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174189 conditions, 76369 events. 56136/76369 cut-off events. For 25786/25786 co-relation queries the response was YES. Maximal size of possible extension queue 2242. Compared 499409 event pairs, 44295 based on Foata normal form. 0/73885 useless extension candidates. Maximal degree in co-relation 173946. Up to 27686 conditions per place. [2025-03-09 01:24:46,273 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 148 selfloop transitions, 100 changer transitions 0/257 dead transitions. [2025-03-09 01:24:46,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 257 transitions, 2158 flow [2025-03-09 01:24:46,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:24:46,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 01:24:46,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 313 transitions. [2025-03-09 01:24:46,275 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47424242424242424 [2025-03-09 01:24:46,275 INFO L175 Difference]: Start difference. First operand has 119 places, 163 transitions, 1394 flow. Second operand 10 states and 313 transitions. [2025-03-09 01:24:46,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 257 transitions, 2158 flow [2025-03-09 01:24:46,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 257 transitions, 1878 flow, removed 87 selfloop flow, removed 9 redundant places. [2025-03-09 01:24:46,341 INFO L231 Difference]: Finished difference. Result has 121 places, 163 transitions, 1327 flow [2025-03-09 01:24:46,341 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=1114, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1327, PETRI_PLACES=121, PETRI_TRANSITIONS=163} [2025-03-09 01:24:46,342 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 53 predicate places. [2025-03-09 01:24:46,342 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 163 transitions, 1327 flow [2025-03-09 01:24:46,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.9) internal successors, (179), 10 states have internal predecessors, (179), 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) [2025-03-09 01:24:46,342 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:24:46,342 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:24:46,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-09 01:24:46,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:24:46,543 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-09 01:24:46,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:24:46,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1311981690, now seen corresponding path program 2 times [2025-03-09 01:24:46,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:24:46,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [155893597] [2025-03-09 01:24:46,543 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:24:46,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:24:46,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:24:46,545 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:24:46,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 01:24:46,587 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-09 01:24:46,606 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 16 statements. [2025-03-09 01:24:46,606 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:24:46,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:46,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 01:24:46,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:24:46,615 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 7 [2025-03-09 01:24:46,621 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 6 treesize of output 7 [2025-03-09 01:24:46,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:24:46,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-09 01:24:46,706 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-09 01:24:46,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-03-09 01:24:46,742 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 01:24:46,742 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:24:46,742 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 01:24:46,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155893597] [2025-03-09 01:24:46,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155893597] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:24:46,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:24:46,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:24:46,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646879647] [2025-03-09 01:24:46,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:24:46,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:24:46,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 01:24:46,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:24:46,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:24:46,763 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-09 01:24:46,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 163 transitions, 1327 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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) [2025-03-09 01:24:46,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:24:46,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-09 01:24:46,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:24:51,610 INFO L124 PetriNetUnfolderBase]: 49262/67106 cut-off events. [2025-03-09 01:24:51,610 INFO L125 PetriNetUnfolderBase]: For 33495/33495 co-relation queries the response was YES. [2025-03-09 01:24:51,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151202 conditions, 67106 events. 49262/67106 cut-off events. For 33495/33495 co-relation queries the response was YES. Maximal size of possible extension queue 2014. Compared 434578 event pairs, 38491 based on Foata normal form. 1837/66335 useless extension candidates. Maximal degree in co-relation 150971. Up to 65238 conditions per place. [2025-03-09 01:24:52,169 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 138 selfloop transitions, 12 changer transitions 0/161 dead transitions. [2025-03-09 01:24:52,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 161 transitions, 1611 flow [2025-03-09 01:24:52,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:24:52,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:24:52,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2025-03-09 01:24:52,170 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4015151515151515 [2025-03-09 01:24:52,170 INFO L175 Difference]: Start difference. First operand has 121 places, 163 transitions, 1327 flow. Second operand 4 states and 106 transitions. [2025-03-09 01:24:52,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 161 transitions, 1611 flow [2025-03-09 01:24:52,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 161 transitions, 1543 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:24:52,210 INFO L231 Difference]: Finished difference. Result has 118 places, 161 transitions, 1267 flow [2025-03-09 01:24:52,210 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=1243, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1267, PETRI_PLACES=118, PETRI_TRANSITIONS=161} [2025-03-09 01:24:52,210 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 50 predicate places. [2025-03-09 01:24:52,210 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 161 transitions, 1267 flow [2025-03-09 01:24:52,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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) [2025-03-09 01:24:52,211 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:24:52,211 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:24:52,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-09 01:24:52,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:24:52,411 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-09 01:24:52,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:24:52,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1542374702, now seen corresponding path program 2 times [2025-03-09 01:24:52,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:24:52,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1867053520] [2025-03-09 01:24:52,412 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:24:52,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:24:52,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:24:52,414 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:24:52,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-09 01:24:52,466 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-09 01:24:52,496 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 18 statements. [2025-03-09 01:24:52,496 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:24:52,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:52,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 01:24:52,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:24:52,517 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 7 [2025-03-09 01:24:52,643 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 01:24:52,643 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:24:52,643 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 01:24:52,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867053520] [2025-03-09 01:24:52,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867053520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:24:52,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:24:52,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:24:52,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477347106] [2025-03-09 01:24:52,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:24:52,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:24:52,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 01:24:52,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:24:52,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:24:52,664 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-03-09 01:24:52,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 161 transitions, 1267 flow. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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) [2025-03-09 01:24:52,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:24:52,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-03-09 01:24:52,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:24:56,899 INFO L124 PetriNetUnfolderBase]: 43607/59614 cut-off events. [2025-03-09 01:24:56,899 INFO L125 PetriNetUnfolderBase]: For 19587/19587 co-relation queries the response was YES. [2025-03-09 01:24:57,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129654 conditions, 59614 events. 43607/59614 cut-off events. For 19587/19587 co-relation queries the response was YES. Maximal size of possible extension queue 1891. Compared 384512 event pairs, 33775 based on Foata normal form. 1249/58777 useless extension candidates. Maximal degree in co-relation 129426. Up to 57761 conditions per place. [2025-03-09 01:24:57,385 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 122 selfloop transitions, 26 changer transitions 0/159 dead transitions. [2025-03-09 01:24:57,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 159 transitions, 1547 flow [2025-03-09 01:24:57,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:24:57,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:24:57,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2025-03-09 01:24:57,386 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2025-03-09 01:24:57,386 INFO L175 Difference]: Start difference. First operand has 118 places, 161 transitions, 1267 flow. Second operand 4 states and 112 transitions. [2025-03-09 01:24:57,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 159 transitions, 1547 flow [2025-03-09 01:24:57,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 159 transitions, 1529 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:24:57,398 INFO L231 Difference]: Finished difference. Result has 115 places, 159 transitions, 1285 flow [2025-03-09 01:24:57,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=1233, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1285, PETRI_PLACES=115, PETRI_TRANSITIONS=159} [2025-03-09 01:24:57,398 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 47 predicate places. [2025-03-09 01:24:57,398 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 159 transitions, 1285 flow [2025-03-09 01:24:57,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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) [2025-03-09 01:24:57,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:24:57,398 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1] [2025-03-09 01:24:57,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-09 01:24:57,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:24:57,599 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-09 01:24:57,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:24:57,599 INFO L85 PathProgramCache]: Analyzing trace with hash 976964615, now seen corresponding path program 3 times [2025-03-09 01:24:57,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:24:57,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [178171869] [2025-03-09 01:24:57,599 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:24:57,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:24:57,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:24:57,601 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:24:57,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-09 01:24:57,649 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 11 equivalence classes. [2025-03-09 01:24:58,015 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:24:58,015 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-09 01:24:58,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:58,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-09 01:24:58,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:24:58,028 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 7 [2025-03-09 01:24:58,560 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:24:58,560 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:25:00,274 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:25:00,275 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 01:25:00,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178171869] [2025-03-09 01:25:00,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178171869] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:25:00,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:25:00,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 24 [2025-03-09 01:25:00,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12688986] [2025-03-09 01:25:00,275 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 01:25:00,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-09 01:25:00,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 01:25:00,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-09 01:25:00,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=477, Unknown=0, NotChecked=0, Total=650 [2025-03-09 01:25:00,969 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-09 01:25:00,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 159 transitions, 1285 flow. Second operand has 26 states, 26 states have (on average 17.76923076923077) internal successors, (462), 26 states have internal predecessors, (462), 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) [2025-03-09 01:25:00,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:25:00,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-09 01:25:00,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand