./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/chl-chromosome-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 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/chl-chromosome-symm.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 23ca06a4d1d66eab783b29fc3ce31114eee62eb7d17a2452b84e2d73b8d92cfa --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:06:29,600 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:06:29,656 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:06:29,664 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:06:29,664 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:06:29,680 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:06:29,681 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:06:29,681 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:06:29,682 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:06:29,682 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:06:29,682 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:06:29,683 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:06:29,683 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:06:29,683 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:06:29,683 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:06:29,683 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:06:29,683 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:06:29,683 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:06:29,683 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:06:29,683 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:06:29,683 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:06:29,683 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:06:29,683 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:06:29,683 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:06:29,683 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:06:29,683 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:06:29,683 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:06:29,683 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:06:29,683 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:06:29,683 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:06:29,684 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:06:29,684 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:06:29,684 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:06:29,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:06:29,684 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:06:29,684 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:06:29,684 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:06:29,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:06:29,684 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:06:29,684 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:06:29,684 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:06:29,684 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:06:29,684 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 -> 23ca06a4d1d66eab783b29fc3ce31114eee62eb7d17a2452b84e2d73b8d92cfa [2025-03-04 10:06:29,920 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:06:29,926 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:06:29,928 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:06:29,929 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:06:29,929 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:06:29,930 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-chromosome-symm.wvr.c [2025-03-04 10:06:31,090 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfba84556/5af6059efeb6490ca05fdcc67fe33dc6/FLAGa1c4270d6 [2025-03-04 10:06:31,304 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:06:31,305 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-chromosome-symm.wvr.c [2025-03-04 10:06:31,310 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfba84556/5af6059efeb6490ca05fdcc67fe33dc6/FLAGa1c4270d6 [2025-03-04 10:06:31,666 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfba84556/5af6059efeb6490ca05fdcc67fe33dc6 [2025-03-04 10:06:31,667 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:06:31,668 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:06:31,669 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:06:31,669 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:06:31,672 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:06:31,673 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:06:31" (1/1) ... [2025-03-04 10:06:31,673 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4afc62f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:31, skipping insertion in model container [2025-03-04 10:06:31,673 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:06:31" (1/1) ... [2025-03-04 10:06:31,684 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:06:31,790 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-04 10:06:31,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:06:31,800 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:06:31,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:06:31,822 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:06:31,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:31 WrapperNode [2025-03-04 10:06:31,823 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:06:31,823 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:06:31,823 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:06:31,823 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:06:31,827 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:31" (1/1) ... [2025-03-04 10:06:31,831 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:31" (1/1) ... [2025-03-04 10:06:31,845 INFO L138 Inliner]: procedures = 24, calls = 28, calls flagged for inlining = 16, calls inlined = 20, statements flattened = 181 [2025-03-04 10:06:31,845 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:06:31,846 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:06:31,846 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:06:31,846 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:06:31,850 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:31" (1/1) ... [2025-03-04 10:06:31,851 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:31" (1/1) ... [2025-03-04 10:06:31,852 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:31" (1/1) ... [2025-03-04 10:06:31,860 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-04 10:06:31,861 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:31" (1/1) ... [2025-03-04 10:06:31,861 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:31" (1/1) ... [2025-03-04 10:06:31,865 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:31" (1/1) ... [2025-03-04 10:06:31,869 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:31" (1/1) ... [2025-03-04 10:06:31,870 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:31" (1/1) ... [2025-03-04 10:06:31,870 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:31" (1/1) ... [2025-03-04 10:06:31,871 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:06:31,872 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:06:31,872 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:06:31,872 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:06:31,872 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:31" (1/1) ... [2025-03-04 10:06:31,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:06:31,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:31,896 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-04 10:06:31,898 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-04 10:06:31,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:06:31,913 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:06:31,913 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:06:31,913 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:06:31,913 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:06:31,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:06:31,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:06:31,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:06:31,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:06:31,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:06:31,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:06:31,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:06:31,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:06:31,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:06:31,914 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 10:06:31,976 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:06:31,977 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:06:32,341 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:06:32,344 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:06:32,573 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:06:32,574 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:06:32,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:06:32 BoogieIcfgContainer [2025-03-04 10:06:32,575 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:06:32,576 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:06:32,577 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:06:32,580 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:06:32,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:06:31" (1/3) ... [2025-03-04 10:06:32,581 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b9bcff2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:06:32, skipping insertion in model container [2025-03-04 10:06:32,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:31" (2/3) ... [2025-03-04 10:06:32,581 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b9bcff2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:06:32, skipping insertion in model container [2025-03-04 10:06:32,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:06:32" (3/3) ... [2025-03-04 10:06:32,583 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-chromosome-symm.wvr.c [2025-03-04 10:06:32,596 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:06:32,597 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-chromosome-symm.wvr.c that has 3 procedures, 39 locations, 1 initial locations, 4 loop locations, and 14 error locations. [2025-03-04 10:06:32,597 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:06:32,649 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 10:06:32,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 42 transitions, 98 flow [2025-03-04 10:06:32,702 INFO L124 PetriNetUnfolderBase]: 4/40 cut-off events. [2025-03-04 10:06:32,704 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:06:32,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 40 events. 4/40 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 87 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2025-03-04 10:06:32,708 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 42 transitions, 98 flow [2025-03-04 10:06:32,710 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 39 transitions, 90 flow [2025-03-04 10:06:32,716 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:06:32,725 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;@1bfbd09c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:06:32,725 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2025-03-04 10:06:32,727 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:06:32,728 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-04 10:06:32,728 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:06:32,728 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:32,728 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:06:32,729 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 10:06:32,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:32,733 INFO L85 PathProgramCache]: Analyzing trace with hash 551281, now seen corresponding path program 1 times [2025-03-04 10:06:32,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:32,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171533739] [2025-03-04 10:06:32,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:32,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:32,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:06:32,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:06:32,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:32,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:32,924 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-04 10:06:32,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:32,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171533739] [2025-03-04 10:06:32,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171533739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:06:32,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:06:32,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:06:32,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494602090] [2025-03-04 10:06:32,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:32,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:06:32,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:32,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:06:32,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:06:32,984 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2025-03-04 10:06:32,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 39 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-04 10:06:32,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:32,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2025-03-04 10:06:32,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:33,076 INFO L124 PetriNetUnfolderBase]: 39/118 cut-off events. [2025-03-04 10:06:33,076 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-04 10:06:33,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 118 events. 39/118 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 429 event pairs, 22 based on Foata normal form. 1/93 useless extension candidates. Maximal degree in co-relation 162. Up to 68 conditions per place. [2025-03-04 10:06:33,080 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 18 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2025-03-04 10:06:33,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 35 transitions, 122 flow [2025-03-04 10:06:33,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:06:33,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:06:33,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2025-03-04 10:06:33,090 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2025-03-04 10:06:33,092 INFO L175 Difference]: Start difference. First operand has 42 places, 39 transitions, 90 flow. Second operand 3 states and 77 transitions. [2025-03-04 10:06:33,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 35 transitions, 122 flow [2025-03-04 10:06:33,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 35 transitions, 114 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:06:33,097 INFO L231 Difference]: Finished difference. Result has 36 places, 35 transitions, 78 flow [2025-03-04 10:06:33,099 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=36, PETRI_TRANSITIONS=35} [2025-03-04 10:06:33,102 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, -6 predicate places. [2025-03-04 10:06:33,103 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 35 transitions, 78 flow [2025-03-04 10:06:33,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-04 10:06:33,103 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:33,103 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:06:33,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:06:33,104 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 10:06:33,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:33,105 INFO L85 PathProgramCache]: Analyzing trace with hash 551282, now seen corresponding path program 1 times [2025-03-04 10:06:33,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:33,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173027593] [2025-03-04 10:06:33,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:33,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:33,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:06:33,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:06:33,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:33,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:33,278 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-04 10:06:33,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:33,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173027593] [2025-03-04 10:06:33,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173027593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:06:33,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:06:33,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:06:33,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932364762] [2025-03-04 10:06:33,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:33,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:06:33,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:33,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:06:33,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:06:33,312 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2025-03-04 10:06:33,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 35 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:33,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:33,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2025-03-04 10:06:33,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:33,423 INFO L124 PetriNetUnfolderBase]: 39/122 cut-off events. [2025-03-04 10:06:33,423 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:06:33,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 122 events. 39/122 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 425 event pairs, 22 based on Foata normal form. 1/96 useless extension candidates. Maximal degree in co-relation 179. Up to 76 conditions per place. [2025-03-04 10:06:33,424 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 22 selfloop transitions, 4 changer transitions 0/39 dead transitions. [2025-03-04 10:06:33,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 39 transitions, 138 flow [2025-03-04 10:06:33,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:06:33,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:06:33,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2025-03-04 10:06:33,426 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-04 10:06:33,426 INFO L175 Difference]: Start difference. First operand has 36 places, 35 transitions, 78 flow. Second operand 3 states and 84 transitions. [2025-03-04 10:06:33,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 39 transitions, 138 flow [2025-03-04 10:06:33,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 39 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:06:33,427 INFO L231 Difference]: Finished difference. Result has 37 places, 37 transitions, 100 flow [2025-03-04 10:06:33,428 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=37, PETRI_TRANSITIONS=37} [2025-03-04 10:06:33,428 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, -5 predicate places. [2025-03-04 10:06:33,428 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 37 transitions, 100 flow [2025-03-04 10:06:33,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:33,428 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:33,428 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-04 10:06:33,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:06:33,429 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 10:06:33,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:33,431 INFO L85 PathProgramCache]: Analyzing trace with hash 529799929, now seen corresponding path program 1 times [2025-03-04 10:06:33,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:33,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55399087] [2025-03-04 10:06:33,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:33,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:33,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:06:33,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:06:33,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:33,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:33,611 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-04 10:06:33,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:33,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55399087] [2025-03-04 10:06:33,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55399087] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:33,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037765684] [2025-03-04 10:06:33,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:33,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:33,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:33,614 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-04 10:06:33,615 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-04 10:06:33,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:06:33,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:06:33,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:33,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:33,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:06:33,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:33,693 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-04 10:06:33,739 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-04 10:06:33,739 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:33,801 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-04 10:06:33,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037765684] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:06:33,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:06:33,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 7 [2025-03-04 10:06:33,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145252873] [2025-03-04 10:06:33,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:06:33,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:06:33,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:33,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:06:33,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:06:33,880 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2025-03-04 10:06:33,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 37 transitions, 100 flow. Second operand has 9 states, 9 states have (on average 19.666666666666668) internal successors, (177), 9 states have internal predecessors, (177), 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-04 10:06:33,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:33,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2025-03-04 10:06:33,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:34,023 INFO L124 PetriNetUnfolderBase]: 43/138 cut-off events. [2025-03-04 10:06:34,024 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:06:34,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 138 events. 43/138 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 473 event pairs, 22 based on Foata normal form. 2/114 useless extension candidates. Maximal degree in co-relation 211. Up to 78 conditions per place. [2025-03-04 10:06:34,025 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 28 selfloop transitions, 14 changer transitions 0/55 dead transitions. [2025-03-04 10:06:34,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 55 transitions, 242 flow [2025-03-04 10:06:34,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:06:34,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:06:34,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 158 transitions. [2025-03-04 10:06:34,026 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.626984126984127 [2025-03-04 10:06:34,026 INFO L175 Difference]: Start difference. First operand has 37 places, 37 transitions, 100 flow. Second operand 6 states and 158 transitions. [2025-03-04 10:06:34,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 55 transitions, 242 flow [2025-03-04 10:06:34,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 55 transitions, 236 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:06:34,028 INFO L231 Difference]: Finished difference. Result has 44 places, 47 transitions, 198 flow [2025-03-04 10:06:34,028 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=198, PETRI_PLACES=44, PETRI_TRANSITIONS=47} [2025-03-04 10:06:34,028 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2025-03-04 10:06:34,028 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 47 transitions, 198 flow [2025-03-04 10:06:34,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.666666666666668) internal successors, (177), 9 states have internal predecessors, (177), 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-04 10:06:34,028 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:34,029 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2025-03-04 10:06:34,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:06:34,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:34,234 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 10:06:34,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:34,235 INFO L85 PathProgramCache]: Analyzing trace with hash -765506290, now seen corresponding path program 2 times [2025-03-04 10:06:34,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:34,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236450839] [2025-03-04 10:06:34,236 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:06:34,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:34,245 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-04 10:06:34,262 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:06:34,266 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:06:34,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:34,516 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:06:34,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:34,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236450839] [2025-03-04 10:06:34,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236450839] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:34,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613891028] [2025-03-04 10:06:34,516 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:06:34,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:34,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:34,519 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-04 10:06:34,520 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-04 10:06:34,559 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-04 10:06:34,572 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:06:34,572 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:06:34,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:34,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 10:06:34,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:34,580 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-04 10:06:34,688 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-04 10:06:34,688 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:34,792 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-04 10:06:34,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613891028] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:06:34,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:06:34,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2025-03-04 10:06:34,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393456446] [2025-03-04 10:06:34,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:06:34,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 10:06:34,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:34,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 10:06:34,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:06:35,115 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2025-03-04 10:06:35,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 47 transitions, 198 flow. Second operand has 18 states, 18 states have (on average 19.833333333333332) internal successors, (357), 18 states have internal predecessors, (357), 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-04 10:06:35,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:35,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2025-03-04 10:06:35,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:35,395 INFO L124 PetriNetUnfolderBase]: 39/136 cut-off events. [2025-03-04 10:06:35,396 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-03-04 10:06:35,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 276 conditions, 136 events. 39/136 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 422 event pairs, 22 based on Foata normal form. 10/122 useless extension candidates. Maximal degree in co-relation 209. Up to 68 conditions per place. [2025-03-04 10:06:35,397 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 23 selfloop transitions, 17 changer transitions 0/53 dead transitions. [2025-03-04 10:06:35,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 53 transitions, 262 flow [2025-03-04 10:06:35,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:06:35,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:06:35,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 212 transitions. [2025-03-04 10:06:35,399 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5608465608465608 [2025-03-04 10:06:35,399 INFO L175 Difference]: Start difference. First operand has 44 places, 47 transitions, 198 flow. Second operand 9 states and 212 transitions. [2025-03-04 10:06:35,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 53 transitions, 262 flow [2025-03-04 10:06:35,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 220 flow, removed 11 selfloop flow, removed 5 redundant places. [2025-03-04 10:06:35,401 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 170 flow [2025-03-04 10:06:35,401 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=170, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2025-03-04 10:06:35,404 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2025-03-04 10:06:35,404 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 170 flow [2025-03-04 10:06:35,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 19.833333333333332) internal successors, (357), 18 states have internal predecessors, (357), 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-04 10:06:35,404 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:35,404 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:35,411 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-04 10:06:35,609 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,SelfDestructingSolverStorable3 [2025-03-04 10:06:35,609 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 10:06:35,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:35,610 INFO L85 PathProgramCache]: Analyzing trace with hash -247269669, now seen corresponding path program 1 times [2025-03-04 10:06:35,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:35,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51999648] [2025-03-04 10:06:35,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:35,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:35,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 10:06:35,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:06:35,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:35,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:35,806 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-04 10:06:35,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:35,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51999648] [2025-03-04 10:06:35,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51999648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:06:35,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:06:35,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:06:35,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865187385] [2025-03-04 10:06:35,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:35,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:06:35,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:35,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:06:35,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:06:35,843 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 42 [2025-03-04 10:06:35,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 170 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:35,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:35,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 42 [2025-03-04 10:06:35,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:35,909 INFO L124 PetriNetUnfolderBase]: 50/157 cut-off events. [2025-03-04 10:06:35,910 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-03-04 10:06:35,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 325 conditions, 157 events. 50/157 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 543 event pairs, 31 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 220. Up to 86 conditions per place. [2025-03-04 10:06:35,911 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 30 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2025-03-04 10:06:35,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 43 transitions, 232 flow [2025-03-04 10:06:35,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:06:35,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:06:35,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2025-03-04 10:06:35,913 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-03-04 10:06:35,913 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 170 flow. Second operand 5 states and 98 transitions. [2025-03-04 10:06:35,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 43 transitions, 232 flow [2025-03-04 10:06:35,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 200 flow, removed 5 selfloop flow, removed 6 redundant places. [2025-03-04 10:06:35,914 INFO L231 Difference]: Finished difference. Result has 42 places, 43 transitions, 140 flow [2025-03-04 10:06:35,914 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=140, PETRI_PLACES=42, PETRI_TRANSITIONS=43} [2025-03-04 10:06:35,915 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2025-03-04 10:06:35,915 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 43 transitions, 140 flow [2025-03-04 10:06:35,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:35,915 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:35,915 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:35,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:06:35,915 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 10:06:35,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:35,917 INFO L85 PathProgramCache]: Analyzing trace with hash -247269668, now seen corresponding path program 1 times [2025-03-04 10:06:35,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:35,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788783014] [2025-03-04 10:06:35,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:35,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:35,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 10:06:35,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:06:35,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:35,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:36,345 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 10:06:36,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:36,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788783014] [2025-03-04 10:06:36,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788783014] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:36,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103168087] [2025-03-04 10:06:36,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:36,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:36,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:36,348 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-04 10:06:36,349 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-04 10:06:36,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 10:06:36,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:06:36,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:36,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:36,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-04 10:06:36,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:36,434 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-04 10:06:36,440 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-04 10:06:36,533 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 10:06:36,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-04 10:06:36,550 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:06:36,551 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-04 10:06:36,831 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 10:06:36,831 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:37,181 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 10:06:37,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103168087] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:37,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:06:37,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 8] total 24 [2025-03-04 10:06:37,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813028322] [2025-03-04 10:06:37,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:37,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:06:37,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:37,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:06:37,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=501, Unknown=0, NotChecked=0, Total=650 [2025-03-04 10:06:37,366 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2025-03-04 10:06:37,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 43 transitions, 140 flow. Second operand has 10 states, 10 states have (on average 19.8) internal successors, (198), 10 states have internal predecessors, (198), 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-04 10:06:37,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:37,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2025-03-04 10:06:37,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:37,486 INFO L124 PetriNetUnfolderBase]: 86/234 cut-off events. [2025-03-04 10:06:37,486 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:06:37,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 456 conditions, 234 events. 86/234 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 920 event pairs, 31 based on Foata normal form. 0/201 useless extension candidates. Maximal degree in co-relation 365. Up to 78 conditions per place. [2025-03-04 10:06:37,487 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 39 selfloop transitions, 6 changer transitions 0/54 dead transitions. [2025-03-04 10:06:37,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 54 transitions, 255 flow [2025-03-04 10:06:37,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:06:37,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:06:37,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions. [2025-03-04 10:06:37,491 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5634920634920635 [2025-03-04 10:06:37,491 INFO L175 Difference]: Start difference. First operand has 42 places, 43 transitions, 140 flow. Second operand 6 states and 142 transitions. [2025-03-04 10:06:37,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 54 transitions, 255 flow [2025-03-04 10:06:37,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 54 transitions, 250 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:06:37,492 INFO L231 Difference]: Finished difference. Result has 46 places, 44 transitions, 160 flow [2025-03-04 10:06:37,492 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=160, PETRI_PLACES=46, PETRI_TRANSITIONS=44} [2025-03-04 10:06:37,493 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2025-03-04 10:06:37,493 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 44 transitions, 160 flow [2025-03-04 10:06:37,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 19.8) internal successors, (198), 10 states have internal predecessors, (198), 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-04 10:06:37,493 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:37,493 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:37,499 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-04 10:06:37,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:37,695 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 10:06:37,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:37,695 INFO L85 PathProgramCache]: Analyzing trace with hash 924575380, now seen corresponding path program 1 times [2025-03-04 10:06:37,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:37,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509431344] [2025-03-04 10:06:37,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:37,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:37,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 10:06:37,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:06:37,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:37,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:37,922 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 10:06:37,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:37,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509431344] [2025-03-04 10:06:37,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509431344] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:37,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568581651] [2025-03-04 10:06:37,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:37,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:37,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:37,925 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-04 10:06:37,926 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-04 10:06:37,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 10:06:37,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:06:37,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:37,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:37,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 10:06:37,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:38,097 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 10:06:38,098 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:38,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-03-04 10:06:38,246 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 10:06:38,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568581651] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:06:38,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:06:38,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 20 [2025-03-04 10:06:38,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924800941] [2025-03-04 10:06:38,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:06:38,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 10:06:38,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:38,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 10:06:38,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2025-03-04 10:06:38,578 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 42 [2025-03-04 10:06:38,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 44 transitions, 160 flow. Second operand has 21 states, 21 states have (on average 20.904761904761905) internal successors, (439), 21 states have internal predecessors, (439), 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-04 10:06:38,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:38,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 42 [2025-03-04 10:06:38,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:38,887 INFO L124 PetriNetUnfolderBase]: 100/297 cut-off events. [2025-03-04 10:06:38,887 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2025-03-04 10:06:38,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 649 conditions, 297 events. 100/297 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1289 event pairs, 31 based on Foata normal form. 16/293 useless extension candidates. Maximal degree in co-relation 555. Up to 86 conditions per place. [2025-03-04 10:06:38,889 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 49 selfloop transitions, 14 changer transitions 0/74 dead transitions. [2025-03-04 10:06:38,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 74 transitions, 376 flow [2025-03-04 10:06:38,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:06:38,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:06:38,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 251 transitions. [2025-03-04 10:06:38,891 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5976190476190476 [2025-03-04 10:06:38,891 INFO L175 Difference]: Start difference. First operand has 46 places, 44 transitions, 160 flow. Second operand 10 states and 251 transitions. [2025-03-04 10:06:38,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 74 transitions, 376 flow [2025-03-04 10:06:38,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 74 transitions, 366 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:06:38,892 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 200 flow [2025-03-04 10:06:38,892 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=200, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2025-03-04 10:06:38,893 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 11 predicate places. [2025-03-04 10:06:38,893 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 200 flow [2025-03-04 10:06:38,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 20.904761904761905) internal successors, (439), 21 states have internal predecessors, (439), 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-04 10:06:38,893 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:38,893 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:38,901 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-04 10:06:39,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:39,099 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 10:06:39,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:39,099 INFO L85 PathProgramCache]: Analyzing trace with hash 924575379, now seen corresponding path program 1 times [2025-03-04 10:06:39,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:39,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687164783] [2025-03-04 10:06:39,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:39,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:39,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 10:06:39,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:06:39,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:39,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:39,154 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-04 10:06:39,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:39,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687164783] [2025-03-04 10:06:39,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687164783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:06:39,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:06:39,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:06:39,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350753682] [2025-03-04 10:06:39,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:39,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:06:39,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:39,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:06:39,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:06:39,180 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 42 [2025-03-04 10:06:39,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 200 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-04 10:06:39,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:39,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 42 [2025-03-04 10:06:39,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:39,226 INFO L124 PetriNetUnfolderBase]: 113/289 cut-off events. [2025-03-04 10:06:39,227 INFO L125 PetriNetUnfolderBase]: For 205/210 co-relation queries the response was YES. [2025-03-04 10:06:39,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 718 conditions, 289 events. 113/289 cut-off events. For 205/210 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1174 event pairs, 84 based on Foata normal form. 21/301 useless extension candidates. Maximal degree in co-relation 613. Up to 200 conditions per place. [2025-03-04 10:06:39,228 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 33 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2025-03-04 10:06:39,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 44 transitions, 266 flow [2025-03-04 10:06:39,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:06:39,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:06:39,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2025-03-04 10:06:39,229 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49404761904761907 [2025-03-04 10:06:39,229 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 200 flow. Second operand 4 states and 83 transitions. [2025-03-04 10:06:39,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 44 transitions, 266 flow [2025-03-04 10:06:39,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 44 transitions, 245 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 10:06:39,230 INFO L231 Difference]: Finished difference. Result has 48 places, 44 transitions, 179 flow [2025-03-04 10:06:39,230 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=48, PETRI_TRANSITIONS=44} [2025-03-04 10:06:39,231 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 6 predicate places. [2025-03-04 10:06:39,231 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 44 transitions, 179 flow [2025-03-04 10:06:39,231 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-04 10:06:39,231 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:39,231 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:39,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:06:39,231 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 10:06:39,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:39,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1425420073, now seen corresponding path program 1 times [2025-03-04 10:06:39,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:39,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973710966] [2025-03-04 10:06:39,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:39,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:39,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 10:06:39,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 10:06:39,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:39,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:39,395 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 10:06:39,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:39,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973710966] [2025-03-04 10:06:39,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973710966] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:39,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945096679] [2025-03-04 10:06:39,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:39,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:39,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:39,398 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-04 10:06:39,399 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-04 10:06:39,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 10:06:39,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 10:06:39,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:39,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:39,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 10:06:39,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:39,576 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 10:06:39,576 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:39,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-03-04 10:06:39,712 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 10:06:39,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945096679] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:06:39,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:06:39,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 20 [2025-03-04 10:06:39,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125403695] [2025-03-04 10:06:39,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:06:39,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 10:06:39,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:39,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 10:06:39,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2025-03-04 10:06:39,947 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2025-03-04 10:06:39,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 44 transitions, 179 flow. Second operand has 21 states, 21 states have (on average 20.19047619047619) internal successors, (424), 21 states have internal predecessors, (424), 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-04 10:06:39,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:39,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2025-03-04 10:06:39,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:40,221 INFO L124 PetriNetUnfolderBase]: 257/593 cut-off events. [2025-03-04 10:06:40,222 INFO L125 PetriNetUnfolderBase]: For 479/496 co-relation queries the response was YES. [2025-03-04 10:06:40,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1428 conditions, 593 events. 257/593 cut-off events. For 479/496 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2875 event pairs, 84 based on Foata normal form. 0/569 useless extension candidates. Maximal degree in co-relation 1331. Up to 183 conditions per place. [2025-03-04 10:06:40,225 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 52 selfloop transitions, 15 changer transitions 0/75 dead transitions. [2025-03-04 10:06:40,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 75 transitions, 443 flow [2025-03-04 10:06:40,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:06:40,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:06:40,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 239 transitions. [2025-03-04 10:06:40,227 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.569047619047619 [2025-03-04 10:06:40,227 INFO L175 Difference]: Start difference. First operand has 48 places, 44 transitions, 179 flow. Second operand 10 states and 239 transitions. [2025-03-04 10:06:40,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 75 transitions, 443 flow [2025-03-04 10:06:40,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 75 transitions, 440 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:06:40,229 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 225 flow [2025-03-04 10:06:40,229 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=225, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2025-03-04 10:06:40,230 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 16 predicate places. [2025-03-04 10:06:40,230 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 225 flow [2025-03-04 10:06:40,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 20.19047619047619) internal successors, (424), 21 states have internal predecessors, (424), 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-04 10:06:40,230 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:40,230 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:40,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 10:06:40,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:40,435 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 10:06:40,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:40,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1238348798, now seen corresponding path program 1 times [2025-03-04 10:06:40,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:40,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316693091] [2025-03-04 10:06:40,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:40,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:40,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 10:06:40,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:06:40,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:40,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:40,691 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 10:06:40,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:40,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316693091] [2025-03-04 10:06:40,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316693091] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:40,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469153771] [2025-03-04 10:06:40,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:40,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:40,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:40,693 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-04 10:06:40,694 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-04 10:06:40,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 10:06:40,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:06:40,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:40,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:40,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-04 10:06:40,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:40,777 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-04 10:06:40,819 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 10:06:40,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-04 10:06:41,035 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 10:06:41,035 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:41,252 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 10:06:41,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469153771] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:41,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:06:41,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 9] total 25 [2025-03-04 10:06:41,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110340362] [2025-03-04 10:06:41,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:41,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:06:41,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:41,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:06:41,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2025-03-04 10:06:41,385 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 42 [2025-03-04 10:06:41,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 225 flow. Second operand has 10 states, 10 states have (on average 21.0) internal successors, (210), 10 states have internal predecessors, (210), 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-04 10:06:41,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:41,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 42 [2025-03-04 10:06:41,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:41,503 INFO L124 PetriNetUnfolderBase]: 206/516 cut-off events. [2025-03-04 10:06:41,503 INFO L125 PetriNetUnfolderBase]: For 534/547 co-relation queries the response was YES. [2025-03-04 10:06:41,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1402 conditions, 516 events. 206/516 cut-off events. For 534/547 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2507 event pairs, 128 based on Foata normal form. 17/521 useless extension candidates. Maximal degree in co-relation 1292. Up to 271 conditions per place. [2025-03-04 10:06:41,505 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 41 selfloop transitions, 5 changer transitions 0/56 dead transitions. [2025-03-04 10:06:41,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 56 transitions, 363 flow [2025-03-04 10:06:41,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:06:41,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:06:41,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2025-03-04 10:06:41,506 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5753968253968254 [2025-03-04 10:06:41,506 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 225 flow. Second operand 6 states and 145 transitions. [2025-03-04 10:06:41,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 56 transitions, 363 flow [2025-03-04 10:06:41,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 56 transitions, 342 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 10:06:41,508 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 218 flow [2025-03-04 10:06:41,508 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=218, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2025-03-04 10:06:41,509 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 16 predicate places. [2025-03-04 10:06:41,509 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 218 flow [2025-03-04 10:06:41,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 21.0) internal successors, (210), 10 states have internal predecessors, (210), 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-04 10:06:41,509 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:41,509 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:41,515 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-04 10:06:41,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:41,713 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 10:06:41,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:41,713 INFO L85 PathProgramCache]: Analyzing trace with hash -541271463, now seen corresponding path program 1 times [2025-03-04 10:06:41,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:41,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184245801] [2025-03-04 10:06:41,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:41,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:41,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 10:06:41,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:06:41,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:41,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:41,989 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 10:06:41,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:41,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184245801] [2025-03-04 10:06:41,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184245801] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:41,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768416711] [2025-03-04 10:06:41,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:41,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:41,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:41,992 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-04 10:06:41,993 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-04 10:06:42,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 10:06:42,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:06:42,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:42,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:42,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 10:06:42,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:42,088 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-04 10:06:42,091 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-04 10:06:42,159 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 10:06:42,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-04 10:06:42,173 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:06:42,173 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-04 10:06:42,434 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 10:06:42,434 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:42,712 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 10:06:42,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768416711] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:06:42,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:06:42,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2025-03-04 10:06:42,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721994540] [2025-03-04 10:06:42,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:06:42,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 10:06:42,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:42,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 10:06:42,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=635, Unknown=0, NotChecked=0, Total=812 [2025-03-04 10:06:43,231 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 42 [2025-03-04 10:06:43,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 218 flow. Second operand has 29 states, 29 states have (on average 16.06896551724138) internal successors, (466), 29 states have internal predecessors, (466), 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-04 10:06:43,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:43,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 42 [2025-03-04 10:06:43,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:43,778 INFO L124 PetriNetUnfolderBase]: 382/897 cut-off events. [2025-03-04 10:06:43,778 INFO L125 PetriNetUnfolderBase]: For 1191/1217 co-relation queries the response was YES. [2025-03-04 10:06:43,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2511 conditions, 897 events. 382/897 cut-off events. For 1191/1217 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4843 event pairs, 72 based on Foata normal form. 48/934 useless extension candidates. Maximal degree in co-relation 2407. Up to 160 conditions per place. [2025-03-04 10:06:43,783 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 77 selfloop transitions, 17 changer transitions 0/102 dead transitions. [2025-03-04 10:06:43,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 102 transitions, 632 flow [2025-03-04 10:06:43,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 10:06:43,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 10:06:43,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 326 transitions. [2025-03-04 10:06:43,785 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4565826330532213 [2025-03-04 10:06:43,785 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 218 flow. Second operand 17 states and 326 transitions. [2025-03-04 10:06:43,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 102 transitions, 632 flow [2025-03-04 10:06:43,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 102 transitions, 606 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 10:06:43,789 INFO L231 Difference]: Finished difference. Result has 73 places, 48 transitions, 273 flow [2025-03-04 10:06:43,789 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=273, PETRI_PLACES=73, PETRI_TRANSITIONS=48} [2025-03-04 10:06:43,791 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 31 predicate places. [2025-03-04 10:06:43,791 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 48 transitions, 273 flow [2025-03-04 10:06:43,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 16.06896551724138) internal successors, (466), 29 states have internal predecessors, (466), 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-04 10:06:43,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:43,792 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:43,797 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-04 10:06:43,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:43,992 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 10:06:43,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:43,993 INFO L85 PathProgramCache]: Analyzing trace with hash 2120618354, now seen corresponding path program 1 times [2025-03-04 10:06:43,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:43,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762021015] [2025-03-04 10:06:43,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:43,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:44,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 10:06:44,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:06:44,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:44,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:44,239 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 10:06:44,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:44,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762021015] [2025-03-04 10:06:44,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762021015] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:44,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975285276] [2025-03-04 10:06:44,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:44,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:44,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:44,241 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-04 10:06:44,243 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-04 10:06:44,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 10:06:44,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:06:44,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:44,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:44,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 10:06:44,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:44,333 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-04 10:06:44,337 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-04 10:06:44,385 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 10:06:44,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-04 10:06:44,398 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:06:44,398 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-04 10:06:44,655 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 10:06:44,655 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:44,911 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 25 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 10:06:44,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975285276] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:06:44,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:06:44,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2025-03-04 10:06:44,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676430313] [2025-03-04 10:06:44,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:06:44,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 10:06:44,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:44,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 10:06:44,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=583, Unknown=0, NotChecked=0, Total=756 [2025-03-04 10:06:45,395 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 42 [2025-03-04 10:06:45,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 48 transitions, 273 flow. Second operand has 28 states, 28 states have (on average 17.25) internal successors, (483), 28 states have internal predecessors, (483), 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-04 10:06:45,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:45,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 42 [2025-03-04 10:06:45,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:45,824 INFO L124 PetriNetUnfolderBase]: 456/1217 cut-off events. [2025-03-04 10:06:45,824 INFO L125 PetriNetUnfolderBase]: For 2098/2144 co-relation queries the response was YES. [2025-03-04 10:06:45,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3527 conditions, 1217 events. 456/1217 cut-off events. For 2098/2144 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 7694 event pairs, 138 based on Foata normal form. 81/1258 useless extension candidates. Maximal degree in co-relation 3411. Up to 306 conditions per place. [2025-03-04 10:06:45,831 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 76 selfloop transitions, 16 changer transitions 0/103 dead transitions. [2025-03-04 10:06:45,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 103 transitions, 791 flow [2025-03-04 10:06:45,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 10:06:45,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 10:06:45,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 331 transitions. [2025-03-04 10:06:45,833 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4635854341736695 [2025-03-04 10:06:45,833 INFO L175 Difference]: Start difference. First operand has 73 places, 48 transitions, 273 flow. Second operand 17 states and 331 transitions. [2025-03-04 10:06:45,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 103 transitions, 791 flow [2025-03-04 10:06:45,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 103 transitions, 723 flow, removed 10 selfloop flow, removed 8 redundant places. [2025-03-04 10:06:45,837 INFO L231 Difference]: Finished difference. Result has 84 places, 51 transitions, 309 flow [2025-03-04 10:06:45,837 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=309, PETRI_PLACES=84, PETRI_TRANSITIONS=51} [2025-03-04 10:06:45,838 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 42 predicate places. [2025-03-04 10:06:45,839 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 51 transitions, 309 flow [2025-03-04 10:06:45,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 17.25) internal successors, (483), 28 states have internal predecessors, (483), 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-04 10:06:45,839 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:45,839 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:45,845 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-04 10:06:46,040 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,SelfDestructingSolverStorable11 [2025-03-04 10:06:46,040 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 10:06:46,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:46,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1483714636, now seen corresponding path program 1 times [2025-03-04 10:06:46,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:46,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967379065] [2025-03-04 10:06:46,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:46,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:46,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 10:06:46,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 10:06:46,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:46,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:46,249 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 10:06:46,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:46,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967379065] [2025-03-04 10:06:46,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967379065] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:46,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581981058] [2025-03-04 10:06:46,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:46,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:46,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:46,252 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-04 10:06:46,253 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-04 10:06:46,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 10:06:46,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 10:06:46,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:46,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:46,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 10:06:46,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:46,483 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 20 proven. 14 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 10:06:46,483 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:46,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-04 10:06:46,681 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 20 proven. 14 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 10:06:46,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581981058] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:06:46,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:06:46,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 11] total 27 [2025-03-04 10:06:46,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788861203] [2025-03-04 10:06:46,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:06:46,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 10:06:46,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:46,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 10:06:46,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756 [2025-03-04 10:06:47,120 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 42 [2025-03-04 10:06:47,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 51 transitions, 309 flow. Second operand has 28 states, 28 states have (on average 20.678571428571427) internal successors, (579), 28 states have internal predecessors, (579), 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-04 10:06:47,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:47,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 42 [2025-03-04 10:06:47,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:47,604 INFO L124 PetriNetUnfolderBase]: 559/1433 cut-off events. [2025-03-04 10:06:47,605 INFO L125 PetriNetUnfolderBase]: For 3175/3210 co-relation queries the response was YES. [2025-03-04 10:06:47,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4516 conditions, 1433 events. 559/1433 cut-off events. For 3175/3210 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 8973 event pairs, 110 based on Foata normal form. 72/1475 useless extension candidates. Maximal degree in co-relation 4395. Up to 270 conditions per place. [2025-03-04 10:06:47,612 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 103 selfloop transitions, 17 changer transitions 0/131 dead transitions. [2025-03-04 10:06:47,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 131 transitions, 974 flow [2025-03-04 10:06:47,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 10:06:47,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 10:06:47,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 342 transitions. [2025-03-04 10:06:47,613 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6263736263736264 [2025-03-04 10:06:47,613 INFO L175 Difference]: Start difference. First operand has 84 places, 51 transitions, 309 flow. Second operand 13 states and 342 transitions. [2025-03-04 10:06:47,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 131 transitions, 974 flow [2025-03-04 10:06:47,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 131 transitions, 941 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-03-04 10:06:47,619 INFO L231 Difference]: Finished difference. Result has 87 places, 53 transitions, 352 flow [2025-03-04 10:06:47,619 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=352, PETRI_PLACES=87, PETRI_TRANSITIONS=53} [2025-03-04 10:06:47,620 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 45 predicate places. [2025-03-04 10:06:47,620 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 53 transitions, 352 flow [2025-03-04 10:06:47,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 20.678571428571427) internal successors, (579), 28 states have internal predecessors, (579), 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-04 10:06:47,620 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:47,620 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:47,627 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-04 10:06:47,824 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,SelfDestructingSolverStorable12 [2025-03-04 10:06:47,825 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 10:06:47,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:47,825 INFO L85 PathProgramCache]: Analyzing trace with hash 66882151, now seen corresponding path program 1 times [2025-03-04 10:06:47,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:47,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558810670] [2025-03-04 10:06:47,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:47,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:47,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 10:06:47,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 10:06:47,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:47,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:47,920 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:06:47,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:47,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558810670] [2025-03-04 10:06:47,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558810670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:06:47,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:06:47,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:06:47,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833705868] [2025-03-04 10:06:47,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:47,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:06:47,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:47,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:06:47,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:06:47,931 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 42 [2025-03-04 10:06:47,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 53 transitions, 352 flow. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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-04 10:06:47,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:47,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 42 [2025-03-04 10:06:47,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:48,070 INFO L124 PetriNetUnfolderBase]: 522/1406 cut-off events. [2025-03-04 10:06:48,071 INFO L125 PetriNetUnfolderBase]: For 3437/3479 co-relation queries the response was YES. [2025-03-04 10:06:48,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4552 conditions, 1406 events. 522/1406 cut-off events. For 3437/3479 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 9068 event pairs, 380 based on Foata normal form. 2/1372 useless extension candidates. Maximal degree in co-relation 4427. Up to 822 conditions per place. [2025-03-04 10:06:48,078 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 60 selfloop transitions, 3 changer transitions 0/75 dead transitions. [2025-03-04 10:06:48,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 75 transitions, 658 flow [2025-03-04 10:06:48,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:06:48,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:06:48,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2025-03-04 10:06:48,079 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6785714285714286 [2025-03-04 10:06:48,079 INFO L175 Difference]: Start difference. First operand has 87 places, 53 transitions, 352 flow. Second operand 4 states and 114 transitions. [2025-03-04 10:06:48,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 75 transitions, 658 flow [2025-03-04 10:06:48,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 75 transitions, 620 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-03-04 10:06:48,084 INFO L231 Difference]: Finished difference. Result has 83 places, 54 transitions, 341 flow [2025-03-04 10:06:48,086 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=341, PETRI_PLACES=83, PETRI_TRANSITIONS=54} [2025-03-04 10:06:48,086 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 41 predicate places. [2025-03-04 10:06:48,086 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 54 transitions, 341 flow [2025-03-04 10:06:48,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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-04 10:06:48,086 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:48,086 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:48,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 10:06:48,086 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 10:06:48,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:48,087 INFO L85 PathProgramCache]: Analyzing trace with hash 2109028021, now seen corresponding path program 2 times [2025-03-04 10:06:48,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:48,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132981827] [2025-03-04 10:06:48,087 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:06:48,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:48,095 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-04 10:06:48,101 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 35 statements. [2025-03-04 10:06:48,101 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:06:48,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:48,150 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:06:48,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:48,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132981827] [2025-03-04 10:06:48,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132981827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:06:48,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:06:48,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:06:48,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468621841] [2025-03-04 10:06:48,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:48,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:06:48,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:48,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:06:48,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:06:48,157 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 42 [2025-03-04 10:06:48,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 54 transitions, 341 flow. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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-04 10:06:48,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:48,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 42 [2025-03-04 10:06:48,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:48,318 INFO L124 PetriNetUnfolderBase]: 519/1404 cut-off events. [2025-03-04 10:06:48,318 INFO L125 PetriNetUnfolderBase]: For 3807/3863 co-relation queries the response was YES. [2025-03-04 10:06:48,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4859 conditions, 1404 events. 519/1404 cut-off events. For 3807/3863 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 8970 event pairs, 357 based on Foata normal form. 3/1364 useless extension candidates. Maximal degree in co-relation 4742. Up to 838 conditions per place. [2025-03-04 10:06:48,325 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 62 selfloop transitions, 3 changer transitions 2/79 dead transitions. [2025-03-04 10:06:48,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 79 transitions, 628 flow [2025-03-04 10:06:48,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:06:48,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:06:48,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2025-03-04 10:06:48,326 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6964285714285714 [2025-03-04 10:06:48,326 INFO L175 Difference]: Start difference. First operand has 83 places, 54 transitions, 341 flow. Second operand 4 states and 117 transitions. [2025-03-04 10:06:48,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 79 transitions, 628 flow [2025-03-04 10:06:48,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 79 transitions, 618 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:06:48,330 INFO L231 Difference]: Finished difference. Result has 86 places, 55 transitions, 353 flow [2025-03-04 10:06:48,330 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=353, PETRI_PLACES=86, PETRI_TRANSITIONS=55} [2025-03-04 10:06:48,331 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 44 predicate places. [2025-03-04 10:06:48,331 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 55 transitions, 353 flow [2025-03-04 10:06:48,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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-04 10:06:48,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:48,331 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:48,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 10:06:48,331 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 10:06:48,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:48,331 INFO L85 PathProgramCache]: Analyzing trace with hash -790803087, now seen corresponding path program 3 times [2025-03-04 10:06:48,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:48,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818300412] [2025-03-04 10:06:48,331 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:06:48,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:48,341 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 6 equivalence classes. [2025-03-04 10:06:48,345 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 15 of 35 statements. [2025-03-04 10:06:48,345 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 10:06:48,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:48,400 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:06:48,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:48,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818300412] [2025-03-04 10:06:48,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818300412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:06:48,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:06:48,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:06:48,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760580709] [2025-03-04 10:06:48,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:48,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:06:48,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:48,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:06:48,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:06:48,411 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 42 [2025-03-04 10:06:48,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 55 transitions, 353 flow. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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-04 10:06:48,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:48,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 42 [2025-03-04 10:06:48,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:48,587 INFO L124 PetriNetUnfolderBase]: 786/1802 cut-off events. [2025-03-04 10:06:48,588 INFO L125 PetriNetUnfolderBase]: For 5673/5735 co-relation queries the response was YES. [2025-03-04 10:06:48,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6529 conditions, 1802 events. 786/1802 cut-off events. For 5673/5735 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 11189 event pairs, 552 based on Foata normal form. 30/1820 useless extension candidates. Maximal degree in co-relation 6410. Up to 1130 conditions per place. [2025-03-04 10:06:48,597 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 66 selfloop transitions, 4 changer transitions 0/81 dead transitions. [2025-03-04 10:06:48,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 81 transitions, 706 flow [2025-03-04 10:06:48,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:06:48,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:06:48,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2025-03-04 10:06:48,598 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6785714285714286 [2025-03-04 10:06:48,598 INFO L175 Difference]: Start difference. First operand has 86 places, 55 transitions, 353 flow. Second operand 4 states and 114 transitions. [2025-03-04 10:06:48,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 81 transitions, 706 flow [2025-03-04 10:06:48,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 81 transitions, 694 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:06:48,602 INFO L231 Difference]: Finished difference. Result has 89 places, 57 transitions, 384 flow [2025-03-04 10:06:48,603 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=384, PETRI_PLACES=89, PETRI_TRANSITIONS=57} [2025-03-04 10:06:48,603 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 47 predicate places. [2025-03-04 10:06:48,603 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 57 transitions, 384 flow [2025-03-04 10:06:48,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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-04 10:06:48,603 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:48,603 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:48,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 10:06:48,603 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 10:06:48,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:48,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1630752639, now seen corresponding path program 4 times [2025-03-04 10:06:48,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:48,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572738307] [2025-03-04 10:06:48,604 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:06:48,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:48,610 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 35 statements into 2 equivalence classes. [2025-03-04 10:06:48,619 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 10:06:48,619 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:06:48,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:48,709 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:06:48,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:48,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572738307] [2025-03-04 10:06:48,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572738307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:06:48,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:06:48,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:06:48,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465621562] [2025-03-04 10:06:48,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:48,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:06:48,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:48,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:06:48,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:06:48,718 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 42 [2025-03-04 10:06:48,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 57 transitions, 384 flow. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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-04 10:06:48,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:48,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 42 [2025-03-04 10:06:48,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:48,878 INFO L124 PetriNetUnfolderBase]: 543/1610 cut-off events. [2025-03-04 10:06:48,879 INFO L125 PetriNetUnfolderBase]: For 5474/5506 co-relation queries the response was YES. [2025-03-04 10:06:48,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6048 conditions, 1610 events. 543/1610 cut-off events. For 5474/5506 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 10998 event pairs, 234 based on Foata normal form. 30/1638 useless extension candidates. Maximal degree in co-relation 5927. Up to 916 conditions per place. [2025-03-04 10:06:48,891 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 58 selfloop transitions, 6 changer transitions 1/78 dead transitions. [2025-03-04 10:06:48,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 78 transitions, 687 flow [2025-03-04 10:06:48,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:06:48,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:06:48,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2025-03-04 10:06:48,892 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-04 10:06:48,892 INFO L175 Difference]: Start difference. First operand has 89 places, 57 transitions, 384 flow. Second operand 4 states and 112 transitions. [2025-03-04 10:06:48,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 78 transitions, 687 flow [2025-03-04 10:06:48,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 78 transitions, 680 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 10:06:48,899 INFO L231 Difference]: Finished difference. Result has 93 places, 58 transitions, 421 flow [2025-03-04 10:06:48,899 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=421, PETRI_PLACES=93, PETRI_TRANSITIONS=58} [2025-03-04 10:06:48,900 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 51 predicate places. [2025-03-04 10:06:48,900 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 58 transitions, 421 flow [2025-03-04 10:06:48,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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-04 10:06:48,900 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:48,900 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:48,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 10:06:48,901 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 10:06:48,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:48,901 INFO L85 PathProgramCache]: Analyzing trace with hash 2099758807, now seen corresponding path program 1 times [2025-03-04 10:06:48,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:48,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472728527] [2025-03-04 10:06:48,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:48,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:48,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 10:06:48,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 10:06:48,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:48,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:49,097 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 10:06:49,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:49,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472728527] [2025-03-04 10:06:49,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472728527] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:49,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144537388] [2025-03-04 10:06:49,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:49,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:49,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:49,100 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-04 10:06:49,101 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-04 10:06:49,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 10:06:49,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 10:06:49,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:49,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:49,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 10:06:49,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:49,199 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-04 10:06:49,346 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 10:06:49,346 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:49,597 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 10:06:49,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144537388] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:06:49,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:06:49,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 11] total 27 [2025-03-04 10:06:49,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855734937] [2025-03-04 10:06:49,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:06:49,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 10:06:49,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:49,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 10:06:49,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=613, Unknown=0, NotChecked=0, Total=756 [2025-03-04 10:06:49,976 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 42 [2025-03-04 10:06:49,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 58 transitions, 421 flow. Second operand has 28 states, 28 states have (on average 18.107142857142858) internal successors, (507), 28 states have internal predecessors, (507), 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-04 10:06:49,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:49,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 42 [2025-03-04 10:06:49,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:50,496 INFO L124 PetriNetUnfolderBase]: 932/1994 cut-off events. [2025-03-04 10:06:50,497 INFO L125 PetriNetUnfolderBase]: For 8626/8688 co-relation queries the response was YES. [2025-03-04 10:06:50,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7859 conditions, 1994 events. 932/1994 cut-off events. For 8626/8688 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 11824 event pairs, 168 based on Foata normal form. 96/2060 useless extension candidates. Maximal degree in co-relation 7733. Up to 344 conditions per place. [2025-03-04 10:06:50,512 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 107 selfloop transitions, 20 changer transitions 0/137 dead transitions. [2025-03-04 10:06:50,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 137 transitions, 1270 flow [2025-03-04 10:06:50,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 10:06:50,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 10:06:50,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 295 transitions. [2025-03-04 10:06:50,513 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5402930402930403 [2025-03-04 10:06:50,513 INFO L175 Difference]: Start difference. First operand has 93 places, 58 transitions, 421 flow. Second operand 13 states and 295 transitions. [2025-03-04 10:06:50,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 137 transitions, 1270 flow [2025-03-04 10:06:50,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 137 transitions, 1251 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-04 10:06:50,522 INFO L231 Difference]: Finished difference. Result has 104 places, 59 transitions, 473 flow [2025-03-04 10:06:50,522 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=473, PETRI_PLACES=104, PETRI_TRANSITIONS=59} [2025-03-04 10:06:50,522 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 62 predicate places. [2025-03-04 10:06:50,523 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 59 transitions, 473 flow [2025-03-04 10:06:50,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 18.107142857142858) internal successors, (507), 28 states have internal predecessors, (507), 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-04 10:06:50,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:50,523 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:50,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 10:06:50,723 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,SelfDestructingSolverStorable17 [2025-03-04 10:06:50,723 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 10:06:50,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:50,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1264923223, now seen corresponding path program 1 times [2025-03-04 10:06:50,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:50,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092039600] [2025-03-04 10:06:50,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:50,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:50,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 10:06:50,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 10:06:50,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:50,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:50,856 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:06:50,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:50,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092039600] [2025-03-04 10:06:50,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092039600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:06:50,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:06:50,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:06:50,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425900542] [2025-03-04 10:06:50,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:50,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:06:50,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:50,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:06:50,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:06:50,868 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 42 [2025-03-04 10:06:50,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 59 transitions, 473 flow. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:50,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:50,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 42 [2025-03-04 10:06:50,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:51,130 INFO L124 PetriNetUnfolderBase]: 910/2242 cut-off events. [2025-03-04 10:06:51,130 INFO L125 PetriNetUnfolderBase]: For 10517/10572 co-relation queries the response was YES. [2025-03-04 10:06:51,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9007 conditions, 2242 events. 910/2242 cut-off events. For 10517/10572 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 14697 event pairs, 578 based on Foata normal form. 22/2260 useless extension candidates. Maximal degree in co-relation 8869. Up to 1325 conditions per place. [2025-03-04 10:06:51,141 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 67 selfloop transitions, 5 changer transitions 0/85 dead transitions. [2025-03-04 10:06:51,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 85 transitions, 837 flow [2025-03-04 10:06:51,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:06:51,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:06:51,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2025-03-04 10:06:51,142 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6964285714285714 [2025-03-04 10:06:51,142 INFO L175 Difference]: Start difference. First operand has 104 places, 59 transitions, 473 flow. Second operand 4 states and 117 transitions. [2025-03-04 10:06:51,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 85 transitions, 837 flow [2025-03-04 10:06:51,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 85 transitions, 771 flow, removed 4 selfloop flow, removed 11 redundant places. [2025-03-04 10:06:51,153 INFO L231 Difference]: Finished difference. Result has 98 places, 61 transitions, 475 flow [2025-03-04 10:06:51,153 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=475, PETRI_PLACES=98, PETRI_TRANSITIONS=61} [2025-03-04 10:06:51,153 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 56 predicate places. [2025-03-04 10:06:51,153 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 61 transitions, 475 flow [2025-03-04 10:06:51,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:51,153 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:51,153 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:51,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 10:06:51,154 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 10:06:51,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:51,154 INFO L85 PathProgramCache]: Analyzing trace with hash -450715045, now seen corresponding path program 2 times [2025-03-04 10:06:51,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:51,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088082857] [2025-03-04 10:06:51,154 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:06:51,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:51,161 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-04 10:06:51,168 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 38 statements. [2025-03-04 10:06:51,168 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:06:51,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:51,229 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:06:51,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:51,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088082857] [2025-03-04 10:06:51,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088082857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:06:51,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:06:51,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:06:51,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738236738] [2025-03-04 10:06:51,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:51,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:06:51,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:51,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:06:51,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:06:51,237 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 42 [2025-03-04 10:06:51,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 61 transitions, 475 flow. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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-04 10:06:51,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:51,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 42 [2025-03-04 10:06:51,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:51,402 INFO L124 PetriNetUnfolderBase]: 640/1779 cut-off events. [2025-03-04 10:06:51,402 INFO L125 PetriNetUnfolderBase]: For 9205/9249 co-relation queries the response was YES. [2025-03-04 10:06:51,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7326 conditions, 1779 events. 640/1779 cut-off events. For 9205/9249 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 12043 event pairs, 56 based on Foata normal form. 24/1781 useless extension candidates. Maximal degree in co-relation 7197. Up to 986 conditions per place. [2025-03-04 10:06:51,412 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 55 selfloop transitions, 8 changer transitions 1/79 dead transitions. [2025-03-04 10:06:51,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 79 transitions, 779 flow [2025-03-04 10:06:51,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:06:51,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:06:51,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2025-03-04 10:06:51,414 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6547619047619048 [2025-03-04 10:06:51,414 INFO L175 Difference]: Start difference. First operand has 98 places, 61 transitions, 475 flow. Second operand 4 states and 110 transitions. [2025-03-04 10:06:51,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 79 transitions, 779 flow [2025-03-04 10:06:51,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 79 transitions, 771 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 10:06:51,443 INFO L231 Difference]: Finished difference. Result has 102 places, 62 transitions, 523 flow [2025-03-04 10:06:51,443 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=523, PETRI_PLACES=102, PETRI_TRANSITIONS=62} [2025-03-04 10:06:51,443 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 60 predicate places. [2025-03-04 10:06:51,444 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 62 transitions, 523 flow [2025-03-04 10:06:51,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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-04 10:06:51,444 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:51,444 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:51,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 10:06:51,444 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 10:06:51,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:51,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1249037156, now seen corresponding path program 2 times [2025-03-04 10:06:51,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:51,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887025302] [2025-03-04 10:06:51,445 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:06:51,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:51,451 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-04 10:06:51,464 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 10:06:51,464 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:06:51,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:51,749 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 29 proven. 4 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-04 10:06:51,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:51,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887025302] [2025-03-04 10:06:51,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887025302] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:51,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833190140] [2025-03-04 10:06:51,750 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:06:51,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:51,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:51,751 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-04 10:06:51,753 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-04 10:06:51,815 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-04 10:06:51,845 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 10:06:51,846 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:06:51,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:51,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 10:06:51,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:51,852 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-04 10:06:51,857 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-04 10:06:51,958 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:06:51,958 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-04 10:06:51,962 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-04 10:06:52,126 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 20 proven. 31 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 10:06:52,126 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:52,609 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 10:06:52,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833190140] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:06:52,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:06:52,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 12] total 34 [2025-03-04 10:06:52,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981532490] [2025-03-04 10:06:52,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:06:52,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-04 10:06:52,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:52,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-04 10:06:52,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1083, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 10:06:53,435 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 42 [2025-03-04 10:06:53,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 62 transitions, 523 flow. Second operand has 36 states, 36 states have (on average 15.38888888888889) internal successors, (554), 36 states have internal predecessors, (554), 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-04 10:06:53,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:53,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 42 [2025-03-04 10:06:53,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:54,114 INFO L124 PetriNetUnfolderBase]: 1101/2141 cut-off events. [2025-03-04 10:06:54,115 INFO L125 PetriNetUnfolderBase]: For 12500/12578 co-relation queries the response was YES. [2025-03-04 10:06:54,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9210 conditions, 2141 events. 1101/2141 cut-off events. For 12500/12578 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 12182 event pairs, 73 based on Foata normal form. 56/2146 useless extension candidates. Maximal degree in co-relation 9076. Up to 400 conditions per place. [2025-03-04 10:06:54,124 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 137 selfloop transitions, 22 changer transitions 0/168 dead transitions. [2025-03-04 10:06:54,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 168 transitions, 1627 flow [2025-03-04 10:06:54,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 10:06:54,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-04 10:06:54,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 373 transitions. [2025-03-04 10:06:54,125 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.444047619047619 [2025-03-04 10:06:54,125 INFO L175 Difference]: Start difference. First operand has 102 places, 62 transitions, 523 flow. Second operand 20 states and 373 transitions. [2025-03-04 10:06:54,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 168 transitions, 1627 flow [2025-03-04 10:06:54,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 168 transitions, 1579 flow, removed 1 selfloop flow, removed 8 redundant places. [2025-03-04 10:06:54,153 INFO L231 Difference]: Finished difference. Result has 112 places, 62 transitions, 528 flow [2025-03-04 10:06:54,153 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=528, PETRI_PLACES=112, PETRI_TRANSITIONS=62} [2025-03-04 10:06:54,153 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 70 predicate places. [2025-03-04 10:06:54,153 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 62 transitions, 528 flow [2025-03-04 10:06:54,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 15.38888888888889) internal successors, (554), 36 states have internal predecessors, (554), 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-04 10:06:54,154 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:54,154 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:54,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 10:06:54,354 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,SelfDestructingSolverStorable20 [2025-03-04 10:06:54,354 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 10:06:54,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:54,355 INFO L85 PathProgramCache]: Analyzing trace with hash 268172320, now seen corresponding path program 1 times [2025-03-04 10:06:54,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:54,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349861133] [2025-03-04 10:06:54,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:54,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:54,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 10:06:54,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 10:06:54,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:54,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:54,841 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:06:54,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:54,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349861133] [2025-03-04 10:06:54,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349861133] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:54,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910093484] [2025-03-04 10:06:54,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:54,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:54,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:54,843 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-04 10:06:54,844 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-04 10:06:54,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 10:06:54,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 10:06:54,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:54,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:54,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 10:06:54,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:55,064 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:06:55,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 23 [2025-03-04 10:06:55,092 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:06:55,093 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:11,661 INFO L349 Elim1Store]: treesize reduction 28, result has 59.4 percent of original size [2025-03-04 10:07:11,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 50 [2025-03-04 10:07:11,691 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:07:11,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910093484] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:07:11,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:07:11,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 28 [2025-03-04 10:07:11,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52096146] [2025-03-04 10:07:11,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:07:11,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 10:07:11,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:11,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 10:07:11,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=643, Unknown=3, NotChecked=0, Total=756 [2025-03-04 10:07:15,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 10:07:19,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 10:07:23,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 10:07:27,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 10:07:31,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 10:07:35,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-03-04 10:07:39,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 10:07:43,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 10:07:47,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 10:07:51,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 10:07:55,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 10:07:59,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 10:08:03,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 10:08:07,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 10:08:07,833 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2025-03-04 10:08:07,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 62 transitions, 528 flow. Second operand has 28 states, 28 states have (on average 8.107142857142858) internal successors, (227), 28 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:07,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:07,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2025-03-04 10:08:07,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:09,030 INFO L124 PetriNetUnfolderBase]: 2546/4407 cut-off events. [2025-03-04 10:08:09,030 INFO L125 PetriNetUnfolderBase]: For 17526/17526 co-relation queries the response was YES. [2025-03-04 10:08:09,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18229 conditions, 4407 events. 2546/4407 cut-off events. For 17526/17526 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 23186 event pairs, 1126 based on Foata normal form. 1/4408 useless extension candidates. Maximal degree in co-relation 18090. Up to 3560 conditions per place. [2025-03-04 10:08:09,055 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 107 selfloop transitions, 23 changer transitions 3/134 dead transitions. [2025-03-04 10:08:09,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 134 transitions, 1307 flow [2025-03-04 10:08:09,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:08:09,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 10:08:09,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 172 transitions. [2025-03-04 10:08:09,057 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2925170068027211 [2025-03-04 10:08:09,057 INFO L175 Difference]: Start difference. First operand has 112 places, 62 transitions, 528 flow. Second operand 14 states and 172 transitions. [2025-03-04 10:08:09,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 134 transitions, 1307 flow [2025-03-04 10:08:09,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 134 transitions, 1249 flow, removed 1 selfloop flow, removed 18 redundant places. [2025-03-04 10:08:09,074 INFO L231 Difference]: Finished difference. Result has 113 places, 75 transitions, 694 flow [2025-03-04 10:08:09,075 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=694, PETRI_PLACES=113, PETRI_TRANSITIONS=75} [2025-03-04 10:08:09,075 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 71 predicate places. [2025-03-04 10:08:09,075 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 75 transitions, 694 flow [2025-03-04 10:08:09,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 8.107142857142858) internal successors, (227), 28 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:09,075 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:09,075 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:09,083 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-04 10:08:09,280 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,SelfDestructingSolverStorable21 [2025-03-04 10:08:09,280 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-04 10:08:09,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:09,281 INFO L85 PathProgramCache]: Analyzing trace with hash -389471440, now seen corresponding path program 2 times [2025-03-04 10:08:09,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:09,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994013014] [2025-03-04 10:08:09,282 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:08:09,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:09,289 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-03-04 10:08:09,302 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 41 statements. [2025-03-04 10:08:09,302 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:08:09,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat