./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/loop-tiling-eq.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 2c579ed20cf5b381709dcc4ef9fbcf839f80c68ac017a29b947b11bd3a57dd56 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:21:23,825 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:21:23,880 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:21:23,884 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:21:23,885 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:21:23,906 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:21:23,907 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:21:23,907 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:21:23,907 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:21:23,907 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:21:23,908 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:21:23,908 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:21:23,908 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:21:23,908 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:21:23,909 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:21:23,909 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:21:23,909 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:21:23,909 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:21:23,909 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:21:23,909 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:21:23,909 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:21:23,909 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:21:23,909 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:21:23,909 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:21:23,909 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:21:23,909 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:21:23,909 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:21:23,909 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:21:23,909 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:21:23,910 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:21:23,910 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:21:23,910 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:21:23,910 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:21:23,910 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:21:23,910 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:21:23,910 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:21:23,910 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:21:23,910 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:21:23,910 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:21:23,910 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:21:23,910 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:21:23,910 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:21:23,910 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 -> 2c579ed20cf5b381709dcc4ef9fbcf839f80c68ac017a29b947b11bd3a57dd56 [2025-03-09 01:21:24,119 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:21:24,126 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:21:24,128 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:21:24,129 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:21:24,129 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:21:24,132 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c [2025-03-09 01:21:25,293 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e96221d5/47c7d346baa043aeb7aacf0e1a5d55e0/FLAGc739bc95c [2025-03-09 01:21:25,519 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:21:25,519 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c [2025-03-09 01:21:25,545 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e96221d5/47c7d346baa043aeb7aacf0e1a5d55e0/FLAGc739bc95c [2025-03-09 01:21:25,862 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e96221d5/47c7d346baa043aeb7aacf0e1a5d55e0 [2025-03-09 01:21:25,864 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:21:25,865 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:21:25,865 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:21:25,866 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:21:25,868 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:21:25,869 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:21:25" (1/1) ... [2025-03-09 01:21:25,869 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c9801bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:25, skipping insertion in model container [2025-03-09 01:21:25,870 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:21:25" (1/1) ... [2025-03-09 01:21:25,880 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:21:25,981 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 01:21:25,986 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 01:21:25,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:21:25,994 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:21:26,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:21:26,025 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:21:26,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:26 WrapperNode [2025-03-09 01:21:26,026 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:21:26,027 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:21:26,027 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:21:26,028 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:21:26,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:26" (1/1) ... [2025-03-09 01:21:26,038 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:26" (1/1) ... [2025-03-09 01:21:26,055 INFO L138 Inliner]: procedures = 24, calls = 32, calls flagged for inlining = 14, calls inlined = 18, statements flattened = 174 [2025-03-09 01:21:26,055 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:21:26,056 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:21:26,056 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:21:26,056 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:21:26,061 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:26" (1/1) ... [2025-03-09 01:21:26,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:26" (1/1) ... [2025-03-09 01:21:26,064 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:26" (1/1) ... [2025-03-09 01:21:26,075 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 9, 3]. 64 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 6 writes are split as follows [0, 5, 1]. [2025-03-09 01:21:26,075 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:26" (1/1) ... [2025-03-09 01:21:26,075 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:26" (1/1) ... [2025-03-09 01:21:26,081 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:26" (1/1) ... [2025-03-09 01:21:26,082 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:26" (1/1) ... [2025-03-09 01:21:26,083 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:26" (1/1) ... [2025-03-09 01:21:26,084 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:26" (1/1) ... [2025-03-09 01:21:26,086 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:21:26,086 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:21:26,086 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:21:26,086 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:21:26,087 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:26" (1/1) ... [2025-03-09 01:21:26,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:21:26,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:21:26,113 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:21:26,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:21:26,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 01:21:26,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 01:21:26,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-09 01:21:26,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:21:26,133 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 01:21:26,133 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 01:21:26,133 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 01:21:26,133 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 01:21:26,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:21:26,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:21:26,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 01:21:26,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 01:21:26,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 01:21:26,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-09 01:21:26,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:21:26,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:21:26,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 01:21:26,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 01:21:26,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:21:26,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:21:26,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:21:26,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:21:26,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 01:21:26,135 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:21:26,218 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:21:26,220 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:21:26,643 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:21:26,643 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:21:26,856 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:21:26,856 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:21:26,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:21:26 BoogieIcfgContainer [2025-03-09 01:21:26,857 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:21:26,858 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:21:26,859 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:21:26,862 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:21:26,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:21:25" (1/3) ... [2025-03-09 01:21:26,863 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@629eaea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:21:26, skipping insertion in model container [2025-03-09 01:21:26,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:26" (2/3) ... [2025-03-09 01:21:26,863 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@629eaea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:21:26, skipping insertion in model container [2025-03-09 01:21:26,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:21:26" (3/3) ... [2025-03-09 01:21:26,864 INFO L128 eAbstractionObserver]: Analyzing ICFG loop-tiling-eq.wvr.c [2025-03-09 01:21:26,876 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:21:26,878 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG loop-tiling-eq.wvr.c that has 3 procedures, 60 locations, 1 initial locations, 7 loop locations, and 26 error locations. [2025-03-09 01:21:26,878 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:21:26,929 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-09 01:21:26,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 66 transitions, 146 flow [2025-03-09 01:21:26,988 INFO L124 PetriNetUnfolderBase]: 7/64 cut-off events. [2025-03-09 01:21:26,989 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 01:21:26,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 64 events. 7/64 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 163 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2025-03-09 01:21:26,991 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 66 transitions, 146 flow [2025-03-09 01:21:26,998 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 63 transitions, 138 flow [2025-03-09 01:21:27,007 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:21:27,014 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;@3f704b3c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:21:27,014 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2025-03-09 01:21:27,017 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:21:27,017 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-09 01:21:27,017 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:21:27,017 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:27,017 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:21:27,018 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-09 01:21:27,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:27,021 INFO L85 PathProgramCache]: Analyzing trace with hash 620471, now seen corresponding path program 1 times [2025-03-09 01:21:27,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:27,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722659198] [2025-03-09 01:21:27,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:27,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:27,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:21:27,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:21:27,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:27,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:27,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:21:27,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:27,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722659198] [2025-03-09 01:21:27,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722659198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:27,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:27,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:21:27,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223930966] [2025-03-09 01:21:27,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:27,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:21:27,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:27,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:21:27,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:21:27,316 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-03-09 01:21:27,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 63 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 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-09 01:21:27,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:27,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-03-09 01:21:27,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:27,415 INFO L124 PetriNetUnfolderBase]: 58/178 cut-off events. [2025-03-09 01:21:27,415 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-03-09 01:21:27,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 299 conditions, 178 events. 58/178 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 691 event pairs, 30 based on Foata normal form. 1/126 useless extension candidates. Maximal degree in co-relation 222. Up to 96 conditions per place. [2025-03-09 01:21:27,419 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 25 selfloop transitions, 4 changer transitions 0/58 dead transitions. [2025-03-09 01:21:27,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 58 transitions, 186 flow [2025-03-09 01:21:27,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:21:27,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:21:27,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2025-03-09 01:21:27,431 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6515151515151515 [2025-03-09 01:21:27,432 INFO L175 Difference]: Start difference. First operand has 63 places, 63 transitions, 138 flow. Second operand 3 states and 129 transitions. [2025-03-09 01:21:27,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 58 transitions, 186 flow [2025-03-09 01:21:27,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 58 transitions, 178 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:21:27,439 INFO L231 Difference]: Finished difference. Result has 56 places, 58 transitions, 128 flow [2025-03-09 01:21:27,440 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=56, PETRI_TRANSITIONS=58} [2025-03-09 01:21:27,444 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, -7 predicate places. [2025-03-09 01:21:27,445 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 58 transitions, 128 flow [2025-03-09 01:21:27,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 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-09 01:21:27,446 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:27,446 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:21:27,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:21:27,446 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-09 01:21:27,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:27,447 INFO L85 PathProgramCache]: Analyzing trace with hash 620472, now seen corresponding path program 1 times [2025-03-09 01:21:27,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:27,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520830732] [2025-03-09 01:21:27,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:27,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:27,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:21:27,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:21:27,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:27,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 01:21:27,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [710141998] [2025-03-09 01:21:27,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:27,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:27,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:21:27,497 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:21:27,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:21:27,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:21:27,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:21:27,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:27,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:27,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 01:21:27,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:21:27,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-09 01:21:28,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:21:28,252 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:21:28,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:28,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520830732] [2025-03-09 01:21:28,253 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 01:21:28,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710141998] [2025-03-09 01:21:28,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710141998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:28,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:28,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:21:28,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555727071] [2025-03-09 01:21:28,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:28,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:21:28,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:28,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:21:28,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:21:28,631 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-03-09 01:21:28,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 58 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:28,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:28,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-03-09 01:21:28,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:29,222 INFO L124 PetriNetUnfolderBase]: 58/177 cut-off events. [2025-03-09 01:21:29,222 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-09 01:21:29,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 294 conditions, 177 events. 58/177 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 688 event pairs, 30 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 257. Up to 104 conditions per place. [2025-03-09 01:21:29,224 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 27 selfloop transitions, 4 changer transitions 0/57 dead transitions. [2025-03-09 01:21:29,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 57 transitions, 188 flow [2025-03-09 01:21:29,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:21:29,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:21:29,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 160 transitions. [2025-03-09 01:21:29,225 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2025-03-09 01:21:29,225 INFO L175 Difference]: Start difference. First operand has 56 places, 58 transitions, 128 flow. Second operand 4 states and 160 transitions. [2025-03-09 01:21:29,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 57 transitions, 188 flow [2025-03-09 01:21:29,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 57 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:21:29,226 INFO L231 Difference]: Finished difference. Result has 56 places, 57 transitions, 126 flow [2025-03-09 01:21:29,226 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=126, PETRI_PLACES=56, PETRI_TRANSITIONS=57} [2025-03-09 01:21:29,227 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, -7 predicate places. [2025-03-09 01:21:29,227 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 57 transitions, 126 flow [2025-03-09 01:21:29,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:29,227 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:29,227 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-09 01:21:29,235 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-09 01:21:29,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:29,428 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-09 01:21:29,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:29,429 INFO L85 PathProgramCache]: Analyzing trace with hash 19236874, now seen corresponding path program 1 times [2025-03-09 01:21:29,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:29,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417475484] [2025-03-09 01:21:29,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:29,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:29,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 01:21:29,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 01:21:29,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:29,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:29,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:21:29,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:29,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417475484] [2025-03-09 01:21:29,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417475484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:29,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:29,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:21:29,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035962910] [2025-03-09 01:21:29,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:29,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:21:29,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:29,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:21:29,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:21:29,577 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2025-03-09 01:21:29,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 57 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:29,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:29,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2025-03-09 01:21:29,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:29,679 INFO L124 PetriNetUnfolderBase]: 60/185 cut-off events. [2025-03-09 01:21:29,679 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-09 01:21:29,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 185 events. 60/185 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 727 event pairs, 30 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 272. Up to 107 conditions per place. [2025-03-09 01:21:29,681 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 29 selfloop transitions, 7 changer transitions 0/64 dead transitions. [2025-03-09 01:21:29,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 64 transitions, 218 flow [2025-03-09 01:21:29,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:21:29,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:21:29,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 177 transitions. [2025-03-09 01:21:29,683 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6704545454545454 [2025-03-09 01:21:29,683 INFO L175 Difference]: Start difference. First operand has 56 places, 57 transitions, 126 flow. Second operand 4 states and 177 transitions. [2025-03-09 01:21:29,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 64 transitions, 218 flow [2025-03-09 01:21:29,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 64 transitions, 204 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:21:29,686 INFO L231 Difference]: Finished difference. Result has 58 places, 62 transitions, 158 flow [2025-03-09 01:21:29,686 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=158, PETRI_PLACES=58, PETRI_TRANSITIONS=62} [2025-03-09 01:21:29,687 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, -5 predicate places. [2025-03-09 01:21:29,687 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 62 transitions, 158 flow [2025-03-09 01:21:29,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:29,688 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:29,688 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:21:29,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:21:29,688 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-09 01:21:29,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:29,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1305199876, now seen corresponding path program 1 times [2025-03-09 01:21:29,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:29,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243111814] [2025-03-09 01:21:29,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:29,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:29,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:21:29,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:21:29,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:29,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:29,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:21:29,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:29,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243111814] [2025-03-09 01:21:29,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243111814] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:21:29,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670902545] [2025-03-09 01:21:29,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:29,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:29,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:21:29,929 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:21:29,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:21:29,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:21:29,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:21:29,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:29,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:29,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-09 01:21:29,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:21:29,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-09 01:21:30,092 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-09 01:21:30,092 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 32 treesize of output 27 [2025-03-09 01:21:30,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:21:30,112 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:21:30,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:21:30,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670902545] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:21:30,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:21:30,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 3] total 10 [2025-03-09 01:21:30,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716639659] [2025-03-09 01:21:30,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:30,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:21:30,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:30,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:21:30,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:21:30,270 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-03-09 01:21:30,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 62 transitions, 158 flow. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:30,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:30,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-03-09 01:21:30,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:30,419 INFO L124 PetriNetUnfolderBase]: 115/353 cut-off events. [2025-03-09 01:21:30,420 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-09 01:21:30,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 594 conditions, 353 events. 115/353 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1796 event pairs, 60 based on Foata normal form. 1/251 useless extension candidates. Maximal degree in co-relation 292. Up to 107 conditions per place. [2025-03-09 01:21:30,421 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 55 selfloop transitions, 6 changer transitions 0/87 dead transitions. [2025-03-09 01:21:30,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 87 transitions, 336 flow [2025-03-09 01:21:30,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:21:30,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:21:30,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 222 transitions. [2025-03-09 01:21:30,423 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6727272727272727 [2025-03-09 01:21:30,423 INFO L175 Difference]: Start difference. First operand has 58 places, 62 transitions, 158 flow. Second operand 5 states and 222 transitions. [2025-03-09 01:21:30,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 87 transitions, 336 flow [2025-03-09 01:21:30,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 87 transitions, 336 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 01:21:30,424 INFO L231 Difference]: Finished difference. Result has 63 places, 62 transitions, 175 flow [2025-03-09 01:21:30,425 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=175, PETRI_PLACES=63, PETRI_TRANSITIONS=62} [2025-03-09 01:21:30,425 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 0 predicate places. [2025-03-09 01:21:30,425 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 62 transitions, 175 flow [2025-03-09 01:21:30,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:30,425 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:30,425 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:21:30,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 01:21:30,630 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-09 01:21:30,630 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-09 01:21:30,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:30,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1306802994, now seen corresponding path program 1 times [2025-03-09 01:21:30,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:30,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694015144] [2025-03-09 01:21:30,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:30,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:30,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:21:30,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:21:30,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:30,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:30,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:21:30,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:30,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694015144] [2025-03-09 01:21:30,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694015144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:30,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:30,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:21:30,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693545338] [2025-03-09 01:21:30,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:30,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:21:30,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:30,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:21:30,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:21:30,968 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-03-09 01:21:30,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 62 transitions, 175 flow. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:30,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:30,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-03-09 01:21:30,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:31,102 INFO L124 PetriNetUnfolderBase]: 139/391 cut-off events. [2025-03-09 01:21:31,102 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-09 01:21:31,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 690 conditions, 391 events. 139/391 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1963 event pairs, 76 based on Foata normal form. 0/299 useless extension candidates. Maximal degree in co-relation 340. Up to 247 conditions per place. [2025-03-09 01:21:31,105 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 36 selfloop transitions, 7 changer transitions 0/68 dead transitions. [2025-03-09 01:21:31,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 68 transitions, 273 flow [2025-03-09 01:21:31,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:21:31,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:21:31,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 199 transitions. [2025-03-09 01:21:31,106 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.603030303030303 [2025-03-09 01:21:31,106 INFO L175 Difference]: Start difference. First operand has 63 places, 62 transitions, 175 flow. Second operand 5 states and 199 transitions. [2025-03-09 01:21:31,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 68 transitions, 273 flow [2025-03-09 01:21:31,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 68 transitions, 271 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:21:31,107 INFO L231 Difference]: Finished difference. Result has 68 places, 65 transitions, 208 flow [2025-03-09 01:21:31,108 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=208, PETRI_PLACES=68, PETRI_TRANSITIONS=65} [2025-03-09 01:21:31,108 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 5 predicate places. [2025-03-09 01:21:31,108 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 65 transitions, 208 flow [2025-03-09 01:21:31,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:31,108 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:31,108 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:21:31,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:21:31,108 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-09 01:21:31,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:31,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1306802993, now seen corresponding path program 1 times [2025-03-09 01:21:31,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:31,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309327634] [2025-03-09 01:21:31,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:31,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:31,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:21:31,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:21:31,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:31,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:31,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:21:31,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:31,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309327634] [2025-03-09 01:21:31,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309327634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:31,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:31,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:21:31,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126594274] [2025-03-09 01:21:31,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:31,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:21:31,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:31,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:21:31,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:21:31,199 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 66 [2025-03-09 01:21:31,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 65 transitions, 208 flow. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:31,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:31,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 66 [2025-03-09 01:21:31,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:31,268 INFO L124 PetriNetUnfolderBase]: 139/373 cut-off events. [2025-03-09 01:21:31,268 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-09 01:21:31,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 695 conditions, 373 events. 139/373 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1767 event pairs, 76 based on Foata normal form. 4/303 useless extension candidates. Maximal degree in co-relation 620. Up to 245 conditions per place. [2025-03-09 01:21:31,270 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 36 selfloop transitions, 3 changer transitions 0/62 dead transitions. [2025-03-09 01:21:31,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 62 transitions, 280 flow [2025-03-09 01:21:31,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:21:31,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:21:31,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2025-03-09 01:21:31,272 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6262626262626263 [2025-03-09 01:21:31,272 INFO L175 Difference]: Start difference. First operand has 68 places, 65 transitions, 208 flow. Second operand 3 states and 124 transitions. [2025-03-09 01:21:31,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 62 transitions, 280 flow [2025-03-09 01:21:31,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 62 transitions, 273 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:21:31,274 INFO L231 Difference]: Finished difference. Result has 65 places, 62 transitions, 201 flow [2025-03-09 01:21:31,274 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=201, PETRI_PLACES=65, PETRI_TRANSITIONS=62} [2025-03-09 01:21:31,274 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 2 predicate places. [2025-03-09 01:21:31,274 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 62 transitions, 201 flow [2025-03-09 01:21:31,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:31,275 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:31,275 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:21:31,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:21:31,275 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-09 01:21:31,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:31,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1306803020, now seen corresponding path program 1 times [2025-03-09 01:21:31,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:31,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560826882] [2025-03-09 01:21:31,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:31,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:31,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:21:31,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:21:31,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:31,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:31,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:21:31,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:31,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560826882] [2025-03-09 01:21:31,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560826882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:31,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:31,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:21:31,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844221790] [2025-03-09 01:21:31,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:31,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:21:31,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:31,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:21:31,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:21:31,582 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-03-09 01:21:31,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 62 transitions, 201 flow. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:31,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:31,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-03-09 01:21:31,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:31,711 INFO L124 PetriNetUnfolderBase]: 123/363 cut-off events. [2025-03-09 01:21:31,712 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-03-09 01:21:31,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 664 conditions, 363 events. 123/363 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1822 event pairs, 60 based on Foata normal form. 0/267 useless extension candidates. Maximal degree in co-relation 563. Up to 227 conditions per place. [2025-03-09 01:21:31,718 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 34 selfloop transitions, 9 changer transitions 0/66 dead transitions. [2025-03-09 01:21:31,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 66 transitions, 295 flow [2025-03-09 01:21:31,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:21:31,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:21:31,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 198 transitions. [2025-03-09 01:21:31,719 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-09 01:21:31,722 INFO L175 Difference]: Start difference. First operand has 65 places, 62 transitions, 201 flow. Second operand 5 states and 198 transitions. [2025-03-09 01:21:31,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 66 transitions, 295 flow [2025-03-09 01:21:31,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 66 transitions, 292 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:21:31,725 INFO L231 Difference]: Finished difference. Result has 70 places, 66 transitions, 245 flow [2025-03-09 01:21:31,727 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=245, PETRI_PLACES=70, PETRI_TRANSITIONS=66} [2025-03-09 01:21:31,728 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 7 predicate places. [2025-03-09 01:21:31,728 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 66 transitions, 245 flow [2025-03-09 01:21:31,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:31,729 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:31,729 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:31,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:21:31,729 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-09 01:21:31,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:31,729 INFO L85 PathProgramCache]: Analyzing trace with hash 166650161, now seen corresponding path program 1 times [2025-03-09 01:21:31,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:31,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438898715] [2025-03-09 01:21:31,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:31,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:31,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:21:31,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:21:31,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:31,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:31,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:21:31,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:31,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438898715] [2025-03-09 01:21:31,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438898715] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:21:31,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693933147] [2025-03-09 01:21:31,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:31,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:31,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:21:31,822 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:21:31,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 01:21:31,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:21:31,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:21:31,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:31,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:31,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 01:21:31,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:21:31,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:21:31,940 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:21:32,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:21:32,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693933147] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:21:32,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:21:32,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-09 01:21:32,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950715499] [2025-03-09 01:21:32,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:21:32,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:21:32,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:32,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:21:32,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:21:32,045 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2025-03-09 01:21:32,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 66 transitions, 245 flow. Second operand has 13 states, 13 states have (on average 36.53846153846154) internal successors, (475), 13 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:32,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:32,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2025-03-09 01:21:32,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:32,263 INFO L124 PetriNetUnfolderBase]: 233/682 cut-off events. [2025-03-09 01:21:32,263 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-03-09 01:21:32,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1262 conditions, 682 events. 233/682 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 4060 event pairs, 120 based on Foata normal form. 1/517 useless extension candidates. Maximal degree in co-relation 620. Up to 216 conditions per place. [2025-03-09 01:21:32,267 INFO L140 encePairwiseOnDemand]: 56/66 looper letters, 47 selfloop transitions, 23 changer transitions 0/95 dead transitions. [2025-03-09 01:21:32,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 95 transitions, 499 flow [2025-03-09 01:21:32,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:21:32,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:21:32,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 380 transitions. [2025-03-09 01:21:32,269 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6397306397306397 [2025-03-09 01:21:32,269 INFO L175 Difference]: Start difference. First operand has 70 places, 66 transitions, 245 flow. Second operand 9 states and 380 transitions. [2025-03-09 01:21:32,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 95 transitions, 499 flow [2025-03-09 01:21:32,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 95 transitions, 491 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:21:32,272 INFO L231 Difference]: Finished difference. Result has 79 places, 76 transitions, 380 flow [2025-03-09 01:21:32,272 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=380, PETRI_PLACES=79, PETRI_TRANSITIONS=76} [2025-03-09 01:21:32,276 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 16 predicate places. [2025-03-09 01:21:32,276 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 76 transitions, 380 flow [2025-03-09 01:21:32,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 36.53846153846154) internal successors, (475), 13 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:32,276 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:32,277 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:32,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 01:21:32,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:32,477 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-09 01:21:32,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:32,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1708676453, now seen corresponding path program 1 times [2025-03-09 01:21:32,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:32,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336056483] [2025-03-09 01:21:32,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:32,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:32,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:21:32,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:21:32,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:32,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:32,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:21:32,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:32,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336056483] [2025-03-09 01:21:32,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336056483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:32,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:32,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:21:32,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537608685] [2025-03-09 01:21:32,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:32,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:21:32,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:32,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:21:32,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:21:32,557 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-03-09 01:21:32,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 76 transitions, 380 flow. Second operand has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 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-09 01:21:32,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:32,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-03-09 01:21:32,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:32,734 INFO L124 PetriNetUnfolderBase]: 337/973 cut-off events. [2025-03-09 01:21:32,734 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2025-03-09 01:21:32,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1867 conditions, 973 events. 337/973 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 6321 event pairs, 156 based on Foata normal form. 0/735 useless extension candidates. Maximal degree in co-relation 1236. Up to 269 conditions per place. [2025-03-09 01:21:32,737 INFO L140 encePairwiseOnDemand]: 55/66 looper letters, 72 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2025-03-09 01:21:32,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 112 transitions, 687 flow [2025-03-09 01:21:32,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:21:32,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:21:32,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 274 transitions. [2025-03-09 01:21:32,738 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6919191919191919 [2025-03-09 01:21:32,738 INFO L175 Difference]: Start difference. First operand has 79 places, 76 transitions, 380 flow. Second operand 6 states and 274 transitions. [2025-03-09 01:21:32,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 112 transitions, 687 flow [2025-03-09 01:21:32,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 112 transitions, 642 flow, removed 8 selfloop flow, removed 4 redundant places. [2025-03-09 01:21:32,741 INFO L231 Difference]: Finished difference. Result has 83 places, 82 transitions, 431 flow [2025-03-09 01:21:32,742 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=431, PETRI_PLACES=83, PETRI_TRANSITIONS=82} [2025-03-09 01:21:32,743 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 20 predicate places. [2025-03-09 01:21:32,743 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 82 transitions, 431 flow [2025-03-09 01:21:32,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 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-09 01:21:32,744 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:32,744 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:32,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 01:21:32,744 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-09 01:21:32,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:32,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1707270780, now seen corresponding path program 1 times [2025-03-09 01:21:32,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:32,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112436318] [2025-03-09 01:21:32,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:32,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:32,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:21:32,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:21:32,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:32,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:32,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:21:32,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:32,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112436318] [2025-03-09 01:21:32,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112436318] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:21:32,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426734663] [2025-03-09 01:21:32,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:32,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:32,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:21:32,918 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:21:32,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 01:21:32,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:21:32,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:21:32,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:32,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:32,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 01:21:32,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:21:33,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-09 01:21:33,140 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:21:33,140 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:21:33,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:21:33,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426734663] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:21:33,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:21:33,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-09 01:21:33,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897465717] [2025-03-09 01:21:33,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:21:33,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:21:33,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:33,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:21:33,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:21:33,711 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-03-09 01:21:33,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 82 transitions, 431 flow. Second operand has 13 states, 13 states have (on average 33.61538461538461) internal successors, (437), 13 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:33,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:33,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-03-09 01:21:33,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:34,021 INFO L124 PetriNetUnfolderBase]: 311/1001 cut-off events. [2025-03-09 01:21:34,021 INFO L125 PetriNetUnfolderBase]: For 325/325 co-relation queries the response was YES. [2025-03-09 01:21:34,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2130 conditions, 1001 events. 311/1001 cut-off events. For 325/325 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 7060 event pairs, 180 based on Foata normal form. 12/763 useless extension candidates. Maximal degree in co-relation 1342. Up to 556 conditions per place. [2025-03-09 01:21:34,026 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 35 selfloop transitions, 26 changer transitions 0/84 dead transitions. [2025-03-09 01:21:34,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 84 transitions, 567 flow [2025-03-09 01:21:34,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:21:34,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:21:34,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 332 transitions. [2025-03-09 01:21:34,029 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5589225589225589 [2025-03-09 01:21:34,029 INFO L175 Difference]: Start difference. First operand has 83 places, 82 transitions, 431 flow. Second operand 9 states and 332 transitions. [2025-03-09 01:21:34,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 84 transitions, 567 flow [2025-03-09 01:21:34,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 84 transitions, 558 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:21:34,032 INFO L231 Difference]: Finished difference. Result has 89 places, 84 transitions, 488 flow [2025-03-09 01:21:34,033 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=488, PETRI_PLACES=89, PETRI_TRANSITIONS=84} [2025-03-09 01:21:34,034 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 26 predicate places. [2025-03-09 01:21:34,034 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 84 transitions, 488 flow [2025-03-09 01:21:34,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 33.61538461538461) internal successors, (437), 13 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:34,035 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:34,035 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2025-03-09 01:21:34,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 01:21:34,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:34,235 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-09 01:21:34,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:34,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1385005422, now seen corresponding path program 1 times [2025-03-09 01:21:34,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:34,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807561523] [2025-03-09 01:21:34,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:34,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:34,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:21:34,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:21:34,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:34,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:34,516 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:21:34,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:34,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807561523] [2025-03-09 01:21:34,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807561523] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:21:34,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268270914] [2025-03-09 01:21:34,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:34,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:34,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:21:34,518 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:21:34,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 01:21:34,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:21:34,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:21:34,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:34,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:34,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-09 01:21:34,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:21:34,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-09 01:21:34,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:21:34,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:21:34,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-09 01:21:34,666 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:21:34,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 01:21:34,774 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:21:34,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 01:21:34,781 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 21 treesize of output 14 [2025-03-09 01:21:34,852 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:21:34,852 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:21:34,945 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:21:34,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2025-03-09 01:21:35,071 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-09 01:21:35,102 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:21:35,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268270914] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:21:35,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:21:35,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2025-03-09 01:21:35,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582901109] [2025-03-09 01:21:35,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:21:35,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-09 01:21:35,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:35,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 01:21:35,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2025-03-09 01:21:35,856 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 66 [2025-03-09 01:21:35,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 84 transitions, 488 flow. Second operand has 18 states, 18 states have (on average 27.5) internal successors, (495), 18 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:35,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:35,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 66 [2025-03-09 01:21:35,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:36,201 INFO L124 PetriNetUnfolderBase]: 375/1124 cut-off events. [2025-03-09 01:21:36,201 INFO L125 PetriNetUnfolderBase]: For 431/431 co-relation queries the response was YES. [2025-03-09 01:21:36,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2611 conditions, 1124 events. 375/1124 cut-off events. For 431/431 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7911 event pairs, 228 based on Foata normal form. 0/900 useless extension candidates. Maximal degree in co-relation 1643. Up to 634 conditions per place. [2025-03-09 01:21:36,207 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 64 selfloop transitions, 24 changer transitions 0/109 dead transitions. [2025-03-09 01:21:36,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 109 transitions, 892 flow [2025-03-09 01:21:36,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:21:36,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 01:21:36,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 305 transitions. [2025-03-09 01:21:36,209 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4621212121212121 [2025-03-09 01:21:36,209 INFO L175 Difference]: Start difference. First operand has 89 places, 84 transitions, 488 flow. Second operand 10 states and 305 transitions. [2025-03-09 01:21:36,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 109 transitions, 892 flow [2025-03-09 01:21:36,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 109 transitions, 769 flow, removed 20 selfloop flow, removed 6 redundant places. [2025-03-09 01:21:36,213 INFO L231 Difference]: Finished difference. Result has 92 places, 91 transitions, 528 flow [2025-03-09 01:21:36,213 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=528, PETRI_PLACES=92, PETRI_TRANSITIONS=91} [2025-03-09 01:21:36,214 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 29 predicate places. [2025-03-09 01:21:36,214 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 91 transitions, 528 flow [2025-03-09 01:21:36,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 27.5) internal successors, (495), 18 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:36,215 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:36,215 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2025-03-09 01:21:36,221 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-09 01:21:36,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-09 01:21:36,418 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-09 01:21:36,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:36,418 INFO L85 PathProgramCache]: Analyzing trace with hash -287698645, now seen corresponding path program 2 times [2025-03-09 01:21:36,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:36,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468908512] [2025-03-09 01:21:36,418 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:21:36,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:36,430 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-03-09 01:21:36,441 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:21:36,442 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:21:36,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:36,620 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:21:36,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:36,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468908512] [2025-03-09 01:21:36,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468908512] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:21:36,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254471581] [2025-03-09 01:21:36,621 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:21:36,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:36,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:21:36,622 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:21:36,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 01:21:36,666 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-03-09 01:21:36,683 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:21:36,683 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:21:36,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:36,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-09 01:21:36,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:21:36,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 8 treesize of output 1 [2025-03-09 01:21:36,779 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-09 01:21:36,779 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 23 treesize of output 20 [2025-03-09 01:21:36,856 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:21:36,856 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:21:37,020 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:21:37,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254471581] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:21:37,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:21:37,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2025-03-09 01:21:37,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984974326] [2025-03-09 01:21:37,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:21:37,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-09 01:21:37,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:37,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-09 01:21:37,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2025-03-09 01:21:37,771 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-03-09 01:21:37,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 91 transitions, 528 flow. Second operand has 20 states, 20 states have (on average 33.5) internal successors, (670), 20 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:37,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:37,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-03-09 01:21:37,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:38,583 INFO L124 PetriNetUnfolderBase]: 394/1263 cut-off events. [2025-03-09 01:21:38,583 INFO L125 PetriNetUnfolderBase]: For 401/401 co-relation queries the response was YES. [2025-03-09 01:21:38,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2870 conditions, 1263 events. 394/1263 cut-off events. For 401/401 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 9387 event pairs, 210 based on Foata normal form. 7/965 useless extension candidates. Maximal degree in co-relation 1533. Up to 369 conditions per place. [2025-03-09 01:21:38,589 INFO L140 encePairwiseOnDemand]: 55/66 looper letters, 72 selfloop transitions, 71 changer transitions 0/165 dead transitions. [2025-03-09 01:21:38,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 165 transitions, 1275 flow [2025-03-09 01:21:38,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-09 01:21:38,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-09 01:21:38,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 888 transitions. [2025-03-09 01:21:38,592 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5606060606060606 [2025-03-09 01:21:38,592 INFO L175 Difference]: Start difference. First operand has 92 places, 91 transitions, 528 flow. Second operand 24 states and 888 transitions. [2025-03-09 01:21:38,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 165 transitions, 1275 flow [2025-03-09 01:21:38,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 165 transitions, 1136 flow, removed 8 selfloop flow, removed 7 redundant places. [2025-03-09 01:21:38,599 INFO L231 Difference]: Finished difference. Result has 117 places, 139 transitions, 993 flow [2025-03-09 01:21:38,600 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=993, PETRI_PLACES=117, PETRI_TRANSITIONS=139} [2025-03-09 01:21:38,600 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 54 predicate places. [2025-03-09 01:21:38,601 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 139 transitions, 993 flow [2025-03-09 01:21:38,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 33.5) internal successors, (670), 20 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:38,601 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:38,601 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:38,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-09 01:21:38,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:38,806 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-09 01:21:38,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:38,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1150979345, now seen corresponding path program 1 times [2025-03-09 01:21:38,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:38,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068261606] [2025-03-09 01:21:38,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:38,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:38,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:21:38,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:21:38,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:38,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:38,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:21:38,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:38,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068261606] [2025-03-09 01:21:38,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068261606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:38,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:38,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:21:38,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098134860] [2025-03-09 01:21:38,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:38,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:21:38,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:38,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:21:38,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:21:38,860 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2025-03-09 01:21:38,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 139 transitions, 993 flow. Second operand has 5 states, 5 states have (on average 36.8) internal successors, (184), 5 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:38,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:38,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2025-03-09 01:21:38,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:38,993 INFO L124 PetriNetUnfolderBase]: 331/1021 cut-off events. [2025-03-09 01:21:38,993 INFO L125 PetriNetUnfolderBase]: For 494/494 co-relation queries the response was YES. [2025-03-09 01:21:38,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2650 conditions, 1021 events. 331/1021 cut-off events. For 494/494 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6587 event pairs, 160 based on Foata normal form. 5/844 useless extension candidates. Maximal degree in co-relation 2371. Up to 382 conditions per place. [2025-03-09 01:21:38,998 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 110 selfloop transitions, 24 changer transitions 9/166 dead transitions. [2025-03-09 01:21:38,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 166 transitions, 1417 flow [2025-03-09 01:21:38,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:21:38,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:21:38,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 228 transitions. [2025-03-09 01:21:38,999 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6909090909090909 [2025-03-09 01:21:38,999 INFO L175 Difference]: Start difference. First operand has 117 places, 139 transitions, 993 flow. Second operand 5 states and 228 transitions. [2025-03-09 01:21:38,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 166 transitions, 1417 flow [2025-03-09 01:21:39,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 166 transitions, 1364 flow, removed 13 selfloop flow, removed 2 redundant places. [2025-03-09 01:21:39,006 INFO L231 Difference]: Finished difference. Result has 121 places, 141 transitions, 1005 flow [2025-03-09 01:21:39,006 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=940, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1005, PETRI_PLACES=121, PETRI_TRANSITIONS=141} [2025-03-09 01:21:39,007 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 58 predicate places. [2025-03-09 01:21:39,007 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 141 transitions, 1005 flow [2025-03-09 01:21:39,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.8) internal successors, (184), 5 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:39,007 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:39,007 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:39,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 01:21:39,007 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-09 01:21:39,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:39,008 INFO L85 PathProgramCache]: Analyzing trace with hash -898448628, now seen corresponding path program 1 times [2025-03-09 01:21:39,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:39,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020263277] [2025-03-09 01:21:39,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:39,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:39,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:21:39,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:21:39,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:39,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:39,067 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:21:39,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:39,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020263277] [2025-03-09 01:21:39,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020263277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:39,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:39,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:21:39,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825290465] [2025-03-09 01:21:39,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:39,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:21:39,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:39,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:21:39,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:21:39,118 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 66 [2025-03-09 01:21:39,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 141 transitions, 1005 flow. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:39,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:39,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 66 [2025-03-09 01:21:39,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:39,214 INFO L124 PetriNetUnfolderBase]: 319/888 cut-off events. [2025-03-09 01:21:39,214 INFO L125 PetriNetUnfolderBase]: For 571/579 co-relation queries the response was YES. [2025-03-09 01:21:39,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2482 conditions, 888 events. 319/888 cut-off events. For 571/579 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5083 event pairs, 206 based on Foata normal form. 0/804 useless extension candidates. Maximal degree in co-relation 2132. Up to 562 conditions per place. [2025-03-09 01:21:39,219 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 83 selfloop transitions, 37 changer transitions 0/139 dead transitions. [2025-03-09 01:21:39,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 139 transitions, 1241 flow [2025-03-09 01:21:39,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:21:39,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:21:39,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 173 transitions. [2025-03-09 01:21:39,220 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5242424242424243 [2025-03-09 01:21:39,220 INFO L175 Difference]: Start difference. First operand has 121 places, 141 transitions, 1005 flow. Second operand 5 states and 173 transitions. [2025-03-09 01:21:39,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 139 transitions, 1241 flow [2025-03-09 01:21:39,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 139 transitions, 1194 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-09 01:21:39,226 INFO L231 Difference]: Finished difference. Result has 121 places, 139 transitions, 1028 flow [2025-03-09 01:21:39,226 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=954, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1028, PETRI_PLACES=121, PETRI_TRANSITIONS=139} [2025-03-09 01:21:39,227 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 58 predicate places. [2025-03-09 01:21:39,227 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 139 transitions, 1028 flow [2025-03-09 01:21:39,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:39,227 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:39,227 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:39,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 01:21:39,227 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-09 01:21:39,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:39,227 INFO L85 PathProgramCache]: Analyzing trace with hash -898448627, now seen corresponding path program 1 times [2025-03-09 01:21:39,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:39,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924242572] [2025-03-09 01:21:39,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:39,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:39,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:21:39,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:21:39,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:39,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:39,372 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:21:39,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:39,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924242572] [2025-03-09 01:21:39,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924242572] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:21:39,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649276162] [2025-03-09 01:21:39,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:39,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:39,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:21:39,375 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:21:39,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 01:21:39,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:21:39,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:21:39,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:39,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:39,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:21:39,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:21:39,519 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:21:39,520 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:21:39,553 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:21:39,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649276162] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:21:39,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:21:39,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2025-03-09 01:21:39,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147993713] [2025-03-09 01:21:39,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:21:39,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 01:21:39,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:39,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 01:21:39,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:21:39,824 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 66 [2025-03-09 01:21:39,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 139 transitions, 1028 flow. Second operand has 12 states, 12 states have (on average 33.5) internal successors, (402), 12 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:39,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:39,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 66 [2025-03-09 01:21:39,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:44,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-09 01:21:48,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-09 01:21:52,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-09 01:21:53,362 INFO L124 PetriNetUnfolderBase]: 236/687 cut-off events. [2025-03-09 01:21:53,362 INFO L125 PetriNetUnfolderBase]: For 477/477 co-relation queries the response was YES. [2025-03-09 01:21:53,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2121 conditions, 687 events. 236/687 cut-off events. For 477/477 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3967 event pairs, 124 based on Foata normal form. 4/585 useless extension candidates. Maximal degree in co-relation 2022. Up to 209 conditions per place. [2025-03-09 01:21:53,365 INFO L140 encePairwiseOnDemand]: 54/66 looper letters, 87 selfloop transitions, 71 changer transitions 3/181 dead transitions. [2025-03-09 01:21:53,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 181 transitions, 1637 flow [2025-03-09 01:21:53,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-09 01:21:53,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-09 01:21:53,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 601 transitions. [2025-03-09 01:21:53,368 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.535650623885918 [2025-03-09 01:21:53,368 INFO L175 Difference]: Start difference. First operand has 121 places, 139 transitions, 1028 flow. Second operand 17 states and 601 transitions. [2025-03-09 01:21:53,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 181 transitions, 1637 flow [2025-03-09 01:21:53,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 181 transitions, 1545 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:21:53,375 INFO L231 Difference]: Finished difference. Result has 134 places, 152 transitions, 1214 flow [2025-03-09 01:21:53,375 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=954, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1214, PETRI_PLACES=134, PETRI_TRANSITIONS=152} [2025-03-09 01:21:53,376 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 71 predicate places. [2025-03-09 01:21:53,376 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 152 transitions, 1214 flow [2025-03-09 01:21:53,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 33.5) internal successors, (402), 12 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:53,376 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:53,376 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:53,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 01:21:53,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:53,577 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-09 01:21:53,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:53,578 INFO L85 PathProgramCache]: Analyzing trace with hash 301642291, now seen corresponding path program 1 times [2025-03-09 01:21:53,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:53,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858980362] [2025-03-09 01:21:53,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:53,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:53,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:21:53,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:21:53,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:53,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:53,646 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:21:53,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:53,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858980362] [2025-03-09 01:21:53,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858980362] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:21:53,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360294191] [2025-03-09 01:21:53,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:53,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:53,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:21:53,649 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:21:53,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 01:21:53,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:21:53,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:21:53,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:53,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:53,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 01:21:53,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:21:53,751 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:21:53,753 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:21:53,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360294191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:53,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:21:53,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 8 [2025-03-09 01:21:53,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454093128] [2025-03-09 01:21:53,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:53,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:21:53,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:53,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:21:53,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:21:53,778 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-03-09 01:21:53,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 152 transitions, 1214 flow. Second operand has 5 states, 5 states have (on average 36.6) internal successors, (183), 5 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:53,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:53,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-03-09 01:21:53,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:53,933 INFO L124 PetriNetUnfolderBase]: 366/985 cut-off events. [2025-03-09 01:21:53,933 INFO L125 PetriNetUnfolderBase]: For 630/630 co-relation queries the response was YES. [2025-03-09 01:21:53,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3093 conditions, 985 events. 366/985 cut-off events. For 630/630 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 6071 event pairs, 180 based on Foata normal form. 3/829 useless extension candidates. Maximal degree in co-relation 2993. Up to 451 conditions per place. [2025-03-09 01:21:53,937 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 133 selfloop transitions, 24 changer transitions 26/203 dead transitions. [2025-03-09 01:21:53,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 203 transitions, 1901 flow [2025-03-09 01:21:53,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:21:53,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:21:53,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 266 transitions. [2025-03-09 01:21:53,938 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6717171717171717 [2025-03-09 01:21:53,938 INFO L175 Difference]: Start difference. First operand has 134 places, 152 transitions, 1214 flow. Second operand 6 states and 266 transitions. [2025-03-09 01:21:53,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 203 transitions, 1901 flow [2025-03-09 01:21:53,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 203 transitions, 1791 flow, removed 17 selfloop flow, removed 6 redundant places. [2025-03-09 01:21:53,947 INFO L231 Difference]: Finished difference. Result has 133 places, 154 transitions, 1198 flow [2025-03-09 01:21:53,947 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=1131, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1198, PETRI_PLACES=133, PETRI_TRANSITIONS=154} [2025-03-09 01:21:53,948 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 70 predicate places. [2025-03-09 01:21:53,948 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 154 transitions, 1198 flow [2025-03-09 01:21:53,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.6) internal successors, (183), 5 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:53,949 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:53,949 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:53,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-09 01:21:54,154 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,SelfDestructingSolverStorable15 [2025-03-09 01:21:54,154 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-09 01:21:54,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:54,154 INFO L85 PathProgramCache]: Analyzing trace with hash 877091227, now seen corresponding path program 1 times [2025-03-09 01:21:54,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:54,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375735067] [2025-03-09 01:21:54,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:54,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:54,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:21:54,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:21:54,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:54,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:54,396 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:21:54,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:54,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375735067] [2025-03-09 01:21:54,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375735067] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:21:54,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213476437] [2025-03-09 01:21:54,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:54,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:54,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:21:54,400 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:21:54,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 01:21:54,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:21:54,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:21:54,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:54,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:54,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-09 01:21:54,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:21:54,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:21:54,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:21:54,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-09 01:21:54,539 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-09 01:21:54,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-09 01:21:54,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:21:54,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-09 01:21:54,585 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-09 01:21:54,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-03-09 01:21:54,626 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:21:54,626 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:21:54,762 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 162 treesize of output 156 [2025-03-09 01:21:54,901 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:21:54,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213476437] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:21:54,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:21:54,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2025-03-09 01:21:54,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733163330] [2025-03-09 01:21:54,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:21:54,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 01:21:54,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:54,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 01:21:54,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:21:57,619 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 66 [2025-03-09 01:21:57,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 154 transitions, 1198 flow. Second operand has 16 states, 16 states have (on average 29.0) internal successors, (464), 16 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:57,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:57,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 66 [2025-03-09 01:21:57,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:58,191 INFO L124 PetriNetUnfolderBase]: 426/1073 cut-off events. [2025-03-09 01:21:58,191 INFO L125 PetriNetUnfolderBase]: For 555/577 co-relation queries the response was YES. [2025-03-09 01:21:58,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2962 conditions, 1073 events. 426/1073 cut-off events. For 555/577 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6590 event pairs, 166 based on Foata normal form. 0/958 useless extension candidates. Maximal degree in co-relation 2862. Up to 307 conditions per place. [2025-03-09 01:21:58,196 INFO L140 encePairwiseOnDemand]: 53/66 looper letters, 119 selfloop transitions, 71 changer transitions 0/208 dead transitions. [2025-03-09 01:21:58,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 208 transitions, 1787 flow [2025-03-09 01:21:58,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:21:58,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:21:58,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 330 transitions. [2025-03-09 01:21:58,197 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-03-09 01:21:58,197 INFO L175 Difference]: Start difference. First operand has 133 places, 154 transitions, 1198 flow. Second operand 9 states and 330 transitions. [2025-03-09 01:21:58,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 208 transitions, 1787 flow [2025-03-09 01:21:58,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 208 transitions, 1783 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-03-09 01:21:58,204 INFO L231 Difference]: Finished difference. Result has 143 places, 161 transitions, 1409 flow [2025-03-09 01:21:58,205 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=1194, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1409, PETRI_PLACES=143, PETRI_TRANSITIONS=161} [2025-03-09 01:21:58,205 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 80 predicate places. [2025-03-09 01:21:58,205 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 161 transitions, 1409 flow [2025-03-09 01:21:58,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 29.0) internal successors, (464), 16 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:58,205 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:58,206 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:58,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-09 01:21:58,410 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,SelfDestructingSolverStorable16 [2025-03-09 01:21:58,410 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-09 01:21:58,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:58,410 INFO L85 PathProgramCache]: Analyzing trace with hash -585684637, now seen corresponding path program 1 times [2025-03-09 01:21:58,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:58,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69518914] [2025-03-09 01:21:58,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:58,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:58,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:21:58,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:21:58,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:58,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:58,483 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:21:58,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:58,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69518914] [2025-03-09 01:21:58,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69518914] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:21:58,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636927588] [2025-03-09 01:21:58,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:58,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:58,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:21:58,488 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:21:58,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 01:21:58,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:21:58,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:21:58,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:58,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:58,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 01:21:58,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:21:58,621 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:21:58,621 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:21:58,655 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-09 01:21:58,668 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:21:58,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636927588] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:21:58,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:21:58,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-09 01:21:58,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545701428] [2025-03-09 01:21:58,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:21:58,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:21:58,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:58,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:21:58,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:21:58,796 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-03-09 01:21:58,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 161 transitions, 1409 flow. Second operand has 9 states, 9 states have (on average 35.44444444444444) internal successors, (319), 9 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:58,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:58,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-03-09 01:21:58,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:59,084 INFO L124 PetriNetUnfolderBase]: 1120/2630 cut-off events. [2025-03-09 01:21:59,084 INFO L125 PetriNetUnfolderBase]: For 2689/2975 co-relation queries the response was YES. [2025-03-09 01:21:59,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7165 conditions, 2630 events. 1120/2630 cut-off events. For 2689/2975 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 18697 event pairs, 342 based on Foata normal form. 0/2328 useless extension candidates. Maximal degree in co-relation 7057. Up to 496 conditions per place. [2025-03-09 01:21:59,101 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 180 selfloop transitions, 48 changer transitions 0/247 dead transitions. [2025-03-09 01:21:59,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 247 transitions, 2301 flow [2025-03-09 01:21:59,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 01:21:59,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-09 01:21:59,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 480 transitions. [2025-03-09 01:21:59,103 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2025-03-09 01:21:59,103 INFO L175 Difference]: Start difference. First operand has 143 places, 161 transitions, 1409 flow. Second operand 12 states and 480 transitions. [2025-03-09 01:21:59,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 247 transitions, 2301 flow [2025-03-09 01:21:59,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 247 transitions, 2207 flow, removed 14 selfloop flow, removed 3 redundant places. [2025-03-09 01:21:59,112 INFO L231 Difference]: Finished difference. Result has 157 places, 173 transitions, 1526 flow [2025-03-09 01:21:59,112 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=1338, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1526, PETRI_PLACES=157, PETRI_TRANSITIONS=173} [2025-03-09 01:21:59,112 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 94 predicate places. [2025-03-09 01:21:59,113 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 173 transitions, 1526 flow [2025-03-09 01:21:59,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 35.44444444444444) internal successors, (319), 9 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:59,113 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:59,113 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:59,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-09 01:21:59,313 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-09 01:21:59,313 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-09 01:21:59,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:59,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1420024820, now seen corresponding path program 1 times [2025-03-09 01:21:59,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:59,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081204727] [2025-03-09 01:21:59,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:59,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:59,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:21:59,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:21:59,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:59,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:59,517 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:21:59,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:59,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081204727] [2025-03-09 01:21:59,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081204727] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:21:59,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708344666] [2025-03-09 01:21:59,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:59,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:59,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:21:59,519 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:21:59,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 01:21:59,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:21:59,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:21:59,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:59,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:59,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-09 01:21:59,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:21:59,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:21:59,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-09 01:21:59,649 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-09 01:21:59,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-09 01:21:59,666 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 31 treesize of output 24 [2025-03-09 01:21:59,756 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-09 01:21:59,757 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-09 01:21:59,777 INFO L349 Elim1Store]: treesize reduction 24, result has 44.2 percent of original size [2025-03-09 01:21:59,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 40 [2025-03-09 01:22:00,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:22:00,134 INFO L349 Elim1Store]: treesize reduction 80, result has 51.5 percent of original size [2025-03-09 01:22:00,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 144 treesize of output 199 [2025-03-09 01:22:00,158 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-03-09 01:22:00,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2025-03-09 01:22:29,057 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:22:29,057 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:22:33,543 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:22:33,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708344666] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:22:33,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:22:33,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 17 [2025-03-09 01:22:33,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407292550] [2025-03-09 01:22:33,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:22:33,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 01:22:33,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:33,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 01:22:33,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=278, Unknown=1, NotChecked=0, Total=342 [2025-03-09 01:22:38,538 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-09 01:22:42,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-03-09 01:22:46,762 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-09 01:22:50,863 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-09 01:22:53,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:22:58,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-03-09 01:23:00,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1]